{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:3IVF6KLLSVEQU74UB3NNYA6DH3","short_pith_number":"pith:3IVF6KLL","schema_version":"1.0","canonical_sha256":"da2a5f296b95490a7f940edadc03c33edb9482bb1f7b23b53f6b20e105a34674","source":{"kind":"arxiv","id":"1506.05715","version":1},"attestation_state":"computed","paper":{"title":"Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Annette Karrer, Ignaz Rutter, Thomas Bl\\\"asius","submitted_at":"2015-06-18T15:20:22Z","abstract_excerpt":"A simultaneous embedding (with fixed edges) of two graphs $G^1$ and $G^2$ with common graph $G=G^1 \\cap G^2$ is a pair of planar drawings of $G^1$ and $G^2$ that coincide on $G$. It is an open question whether there is a polynomial-time algorithm that decides whether two graphs admit a simultaneous embedding (problem SEFE).\n  In this paper, we present two results. First, a set of three linear-time preprocessing algorithms that remove certain substructures from a given SEFE instance, producing a set of equivalent SEFE instances without such substructures. The structures we can remove are (1) cu"},"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":"1506.05715","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-18T15:20:22Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"0565bc7d22ee74320c9550ccf107a405c9cc8ff2c3b2656079241c6d688e6161","abstract_canon_sha256":"498376acf0abb91fc47366f62df5c0fa7c3d199691d008d72c44e5cc6f18b0aa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:44:09.886764Z","signature_b64":"vg/C29xuC4sCcxJ6kGZqxeKtopOqj2e5QewWF3J8Cw087/4/q7vpPVJaeZIWvAmDGZNKMWnepS7WSkDM0gUGDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da2a5f296b95490a7f940edadc03c33edb9482bb1f7b23b53f6b20e105a34674","last_reissued_at":"2026-05-18T01:44:09.886099Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:44:09.886099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Annette Karrer, Ignaz Rutter, Thomas Bl\\\"asius","submitted_at":"2015-06-18T15:20:22Z","abstract_excerpt":"A simultaneous embedding (with fixed edges) of two graphs $G^1$ and $G^2$ with common graph $G=G^1 \\cap G^2$ is a pair of planar drawings of $G^1$ and $G^2$ that coincide on $G$. It is an open question whether there is a polynomial-time algorithm that decides whether two graphs admit a simultaneous embedding (problem SEFE).\n  In this paper, we present two results. First, a set of three linear-time preprocessing algorithms that remove certain substructures from a given SEFE instance, producing a set of equivalent SEFE instances without such substructures. The structures we can remove are (1) cu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.05715","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":"1506.05715","created_at":"2026-05-18T01:44:09.886216+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.05715v1","created_at":"2026-05-18T01:44:09.886216+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.05715","created_at":"2026-05-18T01:44:09.886216+00:00"},{"alias_kind":"pith_short_12","alias_value":"3IVF6KLLSVEQ","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"3IVF6KLLSVEQU74U","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"3IVF6KLL","created_at":"2026-05-18T12:29:02.477457+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/3IVF6KLLSVEQU74UB3NNYA6DH3","json":"https://pith.science/pith/3IVF6KLLSVEQU74UB3NNYA6DH3.json","graph_json":"https://pith.science/api/pith-number/3IVF6KLLSVEQU74UB3NNYA6DH3/graph.json","events_json":"https://pith.science/api/pith-number/3IVF6KLLSVEQU74UB3NNYA6DH3/events.json","paper":"https://pith.science/paper/3IVF6KLL"},"agent_actions":{"view_html":"https://pith.science/pith/3IVF6KLLSVEQU74UB3NNYA6DH3","download_json":"https://pith.science/pith/3IVF6KLLSVEQU74UB3NNYA6DH3.json","view_paper":"https://pith.science/paper/3IVF6KLL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.05715&json=true","fetch_graph":"https://pith.science/api/pith-number/3IVF6KLLSVEQU74UB3NNYA6DH3/graph.json","fetch_events":"https://pith.science/api/pith-number/3IVF6KLLSVEQU74UB3NNYA6DH3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3IVF6KLLSVEQU74UB3NNYA6DH3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3IVF6KLLSVEQU74UB3NNYA6DH3/action/storage_attestation","attest_author":"https://pith.science/pith/3IVF6KLLSVEQU74UB3NNYA6DH3/action/author_attestation","sign_citation":"https://pith.science/pith/3IVF6KLLSVEQU74UB3NNYA6DH3/action/citation_signature","submit_replication":"https://pith.science/pith/3IVF6KLLSVEQU74UB3NNYA6DH3/action/replication_record"}},"created_at":"2026-05-18T01:44:09.886216+00:00","updated_at":"2026-05-18T01:44:09.886216+00:00"}