{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:3IVF6KLLSVEQU74UB3NNYA6DH3","short_pith_number":"pith:3IVF6KLL","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"},"canonical_sha256":"da2a5f296b95490a7f940edadc03c33edb9482bb1f7b23b53f6b20e105a34674","source":{"kind":"arxiv","id":"1506.05715","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.05715","created_at":"2026-05-18T01:44:09Z"},{"alias_kind":"arxiv_version","alias_value":"1506.05715v1","created_at":"2026-05-18T01:44:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.05715","created_at":"2026-05-18T01:44:09Z"},{"alias_kind":"pith_short_12","alias_value":"3IVF6KLLSVEQ","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3IVF6KLLSVEQU74U","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3IVF6KLL","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:3IVF6KLLSVEQU74UB3NNYA6DH3","target":"record","payload":{"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"},"canonical_sha256":"da2a5f296b95490a7f940edadc03c33edb9482bb1f7b23b53f6b20e105a34674","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"},"source_kind":"arxiv","source_id":"1506.05715","source_version":1,"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:44:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tIhN5L23nYGQTyOp4z/UoTT35Rl5/v1ges+0TLtN0v5Jf9tR1b5/Jn0MflOiDbGZmCPt31EvyTqzgjCygOR1Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:58:07.959126Z"},"content_sha256":"e8fe23b32b650e93d13f13c85b0d0fbbdde12623a57c1098de5e4e69d6c9d27a","schema_version":"1.0","event_id":"sha256:e8fe23b32b650e93d13f13c85b0d0fbbdde12623a57c1098de5e4e69d6c9d27a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:3IVF6KLLSVEQU74UB3NNYA6DH3","target":"graph","payload":{"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"},"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:44:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"45VeN34ZMsoEXAKle0BrwjreNHF2uJdLf3cXwXkPBWgxdTz46LaM29ccgcU2EBO7spzCT8NvI8oXQdl9XUlACQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:58:07.959478Z"},"content_sha256":"a238570a408166fcbd71ef83442ad5f6310b0addb254b47cbcca8f7989f27e22","schema_version":"1.0","event_id":"sha256:a238570a408166fcbd71ef83442ad5f6310b0addb254b47cbcca8f7989f27e22"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3IVF6KLLSVEQU74UB3NNYA6DH3/bundle.json","state_url":"https://pith.science/pith/3IVF6KLLSVEQU74UB3NNYA6DH3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3IVF6KLLSVEQU74UB3NNYA6DH3/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-06-05T14:58:07Z","links":{"resolver":"https://pith.science/pith/3IVF6KLLSVEQU74UB3NNYA6DH3","bundle":"https://pith.science/pith/3IVF6KLLSVEQU74UB3NNYA6DH3/bundle.json","state":"https://pith.science/pith/3IVF6KLLSVEQU74UB3NNYA6DH3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3IVF6KLLSVEQU74UB3NNYA6DH3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:3IVF6KLLSVEQU74UB3NNYA6DH3","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":"498376acf0abb91fc47366f62df5c0fa7c3d199691d008d72c44e5cc6f18b0aa","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-18T15:20:22Z","title_canon_sha256":"0565bc7d22ee74320c9550ccf107a405c9cc8ff2c3b2656079241c6d688e6161"},"schema_version":"1.0","source":{"id":"1506.05715","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.05715","created_at":"2026-05-18T01:44:09Z"},{"alias_kind":"arxiv_version","alias_value":"1506.05715v1","created_at":"2026-05-18T01:44:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.05715","created_at":"2026-05-18T01:44:09Z"},{"alias_kind":"pith_short_12","alias_value":"3IVF6KLLSVEQ","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3IVF6KLLSVEQU74U","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3IVF6KLL","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:a238570a408166fcbd71ef83442ad5f6310b0addb254b47cbcca8f7989f27e22","target":"graph","created_at":"2026-05-18T01:44:09Z","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":"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","authors_text":"Annette Karrer, Ignaz Rutter, Thomas Bl\\\"asius","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-18T15:20:22Z","title":"Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.05715","kind":"arxiv","version":1},"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:e8fe23b32b650e93d13f13c85b0d0fbbdde12623a57c1098de5e4e69d6c9d27a","target":"record","created_at":"2026-05-18T01:44:09Z","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":"498376acf0abb91fc47366f62df5c0fa7c3d199691d008d72c44e5cc6f18b0aa","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-18T15:20:22Z","title_canon_sha256":"0565bc7d22ee74320c9550ccf107a405c9cc8ff2c3b2656079241c6d688e6161"},"schema_version":"1.0","source":{"id":"1506.05715","kind":"arxiv","version":1}},"canonical_sha256":"da2a5f296b95490a7f940edadc03c33edb9482bb1f7b23b53f6b20e105a34674","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da2a5f296b95490a7f940edadc03c33edb9482bb1f7b23b53f6b20e105a34674","first_computed_at":"2026-05-18T01:44:09.886099Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:44:09.886099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vg/C29xuC4sCcxJ6kGZqxeKtopOqj2e5QewWF3J8Cw087/4/q7vpPVJaeZIWvAmDGZNKMWnepS7WSkDM0gUGDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:44:09.886764Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.05715","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e8fe23b32b650e93d13f13c85b0d0fbbdde12623a57c1098de5e4e69d6c9d27a","sha256:a238570a408166fcbd71ef83442ad5f6310b0addb254b47cbcca8f7989f27e22"],"state_sha256":"af3eeb5775f744e0532c8eaea0c898d6fda0650363e8a7f8d89cccebaaf2763f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GOj3oRQbNodYGTsciS7pKUjw4/gK0lOamnhZBAgqTCyBx5uRAcml9DGbCRuRCdViybzEy6arge3v5ygjDGHDDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T14:58:07.961779Z","bundle_sha256":"9a9e2748ca9abf1e94e8f6b5a0ad44b8346b90ac724b6777940a0ce6df774634"}}