{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:Y46ESOXDDN4TNK6IRX6F7T5WWD","short_pith_number":"pith:Y46ESOXD","schema_version":"1.0","canonical_sha256":"c73c493ae31b7936abc88dfc5fcfb6b0dcd3733ef9d4a1e014d3a7874d493d30","source":{"kind":"arxiv","id":"1709.08136","version":1},"attestation_state":"computed","paper":{"title":"The k-planar crossing number of random graphs and random regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Arran Hamm, John Asplund, Laszlo Szekely, Libby Taylor, Thao Do, Zhiyu Wang","submitted_at":"2017-09-24T01:45:10Z","abstract_excerpt":"We give an explicit extension of Spencer's result on the biplanar crossing number of the Erdos-Renyi random graph $G(n,p)$. In particular, we show that the k-planar crossing number of $G(n,p)$ is almost surely $\\Omega((n^2p)^2)$. Along the same lines, we prove that for any fixed $k$, the $k$-planar crossing number of various models of random $d$-regular graphs is $\\Omega ((dn)^2)$ for $d > c_0$ for some constant $c_0=c_0(k)$."},"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":"1709.08136","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-24T01:45:10Z","cross_cats_sorted":[],"title_canon_sha256":"b2dff9f7894923193f5d9db13ee0a154dce437bcb9d8ee5618acbec0f116a193","abstract_canon_sha256":"b8eee2ef853934eb8249c092c5eb34a1dfd6e13db35957ac64f0b641814c1115"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:27.869829Z","signature_b64":"MDf9Z8wBIbz4IzGocGlcY1UK1pay6K7aCii702TWdE2tAq5ZV7E1+F/fCCtFF9zprOMCMoclOtH/jrFKixjoBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c73c493ae31b7936abc88dfc5fcfb6b0dcd3733ef9d4a1e014d3a7874d493d30","last_reissued_at":"2026-05-18T00:34:27.869332Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:27.869332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The k-planar crossing number of random graphs and random regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Arran Hamm, John Asplund, Laszlo Szekely, Libby Taylor, Thao Do, Zhiyu Wang","submitted_at":"2017-09-24T01:45:10Z","abstract_excerpt":"We give an explicit extension of Spencer's result on the biplanar crossing number of the Erdos-Renyi random graph $G(n,p)$. In particular, we show that the k-planar crossing number of $G(n,p)$ is almost surely $\\Omega((n^2p)^2)$. Along the same lines, we prove that for any fixed $k$, the $k$-planar crossing number of various models of random $d$-regular graphs is $\\Omega ((dn)^2)$ for $d > c_0$ for some constant $c_0=c_0(k)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.08136","kind":"arxiv","version":1},"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":"1709.08136","created_at":"2026-05-18T00:34:27.869412+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.08136v1","created_at":"2026-05-18T00:34:27.869412+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.08136","created_at":"2026-05-18T00:34:27.869412+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y46ESOXDDN4T","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y46ESOXDDN4TNK6I","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y46ESOXD","created_at":"2026-05-18T12:31:56.362134+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/Y46ESOXDDN4TNK6IRX6F7T5WWD","json":"https://pith.science/pith/Y46ESOXDDN4TNK6IRX6F7T5WWD.json","graph_json":"https://pith.science/api/pith-number/Y46ESOXDDN4TNK6IRX6F7T5WWD/graph.json","events_json":"https://pith.science/api/pith-number/Y46ESOXDDN4TNK6IRX6F7T5WWD/events.json","paper":"https://pith.science/paper/Y46ESOXD"},"agent_actions":{"view_html":"https://pith.science/pith/Y46ESOXDDN4TNK6IRX6F7T5WWD","download_json":"https://pith.science/pith/Y46ESOXDDN4TNK6IRX6F7T5WWD.json","view_paper":"https://pith.science/paper/Y46ESOXD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.08136&json=true","fetch_graph":"https://pith.science/api/pith-number/Y46ESOXDDN4TNK6IRX6F7T5WWD/graph.json","fetch_events":"https://pith.science/api/pith-number/Y46ESOXDDN4TNK6IRX6F7T5WWD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y46ESOXDDN4TNK6IRX6F7T5WWD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y46ESOXDDN4TNK6IRX6F7T5WWD/action/storage_attestation","attest_author":"https://pith.science/pith/Y46ESOXDDN4TNK6IRX6F7T5WWD/action/author_attestation","sign_citation":"https://pith.science/pith/Y46ESOXDDN4TNK6IRX6F7T5WWD/action/citation_signature","submit_replication":"https://pith.science/pith/Y46ESOXDDN4TNK6IRX6F7T5WWD/action/replication_record"}},"created_at":"2026-05-18T00:34:27.869412+00:00","updated_at":"2026-05-18T00:34:27.869412+00:00"}