{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:BV6QVQLILF2NXB3UEUYEXETTXP","short_pith_number":"pith:BV6QVQLI","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"},"canonical_sha256":"0d7d0ac1685974db877425304b9273bbf7b300b911c361ca2fc5c18d1808eb09","source":{"kind":"arxiv","id":"1411.1619","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.1619","created_at":"2026-05-18T02:38:27Z"},{"alias_kind":"arxiv_version","alias_value":"1411.1619v1","created_at":"2026-05-18T02:38:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.1619","created_at":"2026-05-18T02:38:27Z"},{"alias_kind":"pith_short_12","alias_value":"BV6QVQLILF2N","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BV6QVQLILF2NXB3U","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BV6QVQLI","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:BV6QVQLILF2NXB3UEUYEXETTXP","target":"record","payload":{"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"},"canonical_sha256":"0d7d0ac1685974db877425304b9273bbf7b300b911c361ca2fc5c18d1808eb09","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"},"source_kind":"arxiv","source_id":"1411.1619","source_version":1,"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:38:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A3yFRBf/pTFQu4qZ0uJ42otF5Nz8AsvyVL0WL57Vq25p0r2q/gHWbLnvoPncoGBBzXK/jUmjQ+BCvA0GRnjQBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:11:29.986232Z"},"content_sha256":"339b5b57644b9167157a371a15441202b69dc3da1b1aa6b86b5ee08159db5fb9","schema_version":"1.0","event_id":"sha256:339b5b57644b9167157a371a15441202b69dc3da1b1aa6b86b5ee08159db5fb9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:BV6QVQLILF2NXB3UEUYEXETTXP","target":"graph","payload":{"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"},"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:38:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kGqm4PuSyMap9SG+L/XJMZp4I/ojTeB+XKD4nl7qNQRm5rPMQ8YgfXvc9MrcSzM1xZbkcB5hnusWucPAhpm4Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:11:29.986921Z"},"content_sha256":"0449c7a35eb3381e2d5a3e80d89112efad5494edcf232908b46e05e808f0fa78","schema_version":"1.0","event_id":"sha256:0449c7a35eb3381e2d5a3e80d89112efad5494edcf232908b46e05e808f0fa78"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BV6QVQLILF2NXB3UEUYEXETTXP/bundle.json","state_url":"https://pith.science/pith/BV6QVQLILF2NXB3UEUYEXETTXP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BV6QVQLILF2NXB3UEUYEXETTXP/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-30T13:11:29Z","links":{"resolver":"https://pith.science/pith/BV6QVQLILF2NXB3UEUYEXETTXP","bundle":"https://pith.science/pith/BV6QVQLILF2NXB3UEUYEXETTXP/bundle.json","state":"https://pith.science/pith/BV6QVQLILF2NXB3UEUYEXETTXP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BV6QVQLILF2NXB3UEUYEXETTXP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:BV6QVQLILF2NXB3UEUYEXETTXP","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":"8b5628ca0a1c4ac071ea3dab41fd772b237779051109b617520a815566010271","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-11-06T14:08:24Z","title_canon_sha256":"c5fcf5a4e1300ec0717d2acfa266e9e914c6e597a3374d8fc3bfe0c920b737dc"},"schema_version":"1.0","source":{"id":"1411.1619","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.1619","created_at":"2026-05-18T02:38:27Z"},{"alias_kind":"arxiv_version","alias_value":"1411.1619v1","created_at":"2026-05-18T02:38:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.1619","created_at":"2026-05-18T02:38:27Z"},{"alias_kind":"pith_short_12","alias_value":"BV6QVQLILF2N","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BV6QVQLILF2NXB3U","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BV6QVQLI","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:0449c7a35eb3381e2d5a3e80d89112efad5494edcf232908b46e05e808f0fa78","target":"graph","created_at":"2026-05-18T02:38:27Z","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. 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","authors_text":"Ilario Bonacina, Nicola Galesi, Paul Wollan, Tony Huynh","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-11-06T14:08:24Z","title":"Space proof complexity for random $3$-CNFs via a $(2-\\epsilon)$-Hall's Theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.1619","kind":"arxiv","version":1},"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:339b5b57644b9167157a371a15441202b69dc3da1b1aa6b86b5ee08159db5fb9","target":"record","created_at":"2026-05-18T02:38:27Z","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":"8b5628ca0a1c4ac071ea3dab41fd772b237779051109b617520a815566010271","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-11-06T14:08:24Z","title_canon_sha256":"c5fcf5a4e1300ec0717d2acfa266e9e914c6e597a3374d8fc3bfe0c920b737dc"},"schema_version":"1.0","source":{"id":"1411.1619","kind":"arxiv","version":1}},"canonical_sha256":"0d7d0ac1685974db877425304b9273bbf7b300b911c361ca2fc5c18d1808eb09","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0d7d0ac1685974db877425304b9273bbf7b300b911c361ca2fc5c18d1808eb09","first_computed_at":"2026-05-18T02:38:27.383275Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:38:27.383275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iGTaQmJ4t376VLQRCLc/KAB/fo2FQuM9+unZKEvZaNoKIxeOgfnKZYwFoR34AZcUw6EKDby8fTCV1YE9csDRAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:38:27.383897Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.1619","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:339b5b57644b9167157a371a15441202b69dc3da1b1aa6b86b5ee08159db5fb9","sha256:0449c7a35eb3381e2d5a3e80d89112efad5494edcf232908b46e05e808f0fa78"],"state_sha256":"644cf7751385eba7faa5dfda3a6aee5794cf9c70763425ae4538ca7e58fc0a24"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fUSbOp3/g532wi8ph6tL87oXaLlnU1LZwDWTaCuGT+JpdNOSDXT9bYnXcQNdWUvQegkuSreGGBKF3Ph9j1JbCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T13:11:29.990026Z","bundle_sha256":"a937114187fe1876b64024407b4e3065fc23127cf55c22e936ff265244f3c99b"}}