{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:HGB4FHNGW4BYLD2W2WCGC7YTIM","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":"825dfd5acd090d282249e47f6826a8f1a199112dccc48a9578c84bb2242e7dcb","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-02T13:06:38Z","title_canon_sha256":"f003ff271a58b76a0a4db5477545bd18da5c5874ec1f20eaae3e6d222a87a3ff"},"schema_version":"1.0","source":{"id":"1309.0395","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.0395","created_at":"2026-05-18T01:21:49Z"},{"alias_kind":"arxiv_version","alias_value":"1309.0395v3","created_at":"2026-05-18T01:21:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.0395","created_at":"2026-05-18T01:21:49Z"},{"alias_kind":"pith_short_12","alias_value":"HGB4FHNGW4BY","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HGB4FHNGW4BYLD2W","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HGB4FHNG","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:4283547c6608c16314b602b1c8416a0981a9066073cc3dfb54e9b63e6bf1451e","target":"graph","created_at":"2026-05-18T01:21:49Z","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 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","authors_text":"Andrew Suk, Bartosz Walczak","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-02T13:06:38Z","title":"New bounds on the maximum number of edges in $k$-quasi-planar graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.0395","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:aaeb376aa9365b0277d682e70508489a991b253ac52ec8e44a39fd6db9e98b79","target":"record","created_at":"2026-05-18T01:21:49Z","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":"825dfd5acd090d282249e47f6826a8f1a199112dccc48a9578c84bb2242e7dcb","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-02T13:06:38Z","title_canon_sha256":"f003ff271a58b76a0a4db5477545bd18da5c5874ec1f20eaae3e6d222a87a3ff"},"schema_version":"1.0","source":{"id":"1309.0395","kind":"arxiv","version":3}},"canonical_sha256":"3983c29da6b703858f56d584617f1343072566a05fb254255b0d789bfdfb7cc1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3983c29da6b703858f56d584617f1343072566a05fb254255b0d789bfdfb7cc1","first_computed_at":"2026-05-18T01:21:49.547457Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:49.547457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ut9kpssvjn5rWH8/oA7KS29XpoIcaN8hSNLBM2cskwIu/e6y6H9uSbAkHGYsEuPLLL5JJ2fheEvNe30v4cRxDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:49.548142Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.0395","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aaeb376aa9365b0277d682e70508489a991b253ac52ec8e44a39fd6db9e98b79","sha256:4283547c6608c16314b602b1c8416a0981a9066073cc3dfb54e9b63e6bf1451e"],"state_sha256":"afa76a0298d6d052203be1885a4a1f2768d8898333c989068ea45a0f9fa05266"}