{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:K7WJWDCBRSYRNAM2XH2B6XZMKP","short_pith_number":"pith:K7WJWDCB","schema_version":"1.0","canonical_sha256":"57ec9b0c418cb116819ab9f41f5f2c53de770b73c0496e4a46c37c4f82bd30e6","source":{"kind":"arxiv","id":"1604.06560","version":5},"attestation_state":"computed","paper":{"title":"A feasible interpolation for random resolution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.LO","authors_text":"Jan Krajicek","submitted_at":"2016-04-22T07:47:45Z","abstract_excerpt":"Random resolution, defined by Buss, Kolodziejczyk and Thapen (JSL, 2014), is a sound propositional proof system that extends the resolution proof system by the possibility to augment any set of initial clauses by a set of randomly chosen clauses (modulo a technical condition). We show how to apply the general feasible interpolation theorem for semantic derivations of Krajicek (JSL, 1997) to random resolution. As a consequence we get a lower bound for random resolution refutations of the clique-coloring formulas."},"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":"1604.06560","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2016-04-22T07:47:45Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"77b8a3644464359d956e243dcdd2d889ebf91d686d0076abd74027726efcf6e4","abstract_canon_sha256":"e65928128485d59948efe9574ead3a784a165630666996b8af80f7ece039e4a7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:47.724854Z","signature_b64":"BhhiQ0j/BQ8rB22V88XRFXtkqPTCN6mP320/H632nDe67Te+sCswPvNYd02fP6hhj56llWP9TWHm2LYSBJ+gDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57ec9b0c418cb116819ab9f41f5f2c53de770b73c0496e4a46c37c4f82bd30e6","last_reissued_at":"2026-05-18T00:50:47.724219Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:47.724219Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A feasible interpolation for random resolution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.LO","authors_text":"Jan Krajicek","submitted_at":"2016-04-22T07:47:45Z","abstract_excerpt":"Random resolution, defined by Buss, Kolodziejczyk and Thapen (JSL, 2014), is a sound propositional proof system that extends the resolution proof system by the possibility to augment any set of initial clauses by a set of randomly chosen clauses (modulo a technical condition). We show how to apply the general feasible interpolation theorem for semantic derivations of Krajicek (JSL, 1997) to random resolution. As a consequence we get a lower bound for random resolution refutations of the clique-coloring formulas."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.06560","kind":"arxiv","version":5},"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":"1604.06560","created_at":"2026-05-18T00:50:47.724338+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.06560v5","created_at":"2026-05-18T00:50:47.724338+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06560","created_at":"2026-05-18T00:50:47.724338+00:00"},{"alias_kind":"pith_short_12","alias_value":"K7WJWDCBRSYR","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"K7WJWDCBRSYRNAM2","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"K7WJWDCB","created_at":"2026-05-18T12:30:25.849896+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/K7WJWDCBRSYRNAM2XH2B6XZMKP","json":"https://pith.science/pith/K7WJWDCBRSYRNAM2XH2B6XZMKP.json","graph_json":"https://pith.science/api/pith-number/K7WJWDCBRSYRNAM2XH2B6XZMKP/graph.json","events_json":"https://pith.science/api/pith-number/K7WJWDCBRSYRNAM2XH2B6XZMKP/events.json","paper":"https://pith.science/paper/K7WJWDCB"},"agent_actions":{"view_html":"https://pith.science/pith/K7WJWDCBRSYRNAM2XH2B6XZMKP","download_json":"https://pith.science/pith/K7WJWDCBRSYRNAM2XH2B6XZMKP.json","view_paper":"https://pith.science/paper/K7WJWDCB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.06560&json=true","fetch_graph":"https://pith.science/api/pith-number/K7WJWDCBRSYRNAM2XH2B6XZMKP/graph.json","fetch_events":"https://pith.science/api/pith-number/K7WJWDCBRSYRNAM2XH2B6XZMKP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K7WJWDCBRSYRNAM2XH2B6XZMKP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K7WJWDCBRSYRNAM2XH2B6XZMKP/action/storage_attestation","attest_author":"https://pith.science/pith/K7WJWDCBRSYRNAM2XH2B6XZMKP/action/author_attestation","sign_citation":"https://pith.science/pith/K7WJWDCBRSYRNAM2XH2B6XZMKP/action/citation_signature","submit_replication":"https://pith.science/pith/K7WJWDCBRSYRNAM2XH2B6XZMKP/action/replication_record"}},"created_at":"2026-05-18T00:50:47.724338+00:00","updated_at":"2026-05-18T00:50:47.724338+00:00"}