{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:EPWTXIIPC53ZR46V4XE6V5UVPP","short_pith_number":"pith:EPWTXIIP","canonical_record":{"source":{"id":"1610.08884","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-10-27T17:01:18Z","cross_cats_sorted":[],"title_canon_sha256":"6307031cf8b820dc2e99ed1bbbc2add088ab261c9a684e67baa4c2552db856e9","abstract_canon_sha256":"9896fe1ef4af007e298c8b985d9315df254dc09fb2364975899c5c9b3d4cddca"},"schema_version":"1.0"},"canonical_sha256":"23ed3ba10f177798f3d5e5c9eaf6957be46e92bcf990bc2cd3a7dfc9db682742","source":{"kind":"arxiv","id":"1610.08884","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.08884","created_at":"2026-05-18T01:01:06Z"},{"alias_kind":"arxiv_version","alias_value":"1610.08884v1","created_at":"2026-05-18T01:01:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.08884","created_at":"2026-05-18T01:01:06Z"},{"alias_kind":"pith_short_12","alias_value":"EPWTXIIPC53Z","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EPWTXIIPC53ZR46V","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EPWTXIIP","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:EPWTXIIPC53ZR46V4XE6V5UVPP","target":"record","payload":{"canonical_record":{"source":{"id":"1610.08884","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-10-27T17:01:18Z","cross_cats_sorted":[],"title_canon_sha256":"6307031cf8b820dc2e99ed1bbbc2add088ab261c9a684e67baa4c2552db856e9","abstract_canon_sha256":"9896fe1ef4af007e298c8b985d9315df254dc09fb2364975899c5c9b3d4cddca"},"schema_version":"1.0"},"canonical_sha256":"23ed3ba10f177798f3d5e5c9eaf6957be46e92bcf990bc2cd3a7dfc9db682742","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:06.999968Z","signature_b64":"DBWBf820UKMC1EvXYTovocYcjg+fPJYZbVZVkTUZZPOsA/OHGq1psTl3oejaNitsXBgBDJsrxGCFu+5c7B1JDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23ed3ba10f177798f3d5e5c9eaf6957be46e92bcf990bc2cd3a7dfc9db682742","last_reissued_at":"2026-05-18T01:01:06.999549Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:06.999549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.08884","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:01:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"78m2vnwfDuK+Hhki0CvqvXHYQbzgi+sL79z7bXeM7Ar+IQDqvCenRSROZsG1lEpEvLyqMGGYQnz2ZLI85ZXzDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T03:06:00.103897Z"},"content_sha256":"562bea9d7351eca14f0d2012d2da5e7c58340c14556f9a08325d71932d385a30","schema_version":"1.0","event_id":"sha256:562bea9d7351eca14f0d2012d2da5e7c58340c14556f9a08325d71932d385a30"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:EPWTXIIPC53ZR46V4XE6V5UVPP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Recognizing IC-Planar and NIC-Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Franz J. Brandenburg","submitted_at":"2016-10-27T17:01:18Z","abstract_excerpt":"We prove that triangulated IC-planar and NIC-planar graphs can be recognized in cubic time.\n  A graph is 1-planar if it can be drawn in the plane with at most one crossing per edge. A drawing is IC-planar if, in addition, each vertex is incident to at most one crossing edge and NIC-planar if two pairs of crossing edges share at most one vertex. In a triangulated drawing each face is a triangle. In consequence, planar-maximal and maximal IC-planar and NIC-planar graphs can be recognized in O(n^5) time and maximum and optimal ones in O(n^3) time. In contrast, recognizing 3-connected IC-planar an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.08884","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:01:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zmb23H46PDc779Qghz9HHY/59GYAVIJrB936g61RnNyoq/yksmkWsFIvpR8zYRObGQ01umnXPE6btSSo/vkkBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T03:06:00.104248Z"},"content_sha256":"4678b4e4c956fa130b83e9222760ec89f2c0191d95731954e2fdf3b6df2ed34b","schema_version":"1.0","event_id":"sha256:4678b4e4c956fa130b83e9222760ec89f2c0191d95731954e2fdf3b6df2ed34b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EPWTXIIPC53ZR46V4XE6V5UVPP/bundle.json","state_url":"https://pith.science/pith/EPWTXIIPC53ZR46V4XE6V5UVPP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EPWTXIIPC53ZR46V4XE6V5UVPP/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-04T03:06:00Z","links":{"resolver":"https://pith.science/pith/EPWTXIIPC53ZR46V4XE6V5UVPP","bundle":"https://pith.science/pith/EPWTXIIPC53ZR46V4XE6V5UVPP/bundle.json","state":"https://pith.science/pith/EPWTXIIPC53ZR46V4XE6V5UVPP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EPWTXIIPC53ZR46V4XE6V5UVPP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:EPWTXIIPC53ZR46V4XE6V5UVPP","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":"9896fe1ef4af007e298c8b985d9315df254dc09fb2364975899c5c9b3d4cddca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-10-27T17:01:18Z","title_canon_sha256":"6307031cf8b820dc2e99ed1bbbc2add088ab261c9a684e67baa4c2552db856e9"},"schema_version":"1.0","source":{"id":"1610.08884","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.08884","created_at":"2026-05-18T01:01:06Z"},{"alias_kind":"arxiv_version","alias_value":"1610.08884v1","created_at":"2026-05-18T01:01:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.08884","created_at":"2026-05-18T01:01:06Z"},{"alias_kind":"pith_short_12","alias_value":"EPWTXIIPC53Z","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EPWTXIIPC53ZR46V","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EPWTXIIP","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:4678b4e4c956fa130b83e9222760ec89f2c0191d95731954e2fdf3b6df2ed34b","target":"graph","created_at":"2026-05-18T01:01:06Z","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":"We prove that triangulated IC-planar and NIC-planar graphs can be recognized in cubic time.\n  A graph is 1-planar if it can be drawn in the plane with at most one crossing per edge. A drawing is IC-planar if, in addition, each vertex is incident to at most one crossing edge and NIC-planar if two pairs of crossing edges share at most one vertex. In a triangulated drawing each face is a triangle. In consequence, planar-maximal and maximal IC-planar and NIC-planar graphs can be recognized in O(n^5) time and maximum and optimal ones in O(n^3) time. In contrast, recognizing 3-connected IC-planar an","authors_text":"Franz J. Brandenburg","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-10-27T17:01:18Z","title":"Recognizing IC-Planar and NIC-Planar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.08884","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:562bea9d7351eca14f0d2012d2da5e7c58340c14556f9a08325d71932d385a30","target":"record","created_at":"2026-05-18T01:01:06Z","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":"9896fe1ef4af007e298c8b985d9315df254dc09fb2364975899c5c9b3d4cddca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-10-27T17:01:18Z","title_canon_sha256":"6307031cf8b820dc2e99ed1bbbc2add088ab261c9a684e67baa4c2552db856e9"},"schema_version":"1.0","source":{"id":"1610.08884","kind":"arxiv","version":1}},"canonical_sha256":"23ed3ba10f177798f3d5e5c9eaf6957be46e92bcf990bc2cd3a7dfc9db682742","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"23ed3ba10f177798f3d5e5c9eaf6957be46e92bcf990bc2cd3a7dfc9db682742","first_computed_at":"2026-05-18T01:01:06.999549Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:06.999549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DBWBf820UKMC1EvXYTovocYcjg+fPJYZbVZVkTUZZPOsA/OHGq1psTl3oejaNitsXBgBDJsrxGCFu+5c7B1JDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:06.999968Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.08884","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:562bea9d7351eca14f0d2012d2da5e7c58340c14556f9a08325d71932d385a30","sha256:4678b4e4c956fa130b83e9222760ec89f2c0191d95731954e2fdf3b6df2ed34b"],"state_sha256":"c2ed4d6e6e062956ca70caadffbbf23f6c00619ad021c8bfb1c55699255f70fe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y/Z+2Fl2vUt2PsoDccaKjetSrUBX1spzLxHN/tk7GxahzKfPlYVpMgNkcrONUoKMPz5LJ6iK9I7uX8OjYJPNDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T03:06:00.106790Z","bundle_sha256":"0afd033cef0279074e77e4772175721f1f65553a3fac9839c13228a72ccfa582"}}