{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:AMK2P2PINN2P6AQMPDLUQUI6XY","short_pith_number":"pith:AMK2P2PI","canonical_record":{"source":{"id":"1403.1288","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-05T22:42:23Z","cross_cats_sorted":["cs.CG","cs.DM"],"title_canon_sha256":"6881a7a507717f0f676c197d3b8f68ce10321888c2c9b6e565aff03fac4423a7","abstract_canon_sha256":"b984abc8423a8364eabd3d4acaa749c3cc7757e3fa4ab728806b472bcac4899a"},"schema_version":"1.0"},"canonical_sha256":"0315a7e9e86b74ff020c78d748511ebe0b97715068ff18c1bbccd2922b1248c5","source":{"kind":"arxiv","id":"1403.1288","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.1288","created_at":"2026-05-18T02:56:59Z"},{"alias_kind":"arxiv_version","alias_value":"1403.1288v1","created_at":"2026-05-18T02:56:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.1288","created_at":"2026-05-18T02:56:59Z"},{"alias_kind":"pith_short_12","alias_value":"AMK2P2PINN2P","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"AMK2P2PINN2P6AQM","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"AMK2P2PI","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:AMK2P2PINN2P6AQMPDLUQUI6XY","target":"record","payload":{"canonical_record":{"source":{"id":"1403.1288","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-05T22:42:23Z","cross_cats_sorted":["cs.CG","cs.DM"],"title_canon_sha256":"6881a7a507717f0f676c197d3b8f68ce10321888c2c9b6e565aff03fac4423a7","abstract_canon_sha256":"b984abc8423a8364eabd3d4acaa749c3cc7757e3fa4ab728806b472bcac4899a"},"schema_version":"1.0"},"canonical_sha256":"0315a7e9e86b74ff020c78d748511ebe0b97715068ff18c1bbccd2922b1248c5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:59.347272Z","signature_b64":"MBwkk9F5mxJMwjwyAjZdGeYv9mz+bB3l7ICs+GFn4W3qPqp1f1uWTpOeZpd/v6VieOVygy8QexV2J8M9G1UwDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0315a7e9e86b74ff020c78d748511ebe0b97715068ff18c1bbccd2922b1248c5","last_reissued_at":"2026-05-18T02:56:59.346607Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:59.346607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.1288","source_version":1,"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-18T02:56:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cNgyd57cenG2lyn5auKBZa5dfIkrbs0qit887hd/ghBq9cUyF1yXR+8GmzbbKKtdSwBkqFAAXTvMMRLLw2EHCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:19:35.576970Z"},"content_sha256":"3791bdd654f1cd4d8d7bdba05a7ea518bf5371f1c4fe51b6278a2ec509377914","schema_version":"1.0","event_id":"sha256:3791bdd654f1cd4d8d7bdba05a7ea518bf5371f1c4fe51b6278a2ec509377914"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:AMK2P2PINN2P6AQMPDLUQUI6XY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computational search of small point sets with small rectilinear crossing number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DM"],"primary_cat":"math.CO","authors_text":"Jorge L\\'opez, Ruy Fabila-Monroy","submitted_at":"2014-03-05T22:42:23Z","abstract_excerpt":"Let $\\crs(K_n)$ be the minimum number of crossings over all rectilinear drawings of the complete graph on $n$ vertices on the plane. In this paper we prove that $\\crs(K_n) < 0.380473\\binom{n}{4}+\\Theta(n^3)$; improving thus on the previous best known upper bound. This is done by obtaining new rectilinear drawings of $K_n$ for small values of $n$, and then using known constructions to obtain arbitrarily large good drawings from smaller ones. The \"small\" sets where found using a simple heuristic detailed in this paper."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.1288","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"},"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-18T02:56:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mrBnrAytDGDLuhh8jn93kWZCjODRYryJGDY4JbrdvC15UMPMb4tlzfGvw/TY55IiwUd7HSQGcHjOVCNNk/h1DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:19:35.577307Z"},"content_sha256":"1076ccdb2d3d00b936dba922bc05e28398364289d57b324df53609607ff979b5","schema_version":"1.0","event_id":"sha256:1076ccdb2d3d00b936dba922bc05e28398364289d57b324df53609607ff979b5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AMK2P2PINN2P6AQMPDLUQUI6XY/bundle.json","state_url":"https://pith.science/pith/AMK2P2PINN2P6AQMPDLUQUI6XY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AMK2P2PINN2P6AQMPDLUQUI6XY/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-06-03T03:19:35Z","links":{"resolver":"https://pith.science/pith/AMK2P2PINN2P6AQMPDLUQUI6XY","bundle":"https://pith.science/pith/AMK2P2PINN2P6AQMPDLUQUI6XY/bundle.json","state":"https://pith.science/pith/AMK2P2PINN2P6AQMPDLUQUI6XY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AMK2P2PINN2P6AQMPDLUQUI6XY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:AMK2P2PINN2P6AQMPDLUQUI6XY","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":"b984abc8423a8364eabd3d4acaa749c3cc7757e3fa4ab728806b472bcac4899a","cross_cats_sorted":["cs.CG","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-05T22:42:23Z","title_canon_sha256":"6881a7a507717f0f676c197d3b8f68ce10321888c2c9b6e565aff03fac4423a7"},"schema_version":"1.0","source":{"id":"1403.1288","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.1288","created_at":"2026-05-18T02:56:59Z"},{"alias_kind":"arxiv_version","alias_value":"1403.1288v1","created_at":"2026-05-18T02:56:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.1288","created_at":"2026-05-18T02:56:59Z"},{"alias_kind":"pith_short_12","alias_value":"AMK2P2PINN2P","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"AMK2P2PINN2P6AQM","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"AMK2P2PI","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:1076ccdb2d3d00b936dba922bc05e28398364289d57b324df53609607ff979b5","target":"graph","created_at":"2026-05-18T02:56:59Z","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":"Let $\\crs(K_n)$ be the minimum number of crossings over all rectilinear drawings of the complete graph on $n$ vertices on the plane. In this paper we prove that $\\crs(K_n) < 0.380473\\binom{n}{4}+\\Theta(n^3)$; improving thus on the previous best known upper bound. This is done by obtaining new rectilinear drawings of $K_n$ for small values of $n$, and then using known constructions to obtain arbitrarily large good drawings from smaller ones. The \"small\" sets where found using a simple heuristic detailed in this paper.","authors_text":"Jorge L\\'opez, Ruy Fabila-Monroy","cross_cats":["cs.CG","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-05T22:42:23Z","title":"Computational search of small point sets with small rectilinear crossing number"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.1288","kind":"arxiv","version":1},"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:3791bdd654f1cd4d8d7bdba05a7ea518bf5371f1c4fe51b6278a2ec509377914","target":"record","created_at":"2026-05-18T02:56:59Z","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":"b984abc8423a8364eabd3d4acaa749c3cc7757e3fa4ab728806b472bcac4899a","cross_cats_sorted":["cs.CG","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-05T22:42:23Z","title_canon_sha256":"6881a7a507717f0f676c197d3b8f68ce10321888c2c9b6e565aff03fac4423a7"},"schema_version":"1.0","source":{"id":"1403.1288","kind":"arxiv","version":1}},"canonical_sha256":"0315a7e9e86b74ff020c78d748511ebe0b97715068ff18c1bbccd2922b1248c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0315a7e9e86b74ff020c78d748511ebe0b97715068ff18c1bbccd2922b1248c5","first_computed_at":"2026-05-18T02:56:59.346607Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:56:59.346607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MBwkk9F5mxJMwjwyAjZdGeYv9mz+bB3l7ICs+GFn4W3qPqp1f1uWTpOeZpd/v6VieOVygy8QexV2J8M9G1UwDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:56:59.347272Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.1288","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3791bdd654f1cd4d8d7bdba05a7ea518bf5371f1c4fe51b6278a2ec509377914","sha256:1076ccdb2d3d00b936dba922bc05e28398364289d57b324df53609607ff979b5"],"state_sha256":"dac0f139dddb1c7eebcf2ebfb553eba19b2e17075e284a711f09bde906bdd37f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UvGQkbZqQHza7qrkHeuqkRRAEAiqlIaPESErgQBeD60XpBCMpnyrFoqNR9PpApaGeJrJfXQ/fHlu+DejIxHFBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T03:19:35.579328Z","bundle_sha256":"fc66a1842cdde4288a8c0e3f12f01fb03cbd93a9f8d2417721a613926666afa5"}}