{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LMAMFRPYOYSPMY4BACBKKFDBUC","short_pith_number":"pith:LMAMFRPY","schema_version":"1.0","canonical_sha256":"5b00c2c5f87624f663810082a51461a0a580e20f7235588a6e1b23395f69b289","source":{"kind":"arxiv","id":"1803.05705","version":1},"attestation_state":"computed","paper":{"title":"Minimizing Crossings in Constrained Two-Sided Circular Graph Layouts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Fabian Klute, Martin N\\\"ollenburg","submitted_at":"2018-03-15T12:11:48Z","abstract_excerpt":"Circular layouts are a popular graph drawing style, where vertices are placed on a circle and edges are drawn as straight chords. Crossing minimization in circular layouts is \\NP-hard. One way to allow for fewer crossings in practice are two-sided layouts that draw some edges as curves in the exterior of the circle. In fact, one- and two-sided circular layouts are equivalent to one-page and two-page book drawings, i.e., graph layouts with all vertices placed on a line (the spine) and edges drawn in one or two distinct half-planes (the pages) bounded by the spine. In this paper we study the pro"},"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":"1803.05705","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-03-15T12:11:48Z","cross_cats_sorted":[],"title_canon_sha256":"b881a7f6cadddae39f0e11918da8ab4635557eb1d0b07fa698a36ac294b415c2","abstract_canon_sha256":"e56eb84fa13b5986f744ced15b34c0052f2fa8eb86ae1376e00dc8afbf6b4966"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:54.839915Z","signature_b64":"lCE0jtrfKgmRgE5nbUWsqBx1HZdpDEPv4EimDvpMvCBN+/AxF8WZr3UpTWGPw5Kg9hdYeV5ITQ6R7NfWVhRKCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b00c2c5f87624f663810082a51461a0a580e20f7235588a6e1b23395f69b289","last_reissued_at":"2026-05-18T00:20:54.839355Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:54.839355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimizing Crossings in Constrained Two-Sided Circular Graph Layouts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Fabian Klute, Martin N\\\"ollenburg","submitted_at":"2018-03-15T12:11:48Z","abstract_excerpt":"Circular layouts are a popular graph drawing style, where vertices are placed on a circle and edges are drawn as straight chords. Crossing minimization in circular layouts is \\NP-hard. One way to allow for fewer crossings in practice are two-sided layouts that draw some edges as curves in the exterior of the circle. In fact, one- and two-sided circular layouts are equivalent to one-page and two-page book drawings, i.e., graph layouts with all vertices placed on a line (the spine) and edges drawn in one or two distinct half-planes (the pages) bounded by the spine. In this paper we study the pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.05705","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":"1803.05705","created_at":"2026-05-18T00:20:54.839461+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.05705v1","created_at":"2026-05-18T00:20:54.839461+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.05705","created_at":"2026-05-18T00:20:54.839461+00:00"},{"alias_kind":"pith_short_12","alias_value":"LMAMFRPYOYSP","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"LMAMFRPYOYSPMY4B","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"LMAMFRPY","created_at":"2026-05-18T12:32:37.024351+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/LMAMFRPYOYSPMY4BACBKKFDBUC","json":"https://pith.science/pith/LMAMFRPYOYSPMY4BACBKKFDBUC.json","graph_json":"https://pith.science/api/pith-number/LMAMFRPYOYSPMY4BACBKKFDBUC/graph.json","events_json":"https://pith.science/api/pith-number/LMAMFRPYOYSPMY4BACBKKFDBUC/events.json","paper":"https://pith.science/paper/LMAMFRPY"},"agent_actions":{"view_html":"https://pith.science/pith/LMAMFRPYOYSPMY4BACBKKFDBUC","download_json":"https://pith.science/pith/LMAMFRPYOYSPMY4BACBKKFDBUC.json","view_paper":"https://pith.science/paper/LMAMFRPY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.05705&json=true","fetch_graph":"https://pith.science/api/pith-number/LMAMFRPYOYSPMY4BACBKKFDBUC/graph.json","fetch_events":"https://pith.science/api/pith-number/LMAMFRPYOYSPMY4BACBKKFDBUC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LMAMFRPYOYSPMY4BACBKKFDBUC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LMAMFRPYOYSPMY4BACBKKFDBUC/action/storage_attestation","attest_author":"https://pith.science/pith/LMAMFRPYOYSPMY4BACBKKFDBUC/action/author_attestation","sign_citation":"https://pith.science/pith/LMAMFRPYOYSPMY4BACBKKFDBUC/action/citation_signature","submit_replication":"https://pith.science/pith/LMAMFRPYOYSPMY4BACBKKFDBUC/action/replication_record"}},"created_at":"2026-05-18T00:20:54.839461+00:00","updated_at":"2026-05-18T00:20:54.839461+00:00"}