{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:4VDKGPLCRXSTJRSTVHXKAD7Y72","short_pith_number":"pith:4VDKGPLC","canonical_record":{"source":{"id":"1101.3970","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-01-20T17:09:14Z","cross_cats_sorted":[],"title_canon_sha256":"3d1dbf50ec088b0989c80b46bba84f32dcd0e2f3a0919a12ee3c850ae407b0e0","abstract_canon_sha256":"4aeb4545119b2bd7f68ba2435efdad91efa4ee00ee590f2bfbab0d343a434ec6"},"schema_version":"1.0"},"canonical_sha256":"e546a33d628de534c653a9eea00ff8fe81172e03af5965cc8b0ba7c2a63e5ebb","source":{"kind":"arxiv","id":"1101.3970","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.3970","created_at":"2026-05-18T04:20:49Z"},{"alias_kind":"arxiv_version","alias_value":"1101.3970v2","created_at":"2026-05-18T04:20:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.3970","created_at":"2026-05-18T04:20:49Z"},{"alias_kind":"pith_short_12","alias_value":"4VDKGPLCRXST","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4VDKGPLCRXSTJRST","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4VDKGPLC","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:4VDKGPLCRXSTJRSTVHXKAD7Y72","target":"record","payload":{"canonical_record":{"source":{"id":"1101.3970","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-01-20T17:09:14Z","cross_cats_sorted":[],"title_canon_sha256":"3d1dbf50ec088b0989c80b46bba84f32dcd0e2f3a0919a12ee3c850ae407b0e0","abstract_canon_sha256":"4aeb4545119b2bd7f68ba2435efdad91efa4ee00ee590f2bfbab0d343a434ec6"},"schema_version":"1.0"},"canonical_sha256":"e546a33d628de534c653a9eea00ff8fe81172e03af5965cc8b0ba7c2a63e5ebb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:20:49.637401Z","signature_b64":"WQdVN8jXCUBjcMAMNs6mKYt5d1mroRd2Qsyyr6IEw3sit762Pyy7sIGjVAMTy1ELirNf/mJ3y9HEuzGEZVHaAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e546a33d628de534c653a9eea00ff8fe81172e03af5965cc8b0ba7c2a63e5ebb","last_reissued_at":"2026-05-18T04:20:49.636817Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:20:49.636817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1101.3970","source_version":2,"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-18T04:20:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ao0bmK7zLEQb6ui/Llrb7GWTxI7aRWgodsml6O2S1lFLp1+hAZjBv7itXQcc6m0Fyp0LNau/AoKX4515fqAbAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T03:34:52.527532Z"},"content_sha256":"af999fa6bdbed7f7222e095ae2c2d2c6ba3cb5b8d4f95041784635bcbeef0443","schema_version":"1.0","event_id":"sha256:af999fa6bdbed7f7222e095ae2c2d2c6ba3cb5b8d4f95041784635bcbeef0443"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:4VDKGPLCRXSTJRSTVHXKAD7Y72","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Short Propositional Refutations for Dense Random 3CNF Formulas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Iddo Tzameret, Sebastian M\\\"uller","submitted_at":"2011-01-20T17:09:14Z","abstract_excerpt":"Random 3CNF formulas constitute an important distribution for measuring the average-case behavior of propositional proof systems. Lower bounds for random 3CNF refutations in many propositional proof systems are known. Most notably are the exponential-size resolution refutation lower bounds for random 3CNF formulas with $\\Omega(n^{1.5-\\epsilon}) $ clauses [Chvatal and Szemeredi (1988), Ben-Sasson and Wigderson (2001)]. On the other hand, the only known non-trivial upper bound on the size of random 3CNF refutations in a non-abstract propositional proof system is for resolution with $\\Omega(n^{2}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.3970","kind":"arxiv","version":2},"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-18T04:20:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r/+sH0tSxwkqTslbAtswhzZHwIPvGtmntZlU+w9fGBOPZFW8sA/Q7Y38Y9yuyUoXNUKij1rRIutWcpPiMNPwDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T03:34:52.527864Z"},"content_sha256":"61b46aca17edef3346700b422c0458e1f10444a0ff75332131533007356d5f37","schema_version":"1.0","event_id":"sha256:61b46aca17edef3346700b422c0458e1f10444a0ff75332131533007356d5f37"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4VDKGPLCRXSTJRSTVHXKAD7Y72/bundle.json","state_url":"https://pith.science/pith/4VDKGPLCRXSTJRSTVHXKAD7Y72/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4VDKGPLCRXSTJRSTVHXKAD7Y72/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-06-02T03:34:52Z","links":{"resolver":"https://pith.science/pith/4VDKGPLCRXSTJRSTVHXKAD7Y72","bundle":"https://pith.science/pith/4VDKGPLCRXSTJRSTVHXKAD7Y72/bundle.json","state":"https://pith.science/pith/4VDKGPLCRXSTJRSTVHXKAD7Y72/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4VDKGPLCRXSTJRSTVHXKAD7Y72/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:4VDKGPLCRXSTJRSTVHXKAD7Y72","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":"4aeb4545119b2bd7f68ba2435efdad91efa4ee00ee590f2bfbab0d343a434ec6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-01-20T17:09:14Z","title_canon_sha256":"3d1dbf50ec088b0989c80b46bba84f32dcd0e2f3a0919a12ee3c850ae407b0e0"},"schema_version":"1.0","source":{"id":"1101.3970","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.3970","created_at":"2026-05-18T04:20:49Z"},{"alias_kind":"arxiv_version","alias_value":"1101.3970v2","created_at":"2026-05-18T04:20:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.3970","created_at":"2026-05-18T04:20:49Z"},{"alias_kind":"pith_short_12","alias_value":"4VDKGPLCRXST","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4VDKGPLCRXSTJRST","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4VDKGPLC","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:61b46aca17edef3346700b422c0458e1f10444a0ff75332131533007356d5f37","target":"graph","created_at":"2026-05-18T04:20:49Z","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":"Random 3CNF formulas constitute an important distribution for measuring the average-case behavior of propositional proof systems. Lower bounds for random 3CNF refutations in many propositional proof systems are known. Most notably are the exponential-size resolution refutation lower bounds for random 3CNF formulas with $\\Omega(n^{1.5-\\epsilon}) $ clauses [Chvatal and Szemeredi (1988), Ben-Sasson and Wigderson (2001)]. On the other hand, the only known non-trivial upper bound on the size of random 3CNF refutations in a non-abstract propositional proof system is for resolution with $\\Omega(n^{2}","authors_text":"Iddo Tzameret, Sebastian M\\\"uller","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-01-20T17:09:14Z","title":"Short Propositional Refutations for Dense Random 3CNF Formulas"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.3970","kind":"arxiv","version":2},"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:af999fa6bdbed7f7222e095ae2c2d2c6ba3cb5b8d4f95041784635bcbeef0443","target":"record","created_at":"2026-05-18T04:20:49Z","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":"4aeb4545119b2bd7f68ba2435efdad91efa4ee00ee590f2bfbab0d343a434ec6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-01-20T17:09:14Z","title_canon_sha256":"3d1dbf50ec088b0989c80b46bba84f32dcd0e2f3a0919a12ee3c850ae407b0e0"},"schema_version":"1.0","source":{"id":"1101.3970","kind":"arxiv","version":2}},"canonical_sha256":"e546a33d628de534c653a9eea00ff8fe81172e03af5965cc8b0ba7c2a63e5ebb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e546a33d628de534c653a9eea00ff8fe81172e03af5965cc8b0ba7c2a63e5ebb","first_computed_at":"2026-05-18T04:20:49.636817Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:20:49.636817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WQdVN8jXCUBjcMAMNs6mKYt5d1mroRd2Qsyyr6IEw3sit762Pyy7sIGjVAMTy1ELirNf/mJ3y9HEuzGEZVHaAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:20:49.637401Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.3970","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af999fa6bdbed7f7222e095ae2c2d2c6ba3cb5b8d4f95041784635bcbeef0443","sha256:61b46aca17edef3346700b422c0458e1f10444a0ff75332131533007356d5f37"],"state_sha256":"debd74fb2d588f4ef69f2389e8ea84cb5d1b1828fb204fec85a7af4d1c1088fc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A7XRbVxdkxtZsxykdlFjNGpdc+KGk8MUwxHQbYO8el1YPYLUENmi9c0Ed1pwdYFVE4vByaVAk7f4fnQKMRVXAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T03:34:52.529670Z","bundle_sha256":"b3a77a6a29286e912af857a23810f18182ce65e23af737fe6ecf5ccb0caa9ed5"}}