{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:M2MCLUQNJOPLGCW2OMLRBS462D","short_pith_number":"pith:M2MCLUQN","schema_version":"1.0","canonical_sha256":"669825d20d4b9eb30ada731710cb9ed0efa01349295827982edfd432abab26bf","source":{"kind":"arxiv","id":"1801.00906","version":1},"attestation_state":"computed","paper":{"title":"Circuit Complexity of Bounded Planar Cutwidth Graph Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Aayush Ojha, Raghunath Tewari","submitted_at":"2018-01-03T05:53:35Z","abstract_excerpt":"Recently, perfect matching in bounded planar cutwidth bipartite graphs (\\BGGM) was shown to be in ACC$^0$ by Hansen et al.. They also conjectured that the problem is in AC$^0$.\n  In this paper, we disprove their conjecture by showing that the problem is not in AC$^0[p^{\\alpha}]$ for every prime $p$. Our results show that the previous upper bound is almost tight. Our techniques involve giving a reduction from Parity to BGGM. A further improvement in lower bounds is difficult since we do not have an algebraic characterization for AC$^0[m]$ where $m$ is not a prime power. Moreover, this will also"},"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":"1801.00906","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-01-03T05:53:35Z","cross_cats_sorted":[],"title_canon_sha256":"28c0bd4a43faaef57e56dab07c97748c5a5d2988a15112e511dfd0df9be9ae4c","abstract_canon_sha256":"fa6a38f259219d04b78fcd2fdc7ffb9298af6ff9c63ef6a7390a33016ca4031b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:48.435562Z","signature_b64":"7hd7DQdhdJ4/xOBkncpNfJAJArATawW4olOHZcsg57MqeRkmPeMz37WBJziiSxulfkyqJi4QNluDUnJIE6gQAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"669825d20d4b9eb30ada731710cb9ed0efa01349295827982edfd432abab26bf","last_reissued_at":"2026-05-18T00:26:48.434973Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:48.434973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Circuit Complexity of Bounded Planar Cutwidth Graph Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Aayush Ojha, Raghunath Tewari","submitted_at":"2018-01-03T05:53:35Z","abstract_excerpt":"Recently, perfect matching in bounded planar cutwidth bipartite graphs (\\BGGM) was shown to be in ACC$^0$ by Hansen et al.. They also conjectured that the problem is in AC$^0$.\n  In this paper, we disprove their conjecture by showing that the problem is not in AC$^0[p^{\\alpha}]$ for every prime $p$. Our results show that the previous upper bound is almost tight. Our techniques involve giving a reduction from Parity to BGGM. A further improvement in lower bounds is difficult since we do not have an algebraic characterization for AC$^0[m]$ where $m$ is not a prime power. Moreover, this will also"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.00906","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1801.00906","created_at":"2026-05-18T00:26:48.435067+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.00906v1","created_at":"2026-05-18T00:26:48.435067+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.00906","created_at":"2026-05-18T00:26:48.435067+00:00"},{"alias_kind":"pith_short_12","alias_value":"M2MCLUQNJOPL","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"M2MCLUQNJOPLGCW2","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"M2MCLUQN","created_at":"2026-05-18T12:32:37.024351+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/M2MCLUQNJOPLGCW2OMLRBS462D","json":"https://pith.science/pith/M2MCLUQNJOPLGCW2OMLRBS462D.json","graph_json":"https://pith.science/api/pith-number/M2MCLUQNJOPLGCW2OMLRBS462D/graph.json","events_json":"https://pith.science/api/pith-number/M2MCLUQNJOPLGCW2OMLRBS462D/events.json","paper":"https://pith.science/paper/M2MCLUQN"},"agent_actions":{"view_html":"https://pith.science/pith/M2MCLUQNJOPLGCW2OMLRBS462D","download_json":"https://pith.science/pith/M2MCLUQNJOPLGCW2OMLRBS462D.json","view_paper":"https://pith.science/paper/M2MCLUQN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.00906&json=true","fetch_graph":"https://pith.science/api/pith-number/M2MCLUQNJOPLGCW2OMLRBS462D/graph.json","fetch_events":"https://pith.science/api/pith-number/M2MCLUQNJOPLGCW2OMLRBS462D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M2MCLUQNJOPLGCW2OMLRBS462D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M2MCLUQNJOPLGCW2OMLRBS462D/action/storage_attestation","attest_author":"https://pith.science/pith/M2MCLUQNJOPLGCW2OMLRBS462D/action/author_attestation","sign_citation":"https://pith.science/pith/M2MCLUQNJOPLGCW2OMLRBS462D/action/citation_signature","submit_replication":"https://pith.science/pith/M2MCLUQNJOPLGCW2OMLRBS462D/action/replication_record"}},"created_at":"2026-05-18T00:26:48.435067+00:00","updated_at":"2026-05-18T00:26:48.435067+00:00"}