benchmark stringclasses 1
value | version stringclasses 1
value | task stringclasses 1
value | sample_id stringlengths 101 139 | index int64 0 149 | contract_id stringclasses 3
values | clause_id stringlengths 1 9 | instruction stringclasses 1
value | clause dict | gold_graph dict | prediction dict | judge_scores dict | reference_free_judges dict | risk_scores dict | uncertainty dict | error_prediction dict | evaluation dict | metadata dict | source_id stringlengths 101 139 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
ContractGraphEval | 1.1.0 | contract_minigraph_extraction | NEOMEDIATECHNOLOGIESINC_12_15_2005-EX-16.1-DISTRIBUTOR AGREEMENT/NEOMEDIATECHNOLOGIESINC_12_15_2005-EX-16.1-DISTRIBUTOR_AGREEMENT_18.2 | 0 | NEOMEDIATECHNOLOGIESINC_12_15_2005-EX-16.1-DISTRIBUTOR AGREEMENT | 18.2 | Your task is to act as a legal graph extractor. From this single clause, create a self-contained set of nodes and edges that are explicitly supported by the text. Follow the reasoning process, rules, and clarifications below.
Output ONLY a single, strict JSON object with this structure:
{
"contract_id": "...",
"nod... | {
"text": "18.2 The parties hereof intend to form a long-term relationship. To this end, if both parties wish to renew this Agreement, the parties shall agree on such intention in writing at least thirty(30) days before the expiry of the current Term of the Agreement. The parties shall agree on the terms and conditio... | {
"contract_id": "NEOMEDIATECHNOLOGIESINC_12_15_2005-EX-16.1-DISTRIBUTOR AGREEMENT",
"nodes": [
{
"id": "18",
"node_type": "CLAUSE",
"title": "18",
"level": 1,
"name": null,
"unit": null,
"text": null
},
{
"id": "18.2",
"node_type": "CLAUSE",
"... | {
"graph": {
"contract_id": "NEOMEDIATECHNOLOGIESINC_12_15_2005-EX-16.1-DISTRIBUTOR AGREEMENT",
"nodes": [
{
"id": "18",
"node_type": "CLAUSE",
"title": "18",
"level": 1,
"name": null,
"unit": null,
"text": null
},
{
"id": "18.2... | {
"exact_match": 0,
"structural_f1": 0.6904761904761905,
"semantic_similarity": 0.9980831742286682,
"openai_issues": 0.95,
"hybrid": 0.8442796823524293,
"parse_success": 1,
"completeness": 1,
"graph_edit_distance": 0.925925925925926
} | {
"unused_definitions": 0,
"undefined_references": 1,
"duplicate_definitions": 1,
"orphan_nodes": 1,
"isolated_components": 1,
"domain_range_validity": 1,
"ontology_compliance": 1
} | {
"structural_f1": 0.30952380952380953,
"semantic_similarity": 0.0019168257713317871,
"completeness": 0,
"graph_edit_distance": 0.07407407407407396,
"openai_issues": 0.95
} | {
"cv": 0.11963477260200224,
"entropy": 1.784262821615596,
"range": 0.30952380952380953,
"pairwise": 0.13554023982145588,
"margin": 0.9980831742286682,
"iqr": 0.12137113742569772,
"variance": 0.011630773188795155,
"std": 0.10784606246310134,
"n_judges": 6,
"cv_judges": [
"structural_f1",
"se... | {
"mean_risk": 0.26710294187384304,
"p_error_mean_risk": 0.26710294187384304,
"p_error_calibrated": 0,
"p_error_final": 0.3342221214214899
} | {
"has_error": false,
"mean_score": 0.9014608288305358,
"structural_f1": 0.6904761904761905
} | {
"split": "validation",
"version": "1.1.0",
"model": "llama3-8b-grpo",
"source": "CUAD"
} | NEOMEDIATECHNOLOGIESINC_12_15_2005-EX-16.1-DISTRIBUTOR AGREEMENT/NEOMEDIATECHNOLOGIESINC_12_15_2005-EX-16.1-DISTRIBUTOR_AGREEMENT_18.2 |
ContractGraphEval | 1.1.0 | contract_minigraph_extraction | INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT/INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE_AGREEMENT_15.5.2.3 | 1 | INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT | 15.5.2.3 | Your task is to act as a legal graph extractor. From this single clause, create a self-contained set of nodes and edges that are explicitly supported by the text. Follow the reasoning process, rules, and clarifications below.
Output ONLY a single, strict JSON object with this structure:
{
"contract_id": "...",
"nod... | {
"text": "15.5.2.3 REGISTRATION RIGHTS: SECONDARY OFFERINGS. Franchisee agrees that it will not grant additional registration rights or modify any registration rights previously granted without prior written notice to BKC. The Franchisee further agrees that if it is required to effect a registration pursuant to any ... | {
"contract_id": "INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT",
"nodes": [
{
"id": "15.5.2",
"node_type": "CLAUSE",
"title": "15.5.2",
"level": 3,
"name": null,
"unit": null,
"text": null
},
{
"id": "15.5.2.3",
"node_type": "CLAUSE... | {
"graph": {
"contract_id": "INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT",
"nodes": [
{
"id": "15.5.2",
"node_type": "CLAUSE",
"title": "15.5.2",
"level": 3,
"name": null,
"unit": null,
"text": null
},
{
"id":... | {
"exact_match": 0,
"structural_f1": 0.916083916083916,
"semantic_similarity": 0.938783884048462,
"openai_issues": 0.95,
"hybrid": 0.927433900066189,
"parse_success": 1,
"completeness": 1,
"graph_edit_distance": 0.8518518518518519
} | {
"unused_definitions": 0,
"undefined_references": 1,
"duplicate_definitions": 1,
"orphan_nodes": 1,
"isolated_components": 1,
"domain_range_validity": 1,
"ontology_compliance": 0.9
} | {
"structural_f1": 0.08391608391608396,
"semantic_similarity": 0.061216115951537975,
"completeness": 0,
"graph_edit_distance": 0.14814814814814814,
"openai_issues": 0.95
} | {
"cv": 0.04741005797346256,
"entropy": 1.790629189529453,
"range": 0.14814814814814814,
"pairwise": 0.0569225984314177,
"margin": 0.95,
"iqr": 0.0282745589326312,
"variance": 0.001946942767658712,
"std": 0.044124174413338456,
"n_judges": 6,
"cv_judges": [
"structural_f1",
"semantic_similari... | {
"mean_risk": 0.24865606960315398,
"p_error_mean_risk": 0.24865606960315398,
"p_error_calibrated": 0,
"p_error_final": 0.3134343506139094
} | {
"has_error": false,
"mean_score": 0.9306922586750699,
"structural_f1": 0.916083916083916
} | {
"split": "validation",
"version": "1.1.0",
"model": "llama3-8b-grpo",
"source": "CUAD"
} | INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT/INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE_AGREEMENT_15.5.2.3 |
ContractGraphEval | 1.1.0 | contract_minigraph_extraction | INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT/INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE_AGREEMENT_5.3 | 2 | INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT | 5.3 | Your task is to act as a legal graph extractor. From this single clause, create a self-contained set of nodes and edges that are explicitly supported by the text. Follow the reasoning process, rules, and clarifications below.
Output ONLY a single, strict JSON object with this structure:
{
"contract_id": "...",
"nod... | {
"text": "5.3 BUILDING AND PREMISES .",
"title": "BUILDING AND PREMISES",
"id": "5.3"
} | {
"contract_id": "INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT",
"nodes": [
{
"id": "5",
"node_type": "CLAUSE",
"title": "",
"level": 1,
"name": null,
"unit": null,
"text": null
},
{
"id": "5.3",
"node_type": "CLAUSE",
"title"... | {
"graph": {
"contract_id": "INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT",
"nodes": [
{
"id": "5",
"node_type": "CLAUSE",
"title": "ARTICLE 5",
"level": 1,
"name": null,
"unit": null,
"text": null
},
{
"id": "... | {
"exact_match": 0,
"structural_f1": 0.25,
"semantic_similarity": 0.978951930999756,
"openai_issues": 0.95,
"hybrid": 0.6144759654998779,
"parse_success": 1,
"completeness": 1,
"graph_edit_distance": 0.8571428571428572
} | {
"unused_definitions": 1,
"undefined_references": 1,
"duplicate_definitions": 1,
"orphan_nodes": 1,
"isolated_components": 1,
"domain_range_validity": 1,
"ontology_compliance": 1
} | {
"structural_f1": 0.75,
"semantic_similarity": 0.02104806900024403,
"completeness": 0,
"graph_edit_distance": 0.1428571428571428,
"openai_issues": 0.95
} | {
"cv": 0.3457811569484582,
"entropy": 1.719225054360965,
"range": 0.75,
"pairwise": 0.3290856692904518,
"margin": 0.978951930999756,
"iqr": 0.2965712598391942,
"variance": 0.07183112508283844,
"std": 0.26801329273533886,
"n_judges": 6,
"cv_judges": [
"structural_f1",
"semantic_similarity",
... | {
"mean_risk": 0.37278104237147736,
"p_error_mean_risk": 0.37278104237147736,
"p_error_calibrated": 0,
"p_error_final": 0.46377958660395463
} | {
"has_error": true,
"mean_score": 0.7750951256070818,
"structural_f1": 0.25
} | {
"split": "validation",
"version": "1.1.0",
"model": "llama3-8b-grpo",
"source": "CUAD"
} | INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT/INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE_AGREEMENT_5.3 |
ContractGraphEval | 1.1.0 | contract_minigraph_extraction | INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT/INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE_AGREEMENT_1.9 | 3 | INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT | 1.9 | Your task is to act as a legal graph extractor. From this single clause, create a self-contained set of nodes and edges that are explicitly supported by the text. Follow the reasoning process, rules, and clarifications below.
Output ONLY a single, strict JSON object with this structure:
{
"contract_id": "...",
"nod... | {
"text": "1.9 \"Managing Director\" has the meaning ascribed to it in Subparagraph 4.3 and on SCHEDULE 1.",
"title": "1.9",
"id": "1.9"
} | {
"contract_id": "INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT",
"nodes": [
{
"id": "1",
"node_type": "CLAUSE",
"title": "1",
"level": 1,
"name": null,
"unit": null,
"text": null
},
{
"id": "1.9",
"node_type": "CLAUSE",
"title... | {
"graph": {
"contract_id": "INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT",
"nodes": [
{
"id": "1",
"node_type": "CLAUSE",
"title": "1",
"level": 1,
"name": null,
"unit": null,
"text": null
},
{
"id": "1.9",
... | {
"exact_match": 0,
"structural_f1": 0.55,
"semantic_similarity": 0.9072380661964417,
"openai_issues": 0.4,
"hybrid": 0.7286190330982208,
"parse_success": 1,
"completeness": 0.7,
"graph_edit_distance": 0.5789473684210527
} | {
"unused_definitions": 0,
"undefined_references": 1,
"duplicate_definitions": 1,
"orphan_nodes": 1,
"isolated_components": 1,
"domain_range_validity": 1,
"ontology_compliance": 0.875
} | {
"structural_f1": 0.44999999999999996,
"semantic_similarity": 0.09276193380355835,
"completeness": 0.30000000000000004,
"graph_edit_distance": 0.42105263157894735,
"openai_issues": 0.4
} | {
"cv": 0.24725633323727772,
"entropy": 1.7608381220894676,
"range": 0.5072380661964416,
"pairwise": 0.2128733374570545,
"margin": 0.8213809669017792,
"iqr": 0.16422743271840246,
"variance": 0.02536573287854699,
"std": 0.15926623270030277,
"n_judges": 6,
"cv_judges": [
"structural_f1",
"sema... | {
"mean_risk": 0.33276291307650113,
"p_error_mean_risk": 0.33276291307650113,
"p_error_calibrated": 0,
"p_error_final": 0.41310527787096435
} | {
"has_error": true,
"mean_score": 0.6441340779526191,
"structural_f1": 0.55
} | {
"split": "validation",
"version": "1.1.0",
"model": "llama3-8b-grpo",
"source": "CUAD"
} | INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT/INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE_AGREEMENT_1.9 |
ContractGraphEval | 1.1.0 | contract_minigraph_extraction | INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT/INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE_AGREEMENT_11.1.1 | 4 | INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT | 11.1.1 | Your task is to act as a legal graph extractor. From this single clause, create a self-contained set of nodes and edges that are explicitly supported by the text. Follow the reasoning process, rules, and clarifications below.
Output ONLY a single, strict JSON object with this structure:
{
"contract_id": "...",
"nod... | {
"text": "11.1.1 REGISTRATION ASSISTANCE BY FRANCHISEE. The Franchisee shall, upon request and at no expense to the Franchisee assist BKC in perfecting and obtaining registration of unregistered Burger King Marks.",
"title": "11.1.1",
"id": "11.1.1"
} | {
"contract_id": "INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT",
"nodes": [
{
"id": "11.1",
"node_type": "CLAUSE",
"title": "11.1",
"level": 2,
"name": null,
"unit": null,
"text": null
},
{
"id": "11.1.1",
"node_type": "CLAUSE",
... | {
"graph": {
"contract_id": "INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT",
"nodes": [
{
"id": "11.1",
"node_type": "CLAUSE",
"title": "11.1",
"level": 2,
"name": null,
"unit": null,
"text": null
},
{
"id": "11... | {
"exact_match": 1,
"structural_f1": 1,
"semantic_similarity": 1,
"openai_issues": 1,
"hybrid": 1,
"parse_success": 1,
"completeness": 1,
"graph_edit_distance": 1
} | {
"unused_definitions": 0,
"undefined_references": 1,
"duplicate_definitions": 1,
"orphan_nodes": 1,
"isolated_components": 1,
"domain_range_validity": 1,
"ontology_compliance": 0.875
} | {
"structural_f1": 0,
"semantic_similarity": -1.1920928955078125e-7,
"completeness": 0,
"graph_edit_distance": 0,
"openai_issues": 1
} | {
"cv": 4.552379759707742e-8,
"entropy": 1.791759469228054,
"range": 1.1920928955078125e-7,
"pairwise": 5.1657358805338543e-8,
"margin": 0.9999999403953552,
"iqr": 4.470348358154297e-8,
"variance": 2.0724163126336257e-15,
"std": 4.552379940903028e-8,
"n_judges": 6,
"cv_judges": [
"structural_f1"... | {
"mean_risk": 0.19999997615814208,
"p_error_mean_risk": 0.19999997615814208,
"p_error_calibrated": 0,
"p_error_final": 0.2621959957045821
} | {
"has_error": false,
"mean_score": 1.0000000298023224,
"structural_f1": 1
} | {
"split": "validation",
"version": "1.1.0",
"model": "llama3-8b-grpo",
"source": "CUAD"
} | INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT/INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE_AGREEMENT_11.1.1 |
ContractGraphEval | 1.1.0 | contract_minigraph_extraction | INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT/INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE_AGREEMENT_1.10 | 5 | INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT | 1.10 | Your task is to act as a legal graph extractor. From this single clause, create a self-contained set of nodes and edges that are explicitly supported by the text. Follow the reasoning process, rules, and clarifications below.
Output ONLY a single, strict JSON object with this structure:
{
"contract_id": "...",
"nod... | {
"text": "1.10 \"MOD Manual\" means all volumes of the Manual of Operating Data setting out BKC's standards, specifications and procedures of operation, as revised from time to time by BKC including both required and recommended. FRANCHISE GRANT TERM.",
"title": "1.10",
"id": "1.10"
} | {
"contract_id": "INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT",
"nodes": [
{
"id": "1",
"node_type": "CLAUSE",
"title": "1",
"level": 1,
"name": null,
"unit": null,
"text": null
},
{
"id": "1.10",
"node_type": "CLAUSE",
"titl... | {
"graph": {
"contract_id": "INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT",
"nodes": [
{
"id": "1",
"node_type": "CLAUSE",
"title": "1",
"level": 1,
"name": null,
"unit": null,
"text": null
},
{
"id": "1.10",
... | {
"exact_match": 0,
"structural_f1": 0.7749999999999999,
"semantic_similarity": 0.8451193571090698,
"openai_issues": 0.75,
"hybrid": 0.8100596785545349,
"parse_success": 1,
"completeness": 1,
"graph_edit_distance": 0.5652173913043479
} | {
"unused_definitions": 0.33333333333333337,
"undefined_references": 1,
"duplicate_definitions": 1,
"orphan_nodes": 1,
"isolated_components": 1,
"domain_range_validity": 1,
"ontology_compliance": 1
} | {
"structural_f1": 0.2250000000000001,
"semantic_similarity": 0.15488064289093018,
"completeness": 0,
"graph_edit_distance": 0.4347826086956521,
"openai_issues": 0.75
} | {
"cv": 0.16313966499876084,
"entropy": 1.7781546901449463,
"range": 0.4347826086956521,
"pairwise": 0.16628871955733365,
"margin": 0.8451193571090698,
"iqr": 0.08010443747043616,
"variance": 0.016647983638863505,
"std": 0.12902706552837473,
"n_judges": 6,
"cv_judges": [
"structural_f1",
"se... | {
"mean_risk": 0.3129326503173165,
"p_error_mean_risk": 0.3129326503173165,
"p_error_calibrated": 0,
"p_error_final": 0.3885940087331019
} | {
"has_error": false,
"mean_score": 0.7908994044946588,
"structural_f1": 0.7749999999999999
} | {
"split": "validation",
"version": "1.1.0",
"model": "llama3-8b-grpo",
"source": "CUAD"
} | INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT/INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE_AGREEMENT_1.10 |
ContractGraphEval | 1.1.0 | contract_minigraph_extraction | NEOMEDIATECHNOLOGIESINC_12_15_2005-EX-16.1-DISTRIBUTOR AGREEMENT/NEOMEDIATECHNOLOGIESINC_12_15_2005-EX-16.1-DISTRIBUTOR_AGREEMENT_20.4 | 6 | NEOMEDIATECHNOLOGIESINC_12_15_2005-EX-16.1-DISTRIBUTOR AGREEMENT | 20.4 | Your task is to act as a legal graph extractor. From this single clause, create a self-contained set of nodes and edges that are explicitly supported by the text. Follow the reasoning process, rules, and clarifications below.
Output ONLY a single, strict JSON object with this structure:
{
"contract_id": "...",
"nod... | {
"text": "20.4 There shall be three arbitrators. Each of PPG SHANGHAI and DISTRIBUTOR shall select one; the chief arbitrator shall be selected by the first two arbitrators, provided that where the first two arbitrators are not able to agree on the appointment of the chief arbitrator within ten (10) days of the later... | {
"contract_id": "NEOMEDIATECHNOLOGIESINC_12_15_2005-EX-16.1-DISTRIBUTOR AGREEMENT",
"nodes": [
{
"id": "20",
"node_type": "CLAUSE",
"title": "20",
"level": 1,
"name": null,
"unit": null,
"text": null
},
{
"id": "20.4",
"node_type": "CLAUSE",
"... | {
"graph": {
"contract_id": "NEOMEDIATECHNOLOGIESINC_12_15_2005-EX-16.1-DISTRIBUTOR AGREEMENT",
"nodes": [
{
"id": "20",
"node_type": "CLAUSE",
"title": "20",
"level": 1,
"name": null,
"unit": null,
"text": null
},
{
"id": "20.4... | {
"exact_match": 0,
"structural_f1": 0.6904761904761905,
"semantic_similarity": 0.7680723667144775,
"openai_issues": 0.6,
"hybrid": 0.729274278595334,
"parse_success": 1,
"completeness": 0.7916666666666666,
"graph_edit_distance": 0.5161290322580645
} | {
"unused_definitions": 1,
"undefined_references": 1,
"duplicate_definitions": 1,
"orphan_nodes": 1,
"isolated_components": 1,
"domain_range_validity": 1,
"ontology_compliance": 1
} | {
"structural_f1": 0.30952380952380953,
"semantic_similarity": 0.23192763328552246,
"completeness": 0.20833333333333337,
"graph_edit_distance": 0.4838709677419355,
"openai_issues": 0.6
} | {
"cv": 0.14150137277877536,
"entropy": 1.781400051227868,
"range": 0.27553763440860213,
"pairwise": 0.12804689068703914,
"margin": 0.9764057000478109,
"iqr": 0.13575379706564406,
"variance": 0.0093294881586741,
"std": 0.09658927558830795,
"n_judges": 6,
"cv_judges": [
"structural_f1",
"sema... | {
"mean_risk": 0.36673114877692015,
"p_error_mean_risk": 0.36673114877692015,
"p_error_calibrated": 0,
"p_error_final": 0.456043818853728
} | {
"has_error": false,
"mean_score": 0.6826030891184556,
"structural_f1": 0.6904761904761905
} | {
"split": "validation",
"version": "1.1.0",
"model": "llama3-8b-grpo",
"source": "CUAD"
} | NEOMEDIATECHNOLOGIESINC_12_15_2005-EX-16.1-DISTRIBUTOR AGREEMENT/NEOMEDIATECHNOLOGIESINC_12_15_2005-EX-16.1-DISTRIBUTOR_AGREEMENT_20.4 |
ContractGraphEval | 1.1.0 | contract_minigraph_extraction | INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT/INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE_AGREEMENT_5.3.2 | 7 | INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT | 5.3.2 | Your task is to act as a legal graph extractor. From this single clause, create a self-contained set of nodes and edges that are explicitly supported by the text. Follow the reasoning process, rules, and clarifications below.
Output ONLY a single, strict JSON object with this structure:
{
"contract_id": "...",
"nod... | {
"text": "5.3.2 REPAIR AND MAINTENANCE. The Franchisee shall, at its own expense, continuously throughout the Term of this Agreement, maintain the Franchised Restaurant in good condition and repair in accordance with BKC's then current repair and maintenance standards.",
"title": "5.3.2",
"id": "5.3.2"
} | {
"contract_id": "INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT",
"nodes": [
{
"id": "5.3",
"node_type": "CLAUSE",
"title": "5.3",
"level": 2,
"name": null,
"unit": null,
"text": null
},
{
"id": "5.3.2",
"node_type": "CLAUSE",
... | {
"graph": {
"contract_id": "INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT",
"nodes": [
{
"id": "5.3",
"node_type": "CLAUSE",
"title": "5.3",
"level": 2,
"name": null,
"unit": null,
"text": null
},
{
"id": "5.3.... | {
"exact_match": 1,
"structural_f1": 1,
"semantic_similarity": 0.9999999403953552,
"openai_issues": 1,
"hybrid": 0.9999999701976776,
"parse_success": 1,
"completeness": 1,
"graph_edit_distance": 1
} | {
"unused_definitions": 0,
"undefined_references": 1,
"duplicate_definitions": 1,
"orphan_nodes": 1,
"isolated_components": 1,
"domain_range_validity": 1,
"ontology_compliance": 0.9
} | {
"structural_f1": 0,
"semantic_similarity": 5.960464477539063e-8,
"completeness": 0,
"graph_edit_distance": 0,
"openai_issues": 1
} | {
"cv": 2.276189981607488e-8,
"entropy": 1.7917594692280545,
"range": 5.960464477539063e-8,
"pairwise": 2.5828679402669272e-8,
"margin": 1,
"iqr": 2.2351741790771484e-8,
"variance": 5.181040781584064e-16,
"std": 2.276189970451514e-8,
"n_judges": 6,
"cv_judges": [
"structural_f1",
"semantic_s... | {
"mean_risk": 0.20000001192092895,
"p_error_mean_risk": 0.20000001192092895,
"p_error_calibrated": 0,
"p_error_final": 0.2621960313188351
} | {
"has_error": false,
"mean_score": 0.9999999850988388,
"structural_f1": 1
} | {
"split": "validation",
"version": "1.1.0",
"model": "llama3-8b-grpo",
"source": "CUAD"
} | INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT/INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE_AGREEMENT_5.3.2 |
ContractGraphEval | 1.1.0 | contract_minigraph_extraction | INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT/INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE_AGREEMENT_4.5.2 | 8 | INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT | 4.5.2 | Your task is to act as a legal graph extractor. From this single clause, create a self-contained set of nodes and edges that are explicitly supported by the text. Follow the reasoning process, rules, and clarifications below.
Output ONLY a single, strict JSON object with this structure:
{
"contract_id": "...",
"nod... | {
"text": "4.5.2 MANAGING DIRECTOR'S AUTHORITY. The articles of incorporation, bylaws and other governing documents of Franchisee must mandate the designation of a Managing Director and describe the Managing Director's authority to bind the Franchisee and to direct any actions necessary to ensure compliance with this... | {
"contract_id": "INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT",
"nodes": [
{
"id": "4.5",
"node_type": "CLAUSE",
"title": "4.5",
"level": 2,
"name": null,
"unit": null,
"text": null
},
{
"id": "4.5.2",
"node_type": "CLAUSE",
... | {
"graph": {
"contract_id": "INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT",
"nodes": [
{
"id": "4.5",
"node_type": "CLAUSE",
"title": "4.5",
"level": 2,
"name": null,
"unit": null,
"text": null
},
{
"id": "4.5.... | {
"exact_match": 0,
"structural_f1": 0.8166666666666668,
"semantic_similarity": 0.9538472890853882,
"openai_issues": 0.8,
"hybrid": 0.8852569778760275,
"parse_success": 1,
"completeness": 0.9166666666666669,
"graph_edit_distance": 0.8260869565217391
} | {
"unused_definitions": 0,
"undefined_references": 1,
"duplicate_definitions": 1,
"orphan_nodes": 1,
"isolated_components": 1,
"domain_range_validity": 1,
"ontology_compliance": 0.8888888888888888
} | {
"structural_f1": 0.18333333333333324,
"semantic_similarity": 0.046152710914611816,
"completeness": 0.08333333333333315,
"graph_edit_distance": 0.17391304347826086,
"openai_issues": 0.8
} | {
"cv": 0.06501193948117608,
"entropy": 1.7896576184748407,
"range": 0.15384728908538814,
"pairwise": 0.07522709778541528,
"margin": 0.9628193775812787,
"iqr": 0.08979250533857219,
"variance": 0.0031728091823282328,
"std": 0.0563276946299796,
"n_judges": 6,
"cv_judges": [
"structural_f1",
"s... | {
"mean_risk": 0.2573464842119078,
"p_error_mean_risk": 0.2573464842119078,
"p_error_calibrated": 0,
"p_error_final": 0.32314082519668147
} | {
"has_error": false,
"mean_score": 0.8664207594694148,
"structural_f1": 0.8166666666666668
} | {
"split": "validation",
"version": "1.1.0",
"model": "llama3-8b-grpo",
"source": "CUAD"
} | INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT/INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE_AGREEMENT_4.5.2 |
ContractGraphEval | 1.1.0 | contract_minigraph_extraction | INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT/INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE_AGREEMENT_r | 9 | INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT | (r | Your task is to act as a legal graph extractor. From this single clause, create a self-contained set of nodes and edges that are explicitly supported by the text. Follow the reasoning process, rules, and clarifications below.
Output ONLY a single, strict JSON object with this structure:
{
"contract_id": "...",
"nod... | {
"text": "(r) If any of the above occurs in relation to any Principal.",
"title": "(r",
"id": "(r"
} | {
"contract_id": "INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT",
"nodes": [
{
"id": "(r",
"node_type": "CLAUSE",
"title": "(r",
"level": 1,
"name": null,
"unit": null,
"text": null
},
{
"id": "term:Principal",
"node_type": "DEFINED_... | {
"graph": {
"contract_id": "INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT",
"nodes": [
{
"id": "(r",
"node_type": "CLAUSE",
"title": "(r",
"level": 0,
"name": null,
"unit": null,
"text": null
},
{
"id": "term:P... | {
"exact_match": 0,
"structural_f1": 1,
"semantic_similarity": 0.9999999403953552,
"openai_issues": 0.9,
"hybrid": 0.9999999701976776,
"parse_success": 1,
"completeness": 1,
"graph_edit_distance": 1
} | {
"unused_definitions": 0,
"undefined_references": 1,
"duplicate_definitions": 1,
"orphan_nodes": 1,
"isolated_components": 1,
"domain_range_validity": 1,
"ontology_compliance": 1
} | {
"structural_f1": 0,
"semantic_similarity": 5.960464477539063e-8,
"completeness": 0,
"graph_edit_distance": 0,
"openai_issues": 0.9
} | {
"cv": 0.03789945065771418,
"entropy": 1.7910242942216714,
"range": 0.09999999999999998,
"pairwise": 0.03333334724108377,
"margin": 1,
"iqr": 5.21540641784668e-8,
"variance": 0.001388888392184033,
"std": 0.03726779296100097,
"n_judges": 6,
"cv_judges": [
"structural_f1",
"semantic_similarit... | {
"mean_risk": 0.18000001192092896,
"p_error_mean_risk": 0.18000001192092896,
"p_error_calibrated": 0,
"p_error_final": 0.2427718254446699
} | {
"has_error": false,
"mean_score": 0.9833333184321722,
"structural_f1": 1
} | {
"split": "validation",
"version": "1.1.0",
"model": "llama3-8b-grpo",
"source": "CUAD"
} | INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT/INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE_AGREEMENT_r |
ContractGraphEval | 1.1.0 | contract_minigraph_extraction | INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT/INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE_AGREEMENT_19.9 | 10 | INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT | 19.9 | Your task is to act as a legal graph extractor. From this single clause, create a self-contained set of nodes and edges that are explicitly supported by the text. Follow the reasoning process, rules, and clarifications below.
Output ONLY a single, strict JSON object with this structure:
{
"contract_id": "...",
"nod... | {
"text": "19.9 LANGUAGE. This Agreement is in the English language only, which language shall be controlling in all respects.",
"title": "19.9",
"id": "19.9"
} | {
"contract_id": "INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT",
"nodes": [
{
"id": "19",
"node_type": "CLAUSE",
"title": "19",
"level": 1,
"name": null,
"unit": null,
"text": null
},
{
"id": "19.9",
"node_type": "CLAUSE",
"ti... | {
"graph": {
"contract_id": "INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT",
"nodes": [
{
"id": "19",
"node_type": "CLAUSE",
"title": "19",
"level": 1,
"name": null,
"unit": null,
"text": null
},
{
"id": "19.9",... | {
"exact_match": 0,
"structural_f1": 0.8285714285714285,
"semantic_similarity": 0.9258906841278076,
"openai_issues": 0.9,
"hybrid": 0.8772310563496181,
"parse_success": 1,
"completeness": 1,
"graph_edit_distance": 0.7333333333333334
} | {
"unused_definitions": 0,
"undefined_references": 1,
"duplicate_definitions": 1,
"orphan_nodes": 1,
"isolated_components": 1,
"domain_range_validity": 1,
"ontology_compliance": 1
} | {
"structural_f1": 0.17142857142857149,
"semantic_similarity": 0.07410931587219238,
"completeness": 0,
"graph_edit_distance": 0.2666666666666666,
"openai_issues": 0.9
} | {
"cv": 0.09424054643443724,
"entropy": 1.7872551274727244,
"range": 0.2666666666666666,
"pairwise": 0.1098706695768568,
"margin": 0.9258906841278076,
"iqr": 0.07868167757987976,
"variance": 0.0068387105673000355,
"std": 0.08269649670512068,
"n_judges": 6,
"cv_judges": [
"structural_f1",
"se... | {
"mean_risk": 0.2824409107934861,
"p_error_mean_risk": 0.2824409107934861,
"p_error_calibrated": 0,
"p_error_final": 0.3520152149779328
} | {
"has_error": false,
"mean_score": 0.877504417063698,
"structural_f1": 0.8285714285714285
} | {
"split": "validation",
"version": "1.1.0",
"model": "llama3-8b-grpo",
"source": "CUAD"
} | INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT/INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE_AGREEMENT_19.9 |
ContractGraphEval | 1.1.0 | contract_minigraph_extraction | NEOMEDIATECHNOLOGIESINC_12_15_2005-EX-16.1-DISTRIBUTOR AGREEMENT/NEOMEDIATECHNOLOGIESINC_12_15_2005-EX-16.1-DISTRIBUTOR_AGREEMENT_4.4 | 11 | NEOMEDIATECHNOLOGIESINC_12_15_2005-EX-16.1-DISTRIBUTOR AGREEMENT | 4.4 | Your task is to act as a legal graph extractor. From this single clause, create a self-contained set of nodes and edges that are explicitly supported by the text. Follow the reasoning process, rules, and clarifications below.
Output ONLY a single, strict JSON object with this structure:
{
"contract_id": "...",
"nod... | {
"text": "4.4 DISTRIBUTOR and PPG Shanghai shall be responsible for providing technical support and after sale services to the Territory. PPG Shanghai's responsibility under this Section 4.4 is defined in Section 8. PRICES AND TERMS",
"title": "4.4",
"id": "4.4"
} | {
"contract_id": "NEOMEDIATECHNOLOGIESINC_12_15_2005-EX-16.1-DISTRIBUTOR AGREEMENT",
"nodes": [
{
"id": "4",
"node_type": "CLAUSE",
"title": "4",
"level": 1,
"name": null,
"unit": null,
"text": null
},
{
"id": "4.4",
"node_type": "CLAUSE",
"tit... | {
"graph": {
"contract_id": "NEOMEDIATECHNOLOGIESINC_12_15_2005-EX-16.1-DISTRIBUTOR AGREEMENT",
"nodes": [
{
"id": "4",
"node_type": "CLAUSE",
"title": "4",
"level": 1,
"name": null,
"unit": null,
"text": null
},
{
"id": "4.4",
... | {
"exact_match": 0,
"structural_f1": 0.916083916083916,
"semantic_similarity": 0.9412894248962402,
"openai_issues": 0.9,
"hybrid": 0.928686670490078,
"parse_success": 1,
"completeness": 1,
"graph_edit_distance": 0.7777777777777778
} | {
"unused_definitions": 0,
"undefined_references": 1,
"duplicate_definitions": 1,
"orphan_nodes": 1,
"isolated_components": 1,
"domain_range_validity": 1,
"ontology_compliance": 1
} | {
"structural_f1": 0.08391608391608396,
"semantic_similarity": 0.058710575103759766,
"completeness": 0,
"graph_edit_distance": 0.2222222222222222,
"openai_issues": 0.9
} | {
"cv": 0.07372678410771068,
"entropy": 1.7889747241073954,
"range": 0.2222222222222222,
"pairwise": 0.08317214268039959,
"margin": 0.9412894248962402,
"iqr": 0.034117757273720684,
"variance": 0.004507582512931505,
"std": 0.06713853225184108,
"n_judges": 6,
"cv_judges": [
"structural_f1",
"s... | {
"mean_risk": 0.2529697762484132,
"p_error_mean_risk": 0.2529697762484132,
"p_error_calibrated": 0,
"p_error_final": 0.3182326765155491
} | {
"has_error": false,
"mean_score": 0.9106396315413354,
"structural_f1": 0.916083916083916
} | {
"split": "validation",
"version": "1.1.0",
"model": "llama3-8b-grpo",
"source": "CUAD"
} | NEOMEDIATECHNOLOGIESINC_12_15_2005-EX-16.1-DISTRIBUTOR AGREEMENT/NEOMEDIATECHNOLOGIESINC_12_15_2005-EX-16.1-DISTRIBUTOR_AGREEMENT_4.4 |
ContractGraphEval | 1.1.0 | contract_minigraph_extraction | INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT/INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE_AGREEMENT_36 | 12 | INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT | 36 | Your task is to act as a legal graph extractor. From this single clause, create a self-contained set of nodes and edges that are explicitly supported by the text. Follow the reasoning process, rules, and clarifications below.
Output ONLY a single, strict JSON object with this structure:
{
"contract_id": "...",
"nod... | {
"text": "36 SCHEDULE",
"title": "SCHEDULE",
"id": "36"
} | {
"contract_id": "INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT",
"nodes": [
{
"id": "36",
"node_type": "CLAUSE",
"title": "SCHEDULE",
"level": 1,
"name": null,
"unit": null,
"text": null
}
],
"edges": []
} | {
"graph": {
"contract_id": "INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT",
"nodes": [
{
"id": "36",
"node_type": "CLAUSE",
"title": "SCHEDULE",
"level": 1,
"name": null,
"unit": null,
"text": null
}
],
"edges": []
... | {
"exact_match": 1,
"structural_f1": 0.5,
"semantic_similarity": 1,
"openai_issues": 1,
"hybrid": 0.75,
"parse_success": 0.6000000000000001,
"completeness": 0.7,
"graph_edit_distance": 1
} | {
"unused_definitions": 1,
"undefined_references": 1,
"duplicate_definitions": 1,
"orphan_nodes": 0,
"isolated_components": 1,
"domain_range_validity": 1,
"ontology_compliance": 1
} | {
"structural_f1": 0.5,
"semantic_similarity": 0,
"completeness": 0.30000000000000004,
"graph_edit_distance": 0,
"openai_issues": 1
} | {
"cv": 0.2314432141115893,
"entropy": 1.763429517060583,
"range": 0.5,
"pairwise": 0.2433333333333333,
"margin": 1,
"iqr": 0.2875000000000001,
"variance": 0.036458333333333336,
"std": 0.19094065395649334,
"n_judges": 6,
"cv_judges": [
"structural_f1",
"semantic_similarity",
"openai_issu... | {
"mean_risk": 0.36,
"p_error_mean_risk": 0.36,
"p_error_calibrated": 0,
"p_error_final": 0.4474619728315691
} | {
"has_error": false,
"mean_score": 0.8250000000000001,
"structural_f1": 0.5
} | {
"split": "validation",
"version": "1.1.0",
"model": "llama3-8b-grpo",
"source": "CUAD"
} | INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT/INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE_AGREEMENT_36 |
ContractGraphEval | 1.1.0 | contract_minigraph_extraction | DIVERSINETCORP_03_01_2012-EX-4-RESELLER AGREEMENT/DIVERSINETCORP_03_01_2012-EX-4-RESELLER_AGREEMENT_a | 13 | DIVERSINETCORP_03_01_2012-EX-4-RESELLER AGREEMENT | (a | Your task is to act as a legal graph extractor. From this single clause, create a self-contained set of nodes and edges that are explicitly supported by the text. Follow the reasoning process, rules, and clarifications below.
Output ONLY a single, strict JSON object with this structure:
{
"contract_id": "...",
"nod... | {
"text": "(a) Upon Reseller's request, Diversinet will provide Reseller with pre-sales consulting and post-sales consulting at the Diversinet's standard rates. Post-sales consulting will be provided under a separate services agreement to be entered into by the Parties, which shall include specific statement(s) of wo... | {
"contract_id": "DIVERSINETCORP_03_01_2012-EX-4-RESELLER AGREEMENT",
"nodes": [
{
"id": "(a",
"node_type": "CLAUSE",
"title": "'s request, Diversinet will provide Reseller with pre-sales consulting and post-",
"level": 1,
"name": null,
"unit": null,
"text": null
},... | {
"graph": {
"contract_id": "DIVERSINETCORP_03_01_2012-EX-4-RESELLER AGREEMENT",
"nodes": [
{
"id": "(a",
"node_type": "CLAUSE",
"title": "'s request, Diversinet will provide Reseller with pre-sales consulting and post-",
"level": 1,
"name": null,
"unit": ... | {
"exact_match": 0,
"structural_f1": 0.7749999999999999,
"semantic_similarity": 0.9563177824020386,
"openai_issues": 0.62,
"hybrid": 0.8656588912010192,
"parse_success": 1,
"completeness": 0.8333333333333333,
"graph_edit_distance": 0.6521739130434783
} | {
"unused_definitions": 0,
"undefined_references": 1,
"duplicate_definitions": 1,
"orphan_nodes": 1,
"isolated_components": 1,
"domain_range_validity": 1,
"ontology_compliance": 1
} | {
"structural_f1": 0.2250000000000001,
"semantic_similarity": 0.043682217597961426,
"completeness": 0.16666666666666674,
"graph_edit_distance": 0.34782608695652173,
"openai_issues": 0.62
} | {
"cv": 0.15020337814701415,
"entropy": 1.780356156553668,
"range": 0.3363177824020386,
"pairwise": 0.1586918119877433,
"margin": 0.9093411087989807,
"iqr": 0.174697066951489,
"variance": 0.013858350756846308,
"std": 0.11772149657919877,
"n_judges": 6,
"cv_judges": [
"structural_f1",
"semant... | {
"mean_risk": 0.28063499424423,
"p_error_mean_risk": 0.28063499424423,
"p_error_calibrated": 0,
"p_error_final": 0.34989758961122963
} | {
"has_error": false,
"mean_score": 0.783747319996645,
"structural_f1": 0.7749999999999999
} | {
"split": "validation",
"version": "1.1.0",
"model": "llama3-8b-grpo",
"source": "CUAD"
} | DIVERSINETCORP_03_01_2012-EX-4-RESELLER AGREEMENT/DIVERSINETCORP_03_01_2012-EX-4-RESELLER_AGREEMENT_a |
ContractGraphEval | 1.1.0 | contract_minigraph_extraction | INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT/INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE_AGREEMENT_2 | 14 | INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT | 2 | Your task is to act as a legal graph extractor. From this single clause, create a self-contained set of nodes and edges that are explicitly supported by the text. Follow the reasoning process, rules, and clarifications below.
Output ONLY a single, strict JSON object with this structure:
{
"contract_id": "...",
"nod... | {
"text": "2 TO FRANCHISE AGREEMENT Shares of the Franchisee owned by the Principals: ================================================================================ | Number of | Class of | % of Class of | % of Total Principal | Shares | Shares | Shares | Shares - -----------------|--------------|-----------|------... | {
"contract_id": "INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT",
"nodes": [
{
"id": "2",
"node_type": "CLAUSE",
"title": "TO FRANCHISE AGREEMENT",
"level": 1,
"name": null,
"unit": null,
"text": null
},
{
"id": "party:Franchisee",
"... | {
"graph": {
"contract_id": "INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT",
"nodes": [
{
"id": "2",
"node_type": "CLAUSE",
"title": "TO FRANCHISE AGREEMENT",
"level": 1,
"name": null,
"unit": null,
"text": null
},
{
... | {
"exact_match": 0,
"structural_f1": 0.7083333333333333,
"semantic_similarity": 0.7679431438446045,
"openai_issues": 0.55,
"hybrid": 0.7381382385889689,
"parse_success": 1,
"completeness": 0.5833333333333333,
"graph_edit_distance": 0.5789473684210527
} | {
"unused_definitions": 1,
"undefined_references": 1,
"duplicate_definitions": 1,
"orphan_nodes": 1,
"isolated_components": 1,
"domain_range_validity": 1,
"ontology_compliance": 1
} | {
"structural_f1": 0.29166666666666674,
"semantic_similarity": 0.2320568561553955,
"completeness": 0.41666666666666674,
"graph_edit_distance": 0.42105263157894735,
"openai_issues": 0.55
} | {
"cv": 0.13152639140228586,
"entropy": 1.7831069735655447,
"range": 0.21794314384460445,
"pairwise": 0.11281922198178472,
"margin": 0.9701950947443644,
"iqr": 0.15064315262593708,
"variance": 0.007409309789765259,
"std": 0.08607734771567523,
"n_judges": 6,
"cv_judges": [
"structural_f1",
"s... | {
"mean_risk": 0.3822885642135353,
"p_error_mean_risk": 0.3822885642135353,
"p_error_calibrated": 0,
"p_error_final": 0.4759703653228694
} | {
"has_error": false,
"mean_score": 0.6544492362535488,
"structural_f1": 0.7083333333333333
} | {
"split": "validation",
"version": "1.1.0",
"model": "llama3-8b-grpo",
"source": "CUAD"
} | INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT/INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE_AGREEMENT_2 |
ContractGraphEval | 1.1.0 | contract_minigraph_extraction | INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT/INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE_AGREEMENT_25 | 15 | INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT | 25 | Your task is to act as a legal graph extractor. From this single clause, create a self-contained set of nodes and edges that are explicitly supported by the text. Follow the reasoning process, rules, and clarifications below.
Output ONLY a single, strict JSON object with this structure:
{
"contract_id": "...",
"nod... | {
"text": "25\n\n16. THE PRINCIPALS.",
"title": "25",
"id": "25"
} | {
"contract_id": "INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT",
"nodes": [
{
"id": "25",
"node_type": "CLAUSE",
"title": "25",
"level": 1,
"name": null,
"unit": null,
"text": null
},
{
"id": "clause:16",
"node_type": "CLAUSE",
... | {
"graph": {
"contract_id": "INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT",
"nodes": [
{
"id": "25",
"node_type": "CLAUSE",
"title": "16. THE PRINCIPALS.",
"level": 1,
"name": null,
"unit": null,
"text": null
},
{
... | {
"exact_match": 0,
"structural_f1": 0.1666666666666666,
"semantic_similarity": 0.6540744304656982,
"openai_issues": 0.2,
"hybrid": 0.4103705485661824,
"parse_success": 1,
"completeness": 0.2666666666666666,
"graph_edit_distance": 0.0909090909090909
} | {
"unused_definitions": 1,
"undefined_references": 1,
"duplicate_definitions": 1,
"orphan_nodes": 1,
"isolated_components": 1,
"domain_range_validity": 1,
"ontology_compliance": 1
} | {
"structural_f1": 0.8333333333333334,
"semantic_similarity": 0.34592556953430176,
"completeness": 0.7333333333333334,
"graph_edit_distance": 0.9090909090909091,
"openai_issues": 0.2
} | {
"cv": 0.627758138725618,
"entropy": 1.6069069970719543,
"range": 0.5631653395566073,
"pairwise": 0.24090700067655,
"margin": 0.7562961181004841,
"iqr": 0.19944457809130348,
"variance": 0.03502282138549677,
"std": 0.18714385211782078,
"n_judges": 6,
"cv_judges": [
"structural_f1",
"semantic... | {
"mean_risk": 0.6043366290583756,
"p_error_mean_risk": 0.6043366290583756,
"p_error_calibrated": 1,
"p_error_final": 0.7401745973732011
} | {
"has_error": true,
"mean_score": 0.2981145672123841,
"structural_f1": 0.1666666666666666
} | {
"split": "validation",
"version": "1.1.0",
"model": "llama3-8b-grpo",
"source": "CUAD"
} | INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT/INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE_AGREEMENT_25 |
ContractGraphEval | 1.1.0 | contract_minigraph_extraction | INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT/INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE_AGREEMENT_D | 16 | INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT | D | Your task is to act as a legal graph extractor. From this single clause, create a self-contained set of nodes and edges that are explicitly supported by the text. Follow the reasoning process, rules, and clarifications below.
Output ONLY a single, strict JSON object with this structure:
{
"contract_id": "...",
"nod... | {
"text": "D. Each of the Principals owns an equity interest in the Franchisee. AGREEMENT In consideration of the fees and other sums payable by the Franchisee and the mutual covenants herein, the parties agree as follows:",
"title": "D",
"id": "D"
} | {
"contract_id": "INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT",
"nodes": [
{
"id": "D",
"node_type": "CLAUSE",
"title": "D",
"level": 1,
"name": null,
"unit": null,
"text": null
},
{
"id": "party:Franchisee",
"node_type": "PARTY",
... | {
"graph": {
"contract_id": "INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT",
"nodes": [
{
"id": "D",
"node_type": "CLAUSE",
"title": "D",
"level": 1,
"name": null,
"unit": null,
"text": null
},
{
"id": "party:Fr... | {
"exact_match": 1,
"structural_f1": 1,
"semantic_similarity": 1,
"openai_issues": 1,
"hybrid": 1,
"parse_success": 1,
"completeness": 1,
"graph_edit_distance": 1
} | {
"unused_definitions": 0,
"undefined_references": 1,
"duplicate_definitions": 1,
"orphan_nodes": 1,
"isolated_components": 1,
"domain_range_validity": 1,
"ontology_compliance": 1
} | {
"structural_f1": 0,
"semantic_similarity": -1.1920928955078125e-7,
"completeness": 0,
"graph_edit_distance": 0,
"openai_issues": 1
} | {
"cv": 4.552379759707742e-8,
"entropy": 1.791759469228054,
"range": 1.1920928955078125e-7,
"pairwise": 5.1657358805338543e-8,
"margin": 0.9999999403953552,
"iqr": 4.470348358154297e-8,
"variance": 2.0724163126336257e-15,
"std": 4.552379940903028e-8,
"n_judges": 6,
"cv_judges": [
"structural_f1"... | {
"mean_risk": 0.19999997615814208,
"p_error_mean_risk": 0.19999997615814208,
"p_error_calibrated": 0,
"p_error_final": 0.2621959957045821
} | {
"has_error": false,
"mean_score": 1.0000000298023224,
"structural_f1": 1
} | {
"split": "validation",
"version": "1.1.0",
"model": "llama3-8b-grpo",
"source": "CUAD"
} | INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT/INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE_AGREEMENT_D |
ContractGraphEval | 1.1.0 | contract_minigraph_extraction | NEOMEDIATECHNOLOGIESINC_12_15_2005-EX-16.1-DISTRIBUTOR AGREEMENT/NEOMEDIATECHNOLOGIESINC_12_15_2005-EX-16.1-DISTRIBUTOR_AGREEMENT_22 | 17 | NEOMEDIATECHNOLOGIESINC_12_15_2005-EX-16.1-DISTRIBUTOR AGREEMENT | 22 | Your task is to act as a legal graph extractor. From this single clause, create a self-contained set of nodes and edges that are explicitly supported by the text. Follow the reasoning process, rules, and clarifications below.
Output ONLY a single, strict JSON object with this structure:
{
"contract_id": "...",
"nod... | {
"text": "22. LANGUAGE AND COUNTERPART This Agreement shall be executed in two (2) counterparts of the Chinese language text.",
"title": "22",
"id": "22"
} | {
"contract_id": "NEOMEDIATECHNOLOGIESINC_12_15_2005-EX-16.1-DISTRIBUTOR AGREEMENT",
"nodes": [
{
"id": "22",
"node_type": "CLAUSE",
"title": "22",
"level": 1,
"name": null,
"unit": null,
"text": null
},
{
"id": "term:Agreement",
"node_type": "DEFINE... | {
"graph": {
"contract_id": "NEOMEDIATECHNOLOGIESINC_12_15_2005-EX-16.1-DISTRIBUTOR AGREEMENT",
"nodes": [
{
"id": "22",
"node_type": "CLAUSE",
"title": "22",
"level": 1,
"name": null,
"unit": null,
"text": null
},
{
"id": "term... | {
"exact_match": 0,
"structural_f1": 0.4857142857142857,
"semantic_similarity": 0.8383328318595886,
"openai_issues": 0.4,
"hybrid": 0.6620235587869372,
"parse_success": 1,
"completeness": 0.8333333333333333,
"graph_edit_distance": 0.4
} | {
"unused_definitions": 0,
"undefined_references": 1,
"duplicate_definitions": 1,
"orphan_nodes": 1,
"isolated_components": 1,
"domain_range_validity": 1,
"ontology_compliance": 1
} | {
"structural_f1": 0.5142857142857142,
"semantic_similarity": 0.16166716814041138,
"completeness": 0.16666666666666674,
"graph_edit_distance": 0.6,
"openai_issues": 0.4
} | {
"cv": 0.30872133264995266,
"entropy": 1.7440102543323288,
"range": 0.4383328318595886,
"pairwise": 0.2445315621580396,
"margin": 0.9950005014737446,
"iqr": 0.36907731826816287,
"variance": 0.034682062820391026,
"std": 0.18623120796577308,
"n_judges": 6,
"cv_judges": [
"structural_f1",
"sem... | {
"mean_risk": 0.3685239098185584,
"p_error_mean_risk": 0.3685239098185584,
"p_error_calibrated": 0,
"p_error_final": 0.45833411387825335
} | {
"has_error": true,
"mean_score": 0.6032340016156907,
"structural_f1": 0.4857142857142857
} | {
"split": "validation",
"version": "1.1.0",
"model": "llama3-8b-grpo",
"source": "CUAD"
} | NEOMEDIATECHNOLOGIESINC_12_15_2005-EX-16.1-DISTRIBUTOR AGREEMENT/NEOMEDIATECHNOLOGIESINC_12_15_2005-EX-16.1-DISTRIBUTOR_AGREEMENT_22 |
ContractGraphEval | 1.1.0 | contract_minigraph_extraction | INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT/INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE_AGREEMENT_5.16.2 | 18 | INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT | 5.16.2 | Your task is to act as a legal graph extractor. From this single clause, create a self-contained set of nodes and edges that are explicitly supported by the text. Follow the reasoning process, rules, and clarifications below.
Output ONLY a single, strict JSON object with this structure:
{
"contract_id": "...",
"nod... | {
"text": "5.16.2 SELF-SUPPLY. Franchisee may, upon prior written notice to BKC, invest in BKC approved suppliers and/or distributors to the Franchised Restaurant or request approval from BKC to become an approved supplier and/or distributor to the Franchised Restaurant. BKC shall not unreasonably withhold its approv... | {
"contract_id": "INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT",
"nodes": [
{
"id": "5.16",
"node_type": "CLAUSE",
"title": "5.16",
"level": 2,
"name": null,
"unit": null,
"text": null
},
{
"id": "5.16.2",
"node_type": "CLAUSE",
... | {
"graph": {
"contract_id": "INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT",
"nodes": [
{
"id": "5.16",
"node_type": "CLAUSE",
"title": "5.16",
"level": 2,
"name": null,
"unit": null,
"text": null
},
{
"id": "5.... | {
"exact_match": 0,
"structural_f1": 0.6571428571428571,
"semantic_similarity": 0.8632739186286926,
"openai_issues": 0.5,
"hybrid": 0.7602083878857748,
"parse_success": 1,
"completeness": 0.8333333333333333,
"graph_edit_distance": 0.5483870967741935
} | {
"unused_definitions": 0,
"undefined_references": 1,
"duplicate_definitions": 1,
"orphan_nodes": 1,
"isolated_components": 1,
"domain_range_validity": 1,
"ontology_compliance": 0.9090909090909091
} | {
"structural_f1": 0.34285714285714286,
"semantic_similarity": 0.13672608137130737,
"completeness": 0.16666666666666674,
"graph_edit_distance": 0.4516129032258065,
"openai_issues": 0.5
} | {
"cv": 0.19751469613394257,
"entropy": 1.7718479609505897,
"range": 0.3632739186286926,
"pairwise": 0.18495158890425334,
"margin": 0.9700594147046406,
"iqr": 0.23947606010508427,
"variance": 0.018774683053483166,
"std": 0.1370207395013002,
"n_judges": 6,
"cv_judges": [
"structural_f1",
"sem... | {
"mean_risk": 0.31957255882418467,
"p_error_mean_risk": 0.31957255882418467,
"p_error_calibrated": 0,
"p_error_final": 0.3967453259246107
} | {
"has_error": false,
"mean_score": 0.6937242656274752,
"structural_f1": 0.6571428571428571
} | {
"split": "validation",
"version": "1.1.0",
"model": "llama3-8b-grpo",
"source": "CUAD"
} | INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT/INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE_AGREEMENT_5.16.2 |
ContractGraphEval | 1.1.0 | contract_minigraph_extraction | INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT/INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE_AGREEMENT_4.5.4 | 19 | INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT | 4.5.4 | Your task is to act as a legal graph extractor. From this single clause, create a self-contained set of nodes and edges that are explicitly supported by the text. Follow the reasoning process, rules, and clarifications below.
Output ONLY a single, strict JSON object with this structure:
{
"contract_id": "...",
"nod... | {
"text": "4.5.4 AMENDMENTS. BKC must be immediately provided with any amendments, shareholder agreements, addenda, revisions or other alterations to the articles of incorporation, bylaws or constitution of Franchisee. No amendment to such governing documents may be made, nor may any resolution be adopted by the boar... | {
"contract_id": "INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT",
"nodes": [
{
"id": "4.5",
"node_type": "CLAUSE",
"title": "4.5",
"level": 2,
"name": null,
"unit": null,
"text": null
},
{
"id": "4.5.4",
"node_type": "CLAUSE",
... | {
"graph": {
"contract_id": "INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT",
"nodes": [
{
"id": "4.5",
"node_type": "CLAUSE",
"title": "4.5",
"level": 2,
"name": null,
"unit": null,
"text": null
},
{
"id": "4.5.... | {
"exact_match": 0,
"structural_f1": 0.898989898989899,
"semantic_similarity": 0.8671190142631531,
"openai_issues": 0.9,
"hybrid": 0.883054456626526,
"parse_success": 1,
"completeness": 1,
"graph_edit_distance": 0.8260869565217391
} | {
"unused_definitions": 0,
"undefined_references": 1,
"duplicate_definitions": 1,
"orphan_nodes": 1,
"isolated_components": 1,
"domain_range_validity": 1,
"ontology_compliance": 0.8888888888888888
} | {
"structural_f1": 0.101010101010101,
"semantic_similarity": 0.13288098573684692,
"completeness": 0,
"graph_edit_distance": 0.17391304347826086,
"openai_issues": 0.9
} | {
"cv": 0.05894266957053459,
"entropy": 1.7900489134639255,
"range": 0.17391304347826086,
"pairwise": 0.06560957446434787,
"margin": 0.9,
"iqr": 0.02864459989347845,
"variance": 0.0027883963177186694,
"std": 0.05280526789742354,
"n_judges": 6,
"cv_judges": [
"structural_f1",
"semantic_simila... | {
"mean_risk": 0.26156082604504177,
"p_error_mean_risk": 0.26156082604504177,
"p_error_calibrated": 0,
"p_error_final": 0.3279040137293046
} | {
"has_error": false,
"mean_score": 0.8958750544002196,
"structural_f1": 0.898989898989899
} | {
"split": "validation",
"version": "1.1.0",
"model": "llama3-8b-grpo",
"source": "CUAD"
} | INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT/INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE_AGREEMENT_4.5.4 |
ContractGraphEval | 1.1.0 | contract_minigraph_extraction | INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT/INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE_AGREEMENT_14 | 20 | INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT | 14 | Your task is to act as a legal graph extractor. From this single clause, create a self-contained set of nodes and edges that are explicitly supported by the text. Follow the reasoning process, rules, and clarifications below.
Output ONLY a single, strict JSON object with this structure:
{
"contract_id": "...",
"nod... | {
"text": "14\n\n 10.2 ANNUAL FINANCIAL STATEMENT. Within ninety (90) days after the close of each fiscal year and at any time on request, the Franchisee shall submit a full disclosure of all shareholders in the Franchisee, and of all persons with an interest in the Franchised Restaurant. ln addition, the Franchisee ... | {
"contract_id": "INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT",
"nodes": [
{
"id": "10.2",
"node_type": "CLAUSE",
"title": "ANNUAL FINANCIAL STATEMENT",
"level": 2,
"name": null,
"unit": null,
"text": null
},
{
"id": "14",
"node_ty... | {
"graph": {
"contract_id": "INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT",
"nodes": [
{
"id": "10",
"node_type": "CLAUSE",
"title": "10",
"level": 1,
"name": null,
"unit": null,
"text": null
},
{
"id": "10.2",... | {
"exact_match": 0,
"structural_f1": 0.1666666666666666,
"semantic_similarity": 0.8975897431373596,
"openai_issues": 0.45,
"hybrid": 0.5321282049020132,
"parse_success": 1,
"completeness": 0.6749999999999999,
"graph_edit_distance": 0.1111111111111111
} | {
"unused_definitions": 1,
"undefined_references": 1,
"duplicate_definitions": 1,
"orphan_nodes": 0.9166666666666666,
"isolated_components": 0,
"domain_range_validity": 0.33333333333333337,
"ontology_compliance": 0.4285714285714286
} | {
"structural_f1": 0.8333333333333334,
"semantic_similarity": 0.10241025686264038,
"completeness": 0.32500000000000007,
"graph_edit_distance": 0.8888888888888888,
"openai_issues": 0.45
} | {
"cv": 0.5800512782280677,
"entropy": 1.606058107933641,
"range": 0.7864786320262485,
"pairwise": 0.3693014243355504,
"margin": 0.7774102568626403,
"iqr": 0.40178205122550337,
"variance": 0.07498403734983597,
"std": 0.2738321335231422,
"n_judges": 6,
"cv_judges": [
"structural_f1",
"semanti... | {
"mean_risk": 0.5199264958169726,
"p_error_mean_risk": 0.5199264958169726,
"p_error_calibrated": 1,
"p_error_final": 0.6484757704335454
} | {
"has_error": true,
"mean_score": 0.4720826209695251,
"structural_f1": 0.1666666666666666
} | {
"split": "validation",
"version": "1.1.0",
"model": "llama3-8b-grpo",
"source": "CUAD"
} | INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT/INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE_AGREEMENT_14 |
ContractGraphEval | 1.1.0 | contract_minigraph_extraction | INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT/INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE_AGREEMENT_d | 21 | INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT | (d | Your task is to act as a legal graph extractor. From this single clause, create a self-contained set of nodes and edges that are explicitly supported by the text. Follow the reasoning process, rules, and clarifications below.
Output ONLY a single, strict JSON object with this structure:
{
"contract_id": "...",
"nod... | {
"text": "(d) If the Franchisee challenges the validity or ownership of the Burger King Marks or BKC's ownership rights to the Burger King System.",
"title": "'s ownership rights to the Burger King System.",
"id": "(d"
} | {
"contract_id": "INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT",
"nodes": [
{
"id": "(d",
"node_type": "CLAUSE",
"title": "'s ownership rights to the Burger King System.",
"level": 1,
"name": null,
"unit": null,
"text": null
},
{
"id": "t... | {
"graph": {
"contract_id": "INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT",
"nodes": [
{
"id": "(d",
"node_type": "CLAUSE",
"title": "'s ownership rights to the Burger King System.",
"level": 1,
"name": null,
"unit": null,
"text":... | {
"exact_match": 0,
"structural_f1": 0.55,
"semantic_similarity": 0.9442197680473328,
"openai_issues": 0.5,
"hybrid": 0.7471098840236664,
"parse_success": 1,
"completeness": 0.8,
"graph_edit_distance": 0.5789473684210527
} | {
"unused_definitions": 0,
"undefined_references": 1,
"duplicate_definitions": 1,
"orphan_nodes": 1,
"isolated_components": 1,
"domain_range_validity": 1,
"ontology_compliance": 1
} | {
"structural_f1": 0.44999999999999996,
"semantic_similarity": 0.055780231952667236,
"completeness": 0.19999999999999996,
"graph_edit_distance": 0.42105263157894735,
"openai_issues": 0.5
} | {
"cv": 0.22867415552569778,
"entropy": 1.7659765310175137,
"range": 0.44421976804733276,
"pairwise": 0.20928409038928517,
"margin": 0.8557802319526673,
"iqr": 0.22954062890065352,
"variance": 0.024659513941066757,
"std": 0.15703348031890127,
"n_judges": 6,
"cv_judges": [
"structural_f1",
"s... | {
"mean_risk": 0.3253665727063229,
"p_error_mean_risk": 0.3253665727063229,
"p_error_calibrated": 0,
"p_error_final": 0.4039055190233343
} | {
"has_error": false,
"mean_score": 0.6867128367486753,
"structural_f1": 0.55
} | {
"split": "validation",
"version": "1.1.0",
"model": "llama3-8b-grpo",
"source": "CUAD"
} | INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE AGREEMENT/INTERNATIONALFASTFOODCORP_04_04_1997-EX-99-FRANCHISE_AGREEMENT_d |
End of preview. Expand in Data Studio
ContractGraphEval
150 contract clauses, each with a reference graph, a model-predicted graph, scores from several judges, and uncertainty estimates. Benchmark of "LLM as a Judge for Evaluating Contract Graphs" (Procedia Computer Science 275, 2026).
Paper · Code · Source dataset
Use
from datasets import load_dataset
ds = load_dataset("moriyad/ContractGraphEval", split="validation")
s = ds[0]
s["clause"]["text"], s["judge_scores"]["hybrid"], s["error_prediction"]["p_error_calibrated"]
Fields
| Field | Description |
|---|---|
clause, instruction |
The clause and the extraction prompt |
gold_graph, prediction |
Reference graph and the output of the GRPO-trained Llama-3.1-8B model |
judge_scores |
8 reference-based scores in [0, 1] |
reference_free_judges |
7 checks that need no reference graph, computed with the contract_linter package |
uncertainty, risk_scores, error_prediction |
Judge disagreement, per-judge risk, and calibrated error probability |
evaluation |
has_error, mean_score, structural_f1 |
source_id |
The same clause in the source dataset |
Error labels are derived from judge scores against the reference graph.
Notes
- The samples are validation rows of the source dataset, from 3 contracts that were not used for training.
Licence and citation
cc-by-nc-nd-4.0. Clause text comes from CUAD (The Atticus Project, CC BY 4.0).
@article{dechtiar2026llmjudge,
title = {LLM as a Judge for Evaluating Contract Graphs: Multi-Judge Benchmarking and Agentic Uncertainty-Aware Refinement},
author = {Dechtiar, Moriya and Katz, Daniel Martin and Jaume, Sylvain and Wang, Hongming},
journal = {Procedia Computer Science},
volume = {275},
pages = {513--522},
year = {2026},
doi = {10.1016/j.procs.2026.01.060}
}
- Downloads last month
- 47