{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:WEIYBABMQU7HNI2DAS5MRWR6G6","short_pith_number":"pith:WEIYBABM","schema_version":"1.0","canonical_sha256":"b11180802c853e76a34304bac8da3e37b7842438eadbcafb97af8d30f5e412dc","source":{"kind":"arxiv","id":"2606.13367","version":1},"attestation_state":"computed","paper":{"title":"Extended Frege proofs, circuits and rewriting","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.LO","authors_text":"Jan Krajicek","submitted_at":"2026-06-11T13:53:03Z","abstract_excerpt":"Inspired by a statement about Extended Frege proof systems by Jain and Jin (FOCS 2022) we prove that:\n  - there is a p-time binary relation $\\approx$ between circuits that implies their logical equivalence,\n  - the relation $\\approx$ implies that each of the two circuits can be rewritten into the other one by possibly deleting some gates and adding at most seven new gates,\n  - if the equivalence $C \\equiv D$ has a size $s$ proof in an Extended Frege or a Circuit Frege proof system then there is a chain of circuits $E_i$ $$ C = E_0 \\approx \\dots \\approx E_t = D $$ with $t \\le s^{O(1)}$."},"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":"2606.13367","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.LO","submitted_at":"2026-06-11T13:53:03Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"b675dd4950053d2e684fadc3b0ef73699f468e0a2e7500b5129b3e4b0cb827ad","abstract_canon_sha256":"c0ee5f80f735f3d5c20ab47f603f2f351617601b5c2afc263722e5101d694b04"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-12T01:09:57.830362Z","signature_b64":"LQ9Y0kAW2kPnViOoZdLpgIhpdCu6ImAtCfZ45ZRxY+Ya1HB8tdddcJmSovitWPJuT/vgyByiPY4YwEgRSSSaDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b11180802c853e76a34304bac8da3e37b7842438eadbcafb97af8d30f5e412dc","last_reissued_at":"2026-06-12T01:09:57.829548Z","signature_status":"signed_v1","first_computed_at":"2026-06-12T01:09:57.829548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Extended Frege proofs, circuits and rewriting","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.LO","authors_text":"Jan Krajicek","submitted_at":"2026-06-11T13:53:03Z","abstract_excerpt":"Inspired by a statement about Extended Frege proof systems by Jain and Jin (FOCS 2022) we prove that:\n  - there is a p-time binary relation $\\approx$ between circuits that implies their logical equivalence,\n  - the relation $\\approx$ implies that each of the two circuits can be rewritten into the other one by possibly deleting some gates and adding at most seven new gates,\n  - if the equivalence $C \\equiv D$ has a size $s$ proof in an Extended Frege or a Circuit Frege proof system then there is a chain of circuits $E_i$ $$ C = E_0 \\approx \\dots \\approx E_t = D $$ with $t \\le s^{O(1)}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.13367","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.13367/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2606.13367","created_at":"2026-06-12T01:09:57.829690+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.13367v1","created_at":"2026-06-12T01:09:57.829690+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.13367","created_at":"2026-06-12T01:09:57.829690+00:00"},{"alias_kind":"pith_short_12","alias_value":"WEIYBABMQU7H","created_at":"2026-06-12T01:09:57.829690+00:00"},{"alias_kind":"pith_short_16","alias_value":"WEIYBABMQU7HNI2D","created_at":"2026-06-12T01:09:57.829690+00:00"},{"alias_kind":"pith_short_8","alias_value":"WEIYBABM","created_at":"2026-06-12T01:09:57.829690+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/WEIYBABMQU7HNI2DAS5MRWR6G6","json":"https://pith.science/pith/WEIYBABMQU7HNI2DAS5MRWR6G6.json","graph_json":"https://pith.science/api/pith-number/WEIYBABMQU7HNI2DAS5MRWR6G6/graph.json","events_json":"https://pith.science/api/pith-number/WEIYBABMQU7HNI2DAS5MRWR6G6/events.json","paper":"https://pith.science/paper/WEIYBABM"},"agent_actions":{"view_html":"https://pith.science/pith/WEIYBABMQU7HNI2DAS5MRWR6G6","download_json":"https://pith.science/pith/WEIYBABMQU7HNI2DAS5MRWR6G6.json","view_paper":"https://pith.science/paper/WEIYBABM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.13367&json=true","fetch_graph":"https://pith.science/api/pith-number/WEIYBABMQU7HNI2DAS5MRWR6G6/graph.json","fetch_events":"https://pith.science/api/pith-number/WEIYBABMQU7HNI2DAS5MRWR6G6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WEIYBABMQU7HNI2DAS5MRWR6G6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WEIYBABMQU7HNI2DAS5MRWR6G6/action/storage_attestation","attest_author":"https://pith.science/pith/WEIYBABMQU7HNI2DAS5MRWR6G6/action/author_attestation","sign_citation":"https://pith.science/pith/WEIYBABMQU7HNI2DAS5MRWR6G6/action/citation_signature","submit_replication":"https://pith.science/pith/WEIYBABMQU7HNI2DAS5MRWR6G6/action/replication_record"}},"created_at":"2026-06-12T01:09:57.829690+00:00","updated_at":"2026-06-12T01:09:57.829690+00:00"}