{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:YKEQVWW2UM6TDYHUGR6AWWYVGR","short_pith_number":"pith:YKEQVWW2","schema_version":"1.0","canonical_sha256":"c2890adadaa33d31e0f4347c0b5b15345c68b23e57b06f77b1167ae96c6a56ec","source":{"kind":"arxiv","id":"1009.4517","version":2},"attestation_state":"computed","paper":{"title":"Testing Simultaneous Planarity when the Common Graph is 2-Connected","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anna Lubiw, Bernhard Haeupler, Krishnam Raju Jampani","submitted_at":"2010-09-23T04:24:51Z","abstract_excerpt":"Two planar graphs G1 and G2 sharing some vertices and edges are `simultaneously planar' if they have planar drawings such that a shared vertex [edge] is represented by the same point [curve] in both drawings. It is an open problem whether simultaneous planarity can be tested efficiently. We give a linear-time algorithm to test simultaneous planarity when the two graphs share a 2-connected subgraph. Our algorithm extends to the case of k planar graphs where each vertex [edge] is either common to all graphs or belongs to exactly one of them."},"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":"1009.4517","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-09-23T04:24:51Z","cross_cats_sorted":[],"title_canon_sha256":"72403406a3bf3255533691ee60038fc6870405dcb9a8de75712ebcc4f1ef9ee4","abstract_canon_sha256":"32f31eff1cdb913db63e4ec32d7f1afbe91305bef28f52af9137496b386a8461"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:06:45.130868Z","signature_b64":"xtT6082CV8O6dEhvwsJGVzfeoRiwltLzCCFbIPIcAZ9/ORYeWt9JeJKWKkdrsfo93m4aqVW29fgLn6m28tkOAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2890adadaa33d31e0f4347c0b5b15345c68b23e57b06f77b1167ae96c6a56ec","last_reissued_at":"2026-05-18T04:06:45.130201Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:06:45.130201Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Testing Simultaneous Planarity when the Common Graph is 2-Connected","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anna Lubiw, Bernhard Haeupler, Krishnam Raju Jampani","submitted_at":"2010-09-23T04:24:51Z","abstract_excerpt":"Two planar graphs G1 and G2 sharing some vertices and edges are `simultaneously planar' if they have planar drawings such that a shared vertex [edge] is represented by the same point [curve] in both drawings. It is an open problem whether simultaneous planarity can be tested efficiently. We give a linear-time algorithm to test simultaneous planarity when the two graphs share a 2-connected subgraph. Our algorithm extends to the case of k planar graphs where each vertex [edge] is either common to all graphs or belongs to exactly one of them."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.4517","kind":"arxiv","version":2},"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":"1009.4517","created_at":"2026-05-18T04:06:45.130303+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.4517v2","created_at":"2026-05-18T04:06:45.130303+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.4517","created_at":"2026-05-18T04:06:45.130303+00:00"},{"alias_kind":"pith_short_12","alias_value":"YKEQVWW2UM6T","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_16","alias_value":"YKEQVWW2UM6TDYHU","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_8","alias_value":"YKEQVWW2","created_at":"2026-05-18T12:26:17.028572+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/YKEQVWW2UM6TDYHUGR6AWWYVGR","json":"https://pith.science/pith/YKEQVWW2UM6TDYHUGR6AWWYVGR.json","graph_json":"https://pith.science/api/pith-number/YKEQVWW2UM6TDYHUGR6AWWYVGR/graph.json","events_json":"https://pith.science/api/pith-number/YKEQVWW2UM6TDYHUGR6AWWYVGR/events.json","paper":"https://pith.science/paper/YKEQVWW2"},"agent_actions":{"view_html":"https://pith.science/pith/YKEQVWW2UM6TDYHUGR6AWWYVGR","download_json":"https://pith.science/pith/YKEQVWW2UM6TDYHUGR6AWWYVGR.json","view_paper":"https://pith.science/paper/YKEQVWW2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.4517&json=true","fetch_graph":"https://pith.science/api/pith-number/YKEQVWW2UM6TDYHUGR6AWWYVGR/graph.json","fetch_events":"https://pith.science/api/pith-number/YKEQVWW2UM6TDYHUGR6AWWYVGR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YKEQVWW2UM6TDYHUGR6AWWYVGR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YKEQVWW2UM6TDYHUGR6AWWYVGR/action/storage_attestation","attest_author":"https://pith.science/pith/YKEQVWW2UM6TDYHUGR6AWWYVGR/action/author_attestation","sign_citation":"https://pith.science/pith/YKEQVWW2UM6TDYHUGR6AWWYVGR/action/citation_signature","submit_replication":"https://pith.science/pith/YKEQVWW2UM6TDYHUGR6AWWYVGR/action/replication_record"}},"created_at":"2026-05-18T04:06:45.130303+00:00","updated_at":"2026-05-18T04:06:45.130303+00:00"}