{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:4H7PQ3CRAPUL4PDHSALOMBS6U6","short_pith_number":"pith:4H7PQ3CR","schema_version":"1.0","canonical_sha256":"e1fef86c5103e8be3c679016e6065ea798dc2c6a224bd6ceb0fa632935c5e307","source":{"kind":"arxiv","id":"2411.02400","version":2},"attestation_state":"computed","paper":{"title":"Decomposition Dilemmas: Does Claim Decomposition Boost or Burden Fact-Checking Performance?","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.IR","authors_text":"Qisheng Hu, Quanyu Long, Wenya Wang","submitted_at":"2024-10-17T11:45:59Z","abstract_excerpt":"Fact-checking pipelines increasingly adopt the Decompose-Then-Verify paradigm, where texts are broken down into smaller claims for individual verification and subsequently combined for a veracity decision. While decomposition is widely-adopted in such pipelines, its effects on final fact-checking performance remain underexplored. Some studies have reported improvements from decompostition, while others have observed performance declines, indicating its inconsistent impact. To date, no comprehensive analysis has been conducted to understand this variability. To address this gap, we present an i"},"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":"2411.02400","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IR","submitted_at":"2024-10-17T11:45:59Z","cross_cats_sorted":["cs.AI","cs.CL"],"title_canon_sha256":"c9284b139fcc903f394bb00f9a7cdeb19366a07b5c0e31531c8c6b14c07060a6","abstract_canon_sha256":"8b57a2fd381b193c988e3bce8a6e84f2f58e95f8802e5a5dbfef6d0dfd92e55d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:14:47.688285Z","signature_b64":"TB8r9xPpjg+h4ZbPUPrDA9rK5zllKkI1hNSvRX/NM3VpE5T+JeecAWiwmtBdhqEnBYlO1MfFCuEjrKgB30fUCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1fef86c5103e8be3c679016e6065ea798dc2c6a224bd6ceb0fa632935c5e307","last_reissued_at":"2026-07-05T10:14:47.687724Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:14:47.687724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decomposition Dilemmas: Does Claim Decomposition Boost or Burden Fact-Checking Performance?","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.IR","authors_text":"Qisheng Hu, Quanyu Long, Wenya Wang","submitted_at":"2024-10-17T11:45:59Z","abstract_excerpt":"Fact-checking pipelines increasingly adopt the Decompose-Then-Verify paradigm, where texts are broken down into smaller claims for individual verification and subsequently combined for a veracity decision. While decomposition is widely-adopted in such pipelines, its effects on final fact-checking performance remain underexplored. Some studies have reported improvements from decompostition, while others have observed performance declines, indicating its inconsistent impact. To date, no comprehensive analysis has been conducted to understand this variability. To address this gap, we present an i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.02400","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/2411.02400/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":"2411.02400","created_at":"2026-07-05T10:14:47.687794+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.02400v2","created_at":"2026-07-05T10:14:47.687794+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.02400","created_at":"2026-07-05T10:14:47.687794+00:00"},{"alias_kind":"pith_short_12","alias_value":"4H7PQ3CRAPUL","created_at":"2026-07-05T10:14:47.687794+00:00"},{"alias_kind":"pith_short_16","alias_value":"4H7PQ3CRAPUL4PDH","created_at":"2026-07-05T10:14:47.687794+00:00"},{"alias_kind":"pith_short_8","alias_value":"4H7PQ3CR","created_at":"2026-07-05T10:14:47.687794+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.06666","citing_title":"A Graph-Enhanced Defense Framework for Explainable Fake News Detection with LLM","ref_index":27,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4H7PQ3CRAPUL4PDHSALOMBS6U6","json":"https://pith.science/pith/4H7PQ3CRAPUL4PDHSALOMBS6U6.json","graph_json":"https://pith.science/api/pith-number/4H7PQ3CRAPUL4PDHSALOMBS6U6/graph.json","events_json":"https://pith.science/api/pith-number/4H7PQ3CRAPUL4PDHSALOMBS6U6/events.json","paper":"https://pith.science/paper/4H7PQ3CR"},"agent_actions":{"view_html":"https://pith.science/pith/4H7PQ3CRAPUL4PDHSALOMBS6U6","download_json":"https://pith.science/pith/4H7PQ3CRAPUL4PDHSALOMBS6U6.json","view_paper":"https://pith.science/paper/4H7PQ3CR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.02400&json=true","fetch_graph":"https://pith.science/api/pith-number/4H7PQ3CRAPUL4PDHSALOMBS6U6/graph.json","fetch_events":"https://pith.science/api/pith-number/4H7PQ3CRAPUL4PDHSALOMBS6U6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4H7PQ3CRAPUL4PDHSALOMBS6U6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4H7PQ3CRAPUL4PDHSALOMBS6U6/action/storage_attestation","attest_author":"https://pith.science/pith/4H7PQ3CRAPUL4PDHSALOMBS6U6/action/author_attestation","sign_citation":"https://pith.science/pith/4H7PQ3CRAPUL4PDHSALOMBS6U6/action/citation_signature","submit_replication":"https://pith.science/pith/4H7PQ3CRAPUL4PDHSALOMBS6U6/action/replication_record"}},"created_at":"2026-07-05T10:14:47.687794+00:00","updated_at":"2026-07-05T10:14:47.687794+00:00"}