{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:J37CVQ43HKFFBFLUTTHGRR7WQB","short_pith_number":"pith:J37CVQ43","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"},"canonical_sha256":"4efe2ac39b3a8a5095749cce68c7f6805e1245e98446e0e66a1f572f8065bdfe","source":{"kind":"arxiv","id":"1503.01613","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.01613","created_at":"2026-05-18T02:19:43Z"},{"alias_kind":"arxiv_version","alias_value":"1503.01613v3","created_at":"2026-05-18T02:19:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01613","created_at":"2026-05-18T02:19:43Z"},{"alias_kind":"pith_short_12","alias_value":"J37CVQ43HKFF","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"J37CVQ43HKFFBFLU","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"J37CVQ43","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:J37CVQ43HKFFBFLUTTHGRR7WQB","target":"record","payload":{"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"},"canonical_sha256":"4efe2ac39b3a8a5095749cce68c7f6805e1245e98446e0e66a1f572f8065bdfe","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"},"source_kind":"arxiv","source_id":"1503.01613","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:19:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g5a7ZedItI54l2bDL6vj7aFgJ4SiC7nnTgQ8H2O0/zTSj3NTPzOkgD0MWhYrC6qwE5pXR3m6vFAbKQKG+IaPBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:21:10.566455Z"},"content_sha256":"ff9f279dd78a25f8a16e74f141d31589d2a507245d81d66c8b9b8f8464f5183a","schema_version":"1.0","event_id":"sha256:ff9f279dd78a25f8a16e74f141d31589d2a507245d81d66c8b9b8f8464f5183a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:J37CVQ43HKFFBFLUTTHGRR7WQB","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:19:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lyvlIVMVch+ojOCehlLjAzgrv7YrnefUqoPerdRIaJjGky36emxW4zEZSikzYcNZ851bYHst9isq/kyjT1xcCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:21:10.567132Z"},"content_sha256":"9cb64bc34c4bea7eaf8f964ee2511edaf3ad5459c8008540f1a85bb5ea08c3b0","schema_version":"1.0","event_id":"sha256:9cb64bc34c4bea7eaf8f964ee2511edaf3ad5459c8008540f1a85bb5ea08c3b0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J37CVQ43HKFFBFLUTTHGRR7WQB/bundle.json","state_url":"https://pith.science/pith/J37CVQ43HKFFBFLUTTHGRR7WQB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J37CVQ43HKFFBFLUTTHGRR7WQB/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T09:21:10Z","links":{"resolver":"https://pith.science/pith/J37CVQ43HKFFBFLUTTHGRR7WQB","bundle":"https://pith.science/pith/J37CVQ43HKFFBFLUTTHGRR7WQB/bundle.json","state":"https://pith.science/pith/J37CVQ43HKFFBFLUTTHGRR7WQB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J37CVQ43HKFFBFLUTTHGRR7WQB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:J37CVQ43HKFFBFLUTTHGRR7WQB","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2a2924c4f1c712e61df24cd5bf6f40dab7e54f3b62bc28ff86422618ed27d700","cross_cats_sorted":["math.CO","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-03-05T11:46:47Z","title_canon_sha256":"178b69873310bce71703b7264c0e507960afd517bb4745b221355fa6ede39127"},"schema_version":"1.0","source":{"id":"1503.01613","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.01613","created_at":"2026-05-18T02:19:43Z"},{"alias_kind":"arxiv_version","alias_value":"1503.01613v3","created_at":"2026-05-18T02:19:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01613","created_at":"2026-05-18T02:19:43Z"},{"alias_kind":"pith_short_12","alias_value":"J37CVQ43HKFF","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"J37CVQ43HKFFBFLU","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"J37CVQ43","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:9cb64bc34c4bea7eaf8f964ee2511edaf3ad5459c8008540f1a85bb5ea08c3b0","target":"graph","created_at":"2026-05-18T02:19:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Ilario Bonacina, Mike Molloy, Nicola Galesi, Patrick Bennett, Paul Wollan, Tony Huynh","cross_cats":["math.CO","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-03-05T11:46:47Z","title":"Space proof complexity for random 3-CNFs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.01613","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ff9f279dd78a25f8a16e74f141d31589d2a507245d81d66c8b9b8f8464f5183a","target":"record","created_at":"2026-05-18T02:19:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2a2924c4f1c712e61df24cd5bf6f40dab7e54f3b62bc28ff86422618ed27d700","cross_cats_sorted":["math.CO","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-03-05T11:46:47Z","title_canon_sha256":"178b69873310bce71703b7264c0e507960afd517bb4745b221355fa6ede39127"},"schema_version":"1.0","source":{"id":"1503.01613","kind":"arxiv","version":3}},"canonical_sha256":"4efe2ac39b3a8a5095749cce68c7f6805e1245e98446e0e66a1f572f8065bdfe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4efe2ac39b3a8a5095749cce68c7f6805e1245e98446e0e66a1f572f8065bdfe","first_computed_at":"2026-05-18T02:19:43.544548Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:19:43.544548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NST7nFJ7s1vCMX51bqc34TSvw9jtvcGBruuLs1ZtGmCSeG7YO4YSJjbXsrz6RArY2C6us1uvAfcAwberISJXCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:19:43.544958Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.01613","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff9f279dd78a25f8a16e74f141d31589d2a507245d81d66c8b9b8f8464f5183a","sha256:9cb64bc34c4bea7eaf8f964ee2511edaf3ad5459c8008540f1a85bb5ea08c3b0"],"state_sha256":"40914828df1e0f4593e0f1f8a1e9cc6bd14493e7cf3088034ee044f0de943f74"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TZR6hk4OBH+taZ6bb2yD13SaPe0z7wzoRcPkI0Luttrd40YlG5YKXhdjjmm0BonJfqOAp/shcXLrJ4XRqzCdCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T09:21:10.570506Z","bundle_sha256":"b5eb864c1185dce51d86bceee87e15d70888bcd6f9d34fee7b9911a04f5d07d4"}}