{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:MAXVONW5OBV35BYUG5MVZOHWRN","short_pith_number":"pith:MAXVONW5","schema_version":"1.0","canonical_sha256":"602f5736dd706bbe871437595cb8f68b76a2975e49456ef882b414ed1e83b071","source":{"kind":"arxiv","id":"1305.4519","version":5},"attestation_state":"computed","paper":{"title":"Clustered planarity testing revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CG","authors_text":"D\\\"om\\\"ot\\\"or P\\'alv\\\"olgyi, Igor Malinovi\\'c, Jan Kyn\\v{c}l, Radoslav Fulek","submitted_at":"2013-05-20T13:08:46Z","abstract_excerpt":"The Hanani--Tutte theorem is a classical result proved for the first time in the 1930s that characterizes planar graphs as graphs that admit a drawing in the plane in which every pair of edges not sharing a vertex cross an even number of times. We generalize this result to clustered graphs with two disjoint clusters, and show that a straightforward extension to flat clustered graphs with three or more disjoint clusters is not possible. For general clustered graphs we show a variant of the Hanani--Tutte theorem in the case when each cluster induces a connected subgraph. Di Battista and Frati pr"},"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":"1305.4519","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-05-20T13:08:46Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"3dbf68484c93add425aa0fc2b69158aeefdc8eda3209b433773649f0b6583369","abstract_canon_sha256":"7324b7a0413b159c998def27d202dd269f9c616a8a8cd2370b083e3359a599c8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:39.863123Z","signature_b64":"DB61y/fM8ZLOPgp5EG1M0LDSlVBb3eErT0bSkIEAx4JOHyJD1wO3gRIywluxgnJtqJWrvSmk1CExhGJSvJIhBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"602f5736dd706bbe871437595cb8f68b76a2975e49456ef882b414ed1e83b071","last_reissued_at":"2026-05-18T01:26:39.862158Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:39.862158Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Clustered planarity testing revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CG","authors_text":"D\\\"om\\\"ot\\\"or P\\'alv\\\"olgyi, Igor Malinovi\\'c, Jan Kyn\\v{c}l, Radoslav Fulek","submitted_at":"2013-05-20T13:08:46Z","abstract_excerpt":"The Hanani--Tutte theorem is a classical result proved for the first time in the 1930s that characterizes planar graphs as graphs that admit a drawing in the plane in which every pair of edges not sharing a vertex cross an even number of times. We generalize this result to clustered graphs with two disjoint clusters, and show that a straightforward extension to flat clustered graphs with three or more disjoint clusters is not possible. For general clustered graphs we show a variant of the Hanani--Tutte theorem in the case when each cluster induces a connected subgraph. Di Battista and Frati pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.4519","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":"1305.4519","created_at":"2026-05-18T01:26:39.862260+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.4519v5","created_at":"2026-05-18T01:26:39.862260+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.4519","created_at":"2026-05-18T01:26:39.862260+00:00"},{"alias_kind":"pith_short_12","alias_value":"MAXVONW5OBV3","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"MAXVONW5OBV35BYU","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"MAXVONW5","created_at":"2026-05-18T12:27:51.066281+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/MAXVONW5OBV35BYUG5MVZOHWRN","json":"https://pith.science/pith/MAXVONW5OBV35BYUG5MVZOHWRN.json","graph_json":"https://pith.science/api/pith-number/MAXVONW5OBV35BYUG5MVZOHWRN/graph.json","events_json":"https://pith.science/api/pith-number/MAXVONW5OBV35BYUG5MVZOHWRN/events.json","paper":"https://pith.science/paper/MAXVONW5"},"agent_actions":{"view_html":"https://pith.science/pith/MAXVONW5OBV35BYUG5MVZOHWRN","download_json":"https://pith.science/pith/MAXVONW5OBV35BYUG5MVZOHWRN.json","view_paper":"https://pith.science/paper/MAXVONW5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.4519&json=true","fetch_graph":"https://pith.science/api/pith-number/MAXVONW5OBV35BYUG5MVZOHWRN/graph.json","fetch_events":"https://pith.science/api/pith-number/MAXVONW5OBV35BYUG5MVZOHWRN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MAXVONW5OBV35BYUG5MVZOHWRN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MAXVONW5OBV35BYUG5MVZOHWRN/action/storage_attestation","attest_author":"https://pith.science/pith/MAXVONW5OBV35BYUG5MVZOHWRN/action/author_attestation","sign_citation":"https://pith.science/pith/MAXVONW5OBV35BYUG5MVZOHWRN/action/citation_signature","submit_replication":"https://pith.science/pith/MAXVONW5OBV35BYUG5MVZOHWRN/action/replication_record"}},"created_at":"2026-05-18T01:26:39.862260+00:00","updated_at":"2026-05-18T01:26:39.862260+00:00"}