{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:AVUPJFW6LXQ6JPYTUOAI5E24XK","short_pith_number":"pith:AVUPJFW6","canonical_record":{"source":{"id":"1509.01932","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-07T07:24:05Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"6af2b70e5743b764cb118bf47c10370257dd81151292b438d9a092cee4d419dc","abstract_canon_sha256":"45c83cb8560a418d45a364d5b03dca47e59395aebb4e4e508cf43dee69bd5c76"},"schema_version":"1.0"},"canonical_sha256":"0568f496de5de1e4bf13a3808e935cbabf28d75c96bf8f0d22ecc0a76e2d769c","source":{"kind":"arxiv","id":"1509.01932","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.01932","created_at":"2026-05-17T23:50:39Z"},{"alias_kind":"arxiv_version","alias_value":"1509.01932v2","created_at":"2026-05-17T23:50:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.01932","created_at":"2026-05-17T23:50:39Z"},{"alias_kind":"pith_short_12","alias_value":"AVUPJFW6LXQ6","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"AVUPJFW6LXQ6JPYT","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"AVUPJFW6","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:AVUPJFW6LXQ6JPYTUOAI5E24XK","target":"record","payload":{"canonical_record":{"source":{"id":"1509.01932","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-07T07:24:05Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"6af2b70e5743b764cb118bf47c10370257dd81151292b438d9a092cee4d419dc","abstract_canon_sha256":"45c83cb8560a418d45a364d5b03dca47e59395aebb4e4e508cf43dee69bd5c76"},"schema_version":"1.0"},"canonical_sha256":"0568f496de5de1e4bf13a3808e935cbabf28d75c96bf8f0d22ecc0a76e2d769c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:39.025299Z","signature_b64":"LpT9M1C+5f/avMiYYN8t3QEWcNxQEtCBaTpTwWVIiiljuBFOt9Lr+8CLaWVgs6uJlGodcFZp1S2MD8h9BgzKBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0568f496de5de1e4bf13a3808e935cbabf28d75c96bf8f0d22ecc0a76e2d769c","last_reissued_at":"2026-05-17T23:50:39.024802Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:39.024802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.01932","source_version":2,"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-17T23:50:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1AW9AMIptIFCLgMqQn4O509ScxrCxnQMekn0GsELHI1ROjTKJa3hlyJ2gDYODERnMSxSg2RxDPutko6jOOviAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:57:30.648117Z"},"content_sha256":"2af8fa53cda2ce74613b331942b7c8860834d31853c1f9b484c060e009bbe818","schema_version":"1.0","event_id":"sha256:2af8fa53cda2ce74613b331942b7c8860834d31853c1f9b484c060e009bbe818"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:AVUPJFW6LXQ6JPYTUOAI5E24XK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On topological graphs with at most four crossings per edge","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"Eyal Ackerman","submitted_at":"2015-09-07T07:24:05Z","abstract_excerpt":"We show that if a graph $G$ with $n \\geq 3$ vertices can be drawn in the plane such that each of its edges is involved in at most four crossings, then $G$ has at most $6n-12$ edges. This settles a conjecture of Pach, Radoi\\v{c}i\\'{c}, Tardos, and T\\'oth, and yields a better bound for the famous Crossing Lemma: The crossing number, $\\mbox{cr}(G)$, of a (not too sparse) graph $G$ with $n$ vertices and $m$ edges is at least $c\\frac{m^3}{n^2}$, where $c > 1/29$. This bound is known to be tight, apart from the constant $c$ for which the previous best lower bound was $1/31.1$. As another corollary w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.01932","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":""},"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-17T23:50:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O+3eAiTouYYCUfzmF1f2/A6kfmCt7a4WVYYS27iYPDvhcU8F4DuIzFFvue/W9qHKPvWFmQ/OohCaIMA6jjhNDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:57:30.648489Z"},"content_sha256":"002b96f8c4cc5f2bcc79475672401f46d2771201495d81952340ccaa97deee99","schema_version":"1.0","event_id":"sha256:002b96f8c4cc5f2bcc79475672401f46d2771201495d81952340ccaa97deee99"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AVUPJFW6LXQ6JPYTUOAI5E24XK/bundle.json","state_url":"https://pith.science/pith/AVUPJFW6LXQ6JPYTUOAI5E24XK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AVUPJFW6LXQ6JPYTUOAI5E24XK/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-05-28T07:57:30Z","links":{"resolver":"https://pith.science/pith/AVUPJFW6LXQ6JPYTUOAI5E24XK","bundle":"https://pith.science/pith/AVUPJFW6LXQ6JPYTUOAI5E24XK/bundle.json","state":"https://pith.science/pith/AVUPJFW6LXQ6JPYTUOAI5E24XK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AVUPJFW6LXQ6JPYTUOAI5E24XK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:AVUPJFW6LXQ6JPYTUOAI5E24XK","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":"45c83cb8560a418d45a364d5b03dca47e59395aebb4e4e508cf43dee69bd5c76","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-07T07:24:05Z","title_canon_sha256":"6af2b70e5743b764cb118bf47c10370257dd81151292b438d9a092cee4d419dc"},"schema_version":"1.0","source":{"id":"1509.01932","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.01932","created_at":"2026-05-17T23:50:39Z"},{"alias_kind":"arxiv_version","alias_value":"1509.01932v2","created_at":"2026-05-17T23:50:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.01932","created_at":"2026-05-17T23:50:39Z"},{"alias_kind":"pith_short_12","alias_value":"AVUPJFW6LXQ6","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"AVUPJFW6LXQ6JPYT","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"AVUPJFW6","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:002b96f8c4cc5f2bcc79475672401f46d2771201495d81952340ccaa97deee99","target":"graph","created_at":"2026-05-17T23:50:39Z","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":"We show that if a graph $G$ with $n \\geq 3$ vertices can be drawn in the plane such that each of its edges is involved in at most four crossings, then $G$ has at most $6n-12$ edges. This settles a conjecture of Pach, Radoi\\v{c}i\\'{c}, Tardos, and T\\'oth, and yields a better bound for the famous Crossing Lemma: The crossing number, $\\mbox{cr}(G)$, of a (not too sparse) graph $G$ with $n$ vertices and $m$ edges is at least $c\\frac{m^3}{n^2}$, where $c > 1/29$. This bound is known to be tight, apart from the constant $c$ for which the previous best lower bound was $1/31.1$. As another corollary w","authors_text":"Eyal Ackerman","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-07T07:24:05Z","title":"On topological graphs with at most four crossings per edge"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.01932","kind":"arxiv","version":2},"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:2af8fa53cda2ce74613b331942b7c8860834d31853c1f9b484c060e009bbe818","target":"record","created_at":"2026-05-17T23:50:39Z","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":"45c83cb8560a418d45a364d5b03dca47e59395aebb4e4e508cf43dee69bd5c76","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-07T07:24:05Z","title_canon_sha256":"6af2b70e5743b764cb118bf47c10370257dd81151292b438d9a092cee4d419dc"},"schema_version":"1.0","source":{"id":"1509.01932","kind":"arxiv","version":2}},"canonical_sha256":"0568f496de5de1e4bf13a3808e935cbabf28d75c96bf8f0d22ecc0a76e2d769c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0568f496de5de1e4bf13a3808e935cbabf28d75c96bf8f0d22ecc0a76e2d769c","first_computed_at":"2026-05-17T23:50:39.024802Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:39.024802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LpT9M1C+5f/avMiYYN8t3QEWcNxQEtCBaTpTwWVIiiljuBFOt9Lr+8CLaWVgs6uJlGodcFZp1S2MD8h9BgzKBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:39.025299Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.01932","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2af8fa53cda2ce74613b331942b7c8860834d31853c1f9b484c060e009bbe818","sha256:002b96f8c4cc5f2bcc79475672401f46d2771201495d81952340ccaa97deee99"],"state_sha256":"2244ae4a40680d8576b5fca8eb946f47903ec6626e2999896de4c6a8be3d1595"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0wfCsSQATTXZPjgy/o9uKje+N9Ny+DSMaqmqLDBSlyqQm7gyzhHDVCfF1yi51SsIdtnOVEOzz1WwaCCTdr9uCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T07:57:30.650466Z","bundle_sha256":"b69f1766a410f07f744b9f277690c12f0230b8f7f5eaaa65dfafaab60086e944"}}