{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:BV6QVQLILF2NXB3UEUYEXETTXP","short_pith_number":"pith:BV6QVQLI","schema_version":"1.0","canonical_sha256":"0d7d0ac1685974db877425304b9273bbf7b300b911c361ca2fc5c18d1808eb09","source":{"kind":"arxiv","id":"1411.1619","version":1},"attestation_state":"computed","paper":{"title":"Space proof complexity for random $3$-CNFs via a $(2-\\epsilon)$-Hall's Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Ilario Bonacina, Nicola Galesi, Paul Wollan, Tony Huynh","submitted_at":"2014-11-06T14:08:24Z","abstract_excerpt":"We investigate the space complexity of refuting $3$-CNFs in Resolution and algebraic systems. No lower bound for refuting any family of $3$-CNFs was previously known for the total space in resolution or for the monomial space in algebraic systems. We prove that every Polynomial Calculus with Resolution refutation of a random $3$-CNF $\\phi$ in $n$ variables requires, with high probability, $\\Omega(n/\\log n)$ distinct monomials to be kept simultaneously in memory. The same construction also proves that every Resolution refutation $\\phi$ requires, with high probability, $\\Omega(n/\\log n)$ clauses"},"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":"1411.1619","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-11-06T14:08:24Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"c5fcf5a4e1300ec0717d2acfa266e9e914c6e597a3374d8fc3bfe0c920b737dc","abstract_canon_sha256":"8b5628ca0a1c4ac071ea3dab41fd772b237779051109b617520a815566010271"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:27.383897Z","signature_b64":"iGTaQmJ4t376VLQRCLc/KAB/fo2FQuM9+unZKEvZaNoKIxeOgfnKZYwFoR34AZcUw6EKDby8fTCV1YE9csDRAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d7d0ac1685974db877425304b9273bbf7b300b911c361ca2fc5c18d1808eb09","last_reissued_at":"2026-05-18T02:38:27.383275Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:27.383275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Space proof complexity for random $3$-CNFs via a $(2-\\epsilon)$-Hall's Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Ilario Bonacina, Nicola Galesi, Paul Wollan, Tony Huynh","submitted_at":"2014-11-06T14:08:24Z","abstract_excerpt":"We investigate the space complexity of refuting $3$-CNFs in Resolution and algebraic systems. No lower bound for refuting any family of $3$-CNFs was previously known for the total space in resolution or for the monomial space in algebraic systems. We prove that every Polynomial Calculus with Resolution refutation of a random $3$-CNF $\\phi$ in $n$ variables requires, with high probability, $\\Omega(n/\\log n)$ distinct monomials to be kept simultaneously in memory. The same construction also proves that every Resolution refutation $\\phi$ requires, with high probability, $\\Omega(n/\\log n)$ clauses"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.1619","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":""},"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":"1411.1619","created_at":"2026-05-18T02:38:27.383413+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.1619v1","created_at":"2026-05-18T02:38:27.383413+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.1619","created_at":"2026-05-18T02:38:27.383413+00:00"},{"alias_kind":"pith_short_12","alias_value":"BV6QVQLILF2N","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"BV6QVQLILF2NXB3U","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"BV6QVQLI","created_at":"2026-05-18T12:28:22.404517+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/BV6QVQLILF2NXB3UEUYEXETTXP","json":"https://pith.science/pith/BV6QVQLILF2NXB3UEUYEXETTXP.json","graph_json":"https://pith.science/api/pith-number/BV6QVQLILF2NXB3UEUYEXETTXP/graph.json","events_json":"https://pith.science/api/pith-number/BV6QVQLILF2NXB3UEUYEXETTXP/events.json","paper":"https://pith.science/paper/BV6QVQLI"},"agent_actions":{"view_html":"https://pith.science/pith/BV6QVQLILF2NXB3UEUYEXETTXP","download_json":"https://pith.science/pith/BV6QVQLILF2NXB3UEUYEXETTXP.json","view_paper":"https://pith.science/paper/BV6QVQLI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.1619&json=true","fetch_graph":"https://pith.science/api/pith-number/BV6QVQLILF2NXB3UEUYEXETTXP/graph.json","fetch_events":"https://pith.science/api/pith-number/BV6QVQLILF2NXB3UEUYEXETTXP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BV6QVQLILF2NXB3UEUYEXETTXP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BV6QVQLILF2NXB3UEUYEXETTXP/action/storage_attestation","attest_author":"https://pith.science/pith/BV6QVQLILF2NXB3UEUYEXETTXP/action/author_attestation","sign_citation":"https://pith.science/pith/BV6QVQLILF2NXB3UEUYEXETTXP/action/citation_signature","submit_replication":"https://pith.science/pith/BV6QVQLILF2NXB3UEUYEXETTXP/action/replication_record"}},"created_at":"2026-05-18T02:38:27.383413+00:00","updated_at":"2026-05-18T02:38:27.383413+00:00"}