{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:EYOCMVP3SV3NQCPEPYWQVGKRVY","short_pith_number":"pith:EYOCMVP3","canonical_record":{"source":{"id":"1807.11711","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-31T09:17:43Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"618fe830c71c06f9caf0f150c53dbb243e528fda00f38be7b4ee06e313fb6b4b","abstract_canon_sha256":"bd7dee501bc219d7326632ed2ffc25f68a45d9a9bfaaa15ba7fffd88a2c151a0"},"schema_version":"1.0"},"canonical_sha256":"261c2655fb9576d809e47e2d0a9951ae05ce7a3d40a9f5b999707678f08f72db","source":{"kind":"arxiv","id":"1807.11711","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.11711","created_at":"2026-05-18T00:09:21Z"},{"alias_kind":"arxiv_version","alias_value":"1807.11711v1","created_at":"2026-05-18T00:09:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.11711","created_at":"2026-05-18T00:09:21Z"},{"alias_kind":"pith_short_12","alias_value":"EYOCMVP3SV3N","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EYOCMVP3SV3NQCPE","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EYOCMVP3","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:EYOCMVP3SV3NQCPEPYWQVGKRVY","target":"record","payload":{"canonical_record":{"source":{"id":"1807.11711","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-31T09:17:43Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"618fe830c71c06f9caf0f150c53dbb243e528fda00f38be7b4ee06e313fb6b4b","abstract_canon_sha256":"bd7dee501bc219d7326632ed2ffc25f68a45d9a9bfaaa15ba7fffd88a2c151a0"},"schema_version":"1.0"},"canonical_sha256":"261c2655fb9576d809e47e2d0a9951ae05ce7a3d40a9f5b999707678f08f72db","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:21.321207Z","signature_b64":"9gGafLXZzCV1tTxQTfPGOOJlfHYlEzYTazHg0k8CLfFyRPD70QOSSqQg9118DKD/7auBHH/i5pmpkWph73JGCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"261c2655fb9576d809e47e2d0a9951ae05ce7a3d40a9f5b999707678f08f72db","last_reissued_at":"2026-05-18T00:09:21.320742Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:21.320742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.11711","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-18T00:09:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TghVhIotV65uTpe6T5T6LKyr3tq/Veb3qCBLRRVTeO0sl6GZtvf9B1rJlZ0N/5tWoS5fpVj2dSFvRsku0WdeBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T07:20:14.058249Z"},"content_sha256":"aec62c5eb0ae28799e998b83cba1a76d2d1c9db695c8545cdf318870ba0a6d4b","schema_version":"1.0","event_id":"sha256:aec62c5eb0ae28799e998b83cba1a76d2d1c9db695c8545cdf318870ba0a6d4b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:EYOCMVP3SV3NQCPEPYWQVGKRVY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Inserting an Edge into a Geometric Embedding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Ignaz Rutter, Marcel Radermacher","submitted_at":"2018-07-31T09:17:43Z","abstract_excerpt":"The algorithm of Gutwenger et al. to insert an edge $e$ in linear time into a planar graph $G$ with a minimal number of crossings on $e$, is a helpful tool for designing heuristics that minimize edge crossings in drawings of general graphs. Unfortunately, some graphs do not have a geometric embedding $\\Gamma$ such that $\\Gamma+e$ has the same number of crossings as the embedding $G+e$. This motivates the study of the computational complexity of the following problem: Given a combinatorially embedded graph $G$, compute a geometric embedding $\\Gamma$ that has the same combinatorial embedding as "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.11711","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-18T00:09:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tkZN4/EKjW5XMzm0nUoHolJvk5ivBul4bjihqQNgZ2g5N20gPOXc2JCY7PcPoHUaoJgannK1cxwu3vbtGn1/Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T07:20:14.058618Z"},"content_sha256":"a8a8b2143c31fc8e8927426f5e6a955286d733d1c922be0339244710465316a0","schema_version":"1.0","event_id":"sha256:a8a8b2143c31fc8e8927426f5e6a955286d733d1c922be0339244710465316a0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EYOCMVP3SV3NQCPEPYWQVGKRVY/bundle.json","state_url":"https://pith.science/pith/EYOCMVP3SV3NQCPEPYWQVGKRVY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EYOCMVP3SV3NQCPEPYWQVGKRVY/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-24T07:20:14Z","links":{"resolver":"https://pith.science/pith/EYOCMVP3SV3NQCPEPYWQVGKRVY","bundle":"https://pith.science/pith/EYOCMVP3SV3NQCPEPYWQVGKRVY/bundle.json","state":"https://pith.science/pith/EYOCMVP3SV3NQCPEPYWQVGKRVY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EYOCMVP3SV3NQCPEPYWQVGKRVY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:EYOCMVP3SV3NQCPEPYWQVGKRVY","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":"bd7dee501bc219d7326632ed2ffc25f68a45d9a9bfaaa15ba7fffd88a2c151a0","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-31T09:17:43Z","title_canon_sha256":"618fe830c71c06f9caf0f150c53dbb243e528fda00f38be7b4ee06e313fb6b4b"},"schema_version":"1.0","source":{"id":"1807.11711","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.11711","created_at":"2026-05-18T00:09:21Z"},{"alias_kind":"arxiv_version","alias_value":"1807.11711v1","created_at":"2026-05-18T00:09:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.11711","created_at":"2026-05-18T00:09:21Z"},{"alias_kind":"pith_short_12","alias_value":"EYOCMVP3SV3N","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EYOCMVP3SV3NQCPE","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EYOCMVP3","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:a8a8b2143c31fc8e8927426f5e6a955286d733d1c922be0339244710465316a0","target":"graph","created_at":"2026-05-18T00:09:21Z","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 algorithm of Gutwenger et al. to insert an edge $e$ in linear time into a planar graph $G$ with a minimal number of crossings on $e$, is a helpful tool for designing heuristics that minimize edge crossings in drawings of general graphs. Unfortunately, some graphs do not have a geometric embedding $\\Gamma$ such that $\\Gamma+e$ has the same number of crossings as the embedding $G+e$. This motivates the study of the computational complexity of the following problem: Given a combinatorially embedded graph $G$, compute a geometric embedding $\\Gamma$ that has the same combinatorial embedding as ","authors_text":"Ignaz Rutter, Marcel Radermacher","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-31T09:17:43Z","title":"Inserting an Edge into a Geometric Embedding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.11711","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:aec62c5eb0ae28799e998b83cba1a76d2d1c9db695c8545cdf318870ba0a6d4b","target":"record","created_at":"2026-05-18T00:09:21Z","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":"bd7dee501bc219d7326632ed2ffc25f68a45d9a9bfaaa15ba7fffd88a2c151a0","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-31T09:17:43Z","title_canon_sha256":"618fe830c71c06f9caf0f150c53dbb243e528fda00f38be7b4ee06e313fb6b4b"},"schema_version":"1.0","source":{"id":"1807.11711","kind":"arxiv","version":1}},"canonical_sha256":"261c2655fb9576d809e47e2d0a9951ae05ce7a3d40a9f5b999707678f08f72db","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"261c2655fb9576d809e47e2d0a9951ae05ce7a3d40a9f5b999707678f08f72db","first_computed_at":"2026-05-18T00:09:21.320742Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:21.320742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9gGafLXZzCV1tTxQTfPGOOJlfHYlEzYTazHg0k8CLfFyRPD70QOSSqQg9118DKD/7auBHH/i5pmpkWph73JGCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:21.321207Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.11711","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aec62c5eb0ae28799e998b83cba1a76d2d1c9db695c8545cdf318870ba0a6d4b","sha256:a8a8b2143c31fc8e8927426f5e6a955286d733d1c922be0339244710465316a0"],"state_sha256":"31a4f7fab9ef501bfff8b5692d733d412ca71b978b2ed34d61d811df1d4b3961"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k4BYsXX8QG8pdyKsS4zRXTS06NcKtUjMDLapM6W7op9hH/cYdKGg4bXaAo5UVtFSZAW+zwgiffadtebtkukBBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T07:20:14.060582Z","bundle_sha256":"f79462f1c5c4428edc00f81b2f760090f5c3adb301555676053dae0288931dbd"}}