{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2000:V4KD2DHXPLXUJ5HVLQNZSCVP4H","short_pith_number":"pith:V4KD2DHX","schema_version":"1.0","canonical_sha256":"af143d0cf77aef44f4f55c1b990aafe1e53f49afe0d7f9738bb2026d4b0d9ac8","source":{"kind":"arxiv","id":"cs/0009023","version":1},"attestation_state":"computed","paper":{"title":"The Rectilinear Crossing Number of K_10 is 62","license":"","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Alex Brodsky, Ellen Gethner, Stephane Durocher","submitted_at":"2000-09-22T19:16:48Z","abstract_excerpt":"A drawing of a graph G in the plane is said to be a rectilinear drawing of G if the edges are required to be line segments (as opposed to Jordan curves). We assume no three vertices are collinear. The rectilinear crossing number of G is the fewest number of edge crossings attainable over all rectilinear drawings of G. Thanks to Richard Guy, exact values of the rectilinear crossing number of K_n, the complete graph on n vertices, for n = 3,...,9, are known (Guy 1972, White and Beinke 1978, Finch 2000, Sloanes A014540). Since 1971, thanks to the work of David Singer (1971, Gardiner 1986), the re"},"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":"cs/0009023","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.DM","submitted_at":"2000-09-22T19:16:48Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"154c643eeb82f9e8d886e4801211c40b50b4427af34886aabbfa8498f2bf2846","abstract_canon_sha256":"4ec78a25c4194d53b4ef4aff3bf1456ad2044f8f1680d1defc34018b2360a340"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:11:49.836287Z","signature_b64":"uw0VyXUwaZ3EFEPKZC4/ZKwsebzE87edkW5aJqE48So8DDcQNmH2r9to3N76tc8BJ3U4b3rl9wsMq9JpvwhkAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af143d0cf77aef44f4f55c1b990aafe1e53f49afe0d7f9738bb2026d4b0d9ac8","last_reissued_at":"2026-05-18T04:11:49.835623Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:11:49.835623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Rectilinear Crossing Number of K_10 is 62","license":"","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Alex Brodsky, Ellen Gethner, Stephane Durocher","submitted_at":"2000-09-22T19:16:48Z","abstract_excerpt":"A drawing of a graph G in the plane is said to be a rectilinear drawing of G if the edges are required to be line segments (as opposed to Jordan curves). We assume no three vertices are collinear. The rectilinear crossing number of G is the fewest number of edge crossings attainable over all rectilinear drawings of G. Thanks to Richard Guy, exact values of the rectilinear crossing number of K_n, the complete graph on n vertices, for n = 3,...,9, are known (Guy 1972, White and Beinke 1978, Finch 2000, Sloanes A014540). Since 1971, thanks to the work of David Singer (1971, Gardiner 1986), the re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0009023","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":"cs/0009023","created_at":"2026-05-18T04:11:49.835739+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0009023v1","created_at":"2026-05-18T04:11:49.835739+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0009023","created_at":"2026-05-18T04:11:49.835739+00:00"},{"alias_kind":"pith_short_12","alias_value":"V4KD2DHXPLXU","created_at":"2026-05-18T12:25:50.254431+00:00"},{"alias_kind":"pith_short_16","alias_value":"V4KD2DHXPLXUJ5HV","created_at":"2026-05-18T12:25:50.254431+00:00"},{"alias_kind":"pith_short_8","alias_value":"V4KD2DHX","created_at":"2026-05-18T12:25:50.254431+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/V4KD2DHXPLXUJ5HVLQNZSCVP4H","json":"https://pith.science/pith/V4KD2DHXPLXUJ5HVLQNZSCVP4H.json","graph_json":"https://pith.science/api/pith-number/V4KD2DHXPLXUJ5HVLQNZSCVP4H/graph.json","events_json":"https://pith.science/api/pith-number/V4KD2DHXPLXUJ5HVLQNZSCVP4H/events.json","paper":"https://pith.science/paper/V4KD2DHX"},"agent_actions":{"view_html":"https://pith.science/pith/V4KD2DHXPLXUJ5HVLQNZSCVP4H","download_json":"https://pith.science/pith/V4KD2DHXPLXUJ5HVLQNZSCVP4H.json","view_paper":"https://pith.science/paper/V4KD2DHX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0009023&json=true","fetch_graph":"https://pith.science/api/pith-number/V4KD2DHXPLXUJ5HVLQNZSCVP4H/graph.json","fetch_events":"https://pith.science/api/pith-number/V4KD2DHXPLXUJ5HVLQNZSCVP4H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V4KD2DHXPLXUJ5HVLQNZSCVP4H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V4KD2DHXPLXUJ5HVLQNZSCVP4H/action/storage_attestation","attest_author":"https://pith.science/pith/V4KD2DHXPLXUJ5HVLQNZSCVP4H/action/author_attestation","sign_citation":"https://pith.science/pith/V4KD2DHXPLXUJ5HVLQNZSCVP4H/action/citation_signature","submit_replication":"https://pith.science/pith/V4KD2DHXPLXUJ5HVLQNZSCVP4H/action/replication_record"}},"created_at":"2026-05-18T04:11:49.835739+00:00","updated_at":"2026-05-18T04:11:49.835739+00:00"}