{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:FLTV7WORLAZWRDIMMBFG5BGCMR","short_pith_number":"pith:FLTV7WOR","schema_version":"1.0","canonical_sha256":"2ae75fd9d15833688d0c604a6e84c26449396f45b962b42e2c4e06654a2b22ec","source":{"kind":"arxiv","id":"2210.13777","version":1},"attestation_state":"computed","paper":{"title":"SciFact-Open: Towards open-domain scientific claim verification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Arman Cohan, Bailey Kuehl, David Wadden, Hannaneh Hajishirzi, Iz Beltagy, Kyle Lo, Lucy Lu Wang","submitted_at":"2022-10-25T05:45:00Z","abstract_excerpt":"While research on scientific claim verification has led to the development of powerful systems that appear to approach human performance, these approaches have yet to be tested in a realistic setting against large corpora of scientific literature. Moving to this open-domain evaluation setting, however, poses unique challenges; in particular, it is infeasible to exhaustively annotate all evidence documents. In this work, we present SciFact-Open, a new test collection designed to evaluate the performance of scientific claim verification systems on a corpus of 500K research abstracts. Drawing upo"},"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":"2210.13777","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2022-10-25T05:45:00Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"c21dce64d1fbb57a2b2fc75da5c908775ad6430c19390fa8db04edf9e3eb0bff","abstract_canon_sha256":"5fc1d10595e99454a92b5828ad11960b524a1960777991fba683245397724d50"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:10:22.427183Z","signature_b64":"Kf0jC2i2lcoIpr9elY69UoHHpVJBzDvw7f4l+CIlENFigVVrA7D1pZ3GsT7Ik8HT2BLZw1ndbjmXeVzqtn3BAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ae75fd9d15833688d0c604a6e84c26449396f45b962b42e2c4e06654a2b22ec","last_reissued_at":"2026-07-05T05:10:22.426781Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:10:22.426781Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SciFact-Open: Towards open-domain scientific claim verification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Arman Cohan, Bailey Kuehl, David Wadden, Hannaneh Hajishirzi, Iz Beltagy, Kyle Lo, Lucy Lu Wang","submitted_at":"2022-10-25T05:45:00Z","abstract_excerpt":"While research on scientific claim verification has led to the development of powerful systems that appear to approach human performance, these approaches have yet to be tested in a realistic setting against large corpora of scientific literature. Moving to this open-domain evaluation setting, however, poses unique challenges; in particular, it is infeasible to exhaustively annotate all evidence documents. In this work, we present SciFact-Open, a new test collection designed to evaluate the performance of scientific claim verification systems on a corpus of 500K research abstracts. Drawing upo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.13777","kind":"arxiv","version":1},"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/2210.13777/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":"2210.13777","created_at":"2026-07-05T05:10:22.426840+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.13777v1","created_at":"2026-07-05T05:10:22.426840+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.13777","created_at":"2026-07-05T05:10:22.426840+00:00"},{"alias_kind":"pith_short_12","alias_value":"FLTV7WORLAZW","created_at":"2026-07-05T05:10:22.426840+00:00"},{"alias_kind":"pith_short_16","alias_value":"FLTV7WORLAZWRDIM","created_at":"2026-07-05T05:10:22.426840+00:00"},{"alias_kind":"pith_short_8","alias_value":"FLTV7WOR","created_at":"2026-07-05T05:10:22.426840+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.20873","citing_title":"SciLens: Multi-modal Scientific Claim Verification with Agentic Entailment and Grounding","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"2510.00361","citing_title":"Attribution Gradients: Incrementally Unfolding Citations for Critical Examination of Attributed AI Answers","ref_index":60,"is_internal_anchor":false},{"citing_arxiv_id":"2405.17428","citing_title":"NV-Embed: Improved Techniques for Training LLMs as Generalist Embedding Models","ref_index":94,"is_internal_anchor":false},{"citing_arxiv_id":"2605.09012","citing_title":"Re$^2$Math: Benchmarking Theorem Retrieval in Research-Level Mathematics","ref_index":20,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FLTV7WORLAZWRDIMMBFG5BGCMR","json":"https://pith.science/pith/FLTV7WORLAZWRDIMMBFG5BGCMR.json","graph_json":"https://pith.science/api/pith-number/FLTV7WORLAZWRDIMMBFG5BGCMR/graph.json","events_json":"https://pith.science/api/pith-number/FLTV7WORLAZWRDIMMBFG5BGCMR/events.json","paper":"https://pith.science/paper/FLTV7WOR"},"agent_actions":{"view_html":"https://pith.science/pith/FLTV7WORLAZWRDIMMBFG5BGCMR","download_json":"https://pith.science/pith/FLTV7WORLAZWRDIMMBFG5BGCMR.json","view_paper":"https://pith.science/paper/FLTV7WOR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.13777&json=true","fetch_graph":"https://pith.science/api/pith-number/FLTV7WORLAZWRDIMMBFG5BGCMR/graph.json","fetch_events":"https://pith.science/api/pith-number/FLTV7WORLAZWRDIMMBFG5BGCMR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FLTV7WORLAZWRDIMMBFG5BGCMR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FLTV7WORLAZWRDIMMBFG5BGCMR/action/storage_attestation","attest_author":"https://pith.science/pith/FLTV7WORLAZWRDIMMBFG5BGCMR/action/author_attestation","sign_citation":"https://pith.science/pith/FLTV7WORLAZWRDIMMBFG5BGCMR/action/citation_signature","submit_replication":"https://pith.science/pith/FLTV7WORLAZWRDIMMBFG5BGCMR/action/replication_record"}},"created_at":"2026-07-05T05:10:22.426840+00:00","updated_at":"2026-07-05T05:10:22.426840+00:00"}