{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:PVZXUOHN3GU3R3PGJXNNBS3X7L","short_pith_number":"pith:PVZXUOHN","schema_version":"1.0","canonical_sha256":"7d737a38edd9a9b8ede64ddad0cb77fada5bc9764bf5a068a3cbe26e649dcdb7","source":{"kind":"arxiv","id":"1707.08652","version":1},"attestation_state":"computed","paper":{"title":"A Note on IC-Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Christian Bachmaier, Franz J. Brandenburg, Kathrin Hanauer","submitted_at":"2017-07-26T21:39:45Z","abstract_excerpt":"A graph is IC-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 no common end vertex. IC-planarity specializes both NIC-planarity, which allows a pair of crossing edges to share at most one vertex, and 1-planarity, where each edge may be crossed at most once. We show that there are infinitely maximal IC-planar graphs with n vertices and 3n-5 edges and thereby prove a tight lower bound on the density of this class of graphs."},"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":"1707.08652","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-07-26T21:39:45Z","cross_cats_sorted":[],"title_canon_sha256":"e82520c3d86e6aaa4b1cff6505d9ccd1e046815fea5fee895b21e04e153e2e78","abstract_canon_sha256":"96b68799590f7ed193547e67b8be25d70672a7c6ad84e886593a70c8cbec2611"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:23.441271Z","signature_b64":"muyvk+SE7LsMm6F1PlAbrCNCQ0i8jf9DQKiVqfSoNBIzSKTH78EHzN0rxCNYNgCPFQavSGmbBenVxz9YuuR+BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d737a38edd9a9b8ede64ddad0cb77fada5bc9764bf5a068a3cbe26e649dcdb7","last_reissued_at":"2026-05-18T00:39:23.440654Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:23.440654Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Note on IC-Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Christian Bachmaier, Franz J. Brandenburg, Kathrin Hanauer","submitted_at":"2017-07-26T21:39:45Z","abstract_excerpt":"A graph is IC-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 no common end vertex. IC-planarity specializes both NIC-planarity, which allows a pair of crossing edges to share at most one vertex, and 1-planarity, where each edge may be crossed at most once. We show that there are infinitely maximal IC-planar graphs with n vertices and 3n-5 edges and thereby prove a tight lower bound on the density of this class of graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.08652","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":"1707.08652","created_at":"2026-05-18T00:39:23.440740+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.08652v1","created_at":"2026-05-18T00:39:23.440740+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.08652","created_at":"2026-05-18T00:39:23.440740+00:00"},{"alias_kind":"pith_short_12","alias_value":"PVZXUOHN3GU3","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"PVZXUOHN3GU3R3PG","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"PVZXUOHN","created_at":"2026-05-18T12:31:37.085036+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/PVZXUOHN3GU3R3PGJXNNBS3X7L","json":"https://pith.science/pith/PVZXUOHN3GU3R3PGJXNNBS3X7L.json","graph_json":"https://pith.science/api/pith-number/PVZXUOHN3GU3R3PGJXNNBS3X7L/graph.json","events_json":"https://pith.science/api/pith-number/PVZXUOHN3GU3R3PGJXNNBS3X7L/events.json","paper":"https://pith.science/paper/PVZXUOHN"},"agent_actions":{"view_html":"https://pith.science/pith/PVZXUOHN3GU3R3PGJXNNBS3X7L","download_json":"https://pith.science/pith/PVZXUOHN3GU3R3PGJXNNBS3X7L.json","view_paper":"https://pith.science/paper/PVZXUOHN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.08652&json=true","fetch_graph":"https://pith.science/api/pith-number/PVZXUOHN3GU3R3PGJXNNBS3X7L/graph.json","fetch_events":"https://pith.science/api/pith-number/PVZXUOHN3GU3R3PGJXNNBS3X7L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PVZXUOHN3GU3R3PGJXNNBS3X7L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PVZXUOHN3GU3R3PGJXNNBS3X7L/action/storage_attestation","attest_author":"https://pith.science/pith/PVZXUOHN3GU3R3PGJXNNBS3X7L/action/author_attestation","sign_citation":"https://pith.science/pith/PVZXUOHN3GU3R3PGJXNNBS3X7L/action/citation_signature","submit_replication":"https://pith.science/pith/PVZXUOHN3GU3R3PGJXNNBS3X7L/action/replication_record"}},"created_at":"2026-05-18T00:39:23.440740+00:00","updated_at":"2026-05-18T00:39:23.440740+00:00"}