{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:NLJ5QYL534IKSWK2OPARUX35SH","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":"d99f008dbf46c3c4cbbb51743f6a24dfc8d95c09f5e91045f8df55d27508cf10","cross_cats_sorted":["cs.DM","cs.LO","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-05-06T13:34:47Z","title_canon_sha256":"35f55d85c40261ee10b49b646197a0b71e6630ad341020f32fe656e23d0df590"},"schema_version":"1.0","source":{"id":"1505.01358","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.01358","created_at":"2026-05-18T02:16:49Z"},{"alias_kind":"arxiv_version","alias_value":"1505.01358v1","created_at":"2026-05-18T02:16:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.01358","created_at":"2026-05-18T02:16:49Z"},{"alias_kind":"pith_short_12","alias_value":"NLJ5QYL534IK","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"NLJ5QYL534IKSWK2","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"NLJ5QYL5","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:e9f814df7ea3ef536c4dee05eabe5b350140599a5008d0c0d0a0cbdfdc81f870","target":"graph","created_at":"2026-05-18T02:16: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":"We study the problem of obtaining lower bounds for polynomial calculus (PC) and polynomial calculus resolution (PCR) on proof degree, and hence by [Impagliazzo et al. '99] also on proof size. [Alekhnovich and Razborov '03] established that if the clause-variable incidence graph of a CNF formula F is a good enough expander, then proving that F is unsatisfiable requires high PC/PCR degree. We further develop the techniques in [AR03] to show that if one can \"cluster\" clauses and variables in a way that \"respects the structure\" of the formula in a certain sense, then it is sufficient that the inci","authors_text":"Jakob Nordstr\\\"om, Mladen Mik\\v{s}a","cross_cats":["cs.DM","cs.LO","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-05-06T13:34:47Z","title":"A Generalized Method for Proving Polynomial Calculus Degree Lower Bounds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.01358","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:405d47c83dfb988655c6084939b6cba904694fcf774e2b05ae04b92b0a499b23","target":"record","created_at":"2026-05-18T02:16: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":"d99f008dbf46c3c4cbbb51743f6a24dfc8d95c09f5e91045f8df55d27508cf10","cross_cats_sorted":["cs.DM","cs.LO","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-05-06T13:34:47Z","title_canon_sha256":"35f55d85c40261ee10b49b646197a0b71e6630ad341020f32fe656e23d0df590"},"schema_version":"1.0","source":{"id":"1505.01358","kind":"arxiv","version":1}},"canonical_sha256":"6ad3d8617ddf10a9595a73c11a5f7d91c45b3c0084afd488baf8432b92dffbe9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6ad3d8617ddf10a9595a73c11a5f7d91c45b3c0084afd488baf8432b92dffbe9","first_computed_at":"2026-05-18T02:16:49.653591Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:16:49.653591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gntbiCrRx64DZFVX7YAOmnk98Aev7YxxTIvdUAzrHIOqFPUjpHBZVEpK77hnAvV5z+Sz+N2P9dgwykyCqAH4CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:16:49.654263Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.01358","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:405d47c83dfb988655c6084939b6cba904694fcf774e2b05ae04b92b0a499b23","sha256:e9f814df7ea3ef536c4dee05eabe5b350140599a5008d0c0d0a0cbdfdc81f870"],"state_sha256":"a431e578fe62f2e84375c1604632e1adf00fcd170b75e7ed4e9d9af489e04527"}