{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:KUPHTHAISC2V4ZDPIGEBA4AOMP","short_pith_number":"pith:KUPHTHAI","schema_version":"1.0","canonical_sha256":"551e799c0890b55e646f418810700e63fd335cb9b76f17db7d4087ff1015fdec","source":{"kind":"arxiv","id":"1701.04375","version":3},"attestation_state":"computed","paper":{"title":"NIC-Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Christian Bachmaier, Daniel Neuwirth, Franz J. Brandenburg, Josef Reislhuber, Kathrin Hanauer","submitted_at":"2017-01-16T18:02:29Z","abstract_excerpt":"A graph is NIC-planar if it admits a drawing in the plane with at most one crossing per edge and such that two pairs of crossing edges share at most one common end vertex. NIC-planarity generalizes IC-planarity, which allows a vertex to be incident to at most one crossing edge, and specializes 1-planarity, which only requires at most one crossing per edge.\n  We characterize embeddings of maximal NIC-planar graphs in terms of generalized planar dual graphs. The characterization is used to derive tight bounds on the density of maximal NIC-planar graphs which ranges between 3.2(n-2) and 3.6(n-2)."},"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":"1701.04375","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-01-16T18:02:29Z","cross_cats_sorted":[],"title_canon_sha256":"e096904f6ae3a14c76cb37d306fe5e2faed06760866d09455752130e77724b38","abstract_canon_sha256":"18e816f8245ec7e26890a971bbfa21bdd37da7cba41c09b49c283237f8bce7ae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:23.935918Z","signature_b64":"nZq6niq17qJHdics4ciSWF3RMxlpzEcJOO/kPfHVaDTI0P5RYhML9NftM5SCQSMr38mw158HHjbXCAO+krHTCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"551e799c0890b55e646f418810700e63fd335cb9b76f17db7d4087ff1015fdec","last_reissued_at":"2026-05-18T00:31:23.935491Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:23.935491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"NIC-Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Christian Bachmaier, Daniel Neuwirth, Franz J. Brandenburg, Josef Reislhuber, Kathrin Hanauer","submitted_at":"2017-01-16T18:02:29Z","abstract_excerpt":"A graph is NIC-planar if it admits a drawing in the plane with at most one crossing per edge and such that two pairs of crossing edges share at most one common end vertex. NIC-planarity generalizes IC-planarity, which allows a vertex to be incident to at most one crossing edge, and specializes 1-planarity, which only requires at most one crossing per edge.\n  We characterize embeddings of maximal NIC-planar graphs in terms of generalized planar dual graphs. The characterization is used to derive tight bounds on the density of maximal NIC-planar graphs which ranges between 3.2(n-2) and 3.6(n-2)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.04375","kind":"arxiv","version":3},"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":"1701.04375","created_at":"2026-05-18T00:31:23.935552+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.04375v3","created_at":"2026-05-18T00:31:23.935552+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.04375","created_at":"2026-05-18T00:31:23.935552+00:00"},{"alias_kind":"pith_short_12","alias_value":"KUPHTHAISC2V","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"KUPHTHAISC2V4ZDP","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"KUPHTHAI","created_at":"2026-05-18T12:31:28.150371+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/KUPHTHAISC2V4ZDPIGEBA4AOMP","json":"https://pith.science/pith/KUPHTHAISC2V4ZDPIGEBA4AOMP.json","graph_json":"https://pith.science/api/pith-number/KUPHTHAISC2V4ZDPIGEBA4AOMP/graph.json","events_json":"https://pith.science/api/pith-number/KUPHTHAISC2V4ZDPIGEBA4AOMP/events.json","paper":"https://pith.science/paper/KUPHTHAI"},"agent_actions":{"view_html":"https://pith.science/pith/KUPHTHAISC2V4ZDPIGEBA4AOMP","download_json":"https://pith.science/pith/KUPHTHAISC2V4ZDPIGEBA4AOMP.json","view_paper":"https://pith.science/paper/KUPHTHAI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.04375&json=true","fetch_graph":"https://pith.science/api/pith-number/KUPHTHAISC2V4ZDPIGEBA4AOMP/graph.json","fetch_events":"https://pith.science/api/pith-number/KUPHTHAISC2V4ZDPIGEBA4AOMP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KUPHTHAISC2V4ZDPIGEBA4AOMP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KUPHTHAISC2V4ZDPIGEBA4AOMP/action/storage_attestation","attest_author":"https://pith.science/pith/KUPHTHAISC2V4ZDPIGEBA4AOMP/action/author_attestation","sign_citation":"https://pith.science/pith/KUPHTHAISC2V4ZDPIGEBA4AOMP/action/citation_signature","submit_replication":"https://pith.science/pith/KUPHTHAISC2V4ZDPIGEBA4AOMP/action/replication_record"}},"created_at":"2026-05-18T00:31:23.935552+00:00","updated_at":"2026-05-18T00:31:23.935552+00:00"}