{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ODDBGT5I3JOSF24KYZ2TGP55XQ","short_pith_number":"pith:ODDBGT5I","schema_version":"1.0","canonical_sha256":"70c6134fa8da5d22eb8ac675333fbdbc32637d435d91cc86c8f03e39d0923a7f","source":{"kind":"arxiv","id":"1807.09483","version":2},"attestation_state":"computed","paper":{"title":"A Greedy Heuristic for Crossing-Angle Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Almut Demel, Dominik D\\\"urrschnabel, Lasse Wulf, Marcel Radermacher, Tamara Mchedlidze","submitted_at":"2018-07-25T08:43:03Z","abstract_excerpt":"The crossing angle of a straight-line drawing $\\Gamma$ of a graph $G=(V, E)$ is the smallest angle between two crossing edges in $\\Gamma$. Deciding whether a graph $G$ has a straight-line drawing with a crossing angle of $90^\\circ$ is $\\mathcal NP$-hard. We propose a simple heuristic to compute a drawing with a large crossing angle. The heuristic greedily selects the best position for a single vertex in a random set of points. The algorithm is accompanied by a speed-up technique to compute the crossing angle of a straight-line drawing. We show the effectiveness of the heuristic in an extensive"},"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":"1807.09483","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-07-25T08:43:03Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"ba80bc403ed408dae5798307c72e63047575ca73e1f078daa97820dbbcaa213c","abstract_canon_sha256":"44ad1c8832b4dda4537d2b69a1cdcb58aedf4e795c6f7637876c129bb324dcea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:23.802059Z","signature_b64":"hE+3hq0lM4cU7oKNaUY+t0FyslZtllr8qRlRp8tCICqAt9VIZQbjx6ggkXAjmRzcG9dv174yld77SN/BjVyeAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70c6134fa8da5d22eb8ac675333fbdbc32637d435d91cc86c8f03e39d0923a7f","last_reissued_at":"2026-05-18T00:09:23.801609Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:23.801609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Greedy Heuristic for Crossing-Angle Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Almut Demel, Dominik D\\\"urrschnabel, Lasse Wulf, Marcel Radermacher, Tamara Mchedlidze","submitted_at":"2018-07-25T08:43:03Z","abstract_excerpt":"The crossing angle of a straight-line drawing $\\Gamma$ of a graph $G=(V, E)$ is the smallest angle between two crossing edges in $\\Gamma$. Deciding whether a graph $G$ has a straight-line drawing with a crossing angle of $90^\\circ$ is $\\mathcal NP$-hard. We propose a simple heuristic to compute a drawing with a large crossing angle. The heuristic greedily selects the best position for a single vertex in a random set of points. The algorithm is accompanied by a speed-up technique to compute the crossing angle of a straight-line drawing. We show the effectiveness of the heuristic in an extensive"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.09483","kind":"arxiv","version":2},"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":"1807.09483","created_at":"2026-05-18T00:09:23.801678+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.09483v2","created_at":"2026-05-18T00:09:23.801678+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.09483","created_at":"2026-05-18T00:09:23.801678+00:00"},{"alias_kind":"pith_short_12","alias_value":"ODDBGT5I3JOS","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"ODDBGT5I3JOSF24K","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"ODDBGT5I","created_at":"2026-05-18T12:32:43.782077+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/ODDBGT5I3JOSF24KYZ2TGP55XQ","json":"https://pith.science/pith/ODDBGT5I3JOSF24KYZ2TGP55XQ.json","graph_json":"https://pith.science/api/pith-number/ODDBGT5I3JOSF24KYZ2TGP55XQ/graph.json","events_json":"https://pith.science/api/pith-number/ODDBGT5I3JOSF24KYZ2TGP55XQ/events.json","paper":"https://pith.science/paper/ODDBGT5I"},"agent_actions":{"view_html":"https://pith.science/pith/ODDBGT5I3JOSF24KYZ2TGP55XQ","download_json":"https://pith.science/pith/ODDBGT5I3JOSF24KYZ2TGP55XQ.json","view_paper":"https://pith.science/paper/ODDBGT5I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.09483&json=true","fetch_graph":"https://pith.science/api/pith-number/ODDBGT5I3JOSF24KYZ2TGP55XQ/graph.json","fetch_events":"https://pith.science/api/pith-number/ODDBGT5I3JOSF24KYZ2TGP55XQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ODDBGT5I3JOSF24KYZ2TGP55XQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ODDBGT5I3JOSF24KYZ2TGP55XQ/action/storage_attestation","attest_author":"https://pith.science/pith/ODDBGT5I3JOSF24KYZ2TGP55XQ/action/author_attestation","sign_citation":"https://pith.science/pith/ODDBGT5I3JOSF24KYZ2TGP55XQ/action/citation_signature","submit_replication":"https://pith.science/pith/ODDBGT5I3JOSF24KYZ2TGP55XQ/action/replication_record"}},"created_at":"2026-05-18T00:09:23.801678+00:00","updated_at":"2026-05-18T00:09:23.801678+00:00"}