{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:RAPEZSKS24VIOSXRKN5V3Q5X7Q","short_pith_number":"pith:RAPEZSKS","canonical_record":{"source":{"id":"1012.0255","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-01T17:45:29Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"65edd1d71393bb405412e1fb203ddbede7e3adff1b4a68dfba1c600f99169684","abstract_canon_sha256":"db12ad3ac26398bb7fed716a06e558ce583c2de9bf8026ab0596abcebfbc74c0"},"schema_version":"1.0"},"canonical_sha256":"881e4cc952d72a874af1537b5dc3b7fc06054b62f6cbea6d43f8ba39df8d8583","source":{"kind":"arxiv","id":"1012.0255","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.0255","created_at":"2026-05-18T04:34:18Z"},{"alias_kind":"arxiv_version","alias_value":"1012.0255v1","created_at":"2026-05-18T04:34:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.0255","created_at":"2026-05-18T04:34:18Z"},{"alias_kind":"pith_short_12","alias_value":"RAPEZSKS24VI","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"RAPEZSKS24VIOSXR","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"RAPEZSKS","created_at":"2026-05-18T12:26:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:RAPEZSKS24VIOSXRKN5V3Q5X7Q","target":"record","payload":{"canonical_record":{"source":{"id":"1012.0255","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-01T17:45:29Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"65edd1d71393bb405412e1fb203ddbede7e3adff1b4a68dfba1c600f99169684","abstract_canon_sha256":"db12ad3ac26398bb7fed716a06e558ce583c2de9bf8026ab0596abcebfbc74c0"},"schema_version":"1.0"},"canonical_sha256":"881e4cc952d72a874af1537b5dc3b7fc06054b62f6cbea6d43f8ba39df8d8583","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:34:18.657800Z","signature_b64":"mXque9s/GS1En6DQ2y+3wYBSw+EEX+hbWuU22i6qXyWdi9Qml9ZfUIL8bk3L3D/1i3DeldCcUZDKW9CXSigfDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"881e4cc952d72a874af1537b5dc3b7fc06054b62f6cbea6d43f8ba39df8d8583","last_reissued_at":"2026-05-18T04:34:18.657128Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:34:18.657128Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1012.0255","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-18T04:34:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ac/7D+20Z9y3822fBkjhHuYaKgD/YrIAJFUBDwpAMLOGSLtsMpRUT+A/gSw/dBwib/pr0vuzsXMffVxLZSymBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T12:35:17.908344Z"},"content_sha256":"bf24b3dcf5b07f4a4151578828ac73751832c08dd6cb5f98e73023622f92290f","schema_version":"1.0","event_id":"sha256:bf24b3dcf5b07f4a4151578828ac73751832c08dd6cb5f98e73023622f92290f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:RAPEZSKS24VIOSXRKN5V3Q5X7Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Algorithm for the Graph Crossing Number Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Julia Chuzhoy","submitted_at":"2010-12-01T17:45:29Z","abstract_excerpt":"We study the Minimum Crossing Number problem: given an $n$-vertex graph $G$, the goal is to find a drawing of $G$ in the plane with minimum number of edge crossings. This is one of the central problems in topological graph theory, that has been studied extensively over the past three decades. The first non-trivial efficient algorithm for the problem, due to Leighton and Rao, achieved an $O(n\\log^4n)$-approximation for bounded degree graphs. This algorithm has since been improved by poly-logarithmic factors, with the best current approximation ratio standing on $O(n \\poly(d) \\log^{3/2}n)$ for g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.0255","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-18T04:34:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eIcS1XtlJWW42r4oKdXI0ezmzmaRZeV/JDN7ql4nVNRdxtV9zI3+OOjbNEa7sO39Puj2N3L/oE1yVWTKjdgjDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T12:35:17.908705Z"},"content_sha256":"56f1d8c4477761614d171f9d47d90109916e443c12b98ec69ff85655e93d2b17","schema_version":"1.0","event_id":"sha256:56f1d8c4477761614d171f9d47d90109916e443c12b98ec69ff85655e93d2b17"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RAPEZSKS24VIOSXRKN5V3Q5X7Q/bundle.json","state_url":"https://pith.science/pith/RAPEZSKS24VIOSXRKN5V3Q5X7Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RAPEZSKS24VIOSXRKN5V3Q5X7Q/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-11T12:35:17Z","links":{"resolver":"https://pith.science/pith/RAPEZSKS24VIOSXRKN5V3Q5X7Q","bundle":"https://pith.science/pith/RAPEZSKS24VIOSXRKN5V3Q5X7Q/bundle.json","state":"https://pith.science/pith/RAPEZSKS24VIOSXRKN5V3Q5X7Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RAPEZSKS24VIOSXRKN5V3Q5X7Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:RAPEZSKS24VIOSXRKN5V3Q5X7Q","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":"db12ad3ac26398bb7fed716a06e558ce583c2de9bf8026ab0596abcebfbc74c0","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-01T17:45:29Z","title_canon_sha256":"65edd1d71393bb405412e1fb203ddbede7e3adff1b4a68dfba1c600f99169684"},"schema_version":"1.0","source":{"id":"1012.0255","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.0255","created_at":"2026-05-18T04:34:18Z"},{"alias_kind":"arxiv_version","alias_value":"1012.0255v1","created_at":"2026-05-18T04:34:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.0255","created_at":"2026-05-18T04:34:18Z"},{"alias_kind":"pith_short_12","alias_value":"RAPEZSKS24VI","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"RAPEZSKS24VIOSXR","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"RAPEZSKS","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:56f1d8c4477761614d171f9d47d90109916e443c12b98ec69ff85655e93d2b17","target":"graph","created_at":"2026-05-18T04:34:18Z","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 study the Minimum Crossing Number problem: given an $n$-vertex graph $G$, the goal is to find a drawing of $G$ in the plane with minimum number of edge crossings. This is one of the central problems in topological graph theory, that has been studied extensively over the past three decades. The first non-trivial efficient algorithm for the problem, due to Leighton and Rao, achieved an $O(n\\log^4n)$-approximation for bounded degree graphs. This algorithm has since been improved by poly-logarithmic factors, with the best current approximation ratio standing on $O(n \\poly(d) \\log^{3/2}n)$ for g","authors_text":"Julia Chuzhoy","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-01T17:45:29Z","title":"An Algorithm for the Graph Crossing Number Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.0255","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:bf24b3dcf5b07f4a4151578828ac73751832c08dd6cb5f98e73023622f92290f","target":"record","created_at":"2026-05-18T04:34:18Z","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":"db12ad3ac26398bb7fed716a06e558ce583c2de9bf8026ab0596abcebfbc74c0","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-01T17:45:29Z","title_canon_sha256":"65edd1d71393bb405412e1fb203ddbede7e3adff1b4a68dfba1c600f99169684"},"schema_version":"1.0","source":{"id":"1012.0255","kind":"arxiv","version":1}},"canonical_sha256":"881e4cc952d72a874af1537b5dc3b7fc06054b62f6cbea6d43f8ba39df8d8583","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"881e4cc952d72a874af1537b5dc3b7fc06054b62f6cbea6d43f8ba39df8d8583","first_computed_at":"2026-05-18T04:34:18.657128Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:34:18.657128Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mXque9s/GS1En6DQ2y+3wYBSw+EEX+hbWuU22i6qXyWdi9Qml9ZfUIL8bk3L3D/1i3DeldCcUZDKW9CXSigfDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:34:18.657800Z","signed_message":"canonical_sha256_bytes"},"source_id":"1012.0255","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bf24b3dcf5b07f4a4151578828ac73751832c08dd6cb5f98e73023622f92290f","sha256:56f1d8c4477761614d171f9d47d90109916e443c12b98ec69ff85655e93d2b17"],"state_sha256":"c3cab97f269b5d3a62f58e3ea1b8fc8147ca4521df9a83f07a50bff771459f46"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PwPJ+VkvCuaPUjdJIw/ijKqpS/JpIKCUf0ekJbqPTPwk7AJDrYz7uDZ/0sEih2fu+AL4UiXKhNuuBI2H33SHAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T12:35:17.910687Z","bundle_sha256":"af7d81355632d2211a9064533567c73ef4aba0fc9b793adf0c47fe2b29dd5f55"}}