{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:UWS4KC6Z6OGRGGWNGAAFLV3FJF","short_pith_number":"pith:UWS4KC6Z","schema_version":"1.0","canonical_sha256":"a5a5c50bd9f38d131acd300055d7654964a49cfc229260c3cf098848b73a184b","source":{"kind":"arxiv","id":"2505.24364","version":2},"attestation_state":"computed","paper":{"title":"A first view on the density of 5-planar graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Aaron B\\\"ungener, Jakob Franz, Maximilian Pfister, Michael Kaufmann","submitted_at":"2025-05-30T08:55:29Z","abstract_excerpt":"A key concept for many graph layout algorithms is planarity, a graph property that allows to draw vertices and edges crossing-free in the plane. Important is the generalization to $k$-planar graphs, which can be drawn in the plane with at most $k > 0$ crossings per edge. One of the basic graph properties that have been explored for those graph classes is the maximum edge density, i.e., the maximum number of edges a $k$-planar graph on $n$ vertices may have. While there are numerous results for the classes of $1$- and $2$-planar graphs, there are few results for increasing $k=3$ or $4$ due to t"},"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":"2505.24364","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2025-05-30T08:55:29Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"a8d101e0ece29b213898a34116b9f1f8650126bf91d23a9a1bc81b2fe74a4041","abstract_canon_sha256":"0320d5c7571371688dd6156fd5a165fb084fad47ad08c36a275e814a2fe55fd5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:00:20.679356Z","signature_b64":"96uLjQIi8rgLoQdZkoQ37x7V2YGtSBsY02qOG5z/MOlRSdWIC9xTHRwuehdxSKjbv71YvL2pS2bDHol9d5w2Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5a5c50bd9f38d131acd300055d7654964a49cfc229260c3cf098848b73a184b","last_reissued_at":"2026-05-20T00:00:20.678571Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:00:20.678571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A first view on the density of 5-planar graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Aaron B\\\"ungener, Jakob Franz, Maximilian Pfister, Michael Kaufmann","submitted_at":"2025-05-30T08:55:29Z","abstract_excerpt":"A key concept for many graph layout algorithms is planarity, a graph property that allows to draw vertices and edges crossing-free in the plane. Important is the generalization to $k$-planar graphs, which can be drawn in the plane with at most $k > 0$ crossings per edge. One of the basic graph properties that have been explored for those graph classes is the maximum edge density, i.e., the maximum number of edges a $k$-planar graph on $n$ vertices may have. While there are numerous results for the classes of $1$- and $2$-planar graphs, there are few results for increasing $k=3$ or $4$ due to t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.24364","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/2505.24364/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":"2505.24364","created_at":"2026-05-20T00:00:20.678705+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.24364v2","created_at":"2026-05-20T00:00:20.678705+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.24364","created_at":"2026-05-20T00:00:20.678705+00:00"},{"alias_kind":"pith_short_12","alias_value":"UWS4KC6Z6OGR","created_at":"2026-05-20T00:00:20.678705+00:00"},{"alias_kind":"pith_short_16","alias_value":"UWS4KC6Z6OGRGGWN","created_at":"2026-05-20T00:00:20.678705+00:00"},{"alias_kind":"pith_short_8","alias_value":"UWS4KC6Z","created_at":"2026-05-20T00:00:20.678705+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/UWS4KC6Z6OGRGGWNGAAFLV3FJF","json":"https://pith.science/pith/UWS4KC6Z6OGRGGWNGAAFLV3FJF.json","graph_json":"https://pith.science/api/pith-number/UWS4KC6Z6OGRGGWNGAAFLV3FJF/graph.json","events_json":"https://pith.science/api/pith-number/UWS4KC6Z6OGRGGWNGAAFLV3FJF/events.json","paper":"https://pith.science/paper/UWS4KC6Z"},"agent_actions":{"view_html":"https://pith.science/pith/UWS4KC6Z6OGRGGWNGAAFLV3FJF","download_json":"https://pith.science/pith/UWS4KC6Z6OGRGGWNGAAFLV3FJF.json","view_paper":"https://pith.science/paper/UWS4KC6Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.24364&json=true","fetch_graph":"https://pith.science/api/pith-number/UWS4KC6Z6OGRGGWNGAAFLV3FJF/graph.json","fetch_events":"https://pith.science/api/pith-number/UWS4KC6Z6OGRGGWNGAAFLV3FJF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UWS4KC6Z6OGRGGWNGAAFLV3FJF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UWS4KC6Z6OGRGGWNGAAFLV3FJF/action/storage_attestation","attest_author":"https://pith.science/pith/UWS4KC6Z6OGRGGWNGAAFLV3FJF/action/author_attestation","sign_citation":"https://pith.science/pith/UWS4KC6Z6OGRGGWNGAAFLV3FJF/action/citation_signature","submit_replication":"https://pith.science/pith/UWS4KC6Z6OGRGGWNGAAFLV3FJF/action/replication_record"}},"created_at":"2026-05-20T00:00:20.678705+00:00","updated_at":"2026-05-20T00:00:20.678705+00:00"}