{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:NWPMXUQG3PG473DG4LX6KALSTZ","short_pith_number":"pith:NWPMXUQG","canonical_record":{"source":{"id":"1508.07921","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-08-31T17:12:21Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"850a4a10d7edcfdb917c123472cb3deaf84f32c7bacc7ba6ae81dca8994a43cc","abstract_canon_sha256":"4f7820133d80fddce52038a4a4e287eca0a561d7bec5a1b664e5a548c4e283ec"},"schema_version":"1.0"},"canonical_sha256":"6d9ecbd206dbcdcfec66e2efe501729e66e81a29fffbf1e6b4b9db693b1ca654","source":{"kind":"arxiv","id":"1508.07921","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.07921","created_at":"2026-05-18T01:34:31Z"},{"alias_kind":"arxiv_version","alias_value":"1508.07921v1","created_at":"2026-05-18T01:34:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.07921","created_at":"2026-05-18T01:34:31Z"},{"alias_kind":"pith_short_12","alias_value":"NWPMXUQG3PG4","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"NWPMXUQG3PG473DG","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"NWPMXUQG","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:NWPMXUQG3PG473DG4LX6KALSTZ","target":"record","payload":{"canonical_record":{"source":{"id":"1508.07921","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-08-31T17:12:21Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"850a4a10d7edcfdb917c123472cb3deaf84f32c7bacc7ba6ae81dca8994a43cc","abstract_canon_sha256":"4f7820133d80fddce52038a4a4e287eca0a561d7bec5a1b664e5a548c4e283ec"},"schema_version":"1.0"},"canonical_sha256":"6d9ecbd206dbcdcfec66e2efe501729e66e81a29fffbf1e6b4b9db693b1ca654","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:31.183877Z","signature_b64":"mqC02JOgtWme5ZyreiLwWBzXNLjbDzZ7pgYYWD16dDXrnQpj5Nsxkpm7rSL04DRjhq0bxqhIzzZqpDEGARi2Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d9ecbd206dbcdcfec66e2efe501729e66e81a29fffbf1e6b4b9db693b1ca654","last_reissued_at":"2026-05-18T01:34:31.183525Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:31.183525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.07921","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:34:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WRtjrcHK31aYcsW26KzoH5AvASeTLPU4xnlrw7f/okYb/VPxc4IXA6Q17JLGZFb0VaAnsWkSok/XDk3K8zZeAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:13:25.336206Z"},"content_sha256":"bfadd3aea6ea9d5d409ff9837e1a0d84e7fe454532f57fc91325ef0a4690b6c7","schema_version":"1.0","event_id":"sha256:bfadd3aea6ea9d5d409ff9837e1a0d84e7fe454532f57fc91325ef0a4690b6c7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:NWPMXUQG3PG473DG4LX6KALSTZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simultaneous Embeddings with Few Bends and Crossings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.CG","authors_text":"Fabrizio Frati, Michael Hoffmann, Vincent Kusters","submitted_at":"2015-08-31T17:12:21Z","abstract_excerpt":"A simultaneous embedding with fixed edges (SEFE) of two planar graphs $R$ and $B$ is a pair of plane drawings of $R$ and $B$ that coincide when restricted to the common vertices and edges of $R$ and $B$. We show that whenever $R$ and $B$ admit a SEFE, they also admit a SEFE in which every edge is a polygonal curve with few bends and every pair of edges has few crossings. Specifically: (1) if $R$ and $B$ are trees then one bend per edge and four crossings per edge pair suffice (and one bend per edge is sometimes necessary), (2) if $R$ is a planar graph and $B$ is a tree then six bends per edge "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.07921","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:34:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4CK9DPcrouPJYVPz3AipGP0bd4jUVLotInsrYdGl8g5jj2mZZ0+j4zG1gKPj9d16PP3yuhpozbagePe+pJJzCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:13:25.336570Z"},"content_sha256":"455c1d3173c01f0408dec485e58700fd95f5046ca6c26a6357efcfac71723e92","schema_version":"1.0","event_id":"sha256:455c1d3173c01f0408dec485e58700fd95f5046ca6c26a6357efcfac71723e92"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NWPMXUQG3PG473DG4LX6KALSTZ/bundle.json","state_url":"https://pith.science/pith/NWPMXUQG3PG473DG4LX6KALSTZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NWPMXUQG3PG473DG4LX6KALSTZ/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-01T21:13:25Z","links":{"resolver":"https://pith.science/pith/NWPMXUQG3PG473DG4LX6KALSTZ","bundle":"https://pith.science/pith/NWPMXUQG3PG473DG4LX6KALSTZ/bundle.json","state":"https://pith.science/pith/NWPMXUQG3PG473DG4LX6KALSTZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NWPMXUQG3PG473DG4LX6KALSTZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:NWPMXUQG3PG473DG4LX6KALSTZ","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":"4f7820133d80fddce52038a4a4e287eca0a561d7bec5a1b664e5a548c4e283ec","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-08-31T17:12:21Z","title_canon_sha256":"850a4a10d7edcfdb917c123472cb3deaf84f32c7bacc7ba6ae81dca8994a43cc"},"schema_version":"1.0","source":{"id":"1508.07921","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.07921","created_at":"2026-05-18T01:34:31Z"},{"alias_kind":"arxiv_version","alias_value":"1508.07921v1","created_at":"2026-05-18T01:34:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.07921","created_at":"2026-05-18T01:34:31Z"},{"alias_kind":"pith_short_12","alias_value":"NWPMXUQG3PG4","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"NWPMXUQG3PG473DG","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"NWPMXUQG","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:455c1d3173c01f0408dec485e58700fd95f5046ca6c26a6357efcfac71723e92","target":"graph","created_at":"2026-05-18T01:34:31Z","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 (SEFE) of two planar graphs $R$ and $B$ is a pair of plane drawings of $R$ and $B$ that coincide when restricted to the common vertices and edges of $R$ and $B$. We show that whenever $R$ and $B$ admit a SEFE, they also admit a SEFE in which every edge is a polygonal curve with few bends and every pair of edges has few crossings. Specifically: (1) if $R$ and $B$ are trees then one bend per edge and four crossings per edge pair suffice (and one bend per edge is sometimes necessary), (2) if $R$ is a planar graph and $B$ is a tree then six bends per edge ","authors_text":"Fabrizio Frati, Michael Hoffmann, Vincent Kusters","cross_cats":["cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-08-31T17:12:21Z","title":"Simultaneous Embeddings with Few Bends and Crossings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.07921","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:bfadd3aea6ea9d5d409ff9837e1a0d84e7fe454532f57fc91325ef0a4690b6c7","target":"record","created_at":"2026-05-18T01:34:31Z","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":"4f7820133d80fddce52038a4a4e287eca0a561d7bec5a1b664e5a548c4e283ec","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-08-31T17:12:21Z","title_canon_sha256":"850a4a10d7edcfdb917c123472cb3deaf84f32c7bacc7ba6ae81dca8994a43cc"},"schema_version":"1.0","source":{"id":"1508.07921","kind":"arxiv","version":1}},"canonical_sha256":"6d9ecbd206dbcdcfec66e2efe501729e66e81a29fffbf1e6b4b9db693b1ca654","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6d9ecbd206dbcdcfec66e2efe501729e66e81a29fffbf1e6b4b9db693b1ca654","first_computed_at":"2026-05-18T01:34:31.183525Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:31.183525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mqC02JOgtWme5ZyreiLwWBzXNLjbDzZ7pgYYWD16dDXrnQpj5Nsxkpm7rSL04DRjhq0bxqhIzzZqpDEGARi2Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:31.183877Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.07921","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bfadd3aea6ea9d5d409ff9837e1a0d84e7fe454532f57fc91325ef0a4690b6c7","sha256:455c1d3173c01f0408dec485e58700fd95f5046ca6c26a6357efcfac71723e92"],"state_sha256":"9e915be9627ec365c3f023abb51e0fd12e8b04da18948b5de237e7b45c860b62"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JzhzvCScHC+p/AuKnP1gqiDMFqSuK8VTcSuYrb5YGjHCGqlY7cvFgOKNVSdS4juRh3IEo4n2o2BOgy2jBhsBAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T21:13:25.338644Z","bundle_sha256":"f754fd3c9ba61691fed700726b8b71ed997f549ecfc06b69fa46f195117d75b8"}}