{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:XTEWS55K5QYYVTVLE53TUUG5N6","short_pith_number":"pith:XTEWS55K","schema_version":"1.0","canonical_sha256":"bcc96977aaec318aceab27773a50dd6f807be5c6b01021d3ed1f363155dc24d3","source":{"kind":"arxiv","id":"1407.2109","version":4},"attestation_state":"computed","paper":{"title":"Planar Graphs: Random Walks and Bipartiteness Testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Artur Czumaj, Christian Sohler, Krzysztof Onak, Morteza Monemizadeh","submitted_at":"2014-07-08T14:33:52Z","abstract_excerpt":"We initiate the study of property testing in arbitrary planar graphs. We prove that bipartiteness can be tested in constant time, improving on the previous bound of $\\tilde{O}(\\sqrt{n})$ for graphs on $n$ vertices. The constant-time testability was only known for planar graphs with bounded degree.\n  Our algorithm is based on random walks. Since planar graphs have good separators, i.e., bad expansion, our analysis diverges from standard techniques that involve the fast convergence of random walks on expanders. We reduce the problem to the task of detecting an odd-parity cycle in a multigraph in"},"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":"1407.2109","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-08T14:33:52Z","cross_cats_sorted":[],"title_canon_sha256":"0c6a5c0adfc6213d54fb2dca0935f9af5e5f2a026c21f438f63c6ef1d81dc284","abstract_canon_sha256":"abd5dd7339f4e2e94af4371912a2c7703974bd83d4c3107fc85faf54a97cde09"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:33.368077Z","signature_b64":"03NtcsWrIqt1DEE9pnVS2FiOg+/VBd08v9pO+5TZlQm4GxhhyyG741uxX9vdWMVAwlNZXAzr8fj7s+xd8YGGDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bcc96977aaec318aceab27773a50dd6f807be5c6b01021d3ed1f363155dc24d3","last_reissued_at":"2026-05-17T23:57:33.367376Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:33.367376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Planar Graphs: Random Walks and Bipartiteness Testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Artur Czumaj, Christian Sohler, Krzysztof Onak, Morteza Monemizadeh","submitted_at":"2014-07-08T14:33:52Z","abstract_excerpt":"We initiate the study of property testing in arbitrary planar graphs. We prove that bipartiteness can be tested in constant time, improving on the previous bound of $\\tilde{O}(\\sqrt{n})$ for graphs on $n$ vertices. The constant-time testability was only known for planar graphs with bounded degree.\n  Our algorithm is based on random walks. Since planar graphs have good separators, i.e., bad expansion, our analysis diverges from standard techniques that involve the fast convergence of random walks on expanders. We reduce the problem to the task of detecting an odd-parity cycle in a multigraph in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.2109","kind":"arxiv","version":4},"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":"1407.2109","created_at":"2026-05-17T23:57:33.367508+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.2109v4","created_at":"2026-05-17T23:57:33.367508+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.2109","created_at":"2026-05-17T23:57:33.367508+00:00"},{"alias_kind":"pith_short_12","alias_value":"XTEWS55K5QYY","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"XTEWS55K5QYYVTVL","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"XTEWS55K","created_at":"2026-05-18T12:28:57.508820+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/XTEWS55K5QYYVTVLE53TUUG5N6","json":"https://pith.science/pith/XTEWS55K5QYYVTVLE53TUUG5N6.json","graph_json":"https://pith.science/api/pith-number/XTEWS55K5QYYVTVLE53TUUG5N6/graph.json","events_json":"https://pith.science/api/pith-number/XTEWS55K5QYYVTVLE53TUUG5N6/events.json","paper":"https://pith.science/paper/XTEWS55K"},"agent_actions":{"view_html":"https://pith.science/pith/XTEWS55K5QYYVTVLE53TUUG5N6","download_json":"https://pith.science/pith/XTEWS55K5QYYVTVLE53TUUG5N6.json","view_paper":"https://pith.science/paper/XTEWS55K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.2109&json=true","fetch_graph":"https://pith.science/api/pith-number/XTEWS55K5QYYVTVLE53TUUG5N6/graph.json","fetch_events":"https://pith.science/api/pith-number/XTEWS55K5QYYVTVLE53TUUG5N6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XTEWS55K5QYYVTVLE53TUUG5N6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XTEWS55K5QYYVTVLE53TUUG5N6/action/storage_attestation","attest_author":"https://pith.science/pith/XTEWS55K5QYYVTVLE53TUUG5N6/action/author_attestation","sign_citation":"https://pith.science/pith/XTEWS55K5QYYVTVLE53TUUG5N6/action/citation_signature","submit_replication":"https://pith.science/pith/XTEWS55K5QYYVTVLE53TUUG5N6/action/replication_record"}},"created_at":"2026-05-17T23:57:33.367508+00:00","updated_at":"2026-05-17T23:57:33.367508+00:00"}