{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:IPMTSM5ULZFCCFRNLXY7ONLX7S","short_pith_number":"pith:IPMTSM5U","canonical_record":{"source":{"id":"1907.01243","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-07-02T08:59:21Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"666f69566f4dde320597a4ca6dd8356a9a66c17e85ee3316514cc514855db56a","abstract_canon_sha256":"ba930d7527be1c5d06250a1bedfe343230d0c2cabe1cd00ecc41e2df5aac3abb"},"schema_version":"1.0"},"canonical_sha256":"43d93933b45e4a21162d5df1f73577fc8f5a9772d0cd266e2e11534234e4b42d","source":{"kind":"arxiv","id":"1907.01243","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.01243","created_at":"2026-05-17T23:41:40Z"},{"alias_kind":"arxiv_version","alias_value":"1907.01243v1","created_at":"2026-05-17T23:41:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.01243","created_at":"2026-05-17T23:41:40Z"},{"alias_kind":"pith_short_12","alias_value":"IPMTSM5ULZFC","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"IPMTSM5ULZFCCFRN","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"IPMTSM5U","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:IPMTSM5ULZFCCFRNLXY7ONLX7S","target":"record","payload":{"canonical_record":{"source":{"id":"1907.01243","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-07-02T08:59:21Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"666f69566f4dde320597a4ca6dd8356a9a66c17e85ee3316514cc514855db56a","abstract_canon_sha256":"ba930d7527be1c5d06250a1bedfe343230d0c2cabe1cd00ecc41e2df5aac3abb"},"schema_version":"1.0"},"canonical_sha256":"43d93933b45e4a21162d5df1f73577fc8f5a9772d0cd266e2e11534234e4b42d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:40.872629Z","signature_b64":"KGn8RBhQXcQlPNb9PPVQJoTSvWujXaKoajLAOBvtgAQKxqG75gWTJwgSQm9ZcS6uUEuoXtmU/cyIYoc0dUS+Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43d93933b45e4a21162d5df1f73577fc8f5a9772d0cd266e2e11534234e4b42d","last_reissued_at":"2026-05-17T23:41:40.872105Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:40.872105Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.01243","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-17T23:41:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2PvQTeGVF19QCe00tm4bGiNNp+zlgVrCaKGKTBksbGlv/36kCAGP/it0qxUJmFEOhEMSMN6HX+lsnqI+8vpnCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:31:32.232451Z"},"content_sha256":"19c4c18b832051d843c29dc84cb548b5f9b89be1c0e4729e694e6a6ced266c4d","schema_version":"1.0","event_id":"sha256:19c4c18b832051d843c29dc84cb548b5f9b89be1c0e4729e694e6a6ced266c4d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:IPMTSM5ULZFCCFRNLXY7ONLX7S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Geometric Crossing-Minimization -- A Scalable Randomized Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Ignaz Rutter, Marcel Radermacher","submitted_at":"2019-07-02T08:59:21Z","abstract_excerpt":"We consider the minimization of edge-crossings in geometric drawings of graphs $G=(V, E)$, i.e., in drawings where each edge is depicted as a line segment. The respective decision problem is NP-hard [Bienstock, '91]. In contrast to theory and the topological setting, the geometric setting did not receive a lot of attention in practice. Prior work [Radermacher et al., ALENEX'18] is limited to the crossing-minimization in geometric graphs with less than $200$ edges. The described heuristics base on the primitive operation of moving a single vertex $v$ to its crossing-minimal position, i.e., the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.01243","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-17T23:41:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BxuxCe2k/8qSIShlZwHlR8XUO3i7DeTYTaSdfTowWVEAlqlKHpsHqkYyoB86R7FWl7Ofuc09hqthq4630OEQBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:31:32.233101Z"},"content_sha256":"bdf50503192cd95b54594cae054ac87c83d1cf830e760341f37a59ab460a4c27","schema_version":"1.0","event_id":"sha256:bdf50503192cd95b54594cae054ac87c83d1cf830e760341f37a59ab460a4c27"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IPMTSM5ULZFCCFRNLXY7ONLX7S/bundle.json","state_url":"https://pith.science/pith/IPMTSM5ULZFCCFRNLXY7ONLX7S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IPMTSM5ULZFCCFRNLXY7ONLX7S/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-05-27T05:31:32Z","links":{"resolver":"https://pith.science/pith/IPMTSM5ULZFCCFRNLXY7ONLX7S","bundle":"https://pith.science/pith/IPMTSM5ULZFCCFRNLXY7ONLX7S/bundle.json","state":"https://pith.science/pith/IPMTSM5ULZFCCFRNLXY7ONLX7S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IPMTSM5ULZFCCFRNLXY7ONLX7S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:IPMTSM5ULZFCCFRNLXY7ONLX7S","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":"ba930d7527be1c5d06250a1bedfe343230d0c2cabe1cd00ecc41e2df5aac3abb","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-07-02T08:59:21Z","title_canon_sha256":"666f69566f4dde320597a4ca6dd8356a9a66c17e85ee3316514cc514855db56a"},"schema_version":"1.0","source":{"id":"1907.01243","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.01243","created_at":"2026-05-17T23:41:40Z"},{"alias_kind":"arxiv_version","alias_value":"1907.01243v1","created_at":"2026-05-17T23:41:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.01243","created_at":"2026-05-17T23:41:40Z"},{"alias_kind":"pith_short_12","alias_value":"IPMTSM5ULZFC","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"IPMTSM5ULZFCCFRN","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"IPMTSM5U","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:bdf50503192cd95b54594cae054ac87c83d1cf830e760341f37a59ab460a4c27","target":"graph","created_at":"2026-05-17T23:41:40Z","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 consider the minimization of edge-crossings in geometric drawings of graphs $G=(V, E)$, i.e., in drawings where each edge is depicted as a line segment. The respective decision problem is NP-hard [Bienstock, '91]. In contrast to theory and the topological setting, the geometric setting did not receive a lot of attention in practice. Prior work [Radermacher et al., ALENEX'18] is limited to the crossing-minimization in geometric graphs with less than $200$ edges. The described heuristics base on the primitive operation of moving a single vertex $v$ to its crossing-minimal position, i.e., the ","authors_text":"Ignaz Rutter, Marcel Radermacher","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-07-02T08:59:21Z","title":"Geometric Crossing-Minimization -- A Scalable Randomized Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.01243","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:19c4c18b832051d843c29dc84cb548b5f9b89be1c0e4729e694e6a6ced266c4d","target":"record","created_at":"2026-05-17T23:41:40Z","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":"ba930d7527be1c5d06250a1bedfe343230d0c2cabe1cd00ecc41e2df5aac3abb","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-07-02T08:59:21Z","title_canon_sha256":"666f69566f4dde320597a4ca6dd8356a9a66c17e85ee3316514cc514855db56a"},"schema_version":"1.0","source":{"id":"1907.01243","kind":"arxiv","version":1}},"canonical_sha256":"43d93933b45e4a21162d5df1f73577fc8f5a9772d0cd266e2e11534234e4b42d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"43d93933b45e4a21162d5df1f73577fc8f5a9772d0cd266e2e11534234e4b42d","first_computed_at":"2026-05-17T23:41:40.872105Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:40.872105Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KGn8RBhQXcQlPNb9PPVQJoTSvWujXaKoajLAOBvtgAQKxqG75gWTJwgSQm9ZcS6uUEuoXtmU/cyIYoc0dUS+Dg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:40.872629Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.01243","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:19c4c18b832051d843c29dc84cb548b5f9b89be1c0e4729e694e6a6ced266c4d","sha256:bdf50503192cd95b54594cae054ac87c83d1cf830e760341f37a59ab460a4c27"],"state_sha256":"e34a2c3ca4452aba4580fe597704a56fe121c727c90a01a3c4febde457ef9b88"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LoN2cDDZDAidQxdGdNK47BGWKMaxupnzQQKkrCXNGWHUpaPXgbG/RNjGYcUKjz4JbQLkKs4xq2/aN3H1a5nfBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T05:31:32.236616Z","bundle_sha256":"197522248c27e159ccc1064ad186dba9177c4629a08e50f0572b68478bf06563"}}