{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:DS4EQNKNF3YYGZIAR7JM7QC3NY","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":"dda7c703f255ff96daaa255255c766e5eb043e341a5f16a65b3835c039d12160","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-02T20:03:33Z","title_canon_sha256":"86725cf49404c48d41f74b4168b2405abf52e70d1d09a35ac35e5568b77bb26b"},"schema_version":"1.0","source":{"id":"1301.0303","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.0303","created_at":"2026-05-18T03:35:53Z"},{"alias_kind":"arxiv_version","alias_value":"1301.0303v2","created_at":"2026-05-18T03:35:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0303","created_at":"2026-05-18T03:35:53Z"},{"alias_kind":"pith_short_12","alias_value":"DS4EQNKNF3YY","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DS4EQNKNF3YYGZIA","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DS4EQNKN","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:f405faeea5b9715f2c58bda0756724b5b442b85758b753d6fab508fb36a87ced","target":"graph","created_at":"2026-05-18T03:35:53Z","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 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","authors_text":"Adam Sheffer, Pat Morin, Vida Dujmovic","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-02T20:03:33Z","title":"Crossings in Grid Drawings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0303","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:bc9a22087197c38092656f8677f52c8c6a3ca2f793e213245c65fc3fe3232d79","target":"record","created_at":"2026-05-18T03:35:53Z","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":"dda7c703f255ff96daaa255255c766e5eb043e341a5f16a65b3835c039d12160","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-02T20:03:33Z","title_canon_sha256":"86725cf49404c48d41f74b4168b2405abf52e70d1d09a35ac35e5568b77bb26b"},"schema_version":"1.0","source":{"id":"1301.0303","kind":"arxiv","version":2}},"canonical_sha256":"1cb848354d2ef18365008fd2cfc05b6e03fdd4b018076e4020f83bf9c9773983","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1cb848354d2ef18365008fd2cfc05b6e03fdd4b018076e4020f83bf9c9773983","first_computed_at":"2026-05-18T03:35:53.559140Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:35:53.559140Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Br3T8EVSmrK06eSmXk/isiobS+w0DT67elQ1C+bzekhXbRiJ8zttN2IdN+l3CC7T3gwDSddN2gRtqjHsJSv+BA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:35:53.559790Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.0303","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc9a22087197c38092656f8677f52c8c6a3ca2f793e213245c65fc3fe3232d79","sha256:f405faeea5b9715f2c58bda0756724b5b442b85758b753d6fab508fb36a87ced"],"state_sha256":"6278f20289dbf9be8343a69898106c92267e323c2917c28bed22bd6370769612"}