{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:23WPNROYXAUB4E22IOBDYY2Z3D","short_pith_number":"pith:23WPNROY","schema_version":"1.0","canonical_sha256":"d6ecf6c5d8b8281e135a43823c6359d8e7a42fbe395a0537acbdbf2635e0be26","source":{"kind":"arxiv","id":"1509.07952","version":1},"attestation_state":"computed","paper":{"title":"Inserting Multiple Edges into a Planar Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Markus Chimani, Petr Hlin\\v{e}n\\'y","submitted_at":"2015-09-26T09:02:35Z","abstract_excerpt":"Let $G$ be a connected planar (but not yet embedded) graph and $F$ a set of additional edges not yet in $G$. The {multiple edge insertion} problem (MEI) asks for a drawing of $G+F$ with the minimum number of pairwise edge crossings, such that the subdrawing of $G$ is plane. An optimal solution to this problem approximates the crossing number of the graph $G+F$.\n  Finding an exact solution to MEI is NP-hard for general $F$, but linear time solvable for the special case of $|F|=1$ (SODA01, Algorithmica) or when all of $F$ are incident to a new vertex (SODA09).\n  The complexity for general $F$ bu"},"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":"1509.07952","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-26T09:02:35Z","cross_cats_sorted":[],"title_canon_sha256":"fe38264d27976acbbfe254b7de786560f6dd717008a50ad9e226b2f6a07e652b","abstract_canon_sha256":"6f681585ebb3e82b838316fd8b70786e4e2d2ee5dca8315a0b487f69af2817f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:31:55.047520Z","signature_b64":"zY/odQvWNGofWITJxdiGzGm1ddu68FZ5LNGVU/EumMYGwJ6RBi1UeO+GtU79Y8kq1Qd9pfyFJi3xe6yqdYOwCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6ecf6c5d8b8281e135a43823c6359d8e7a42fbe395a0537acbdbf2635e0be26","last_reissued_at":"2026-05-18T01:31:55.047104Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:31:55.047104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Inserting Multiple Edges into a Planar Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Markus Chimani, Petr Hlin\\v{e}n\\'y","submitted_at":"2015-09-26T09:02:35Z","abstract_excerpt":"Let $G$ be a connected planar (but not yet embedded) graph and $F$ a set of additional edges not yet in $G$. The {multiple edge insertion} problem (MEI) asks for a drawing of $G+F$ with the minimum number of pairwise edge crossings, such that the subdrawing of $G$ is plane. An optimal solution to this problem approximates the crossing number of the graph $G+F$.\n  Finding an exact solution to MEI is NP-hard for general $F$, but linear time solvable for the special case of $|F|=1$ (SODA01, Algorithmica) or when all of $F$ are incident to a new vertex (SODA09).\n  The complexity for general $F$ bu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.07952","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":"1509.07952","created_at":"2026-05-18T01:31:55.047171+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.07952v1","created_at":"2026-05-18T01:31:55.047171+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07952","created_at":"2026-05-18T01:31:55.047171+00:00"},{"alias_kind":"pith_short_12","alias_value":"23WPNROYXAUB","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"23WPNROYXAUB4E22","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"23WPNROY","created_at":"2026-05-18T12:28:59.999130+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/23WPNROYXAUB4E22IOBDYY2Z3D","json":"https://pith.science/pith/23WPNROYXAUB4E22IOBDYY2Z3D.json","graph_json":"https://pith.science/api/pith-number/23WPNROYXAUB4E22IOBDYY2Z3D/graph.json","events_json":"https://pith.science/api/pith-number/23WPNROYXAUB4E22IOBDYY2Z3D/events.json","paper":"https://pith.science/paper/23WPNROY"},"agent_actions":{"view_html":"https://pith.science/pith/23WPNROYXAUB4E22IOBDYY2Z3D","download_json":"https://pith.science/pith/23WPNROYXAUB4E22IOBDYY2Z3D.json","view_paper":"https://pith.science/paper/23WPNROY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.07952&json=true","fetch_graph":"https://pith.science/api/pith-number/23WPNROYXAUB4E22IOBDYY2Z3D/graph.json","fetch_events":"https://pith.science/api/pith-number/23WPNROYXAUB4E22IOBDYY2Z3D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/23WPNROYXAUB4E22IOBDYY2Z3D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/23WPNROYXAUB4E22IOBDYY2Z3D/action/storage_attestation","attest_author":"https://pith.science/pith/23WPNROYXAUB4E22IOBDYY2Z3D/action/author_attestation","sign_citation":"https://pith.science/pith/23WPNROYXAUB4E22IOBDYY2Z3D/action/citation_signature","submit_replication":"https://pith.science/pith/23WPNROYXAUB4E22IOBDYY2Z3D/action/replication_record"}},"created_at":"2026-05-18T01:31:55.047171+00:00","updated_at":"2026-05-18T01:31:55.047171+00:00"}