{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:LV2QFF3YZ5LAZYMUJ5YW4MCMVD","short_pith_number":"pith:LV2QFF3Y","schema_version":"1.0","canonical_sha256":"5d75029778cf560ce1944f716e304ca8cf6772cbea248e81294401da5ec1a13b","source":{"kind":"arxiv","id":"1010.3976","version":1},"attestation_state":"computed","paper":{"title":"On Graph Crossing Number and Edge Planarization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Anastasios Sidiropoulos, Julia Chuzhoy, Yury Makarychev","submitted_at":"2010-10-19T16:52:33Z","abstract_excerpt":"Given an n-vertex graph G, a drawing of G in the plane is a mapping of its vertices into points of the plane, and its edges into continuous curves, connecting the images of their endpoints. A crossing in such a drawing is a point where two such curves intersect. In the Minimum Crossing Number problem, the goal is to find a drawing of G with minimum number of crossings. The value of the optimal solution, denoted by OPT, is called the graph's crossing number. This is a very basic problem in topological graph theory, that has received a significant amount of attention, but is still poorly underst"},"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":"1010.3976","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-10-19T16:52:33Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"d24620a4efaa290211b81010cb6583517c47ef8678caab1e78f03f6a4998c0a7","abstract_canon_sha256":"283c1a2cb9fb68cf2a01087fdfe0a2e0dd9555206187397b73bc03b4e6200c64"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:39:07.135768Z","signature_b64":"rHgE0qNh3ICbFr44tI6m5qNTjSw04qJqlIrRBCxrAW4TvBgxfqEHy6wvcdxCl/Vms250bqcED9Wr/2KZTj2lAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d75029778cf560ce1944f716e304ca8cf6772cbea248e81294401da5ec1a13b","last_reissued_at":"2026-05-18T04:39:07.135153Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:39:07.135153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Graph Crossing Number and Edge Planarization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Anastasios Sidiropoulos, Julia Chuzhoy, Yury Makarychev","submitted_at":"2010-10-19T16:52:33Z","abstract_excerpt":"Given an n-vertex graph G, a drawing of G in the plane is a mapping of its vertices into points of the plane, and its edges into continuous curves, connecting the images of their endpoints. A crossing in such a drawing is a point where two such curves intersect. In the Minimum Crossing Number problem, the goal is to find a drawing of G with minimum number of crossings. The value of the optimal solution, denoted by OPT, is called the graph's crossing number. This is a very basic problem in topological graph theory, that has received a significant amount of attention, but is still poorly underst"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.3976","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":"1010.3976","created_at":"2026-05-18T04:39:07.135236+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.3976v1","created_at":"2026-05-18T04:39:07.135236+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.3976","created_at":"2026-05-18T04:39:07.135236+00:00"},{"alias_kind":"pith_short_12","alias_value":"LV2QFF3YZ5LA","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_16","alias_value":"LV2QFF3YZ5LAZYMU","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_8","alias_value":"LV2QFF3Y","created_at":"2026-05-18T12:26:10.704358+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/LV2QFF3YZ5LAZYMUJ5YW4MCMVD","json":"https://pith.science/pith/LV2QFF3YZ5LAZYMUJ5YW4MCMVD.json","graph_json":"https://pith.science/api/pith-number/LV2QFF3YZ5LAZYMUJ5YW4MCMVD/graph.json","events_json":"https://pith.science/api/pith-number/LV2QFF3YZ5LAZYMUJ5YW4MCMVD/events.json","paper":"https://pith.science/paper/LV2QFF3Y"},"agent_actions":{"view_html":"https://pith.science/pith/LV2QFF3YZ5LAZYMUJ5YW4MCMVD","download_json":"https://pith.science/pith/LV2QFF3YZ5LAZYMUJ5YW4MCMVD.json","view_paper":"https://pith.science/paper/LV2QFF3Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.3976&json=true","fetch_graph":"https://pith.science/api/pith-number/LV2QFF3YZ5LAZYMUJ5YW4MCMVD/graph.json","fetch_events":"https://pith.science/api/pith-number/LV2QFF3YZ5LAZYMUJ5YW4MCMVD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LV2QFF3YZ5LAZYMUJ5YW4MCMVD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LV2QFF3YZ5LAZYMUJ5YW4MCMVD/action/storage_attestation","attest_author":"https://pith.science/pith/LV2QFF3YZ5LAZYMUJ5YW4MCMVD/action/author_attestation","sign_citation":"https://pith.science/pith/LV2QFF3YZ5LAZYMUJ5YW4MCMVD/action/citation_signature","submit_replication":"https://pith.science/pith/LV2QFF3YZ5LAZYMUJ5YW4MCMVD/action/replication_record"}},"created_at":"2026-05-18T04:39:07.135236+00:00","updated_at":"2026-05-18T04:39:07.135236+00:00"}