{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:A44XAUIUDXD2OSFRDGOOK5PORV","short_pith_number":"pith:A44XAUIU","canonical_record":{"source":{"id":"1509.00388","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-09-01T16:54:16Z","cross_cats_sorted":[],"title_canon_sha256":"7b7d85a4d76b1ab29fc23fd63e1d67860f7f55f91a4256d218cb8da1dcae7586","abstract_canon_sha256":"985f03b79f905920a14cf2ad67fdfa675237ec714dcc1498a41e0dc32f27d219"},"schema_version":"1.0"},"canonical_sha256":"07397051141dc7a748b1199ce575ee8d6457cb0ac9cfe31fbe6421db0d0a0751","source":{"kind":"arxiv","id":"1509.00388","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.00388","created_at":"2026-05-18T01:10:59Z"},{"alias_kind":"arxiv_version","alias_value":"1509.00388v2","created_at":"2026-05-18T01:10:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00388","created_at":"2026-05-18T01:10:59Z"},{"alias_kind":"pith_short_12","alias_value":"A44XAUIUDXD2","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"A44XAUIUDXD2OSFR","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"A44XAUIU","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:A44XAUIUDXD2OSFRDGOOK5PORV","target":"record","payload":{"canonical_record":{"source":{"id":"1509.00388","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-09-01T16:54:16Z","cross_cats_sorted":[],"title_canon_sha256":"7b7d85a4d76b1ab29fc23fd63e1d67860f7f55f91a4256d218cb8da1dcae7586","abstract_canon_sha256":"985f03b79f905920a14cf2ad67fdfa675237ec714dcc1498a41e0dc32f27d219"},"schema_version":"1.0"},"canonical_sha256":"07397051141dc7a748b1199ce575ee8d6457cb0ac9cfe31fbe6421db0d0a0751","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:59.896683Z","signature_b64":"B/xJHm4ZXw7kwZWMXABh1lHgh02Oiq+Z7uBUww0sEJA0O+g9XLVKa2wJxhQjNtNgfVzedh6qM7XzDJESDg2bDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07397051141dc7a748b1199ce575ee8d6457cb0ac9cfe31fbe6421db0d0a0751","last_reissued_at":"2026-05-18T01:10:59.895933Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:59.895933Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.00388","source_version":2,"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:10:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7EwjrY7F0hq1GzjTMO9NL9aDInMgXTWhfo/iqCFTWWsmswx2mb/vOzNMPp6IJ+8xjB8HwlNdllmrtplVu1lXAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T03:30:40.830057Z"},"content_sha256":"cb538a9753fc231cde3d7b56caa560c9ea04c7354e4ac2d2cfcfd17b9649e81d","schema_version":"1.0","event_id":"sha256:cb538a9753fc231cde3d7b56caa560c9ea04c7354e4ac2d2cfcfd17b9649e81d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:A44XAUIUDXD2OSFRDGOOK5PORV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Recognizing and Drawing IC-planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Fabrizio Montecchiani, Franz J. Brandenburg, Giuseppe Liotta, Philipp Kindermann, Walter Didimo, William S. Evans","submitted_at":"2015-09-01T16:54:16Z","abstract_excerpt":"IC-planar graphs are those graphs that admit a drawing where no two crossed edges share an end-vertex and each edge is crossed at most once. They are a proper subfamily of the 1-planar graphs. Given an embedded IC-planar graph $G$ with $n$ vertices, we present an $O(n)$-time algorithm that computes a straight-line drawing of $G$ in quadratic area, and an $O(n^3)$-time algorithm that computes a straight-line drawing of $G$ with right-angle crossings in exponential area. Both these area requirements are worst-case optimal. We also show that it is NP-complete to test IC-planarity both in the gene"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.00388","kind":"arxiv","version":2},"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:10:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2KpuDX5Mv0lEp1j9Arv7wQJVU3r1QwMajxP52rkn2VjGSSq94iFHJEqNHZ7oHwY1Ij1MZlpTWULLYXFyS67eBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T03:30:40.830733Z"},"content_sha256":"db5d1caa5766ddf216d320461206d326fb6c37f8b1f7abd49838f9344c270c92","schema_version":"1.0","event_id":"sha256:db5d1caa5766ddf216d320461206d326fb6c37f8b1f7abd49838f9344c270c92"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A44XAUIUDXD2OSFRDGOOK5PORV/bundle.json","state_url":"https://pith.science/pith/A44XAUIUDXD2OSFRDGOOK5PORV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A44XAUIUDXD2OSFRDGOOK5PORV/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-05-22T03:30:40Z","links":{"resolver":"https://pith.science/pith/A44XAUIUDXD2OSFRDGOOK5PORV","bundle":"https://pith.science/pith/A44XAUIUDXD2OSFRDGOOK5PORV/bundle.json","state":"https://pith.science/pith/A44XAUIUDXD2OSFRDGOOK5PORV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A44XAUIUDXD2OSFRDGOOK5PORV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:A44XAUIUDXD2OSFRDGOOK5PORV","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":"985f03b79f905920a14cf2ad67fdfa675237ec714dcc1498a41e0dc32f27d219","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-09-01T16:54:16Z","title_canon_sha256":"7b7d85a4d76b1ab29fc23fd63e1d67860f7f55f91a4256d218cb8da1dcae7586"},"schema_version":"1.0","source":{"id":"1509.00388","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.00388","created_at":"2026-05-18T01:10:59Z"},{"alias_kind":"arxiv_version","alias_value":"1509.00388v2","created_at":"2026-05-18T01:10:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00388","created_at":"2026-05-18T01:10:59Z"},{"alias_kind":"pith_short_12","alias_value":"A44XAUIUDXD2","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"A44XAUIUDXD2OSFR","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"A44XAUIU","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:db5d1caa5766ddf216d320461206d326fb6c37f8b1f7abd49838f9344c270c92","target":"graph","created_at":"2026-05-18T01:10:59Z","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":"IC-planar graphs are those graphs that admit a drawing where no two crossed edges share an end-vertex and each edge is crossed at most once. They are a proper subfamily of the 1-planar graphs. Given an embedded IC-planar graph $G$ with $n$ vertices, we present an $O(n)$-time algorithm that computes a straight-line drawing of $G$ in quadratic area, and an $O(n^3)$-time algorithm that computes a straight-line drawing of $G$ with right-angle crossings in exponential area. Both these area requirements are worst-case optimal. We also show that it is NP-complete to test IC-planarity both in the gene","authors_text":"Fabrizio Montecchiani, Franz J. Brandenburg, Giuseppe Liotta, Philipp Kindermann, Walter Didimo, William S. Evans","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-09-01T16:54:16Z","title":"Recognizing and Drawing IC-planar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.00388","kind":"arxiv","version":2},"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:cb538a9753fc231cde3d7b56caa560c9ea04c7354e4ac2d2cfcfd17b9649e81d","target":"record","created_at":"2026-05-18T01:10:59Z","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":"985f03b79f905920a14cf2ad67fdfa675237ec714dcc1498a41e0dc32f27d219","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-09-01T16:54:16Z","title_canon_sha256":"7b7d85a4d76b1ab29fc23fd63e1d67860f7f55f91a4256d218cb8da1dcae7586"},"schema_version":"1.0","source":{"id":"1509.00388","kind":"arxiv","version":2}},"canonical_sha256":"07397051141dc7a748b1199ce575ee8d6457cb0ac9cfe31fbe6421db0d0a0751","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"07397051141dc7a748b1199ce575ee8d6457cb0ac9cfe31fbe6421db0d0a0751","first_computed_at":"2026-05-18T01:10:59.895933Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:59.895933Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B/xJHm4ZXw7kwZWMXABh1lHgh02Oiq+Z7uBUww0sEJA0O+g9XLVKa2wJxhQjNtNgfVzedh6qM7XzDJESDg2bDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:59.896683Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.00388","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cb538a9753fc231cde3d7b56caa560c9ea04c7354e4ac2d2cfcfd17b9649e81d","sha256:db5d1caa5766ddf216d320461206d326fb6c37f8b1f7abd49838f9344c270c92"],"state_sha256":"b67aad2df920b7173376f565375c67d5bcb2b464e76ab3a78fc4f5ed45456032"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2F3tD8aCeLcNKpYfrmnqo2ikl7u+mw4dXYgloY2oGVz3vzK5as1ZDe9ddnTF1C7OcbFkXkg4tuU1kQRY7NBNAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T03:30:40.834378Z","bundle_sha256":"f085cf8db0bdd18b3e7f18c52c6c93edfefbffdf9525d012a2ffdff7acd069d3"}}