{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:LV2QFF3YZ5LAZYMUJ5YW4MCMVD","short_pith_number":"pith:LV2QFF3Y","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"},"canonical_sha256":"5d75029778cf560ce1944f716e304ca8cf6772cbea248e81294401da5ec1a13b","source":{"kind":"arxiv","id":"1010.3976","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.3976","created_at":"2026-05-18T04:39:07Z"},{"alias_kind":"arxiv_version","alias_value":"1010.3976v1","created_at":"2026-05-18T04:39:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.3976","created_at":"2026-05-18T04:39:07Z"},{"alias_kind":"pith_short_12","alias_value":"LV2QFF3YZ5LA","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"LV2QFF3YZ5LAZYMU","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"LV2QFF3Y","created_at":"2026-05-18T12:26:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:LV2QFF3YZ5LAZYMUJ5YW4MCMVD","target":"record","payload":{"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"},"canonical_sha256":"5d75029778cf560ce1944f716e304ca8cf6772cbea248e81294401da5ec1a13b","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"},"source_kind":"arxiv","source_id":"1010.3976","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:39:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fDohkoiuGu6eLA355u0ew6WJ7L1SUct/zxt2OIgJhJUwAZhX8ff7X2gKRb+1fziJwqJocBR0qeYCyhZHTu1XCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:43:40.201556Z"},"content_sha256":"d14bd717aa0bb8b49ecf707b544b6a71905e725ee3efee4881e27a672d1e01d3","schema_version":"1.0","event_id":"sha256:d14bd717aa0bb8b49ecf707b544b6a71905e725ee3efee4881e27a672d1e01d3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:LV2QFF3YZ5LAZYMUJ5YW4MCMVD","target":"graph","payload":{"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"},"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:39:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZIY3YUhx4ZZt/De7CMSdT2KOLQZ6JqeJhe3htFjLFRL8/mZWmxdkDRWwBVmgulbakyFm/IjP87huTht+dBl9CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:43:40.201909Z"},"content_sha256":"4acb68b95a7806f3c880ec1c68a93a8b274acb750afb496e8da22e8d52edfa07","schema_version":"1.0","event_id":"sha256:4acb68b95a7806f3c880ec1c68a93a8b274acb750afb496e8da22e8d52edfa07"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LV2QFF3YZ5LAZYMUJ5YW4MCMVD/bundle.json","state_url":"https://pith.science/pith/LV2QFF3YZ5LAZYMUJ5YW4MCMVD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LV2QFF3YZ5LAZYMUJ5YW4MCMVD/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-02T22:43:40Z","links":{"resolver":"https://pith.science/pith/LV2QFF3YZ5LAZYMUJ5YW4MCMVD","bundle":"https://pith.science/pith/LV2QFF3YZ5LAZYMUJ5YW4MCMVD/bundle.json","state":"https://pith.science/pith/LV2QFF3YZ5LAZYMUJ5YW4MCMVD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LV2QFF3YZ5LAZYMUJ5YW4MCMVD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:LV2QFF3YZ5LAZYMUJ5YW4MCMVD","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":"283c1a2cb9fb68cf2a01087fdfe0a2e0dd9555206187397b73bc03b4e6200c64","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-10-19T16:52:33Z","title_canon_sha256":"d24620a4efaa290211b81010cb6583517c47ef8678caab1e78f03f6a4998c0a7"},"schema_version":"1.0","source":{"id":"1010.3976","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.3976","created_at":"2026-05-18T04:39:07Z"},{"alias_kind":"arxiv_version","alias_value":"1010.3976v1","created_at":"2026-05-18T04:39:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.3976","created_at":"2026-05-18T04:39:07Z"},{"alias_kind":"pith_short_12","alias_value":"LV2QFF3YZ5LA","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"LV2QFF3YZ5LAZYMU","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"LV2QFF3Y","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:4acb68b95a7806f3c880ec1c68a93a8b274acb750afb496e8da22e8d52edfa07","target":"graph","created_at":"2026-05-18T04:39:07Z","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":"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","authors_text":"Anastasios Sidiropoulos, Julia Chuzhoy, Yury Makarychev","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-10-19T16:52:33Z","title":"On Graph Crossing Number and Edge Planarization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.3976","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:d14bd717aa0bb8b49ecf707b544b6a71905e725ee3efee4881e27a672d1e01d3","target":"record","created_at":"2026-05-18T04:39:07Z","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":"283c1a2cb9fb68cf2a01087fdfe0a2e0dd9555206187397b73bc03b4e6200c64","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-10-19T16:52:33Z","title_canon_sha256":"d24620a4efaa290211b81010cb6583517c47ef8678caab1e78f03f6a4998c0a7"},"schema_version":"1.0","source":{"id":"1010.3976","kind":"arxiv","version":1}},"canonical_sha256":"5d75029778cf560ce1944f716e304ca8cf6772cbea248e81294401da5ec1a13b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5d75029778cf560ce1944f716e304ca8cf6772cbea248e81294401da5ec1a13b","first_computed_at":"2026-05-18T04:39:07.135153Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:39:07.135153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rHgE0qNh3ICbFr44tI6m5qNTjSw04qJqlIrRBCxrAW4TvBgxfqEHy6wvcdxCl/Vms250bqcED9Wr/2KZTj2lAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:39:07.135768Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.3976","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d14bd717aa0bb8b49ecf707b544b6a71905e725ee3efee4881e27a672d1e01d3","sha256:4acb68b95a7806f3c880ec1c68a93a8b274acb750afb496e8da22e8d52edfa07"],"state_sha256":"29872c12effcee578a2467f49f6e02c6e38e177ff4c340caa5634e9a6dd6e8c2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KTeYGwYQI26XjvWDs+UYeNUJG7LI0EN/BBx3DG2Z53XIrPXgnvFQRxxNkHzRmi+K7Tj8T7mTIOff629YdnI/Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T22:43:40.203861Z","bundle_sha256":"d53b47d153882d7eba654967876e4a34a49fb04a6ac7b90090d79424b6ab4dcc"}}