{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:NULYJRCPSLNOREFUI3YULC35ZY","short_pith_number":"pith:NULYJRCP","schema_version":"1.0","canonical_sha256":"6d1784c44f92dae890b446f1458b7dce20ca12a3660b3f5d0a43ad886ee22838","source":{"kind":"arxiv","id":"1305.0948","version":3},"attestation_state":"computed","paper":{"title":"Sparser Random 3SAT Refutation Algorithms and the Interpolation Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Iddo Tzameret","submitted_at":"2013-05-04T19:22:46Z","abstract_excerpt":"We formalize a combinatorial principle, called the 3XOR principle, due to Feige, Kim and Ofek (2006), as a family of unsatisfiable propositional formulas for which refutations of small size in any propositional proof system that possesses the feasible interpolation property imply an efficient deterministic refutation algorithm for random 3SAT with n variables and \\Omega(n^{1.4}) clauses. Such small size refutations would improve the state-of-the-art (with respect to the clause density) efficient refutation algorithm, which works only for \\Omega(n^{1.5}) many clauses (Feige and Ofek (2007)).\n  "},"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":"1305.0948","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-05-04T19:22:46Z","cross_cats_sorted":[],"title_canon_sha256":"d10aaaf9951e09f933c3bceb1e59f7b918ab94463ea521d9c862cf8bb5f757ed","abstract_canon_sha256":"5064e2e2f026beb47fa198f9f5d565b87a68cbeb191384547da6fe0ecce3230d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:42.373504Z","signature_b64":"qbXzrtHMr6z0JfxOOmK295/tINtT+D3HiYr5budjops0eha6fTPkHv8c5Wsu2cy5lCupmYNzLyhWfaW7eifUDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d1784c44f92dae890b446f1458b7dce20ca12a3660b3f5d0a43ad886ee22838","last_reissued_at":"2026-05-18T02:51:42.373087Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:42.373087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparser Random 3SAT Refutation Algorithms and the Interpolation Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Iddo Tzameret","submitted_at":"2013-05-04T19:22:46Z","abstract_excerpt":"We formalize a combinatorial principle, called the 3XOR principle, due to Feige, Kim and Ofek (2006), as a family of unsatisfiable propositional formulas for which refutations of small size in any propositional proof system that possesses the feasible interpolation property imply an efficient deterministic refutation algorithm for random 3SAT with n variables and \\Omega(n^{1.4}) clauses. Such small size refutations would improve the state-of-the-art (with respect to the clause density) efficient refutation algorithm, which works only for \\Omega(n^{1.5}) many clauses (Feige and Ofek (2007)).\n  "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.0948","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1305.0948","created_at":"2026-05-18T02:51:42.373148+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.0948v3","created_at":"2026-05-18T02:51:42.373148+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.0948","created_at":"2026-05-18T02:51:42.373148+00:00"},{"alias_kind":"pith_short_12","alias_value":"NULYJRCPSLNO","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"NULYJRCPSLNOREFU","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"NULYJRCP","created_at":"2026-05-18T12:27:52.871228+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NULYJRCPSLNOREFUI3YULC35ZY","json":"https://pith.science/pith/NULYJRCPSLNOREFUI3YULC35ZY.json","graph_json":"https://pith.science/api/pith-number/NULYJRCPSLNOREFUI3YULC35ZY/graph.json","events_json":"https://pith.science/api/pith-number/NULYJRCPSLNOREFUI3YULC35ZY/events.json","paper":"https://pith.science/paper/NULYJRCP"},"agent_actions":{"view_html":"https://pith.science/pith/NULYJRCPSLNOREFUI3YULC35ZY","download_json":"https://pith.science/pith/NULYJRCPSLNOREFUI3YULC35ZY.json","view_paper":"https://pith.science/paper/NULYJRCP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.0948&json=true","fetch_graph":"https://pith.science/api/pith-number/NULYJRCPSLNOREFUI3YULC35ZY/graph.json","fetch_events":"https://pith.science/api/pith-number/NULYJRCPSLNOREFUI3YULC35ZY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NULYJRCPSLNOREFUI3YULC35ZY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NULYJRCPSLNOREFUI3YULC35ZY/action/storage_attestation","attest_author":"https://pith.science/pith/NULYJRCPSLNOREFUI3YULC35ZY/action/author_attestation","sign_citation":"https://pith.science/pith/NULYJRCPSLNOREFUI3YULC35ZY/action/citation_signature","submit_replication":"https://pith.science/pith/NULYJRCPSLNOREFUI3YULC35ZY/action/replication_record"}},"created_at":"2026-05-18T02:51:42.373148+00:00","updated_at":"2026-05-18T02:51:42.373148+00:00"}