{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KUPHTHAISC2V4ZDPIGEBA4AOMP","short_pith_number":"pith:KUPHTHAI","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"},"canonical_sha256":"551e799c0890b55e646f418810700e63fd335cb9b76f17db7d4087ff1015fdec","source":{"kind":"arxiv","id":"1701.04375","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.04375","created_at":"2026-05-18T00:31:23Z"},{"alias_kind":"arxiv_version","alias_value":"1701.04375v3","created_at":"2026-05-18T00:31:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.04375","created_at":"2026-05-18T00:31:23Z"},{"alias_kind":"pith_short_12","alias_value":"KUPHTHAISC2V","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"KUPHTHAISC2V4ZDP","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"KUPHTHAI","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KUPHTHAISC2V4ZDPIGEBA4AOMP","target":"record","payload":{"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"},"canonical_sha256":"551e799c0890b55e646f418810700e63fd335cb9b76f17db7d4087ff1015fdec","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"},"source_kind":"arxiv","source_id":"1701.04375","source_version":3,"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-18T00:31:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p2YYy7zuTBdAgJPX1eG+n2z3odH8yAaeaIUMOH/RPPESVHIppz7A+L8AXZm7yRI3PDSxdfAAyT5lQRRhqTxRBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T23:31:06.852880Z"},"content_sha256":"241f56434e64ed9ed5a5c35614670f5d4505141cdf3773dea4892b75c136177c","schema_version":"1.0","event_id":"sha256:241f56434e64ed9ed5a5c35614670f5d4505141cdf3773dea4892b75c136177c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KUPHTHAISC2V4ZDPIGEBA4AOMP","target":"graph","payload":{"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"},"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-18T00:31:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fLMhtyIAAqb4+G1Hjd7/9v6ffQURf4QBIja8XeVDvtWzuwM3asvtulqo9lV7zzU/nd4pqY+8d6Fzdde9d77NAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T23:31:06.853250Z"},"content_sha256":"e1aaab51f5ffc2170d8e33d27c87686896c7b31170f57d6be72a95f63ccde40a","schema_version":"1.0","event_id":"sha256:e1aaab51f5ffc2170d8e33d27c87686896c7b31170f57d6be72a95f63ccde40a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KUPHTHAISC2V4ZDPIGEBA4AOMP/bundle.json","state_url":"https://pith.science/pith/KUPHTHAISC2V4ZDPIGEBA4AOMP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KUPHTHAISC2V4ZDPIGEBA4AOMP/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-20T23:31:06Z","links":{"resolver":"https://pith.science/pith/KUPHTHAISC2V4ZDPIGEBA4AOMP","bundle":"https://pith.science/pith/KUPHTHAISC2V4ZDPIGEBA4AOMP/bundle.json","state":"https://pith.science/pith/KUPHTHAISC2V4ZDPIGEBA4AOMP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KUPHTHAISC2V4ZDPIGEBA4AOMP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KUPHTHAISC2V4ZDPIGEBA4AOMP","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":"18e816f8245ec7e26890a971bbfa21bdd37da7cba41c09b49c283237f8bce7ae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-01-16T18:02:29Z","title_canon_sha256":"e096904f6ae3a14c76cb37d306fe5e2faed06760866d09455752130e77724b38"},"schema_version":"1.0","source":{"id":"1701.04375","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.04375","created_at":"2026-05-18T00:31:23Z"},{"alias_kind":"arxiv_version","alias_value":"1701.04375v3","created_at":"2026-05-18T00:31:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.04375","created_at":"2026-05-18T00:31:23Z"},{"alias_kind":"pith_short_12","alias_value":"KUPHTHAISC2V","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"KUPHTHAISC2V4ZDP","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"KUPHTHAI","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:e1aaab51f5ffc2170d8e33d27c87686896c7b31170f57d6be72a95f63ccde40a","target":"graph","created_at":"2026-05-18T00:31:23Z","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":"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).","authors_text":"Christian Bachmaier, Daniel Neuwirth, Franz J. Brandenburg, Josef Reislhuber, Kathrin Hanauer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-01-16T18:02:29Z","title":"NIC-Planar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.04375","kind":"arxiv","version":3},"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:241f56434e64ed9ed5a5c35614670f5d4505141cdf3773dea4892b75c136177c","target":"record","created_at":"2026-05-18T00:31:23Z","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":"18e816f8245ec7e26890a971bbfa21bdd37da7cba41c09b49c283237f8bce7ae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-01-16T18:02:29Z","title_canon_sha256":"e096904f6ae3a14c76cb37d306fe5e2faed06760866d09455752130e77724b38"},"schema_version":"1.0","source":{"id":"1701.04375","kind":"arxiv","version":3}},"canonical_sha256":"551e799c0890b55e646f418810700e63fd335cb9b76f17db7d4087ff1015fdec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"551e799c0890b55e646f418810700e63fd335cb9b76f17db7d4087ff1015fdec","first_computed_at":"2026-05-18T00:31:23.935491Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:23.935491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nZq6niq17qJHdics4ciSWF3RMxlpzEcJOO/kPfHVaDTI0P5RYhML9NftM5SCQSMr38mw158HHjbXCAO+krHTCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:23.935918Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.04375","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:241f56434e64ed9ed5a5c35614670f5d4505141cdf3773dea4892b75c136177c","sha256:e1aaab51f5ffc2170d8e33d27c87686896c7b31170f57d6be72a95f63ccde40a"],"state_sha256":"470df3ad19acb1b5d495c42b086ecc2004d3113c5ace33de68fc1a2ae526fd60"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b31eig96t/9lrmi9lrJ/0W0X4e8tyED+uyGl364bjogoQkFBX2opDkPYOmQejFNww7Np0Qu2lgddveurTo6EAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T23:31:06.855228Z","bundle_sha256":"3b52a18de80b05f4062b278294731111f401ffde5f78feba2857189ec50eaa48"}}