{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2000:HFOIDZ4FUPMPKAXBXBG4QLNDBC","short_pith_number":"pith:HFOIDZ4F","schema_version":"1.0","canonical_sha256":"395c81e785a3d8f502e1b84dc82da308afeb61c9c4540994b19251c5cdfd096e","source":{"kind":"arxiv","id":"cs/0009028","version":1},"attestation_state":"computed","paper":{"title":"Toward the Rectilinear Crossing Number of $K_n$: New Drawings, Upper Bounds, and Asymptotics","license":"","headline":"","cross_cats":["cs.CG","math.CO"],"primary_cat":"cs.DM","authors_text":"Alex Brodsky, Ellen Gethner, Stephane Durocher","submitted_at":"2000-09-28T16:33:06Z","abstract_excerpt":"Scheinerman and Wilf (1994) assert that `an important open problem in the study of graph embeddings is to determine the rectilinear crossing number of the complete graph K_n.' A rectilinear drawing of K_n is an arrangement of n vertices in the plane, every pair of which is connected by an edge that is a line segment. We assume that no three vertices are collinear, and that no three edges intersect in a point unless that point is an endpoint of all three. The rectilinear crossing number of K_n is the fewest number of edge crossings attainable over all rectilinear drawings of K_n.\n  For each n w"},"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/0009028","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.DM","submitted_at":"2000-09-28T16:33:06Z","cross_cats_sorted":["cs.CG","math.CO"],"title_canon_sha256":"925efa9ec30c25181892eb99a9b400065ae4cfbe1670e892af6ea2067e68cd19","abstract_canon_sha256":"4af3a19b468bd1cdb12de7bd64bf53f5093ae52c64a6d886ea0ea304d22b7656"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:11:49.824933Z","signature_b64":"g4P3n10neGetfI6q6gaM4I4XB9iNPT79W+7AeDZrZV/hyxcULs5bHyse1nD7UEw09hCIAV5tCt0cXV1YQqj+CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"395c81e785a3d8f502e1b84dc82da308afeb61c9c4540994b19251c5cdfd096e","last_reissued_at":"2026-05-18T04:11:49.824055Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:11:49.824055Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Toward the Rectilinear Crossing Number of $K_n$: New Drawings, Upper Bounds, and Asymptotics","license":"","headline":"","cross_cats":["cs.CG","math.CO"],"primary_cat":"cs.DM","authors_text":"Alex Brodsky, Ellen Gethner, Stephane Durocher","submitted_at":"2000-09-28T16:33:06Z","abstract_excerpt":"Scheinerman and Wilf (1994) assert that `an important open problem in the study of graph embeddings is to determine the rectilinear crossing number of the complete graph K_n.' A rectilinear drawing of K_n is an arrangement of n vertices in the plane, every pair of which is connected by an edge that is a line segment. We assume that no three vertices are collinear, and that no three edges intersect in a point unless that point is an endpoint of all three. The rectilinear crossing number of K_n is the fewest number of edge crossings attainable over all rectilinear drawings of K_n.\n  For each n w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0009028","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/0009028","created_at":"2026-05-18T04:11:49.824180+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0009028v1","created_at":"2026-05-18T04:11:49.824180+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0009028","created_at":"2026-05-18T04:11:49.824180+00:00"},{"alias_kind":"pith_short_12","alias_value":"HFOIDZ4FUPMP","created_at":"2026-05-18T12:25:49.631198+00:00"},{"alias_kind":"pith_short_16","alias_value":"HFOIDZ4FUPMPKAXB","created_at":"2026-05-18T12:25:49.631198+00:00"},{"alias_kind":"pith_short_8","alias_value":"HFOIDZ4F","created_at":"2026-05-18T12:25:49.631198+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/HFOIDZ4FUPMPKAXBXBG4QLNDBC","json":"https://pith.science/pith/HFOIDZ4FUPMPKAXBXBG4QLNDBC.json","graph_json":"https://pith.science/api/pith-number/HFOIDZ4FUPMPKAXBXBG4QLNDBC/graph.json","events_json":"https://pith.science/api/pith-number/HFOIDZ4FUPMPKAXBXBG4QLNDBC/events.json","paper":"https://pith.science/paper/HFOIDZ4F"},"agent_actions":{"view_html":"https://pith.science/pith/HFOIDZ4FUPMPKAXBXBG4QLNDBC","download_json":"https://pith.science/pith/HFOIDZ4FUPMPKAXBXBG4QLNDBC.json","view_paper":"https://pith.science/paper/HFOIDZ4F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0009028&json=true","fetch_graph":"https://pith.science/api/pith-number/HFOIDZ4FUPMPKAXBXBG4QLNDBC/graph.json","fetch_events":"https://pith.science/api/pith-number/HFOIDZ4FUPMPKAXBXBG4QLNDBC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HFOIDZ4FUPMPKAXBXBG4QLNDBC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HFOIDZ4FUPMPKAXBXBG4QLNDBC/action/storage_attestation","attest_author":"https://pith.science/pith/HFOIDZ4FUPMPKAXBXBG4QLNDBC/action/author_attestation","sign_citation":"https://pith.science/pith/HFOIDZ4FUPMPKAXBXBG4QLNDBC/action/citation_signature","submit_replication":"https://pith.science/pith/HFOIDZ4FUPMPKAXBXBG4QLNDBC/action/replication_record"}},"created_at":"2026-05-18T04:11:49.824180+00:00","updated_at":"2026-05-18T04:11:49.824180+00:00"}