{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:HGB4FHNGW4BYLD2W2WCGC7YTIM","short_pith_number":"pith:HGB4FHNG","schema_version":"1.0","canonical_sha256":"3983c29da6b703858f56d584617f1343072566a05fb254255b0d789bfdfb7cc1","source":{"kind":"arxiv","id":"1309.0395","version":3},"attestation_state":"computed","paper":{"title":"New bounds on the maximum number of edges in $k$-quasi-planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"Andrew Suk, Bartosz Walczak","submitted_at":"2013-09-02T13:06:38Z","abstract_excerpt":"A topological graph is $k$-quasi-planar if it does not contain $k$ pairwise crossing edges. A 20-year-old conjecture asserts that for every fixed $k$, the maximum number of edges in a $k$-quasi-planar graph on $n$ vertices is $O(n)$. Fox and Pach showed that every $k$-quasi-planar graph with $n$ vertices has at most $n(\\log n)^{O(\\log k)}$ edges. We improve this upper bound to $2^{\\alpha(n)^c}n\\log n$, where $\\alpha(n)$ denotes the inverse Ackermann function and $c$ depends only on $k$, for $k$-quasi-planar graphs in which any two edges intersect in a bounded number of points. We also show tha"},"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":"1309.0395","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-02T13:06:38Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"f003ff271a58b76a0a4db5477545bd18da5c5874ec1f20eaae3e6d222a87a3ff","abstract_canon_sha256":"825dfd5acd090d282249e47f6826a8f1a199112dccc48a9578c84bb2242e7dcb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:49.548142Z","signature_b64":"Ut9kpssvjn5rWH8/oA7KS29XpoIcaN8hSNLBM2cskwIu/e6y6H9uSbAkHGYsEuPLLL5JJ2fheEvNe30v4cRxDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3983c29da6b703858f56d584617f1343072566a05fb254255b0d789bfdfb7cc1","last_reissued_at":"2026-05-18T01:21:49.547457Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:49.547457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New bounds on the maximum number of edges in $k$-quasi-planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"Andrew Suk, Bartosz Walczak","submitted_at":"2013-09-02T13:06:38Z","abstract_excerpt":"A topological graph is $k$-quasi-planar if it does not contain $k$ pairwise crossing edges. A 20-year-old conjecture asserts that for every fixed $k$, the maximum number of edges in a $k$-quasi-planar graph on $n$ vertices is $O(n)$. Fox and Pach showed that every $k$-quasi-planar graph with $n$ vertices has at most $n(\\log n)^{O(\\log k)}$ edges. We improve this upper bound to $2^{\\alpha(n)^c}n\\log n$, where $\\alpha(n)$ denotes the inverse Ackermann function and $c$ depends only on $k$, for $k$-quasi-planar graphs in which any two edges intersect in a bounded number of points. We also show tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.0395","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":"1309.0395","created_at":"2026-05-18T01:21:49.547587+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.0395v3","created_at":"2026-05-18T01:21:49.547587+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.0395","created_at":"2026-05-18T01:21:49.547587+00:00"},{"alias_kind":"pith_short_12","alias_value":"HGB4FHNGW4BY","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"HGB4FHNGW4BYLD2W","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"HGB4FHNG","created_at":"2026-05-18T12:27:46.883200+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/HGB4FHNGW4BYLD2W2WCGC7YTIM","json":"https://pith.science/pith/HGB4FHNGW4BYLD2W2WCGC7YTIM.json","graph_json":"https://pith.science/api/pith-number/HGB4FHNGW4BYLD2W2WCGC7YTIM/graph.json","events_json":"https://pith.science/api/pith-number/HGB4FHNGW4BYLD2W2WCGC7YTIM/events.json","paper":"https://pith.science/paper/HGB4FHNG"},"agent_actions":{"view_html":"https://pith.science/pith/HGB4FHNGW4BYLD2W2WCGC7YTIM","download_json":"https://pith.science/pith/HGB4FHNGW4BYLD2W2WCGC7YTIM.json","view_paper":"https://pith.science/paper/HGB4FHNG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.0395&json=true","fetch_graph":"https://pith.science/api/pith-number/HGB4FHNGW4BYLD2W2WCGC7YTIM/graph.json","fetch_events":"https://pith.science/api/pith-number/HGB4FHNGW4BYLD2W2WCGC7YTIM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HGB4FHNGW4BYLD2W2WCGC7YTIM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HGB4FHNGW4BYLD2W2WCGC7YTIM/action/storage_attestation","attest_author":"https://pith.science/pith/HGB4FHNGW4BYLD2W2WCGC7YTIM/action/author_attestation","sign_citation":"https://pith.science/pith/HGB4FHNGW4BYLD2W2WCGC7YTIM/action/citation_signature","submit_replication":"https://pith.science/pith/HGB4FHNGW4BYLD2W2WCGC7YTIM/action/replication_record"}},"created_at":"2026-05-18T01:21:49.547587+00:00","updated_at":"2026-05-18T01:21:49.547587+00:00"}