{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:CODA3NLO62V5ZUVPPVYEAOBJX2","short_pith_number":"pith:CODA3NLO","schema_version":"1.0","canonical_sha256":"13860db56ef6abdcd2af7d70403829be8e65cc32fee353c20b5b5ee1266032f4","source":{"kind":"arxiv","id":"1403.6184","version":2},"attestation_state":"computed","paper":{"title":"The Density of Fan-Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","math.CO"],"primary_cat":"cs.DM","authors_text":"Michael Kaufmann, Torsten Ueckerdt","submitted_at":"2014-03-24T23:07:40Z","abstract_excerpt":"A topological drawing of a graph is fan-planar if for each edge $e$ the edges crossing $e$ form a star and no endpoint of $e$ is enclosed by $e$ and its crossing edges. A fan-planar graph is a graph admitting such a drawing. Equivalently, this can be formulated by three forbidden patterns, one of which is the configuration where $e$ is crossed by two independent edges and the other two where $e$ is crossed by two incident edges in a way that encloses some endpoint of $e$. A topological drawing is simple if any two edges have at most one point in common.\n  Fan-planar graphs are a new member in "},"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":"1403.6184","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-03-24T23:07:40Z","cross_cats_sorted":["cs.CG","math.CO"],"title_canon_sha256":"62c841a9e156848eac148a841c0417daa2d80641edc71094316c46a37a39097d","abstract_canon_sha256":"ee449dcd362895ba8089b02b2a7b1b1537cdbe763db26e0460c55cffe851c08a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:58:02.518236Z","signature_b64":"cIG/sMg9RCRYr9FSUm3PcxQHrU2TaBW/SVGkwkfzySzYWAZUph5qU2un/OTJsHkBND+lPeBkx6+z54m1ffRWAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13860db56ef6abdcd2af7d70403829be8e65cc32fee353c20b5b5ee1266032f4","last_reissued_at":"2026-07-05T02:58:02.517876Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:58:02.517876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Density of Fan-Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","math.CO"],"primary_cat":"cs.DM","authors_text":"Michael Kaufmann, Torsten Ueckerdt","submitted_at":"2014-03-24T23:07:40Z","abstract_excerpt":"A topological drawing of a graph is fan-planar if for each edge $e$ the edges crossing $e$ form a star and no endpoint of $e$ is enclosed by $e$ and its crossing edges. A fan-planar graph is a graph admitting such a drawing. Equivalently, this can be formulated by three forbidden patterns, one of which is the configuration where $e$ is crossed by two independent edges and the other two where $e$ is crossed by two incident edges in a way that encloses some endpoint of $e$. A topological drawing is simple if any two edges have at most one point in common.\n  Fan-planar graphs are a new member in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.6184","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1403.6184/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1403.6184","created_at":"2026-07-05T02:58:02.517932+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.6184v2","created_at":"2026-07-05T02:58:02.517932+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.6184","created_at":"2026-07-05T02:58:02.517932+00:00"},{"alias_kind":"pith_short_12","alias_value":"CODA3NLO62V5","created_at":"2026-07-05T02:58:02.517932+00:00"},{"alias_kind":"pith_short_16","alias_value":"CODA3NLO62V5ZUVP","created_at":"2026-07-05T02:58:02.517932+00:00"},{"alias_kind":"pith_short_8","alias_value":"CODA3NLO","created_at":"2026-07-05T02:58:02.517932+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1909.00223","citing_title":"Simple $k$-Planar Graphs are Simple $(k+1)$-Quasiplanar","ref_index":20,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CODA3NLO62V5ZUVPPVYEAOBJX2","json":"https://pith.science/pith/CODA3NLO62V5ZUVPPVYEAOBJX2.json","graph_json":"https://pith.science/api/pith-number/CODA3NLO62V5ZUVPPVYEAOBJX2/graph.json","events_json":"https://pith.science/api/pith-number/CODA3NLO62V5ZUVPPVYEAOBJX2/events.json","paper":"https://pith.science/paper/CODA3NLO"},"agent_actions":{"view_html":"https://pith.science/pith/CODA3NLO62V5ZUVPPVYEAOBJX2","download_json":"https://pith.science/pith/CODA3NLO62V5ZUVPPVYEAOBJX2.json","view_paper":"https://pith.science/paper/CODA3NLO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.6184&json=true","fetch_graph":"https://pith.science/api/pith-number/CODA3NLO62V5ZUVPPVYEAOBJX2/graph.json","fetch_events":"https://pith.science/api/pith-number/CODA3NLO62V5ZUVPPVYEAOBJX2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CODA3NLO62V5ZUVPPVYEAOBJX2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CODA3NLO62V5ZUVPPVYEAOBJX2/action/storage_attestation","attest_author":"https://pith.science/pith/CODA3NLO62V5ZUVPPVYEAOBJX2/action/author_attestation","sign_citation":"https://pith.science/pith/CODA3NLO62V5ZUVPPVYEAOBJX2/action/citation_signature","submit_replication":"https://pith.science/pith/CODA3NLO62V5ZUVPPVYEAOBJX2/action/replication_record"}},"created_at":"2026-07-05T02:58:02.517932+00:00","updated_at":"2026-07-05T02:58:02.517932+00:00"}