{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:OXQNEHJHTOKHZCTQLF2RYDEP6C","short_pith_number":"pith:OXQNEHJH","schema_version":"1.0","canonical_sha256":"75e0d21d279b947c8a7059751c0c8ff0b7073173f9cb4ca8b732359705c75a5e","source":{"kind":"arxiv","id":"2503.15354","version":2},"attestation_state":"computed","paper":{"title":"Optimizing Decomposition for Optimal Claim Verification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Hy Dang, Meng Jiang, Noah Ziems, Yining Lu","submitted_at":"2025-03-19T15:56:21Z","abstract_excerpt":"Current research on the \\textit{Decompose-Then-Verify} paradigm for evaluating the factuality of long-form text typically treats decomposition and verification in isolation, overlooking their interactions and potential misalignment. We find that existing decomposition policies, typically hand-crafted demonstrations, do not align well with downstream verifiers in terms of atomicity -- a novel metric quantifying information density -- leading to suboptimal verification results. We formulate finding the optimal decomposition policy for optimal verification as a bilevel optimization problem. To ap"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2503.15354","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-03-19T15:56:21Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"73ac21d4b2f75ce94ff130a4e1634ca3e71c4c7eb532378f49702e866f9ca47c","abstract_canon_sha256":"431e1e4e200857ede0f2d766e205ed8e672576bc2d36bb55c6a64cde729feabc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:09:09.980435Z","signature_b64":"LZwdcnK7YqERHB2ZiG+g7AhUDR2HiyASC4tBkOGpUedH42MQRys0G6msAGYAN1q4dXRlPArIdZl6DMED5iozCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75e0d21d279b947c8a7059751c0c8ff0b7073173f9cb4ca8b732359705c75a5e","last_reissued_at":"2026-07-05T11:09:09.979870Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:09:09.979870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimizing Decomposition for Optimal Claim Verification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Hy Dang, Meng Jiang, Noah Ziems, Yining Lu","submitted_at":"2025-03-19T15:56:21Z","abstract_excerpt":"Current research on the \\textit{Decompose-Then-Verify} paradigm for evaluating the factuality of long-form text typically treats decomposition and verification in isolation, overlooking their interactions and potential misalignment. We find that existing decomposition policies, typically hand-crafted demonstrations, do not align well with downstream verifiers in terms of atomicity -- a novel metric quantifying information density -- leading to suboptimal verification results. We formulate finding the optimal decomposition policy for optimal verification as a bilevel optimization problem. To ap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.15354","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2503.15354/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2503.15354","created_at":"2026-07-05T11:09:09.979941+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.15354v2","created_at":"2026-07-05T11:09:09.979941+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.15354","created_at":"2026-07-05T11:09:09.979941+00:00"},{"alias_kind":"pith_short_12","alias_value":"OXQNEHJHTOKH","created_at":"2026-07-05T11:09:09.979941+00:00"},{"alias_kind":"pith_short_16","alias_value":"OXQNEHJHTOKHZCTQ","created_at":"2026-07-05T11:09:09.979941+00:00"},{"alias_kind":"pith_short_8","alias_value":"OXQNEHJH","created_at":"2026-07-05T11:09:09.979941+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.07528","citing_title":"Coordinating Search-Informed Reasoning and Reasoning-Guided Search in Claim Verification","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OXQNEHJHTOKHZCTQLF2RYDEP6C","json":"https://pith.science/pith/OXQNEHJHTOKHZCTQLF2RYDEP6C.json","graph_json":"https://pith.science/api/pith-number/OXQNEHJHTOKHZCTQLF2RYDEP6C/graph.json","events_json":"https://pith.science/api/pith-number/OXQNEHJHTOKHZCTQLF2RYDEP6C/events.json","paper":"https://pith.science/paper/OXQNEHJH"},"agent_actions":{"view_html":"https://pith.science/pith/OXQNEHJHTOKHZCTQLF2RYDEP6C","download_json":"https://pith.science/pith/OXQNEHJHTOKHZCTQLF2RYDEP6C.json","view_paper":"https://pith.science/paper/OXQNEHJH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.15354&json=true","fetch_graph":"https://pith.science/api/pith-number/OXQNEHJHTOKHZCTQLF2RYDEP6C/graph.json","fetch_events":"https://pith.science/api/pith-number/OXQNEHJHTOKHZCTQLF2RYDEP6C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OXQNEHJHTOKHZCTQLF2RYDEP6C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OXQNEHJHTOKHZCTQLF2RYDEP6C/action/storage_attestation","attest_author":"https://pith.science/pith/OXQNEHJHTOKHZCTQLF2RYDEP6C/action/author_attestation","sign_citation":"https://pith.science/pith/OXQNEHJHTOKHZCTQLF2RYDEP6C/action/citation_signature","submit_replication":"https://pith.science/pith/OXQNEHJHTOKHZCTQLF2RYDEP6C/action/replication_record"}},"created_at":"2026-07-05T11:09:09.979941+00:00","updated_at":"2026-07-05T11:09:09.979941+00:00"}