{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MAXVONW5OBV35BYUG5MVZOHWRN","short_pith_number":"pith:MAXVONW5","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"},"canonical_sha256":"602f5736dd706bbe871437595cb8f68b76a2975e49456ef882b414ed1e83b071","source":{"kind":"arxiv","id":"1305.4519","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.4519","created_at":"2026-05-18T01:26:39Z"},{"alias_kind":"arxiv_version","alias_value":"1305.4519v5","created_at":"2026-05-18T01:26:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.4519","created_at":"2026-05-18T01:26:39Z"},{"alias_kind":"pith_short_12","alias_value":"MAXVONW5OBV3","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"MAXVONW5OBV35BYU","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"MAXVONW5","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MAXVONW5OBV35BYUG5MVZOHWRN","target":"record","payload":{"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"},"canonical_sha256":"602f5736dd706bbe871437595cb8f68b76a2975e49456ef882b414ed1e83b071","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"},"source_kind":"arxiv","source_id":"1305.4519","source_version":5,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:26:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lcb4Or++Atr+cyBIoYuGmrGdk/WnckF5aV2JFvcDuXvsxx0jmV6BmI5vmcRR7kyxGnv96xd1JyG7G/NKrFf8Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:20:18.638624Z"},"content_sha256":"f95ae1aa8bd42f30980d4ee7f128cacadcf0b679a661004c142d3532157b51d8","schema_version":"1.0","event_id":"sha256:f95ae1aa8bd42f30980d4ee7f128cacadcf0b679a661004c142d3532157b51d8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MAXVONW5OBV35BYUG5MVZOHWRN","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:26:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PZ9ZbokyTskvpZ86dRm/BmR891g94YXKCY//o44xdIucGMdWhobMZDPW+aebngztUcs0co24p14Pvwa3wtSeAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:20:18.638981Z"},"content_sha256":"5a18c23f505eca683437c976cf153d9a8832c564ffb0577bc80b0aa14da60185","schema_version":"1.0","event_id":"sha256:5a18c23f505eca683437c976cf153d9a8832c564ffb0577bc80b0aa14da60185"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MAXVONW5OBV35BYUG5MVZOHWRN/bundle.json","state_url":"https://pith.science/pith/MAXVONW5OBV35BYUG5MVZOHWRN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MAXVONW5OBV35BYUG5MVZOHWRN/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T01:20:18Z","links":{"resolver":"https://pith.science/pith/MAXVONW5OBV35BYUG5MVZOHWRN","bundle":"https://pith.science/pith/MAXVONW5OBV35BYUG5MVZOHWRN/bundle.json","state":"https://pith.science/pith/MAXVONW5OBV35BYUG5MVZOHWRN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MAXVONW5OBV35BYUG5MVZOHWRN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MAXVONW5OBV35BYUG5MVZOHWRN","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"7324b7a0413b159c998def27d202dd269f9c616a8a8cd2370b083e3359a599c8","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-05-20T13:08:46Z","title_canon_sha256":"3dbf68484c93add425aa0fc2b69158aeefdc8eda3209b433773649f0b6583369"},"schema_version":"1.0","source":{"id":"1305.4519","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.4519","created_at":"2026-05-18T01:26:39Z"},{"alias_kind":"arxiv_version","alias_value":"1305.4519v5","created_at":"2026-05-18T01:26:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.4519","created_at":"2026-05-18T01:26:39Z"},{"alias_kind":"pith_short_12","alias_value":"MAXVONW5OBV3","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"MAXVONW5OBV35BYU","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"MAXVONW5","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:5a18c23f505eca683437c976cf153d9a8832c564ffb0577bc80b0aa14da60185","target":"graph","created_at":"2026-05-18T01:26:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"D\\\"om\\\"ot\\\"or P\\'alv\\\"olgyi, Igor Malinovi\\'c, Jan Kyn\\v{c}l, Radoslav Fulek","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-05-20T13:08:46Z","title":"Clustered planarity testing revisited"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.4519","kind":"arxiv","version":5},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f95ae1aa8bd42f30980d4ee7f128cacadcf0b679a661004c142d3532157b51d8","target":"record","created_at":"2026-05-18T01:26:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"7324b7a0413b159c998def27d202dd269f9c616a8a8cd2370b083e3359a599c8","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-05-20T13:08:46Z","title_canon_sha256":"3dbf68484c93add425aa0fc2b69158aeefdc8eda3209b433773649f0b6583369"},"schema_version":"1.0","source":{"id":"1305.4519","kind":"arxiv","version":5}},"canonical_sha256":"602f5736dd706bbe871437595cb8f68b76a2975e49456ef882b414ed1e83b071","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"602f5736dd706bbe871437595cb8f68b76a2975e49456ef882b414ed1e83b071","first_computed_at":"2026-05-18T01:26:39.862158Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:39.862158Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DB61y/fM8ZLOPgp5EG1M0LDSlVBb3eErT0bSkIEAx4JOHyJD1wO3gRIywluxgnJtqJWrvSmk1CExhGJSvJIhBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:39.863123Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.4519","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f95ae1aa8bd42f30980d4ee7f128cacadcf0b679a661004c142d3532157b51d8","sha256:5a18c23f505eca683437c976cf153d9a8832c564ffb0577bc80b0aa14da60185"],"state_sha256":"42a38e69cb0e1ce336537c418214868adac0b0c97491b44e02230525b39906cd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K+aAgpk/b9dcIzH6OPgLmSw+HOtQt0C4jCULxu/zTyUW313v0wcOTDzTHdRBWXe5nt8ITTeA6K44APhqLsOiBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T01:20:18.641436Z","bundle_sha256":"df3c87916fce1aae80e4df9b9fbd2ffd67ee170e71f54f6fac85baa22a76184c"}}