{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:UQQLQDIVV3KYQSXCDPMKXFAH2P","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":"0e7a154e05607b215d5d4000e371fdb5fd72bf4d3947173ae6286cc043d743ac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-30T21:01:53Z","title_canon_sha256":"a98fbb7c605a1abf64499b5acc8bca4b1cd2d9cad6337b80e3e428968ba77ad9"},"schema_version":"1.0","source":{"id":"1808.10519","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.10519","created_at":"2026-05-18T00:06:45Z"},{"alias_kind":"arxiv_version","alias_value":"1808.10519v1","created_at":"2026-05-18T00:06:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.10519","created_at":"2026-05-18T00:06:45Z"},{"alias_kind":"pith_short_12","alias_value":"UQQLQDIVV3KY","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UQQLQDIVV3KYQSXC","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UQQLQDIV","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:540feb942b4aea6e2dfdfbde0859ff444a24844c54c582fb4c75ace619205a80","target":"graph","created_at":"2026-05-18T00:06:45Z","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":"The crossing resolution of a non-planar drawing of a graph is the value of the minimum angle formed by any pair of crossing edges. Recent experiments have shown that the larger the crossing resolution is, the easier it is to read and interpret a drawing of a graph. However, maximizing the crossing resolution turns out to be an NP-hard problem in general and only heuristic algorithms are known that are mainly based on appropriately adjusting force-directed algorithms.\n  In this paper, we propose a new heuristic algorithm for the crossing resolution maximization problem and we experimentally com","authors_text":"Amad\\\"aus M. Spallek, Christian Geckeler, Henry F\\\"orster, Jan Splett, Lukas Holl\\\"ander, Michael A. Bekos, Michael Kaufmann","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-30T21:01:53Z","title":"A Heuristic Approach towards Drawings of Graphs with High Crossing Resolution"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.10519","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:9dbd660bc91c1d3bd708e65ccd0c34bfe2e32cab8fe4437b8ef96069b35e7d34","target":"record","created_at":"2026-05-18T00:06:45Z","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":"0e7a154e05607b215d5d4000e371fdb5fd72bf4d3947173ae6286cc043d743ac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-30T21:01:53Z","title_canon_sha256":"a98fbb7c605a1abf64499b5acc8bca4b1cd2d9cad6337b80e3e428968ba77ad9"},"schema_version":"1.0","source":{"id":"1808.10519","kind":"arxiv","version":1}},"canonical_sha256":"a420b80d15aed5884ae21bd8ab9407d3fd3936a8454b520277c5661d5d0d50da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a420b80d15aed5884ae21bd8ab9407d3fd3936a8454b520277c5661d5d0d50da","first_computed_at":"2026-05-18T00:06:45.474012Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:45.474012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"y732uzrHWrVSlPH8My3WwvZoERffGcKDXeH2e79QN3o1uLe7G3RWEu0PqTvhxJ6UhTF7cEvRDj86zbBB2mCaAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:45.474659Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.10519","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9dbd660bc91c1d3bd708e65ccd0c34bfe2e32cab8fe4437b8ef96069b35e7d34","sha256:540feb942b4aea6e2dfdfbde0859ff444a24844c54c582fb4c75ace619205a80"],"state_sha256":"9d117d12c2b90b28033b73ea1faec3092ab6fe89281170004566bd59adb695c4"}