{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:IPMTSM5ULZFCCFRNLXY7ONLX7S","short_pith_number":"pith:IPMTSM5U","schema_version":"1.0","canonical_sha256":"43d93933b45e4a21162d5df1f73577fc8f5a9772d0cd266e2e11534234e4b42d","source":{"kind":"arxiv","id":"1907.01243","version":1},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1907.01243","created_at":"2026-05-17T23:41:40.872188+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.01243v1","created_at":"2026-05-17T23:41:40.872188+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.01243","created_at":"2026-05-17T23:41:40.872188+00:00"},{"alias_kind":"pith_short_12","alias_value":"IPMTSM5ULZFC","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"IPMTSM5ULZFCCFRN","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"IPMTSM5U","created_at":"2026-05-18T12:33:18.533446+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/IPMTSM5ULZFCCFRNLXY7ONLX7S","json":"https://pith.science/pith/IPMTSM5ULZFCCFRNLXY7ONLX7S.json","graph_json":"https://pith.science/api/pith-number/IPMTSM5ULZFCCFRNLXY7ONLX7S/graph.json","events_json":"https://pith.science/api/pith-number/IPMTSM5ULZFCCFRNLXY7ONLX7S/events.json","paper":"https://pith.science/paper/IPMTSM5U"},"agent_actions":{"view_html":"https://pith.science/pith/IPMTSM5ULZFCCFRNLXY7ONLX7S","download_json":"https://pith.science/pith/IPMTSM5ULZFCCFRNLXY7ONLX7S.json","view_paper":"https://pith.science/paper/IPMTSM5U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.01243&json=true","fetch_graph":"https://pith.science/api/pith-number/IPMTSM5ULZFCCFRNLXY7ONLX7S/graph.json","fetch_events":"https://pith.science/api/pith-number/IPMTSM5ULZFCCFRNLXY7ONLX7S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IPMTSM5ULZFCCFRNLXY7ONLX7S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IPMTSM5ULZFCCFRNLXY7ONLX7S/action/storage_attestation","attest_author":"https://pith.science/pith/IPMTSM5ULZFCCFRNLXY7ONLX7S/action/author_attestation","sign_citation":"https://pith.science/pith/IPMTSM5ULZFCCFRNLXY7ONLX7S/action/citation_signature","submit_replication":"https://pith.science/pith/IPMTSM5ULZFCCFRNLXY7ONLX7S/action/replication_record"}},"created_at":"2026-05-17T23:41:40.872188+00:00","updated_at":"2026-05-17T23:41:40.872188+00:00"}