{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:DS4EQNKNF3YYGZIAR7JM7QC3NY","short_pith_number":"pith:DS4EQNKN","schema_version":"1.0","canonical_sha256":"1cb848354d2ef18365008fd2cfc05b6e03fdd4b018076e4020f83bf9c9773983","source":{"kind":"arxiv","id":"1301.0303","version":2},"attestation_state":"computed","paper":{"title":"Crossings in Grid Drawings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"Adam Sheffer, Pat Morin, Vida Dujmovic","submitted_at":"2013-01-02T20:03:33Z","abstract_excerpt":"We prove crossing number inequalities for geometric graphs whose vertex sets are taken from a d-dimensional grid of volume N and give applications of these inequalities to counting the number of non-crossing geometric graphs that can be drawn on such grids.\n  In particular, we show that any geometric graph with m >= 8N edges and with vertices on a 3D integer grid of volume N, has \\Omega((m^2/n)\\log(m/n)) crossings. In d-dimensions, with d >= 4, this bound becomes \\Omega(m^2/n). We provide matching upper bounds for all d. Finally, for d >= 4 the upper bound implies that the maximum number of cr"},"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":"1301.0303","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-02T20:03:33Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"86725cf49404c48d41f74b4168b2405abf52e70d1d09a35ac35e5568b77bb26b","abstract_canon_sha256":"dda7c703f255ff96daaa255255c766e5eb043e341a5f16a65b3835c039d12160"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:53.559790Z","signature_b64":"Br3T8EVSmrK06eSmXk/isiobS+w0DT67elQ1C+bzekhXbRiJ8zttN2IdN+l3CC7T3gwDSddN2gRtqjHsJSv+BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1cb848354d2ef18365008fd2cfc05b6e03fdd4b018076e4020f83bf9c9773983","last_reissued_at":"2026-05-18T03:35:53.559140Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:53.559140Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Crossings in Grid Drawings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"Adam Sheffer, Pat Morin, Vida Dujmovic","submitted_at":"2013-01-02T20:03:33Z","abstract_excerpt":"We prove crossing number inequalities for geometric graphs whose vertex sets are taken from a d-dimensional grid of volume N and give applications of these inequalities to counting the number of non-crossing geometric graphs that can be drawn on such grids.\n  In particular, we show that any geometric graph with m >= 8N edges and with vertices on a 3D integer grid of volume N, has \\Omega((m^2/n)\\log(m/n)) crossings. In d-dimensions, with d >= 4, this bound becomes \\Omega(m^2/n). We provide matching upper bounds for all d. Finally, for d >= 4 the upper bound implies that the maximum number of cr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0303","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1301.0303","created_at":"2026-05-18T03:35:53.559248+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.0303v2","created_at":"2026-05-18T03:35:53.559248+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0303","created_at":"2026-05-18T03:35:53.559248+00:00"},{"alias_kind":"pith_short_12","alias_value":"DS4EQNKNF3YY","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"DS4EQNKNF3YYGZIA","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"DS4EQNKN","created_at":"2026-05-18T12:27:43.054852+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/DS4EQNKNF3YYGZIAR7JM7QC3NY","json":"https://pith.science/pith/DS4EQNKNF3YYGZIAR7JM7QC3NY.json","graph_json":"https://pith.science/api/pith-number/DS4EQNKNF3YYGZIAR7JM7QC3NY/graph.json","events_json":"https://pith.science/api/pith-number/DS4EQNKNF3YYGZIAR7JM7QC3NY/events.json","paper":"https://pith.science/paper/DS4EQNKN"},"agent_actions":{"view_html":"https://pith.science/pith/DS4EQNKNF3YYGZIAR7JM7QC3NY","download_json":"https://pith.science/pith/DS4EQNKNF3YYGZIAR7JM7QC3NY.json","view_paper":"https://pith.science/paper/DS4EQNKN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.0303&json=true","fetch_graph":"https://pith.science/api/pith-number/DS4EQNKNF3YYGZIAR7JM7QC3NY/graph.json","fetch_events":"https://pith.science/api/pith-number/DS4EQNKNF3YYGZIAR7JM7QC3NY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DS4EQNKNF3YYGZIAR7JM7QC3NY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DS4EQNKNF3YYGZIAR7JM7QC3NY/action/storage_attestation","attest_author":"https://pith.science/pith/DS4EQNKNF3YYGZIAR7JM7QC3NY/action/author_attestation","sign_citation":"https://pith.science/pith/DS4EQNKNF3YYGZIAR7JM7QC3NY/action/citation_signature","submit_replication":"https://pith.science/pith/DS4EQNKNF3YYGZIAR7JM7QC3NY/action/replication_record"}},"created_at":"2026-05-18T03:35:53.559248+00:00","updated_at":"2026-05-18T03:35:53.559248+00:00"}