{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:EPWTXIIPC53ZR46V4XE6V5UVPP","short_pith_number":"pith:EPWTXIIP","schema_version":"1.0","canonical_sha256":"23ed3ba10f177798f3d5e5c9eaf6957be46e92bcf990bc2cd3a7dfc9db682742","source":{"kind":"arxiv","id":"1610.08884","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1610.08884","created_at":"2026-05-18T01:01:06.999606+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.08884v1","created_at":"2026-05-18T01:01:06.999606+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.08884","created_at":"2026-05-18T01:01:06.999606+00:00"},{"alias_kind":"pith_short_12","alias_value":"EPWTXIIPC53Z","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"EPWTXIIPC53ZR46V","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"EPWTXIIP","created_at":"2026-05-18T12:30:12.583610+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/EPWTXIIPC53ZR46V4XE6V5UVPP","json":"https://pith.science/pith/EPWTXIIPC53ZR46V4XE6V5UVPP.json","graph_json":"https://pith.science/api/pith-number/EPWTXIIPC53ZR46V4XE6V5UVPP/graph.json","events_json":"https://pith.science/api/pith-number/EPWTXIIPC53ZR46V4XE6V5UVPP/events.json","paper":"https://pith.science/paper/EPWTXIIP"},"agent_actions":{"view_html":"https://pith.science/pith/EPWTXIIPC53ZR46V4XE6V5UVPP","download_json":"https://pith.science/pith/EPWTXIIPC53ZR46V4XE6V5UVPP.json","view_paper":"https://pith.science/paper/EPWTXIIP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.08884&json=true","fetch_graph":"https://pith.science/api/pith-number/EPWTXIIPC53ZR46V4XE6V5UVPP/graph.json","fetch_events":"https://pith.science/api/pith-number/EPWTXIIPC53ZR46V4XE6V5UVPP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EPWTXIIPC53ZR46V4XE6V5UVPP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EPWTXIIPC53ZR46V4XE6V5UVPP/action/storage_attestation","attest_author":"https://pith.science/pith/EPWTXIIPC53ZR46V4XE6V5UVPP/action/author_attestation","sign_citation":"https://pith.science/pith/EPWTXIIPC53ZR46V4XE6V5UVPP/action/citation_signature","submit_replication":"https://pith.science/pith/EPWTXIIPC53ZR46V4XE6V5UVPP/action/replication_record"}},"created_at":"2026-05-18T01:01:06.999606+00:00","updated_at":"2026-05-18T01:01:06.999606+00:00"}