{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EYOCMVP3SV3NQCPEPYWQVGKRVY","short_pith_number":"pith:EYOCMVP3","schema_version":"1.0","canonical_sha256":"261c2655fb9576d809e47e2d0a9951ae05ce7a3d40a9f5b999707678f08f72db","source":{"kind":"arxiv","id":"1807.11711","version":1},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1807.11711","created_at":"2026-05-18T00:09:21.320817+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.11711v1","created_at":"2026-05-18T00:09:21.320817+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.11711","created_at":"2026-05-18T00:09:21.320817+00:00"},{"alias_kind":"pith_short_12","alias_value":"EYOCMVP3SV3N","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EYOCMVP3SV3NQCPE","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EYOCMVP3","created_at":"2026-05-18T12:32:22.470017+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/EYOCMVP3SV3NQCPEPYWQVGKRVY","json":"https://pith.science/pith/EYOCMVP3SV3NQCPEPYWQVGKRVY.json","graph_json":"https://pith.science/api/pith-number/EYOCMVP3SV3NQCPEPYWQVGKRVY/graph.json","events_json":"https://pith.science/api/pith-number/EYOCMVP3SV3NQCPEPYWQVGKRVY/events.json","paper":"https://pith.science/paper/EYOCMVP3"},"agent_actions":{"view_html":"https://pith.science/pith/EYOCMVP3SV3NQCPEPYWQVGKRVY","download_json":"https://pith.science/pith/EYOCMVP3SV3NQCPEPYWQVGKRVY.json","view_paper":"https://pith.science/paper/EYOCMVP3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.11711&json=true","fetch_graph":"https://pith.science/api/pith-number/EYOCMVP3SV3NQCPEPYWQVGKRVY/graph.json","fetch_events":"https://pith.science/api/pith-number/EYOCMVP3SV3NQCPEPYWQVGKRVY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EYOCMVP3SV3NQCPEPYWQVGKRVY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EYOCMVP3SV3NQCPEPYWQVGKRVY/action/storage_attestation","attest_author":"https://pith.science/pith/EYOCMVP3SV3NQCPEPYWQVGKRVY/action/author_attestation","sign_citation":"https://pith.science/pith/EYOCMVP3SV3NQCPEPYWQVGKRVY/action/citation_signature","submit_replication":"https://pith.science/pith/EYOCMVP3SV3NQCPEPYWQVGKRVY/action/replication_record"}},"created_at":"2026-05-18T00:09:21.320817+00:00","updated_at":"2026-05-18T00:09:21.320817+00:00"}