{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:J37CVQ43HKFFBFLUTTHGRR7WQB","short_pith_number":"pith:J37CVQ43","schema_version":"1.0","canonical_sha256":"4efe2ac39b3a8a5095749cce68c7f6805e1245e98446e0e66a1f572f8065bdfe","source":{"kind":"arxiv","id":"1503.01613","version":3},"attestation_state":"computed","paper":{"title":"Space proof complexity for random 3-CNFs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.PR"],"primary_cat":"cs.CC","authors_text":"Ilario Bonacina, Mike Molloy, Nicola Galesi, Patrick Bennett, Paul Wollan, Tony Huynh","submitted_at":"2015-03-05T11:46:47Z","abstract_excerpt":"We investigate the space complexity of refuting $3$-CNFs in Resolution and 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)$ distinct monomials to be kept simultaneously in memory. The same construction also proves that every Resolution refutation $\\phi$ requires, with high probability, $\\Omega(n)$ clauses each of width $\\Omega(n)$ to be kept at the same time in memory. This gives a $\\Omega(n^2)$ lower bound for the total space needed in Resolution to refute $\\phi$. Thes"},"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":"1503.01613","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-03-05T11:46:47Z","cross_cats_sorted":["math.CO","math.PR"],"title_canon_sha256":"178b69873310bce71703b7264c0e507960afd517bb4745b221355fa6ede39127","abstract_canon_sha256":"2a2924c4f1c712e61df24cd5bf6f40dab7e54f3b62bc28ff86422618ed27d700"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:43.544958Z","signature_b64":"NST7nFJ7s1vCMX51bqc34TSvw9jtvcGBruuLs1ZtGmCSeG7YO4YSJjbXsrz6RArY2C6us1uvAfcAwberISJXCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4efe2ac39b3a8a5095749cce68c7f6805e1245e98446e0e66a1f572f8065bdfe","last_reissued_at":"2026-05-18T02:19:43.544548Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:43.544548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Space proof complexity for random 3-CNFs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.PR"],"primary_cat":"cs.CC","authors_text":"Ilario Bonacina, Mike Molloy, Nicola Galesi, Patrick Bennett, Paul Wollan, Tony Huynh","submitted_at":"2015-03-05T11:46:47Z","abstract_excerpt":"We investigate the space complexity of refuting $3$-CNFs in Resolution and 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)$ distinct monomials to be kept simultaneously in memory. The same construction also proves that every Resolution refutation $\\phi$ requires, with high probability, $\\Omega(n)$ clauses each of width $\\Omega(n)$ to be kept at the same time in memory. This gives a $\\Omega(n^2)$ lower bound for the total space needed in Resolution to refute $\\phi$. Thes"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.01613","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":"1503.01613","created_at":"2026-05-18T02:19:43.544609+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.01613v3","created_at":"2026-05-18T02:19:43.544609+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01613","created_at":"2026-05-18T02:19:43.544609+00:00"},{"alias_kind":"pith_short_12","alias_value":"J37CVQ43HKFF","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"J37CVQ43HKFFBFLU","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"J37CVQ43","created_at":"2026-05-18T12:29:27.538025+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/J37CVQ43HKFFBFLUTTHGRR7WQB","json":"https://pith.science/pith/J37CVQ43HKFFBFLUTTHGRR7WQB.json","graph_json":"https://pith.science/api/pith-number/J37CVQ43HKFFBFLUTTHGRR7WQB/graph.json","events_json":"https://pith.science/api/pith-number/J37CVQ43HKFFBFLUTTHGRR7WQB/events.json","paper":"https://pith.science/paper/J37CVQ43"},"agent_actions":{"view_html":"https://pith.science/pith/J37CVQ43HKFFBFLUTTHGRR7WQB","download_json":"https://pith.science/pith/J37CVQ43HKFFBFLUTTHGRR7WQB.json","view_paper":"https://pith.science/paper/J37CVQ43","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.01613&json=true","fetch_graph":"https://pith.science/api/pith-number/J37CVQ43HKFFBFLUTTHGRR7WQB/graph.json","fetch_events":"https://pith.science/api/pith-number/J37CVQ43HKFFBFLUTTHGRR7WQB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J37CVQ43HKFFBFLUTTHGRR7WQB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J37CVQ43HKFFBFLUTTHGRR7WQB/action/storage_attestation","attest_author":"https://pith.science/pith/J37CVQ43HKFFBFLUTTHGRR7WQB/action/author_attestation","sign_citation":"https://pith.science/pith/J37CVQ43HKFFBFLUTTHGRR7WQB/action/citation_signature","submit_replication":"https://pith.science/pith/J37CVQ43HKFFBFLUTTHGRR7WQB/action/replication_record"}},"created_at":"2026-05-18T02:19:43.544609+00:00","updated_at":"2026-05-18T02:19:43.544609+00:00"}