{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:23WPNROYXAUB4E22IOBDYY2Z3D","short_pith_number":"pith:23WPNROY","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"},"canonical_sha256":"d6ecf6c5d8b8281e135a43823c6359d8e7a42fbe395a0537acbdbf2635e0be26","source":{"kind":"arxiv","id":"1509.07952","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.07952","created_at":"2026-05-18T01:31:55Z"},{"alias_kind":"arxiv_version","alias_value":"1509.07952v1","created_at":"2026-05-18T01:31:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07952","created_at":"2026-05-18T01:31:55Z"},{"alias_kind":"pith_short_12","alias_value":"23WPNROYXAUB","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"23WPNROYXAUB4E22","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"23WPNROY","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:23WPNROYXAUB4E22IOBDYY2Z3D","target":"record","payload":{"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"},"canonical_sha256":"d6ecf6c5d8b8281e135a43823c6359d8e7a42fbe395a0537acbdbf2635e0be26","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"},"source_kind":"arxiv","source_id":"1509.07952","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:31:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZniNlWHLyuBtsu+zYDYIRS5W5jlgrjbp/kUU2gZoZenv1OCIMV9CHATUzz73D2DCZL42OWO8oSyVgUwS8UaXBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T09:38:19.085669Z"},"content_sha256":"4d9e3dd38c4d26d3ad0e479af0b5d4a206b4befd667927b5563c2b56c842a70c","schema_version":"1.0","event_id":"sha256:4d9e3dd38c4d26d3ad0e479af0b5d4a206b4befd667927b5563c2b56c842a70c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:23WPNROYXAUB4E22IOBDYY2Z3D","target":"graph","payload":{"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"},"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:31:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pes4Up0r0Df9F00PVDU90UiD2F7P56h6sNLm29Jz4N6uORJcXaf7f8E05Qj9rdth75NtCEdl71STYMO/LprxBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T09:38:19.086032Z"},"content_sha256":"3454aad13e368ed3233c1ba3b605306d6f7fd13b1804f2a72e432ad70e704460","schema_version":"1.0","event_id":"sha256:3454aad13e368ed3233c1ba3b605306d6f7fd13b1804f2a72e432ad70e704460"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/23WPNROYXAUB4E22IOBDYY2Z3D/bundle.json","state_url":"https://pith.science/pith/23WPNROYXAUB4E22IOBDYY2Z3D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/23WPNROYXAUB4E22IOBDYY2Z3D/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-05T09:38:19Z","links":{"resolver":"https://pith.science/pith/23WPNROYXAUB4E22IOBDYY2Z3D","bundle":"https://pith.science/pith/23WPNROYXAUB4E22IOBDYY2Z3D/bundle.json","state":"https://pith.science/pith/23WPNROYXAUB4E22IOBDYY2Z3D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/23WPNROYXAUB4E22IOBDYY2Z3D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:23WPNROYXAUB4E22IOBDYY2Z3D","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":"6f681585ebb3e82b838316fd8b70786e4e2d2ee5dca8315a0b487f69af2817f0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-26T09:02:35Z","title_canon_sha256":"fe38264d27976acbbfe254b7de786560f6dd717008a50ad9e226b2f6a07e652b"},"schema_version":"1.0","source":{"id":"1509.07952","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.07952","created_at":"2026-05-18T01:31:55Z"},{"alias_kind":"arxiv_version","alias_value":"1509.07952v1","created_at":"2026-05-18T01:31:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07952","created_at":"2026-05-18T01:31:55Z"},{"alias_kind":"pith_short_12","alias_value":"23WPNROYXAUB","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"23WPNROYXAUB4E22","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"23WPNROY","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:3454aad13e368ed3233c1ba3b605306d6f7fd13b1804f2a72e432ad70e704460","target":"graph","created_at":"2026-05-18T01:31:55Z","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":"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","authors_text":"Markus Chimani, Petr Hlin\\v{e}n\\'y","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-26T09:02:35Z","title":"Inserting Multiple Edges into a Planar Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.07952","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:4d9e3dd38c4d26d3ad0e479af0b5d4a206b4befd667927b5563c2b56c842a70c","target":"record","created_at":"2026-05-18T01:31:55Z","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":"6f681585ebb3e82b838316fd8b70786e4e2d2ee5dca8315a0b487f69af2817f0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-26T09:02:35Z","title_canon_sha256":"fe38264d27976acbbfe254b7de786560f6dd717008a50ad9e226b2f6a07e652b"},"schema_version":"1.0","source":{"id":"1509.07952","kind":"arxiv","version":1}},"canonical_sha256":"d6ecf6c5d8b8281e135a43823c6359d8e7a42fbe395a0537acbdbf2635e0be26","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d6ecf6c5d8b8281e135a43823c6359d8e7a42fbe395a0537acbdbf2635e0be26","first_computed_at":"2026-05-18T01:31:55.047104Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:31:55.047104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zY/odQvWNGofWITJxdiGzGm1ddu68FZ5LNGVU/EumMYGwJ6RBi1UeO+GtU79Y8kq1Qd9pfyFJi3xe6yqdYOwCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:31:55.047520Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.07952","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4d9e3dd38c4d26d3ad0e479af0b5d4a206b4befd667927b5563c2b56c842a70c","sha256:3454aad13e368ed3233c1ba3b605306d6f7fd13b1804f2a72e432ad70e704460"],"state_sha256":"c98b23089173b315ecfb276eadc6e4f16287730a9788cb9557cd5b0296bb788c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KAoysm4QwcNT84pMGt9la6/Z7g6+QvzF5xxjFaDseUOKyb60UMoMi1FX+DXPXXNy8sdrslaabc/Ljk8ldnaXCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T09:38:19.088502Z","bundle_sha256":"f54de1f4a95d9586c6ab22c75ad953b93df340e46523fec1d32215336644c01b"}}