{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:GBI6VNCRQOH7ACSTD75F47BOQX","short_pith_number":"pith:GBI6VNCR","schema_version":"1.0","canonical_sha256":"3051eab451838ff00a531ffa5e7c2e85e4f4c9e5d063f03486e38cc0d7ebb4e1","source":{"kind":"arxiv","id":"1705.05176","version":1},"attestation_state":"computed","paper":{"title":"On the Maximum Crossing Number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alexander Wolff, Markus Chimani, Pavel Valtr, Stefan Felsner, Stephen Kobourov, Torsten Ueckerdt","submitted_at":"2017-05-15T11:57:54Z","abstract_excerpt":"Research about crossings is typically about minimization. In this paper, we consider \\emph{maximizing} the number of crossings over all possible ways to draw a given graph in the plane. Alpert et al. [Electron. J. Combin., 2009] conjectured that any graph has a \\emph{convex} straight-line drawing, e.g., a drawing with vertices in convex position, that maximizes the number of edge crossings. We disprove this conjecture by constructing a planar graph on twelve vertices that allows a non-convex drawing with more crossings than any convex one. Bald et al. [Proc. COCOON, 2016] showed that it is NP-"},"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":"1705.05176","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-05-15T11:57:54Z","cross_cats_sorted":[],"title_canon_sha256":"54ccbbd153e2cab7b09a381773fce1ed3a40d7accd64eb1e213d60a3fcb7a286","abstract_canon_sha256":"4492c2159e443725d59ab7dfa834cbef7673f877e8be7de9fabc885a9d0b9e93"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:32.737872Z","signature_b64":"BRfZfFdPWHGlWMpmdvJ0WIgbLUDSfhvhaf2D9ADmeBMKLa0dTb7acnwAwwJVr75N5XLi1YiwftZu8FvXZFvJCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3051eab451838ff00a531ffa5e7c2e85e4f4c9e5d063f03486e38cc0d7ebb4e1","last_reissued_at":"2026-05-18T00:44:32.737373Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:32.737373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Maximum Crossing Number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alexander Wolff, Markus Chimani, Pavel Valtr, Stefan Felsner, Stephen Kobourov, Torsten Ueckerdt","submitted_at":"2017-05-15T11:57:54Z","abstract_excerpt":"Research about crossings is typically about minimization. In this paper, we consider \\emph{maximizing} the number of crossings over all possible ways to draw a given graph in the plane. Alpert et al. [Electron. J. Combin., 2009] conjectured that any graph has a \\emph{convex} straight-line drawing, e.g., a drawing with vertices in convex position, that maximizes the number of edge crossings. We disprove this conjecture by constructing a planar graph on twelve vertices that allows a non-convex drawing with more crossings than any convex one. Bald et al. [Proc. COCOON, 2016] showed that it is NP-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.05176","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":"1705.05176","created_at":"2026-05-18T00:44:32.737452+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.05176v1","created_at":"2026-05-18T00:44:32.737452+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.05176","created_at":"2026-05-18T00:44:32.737452+00:00"},{"alias_kind":"pith_short_12","alias_value":"GBI6VNCRQOH7","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"GBI6VNCRQOH7ACST","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"GBI6VNCR","created_at":"2026-05-18T12:31:15.632608+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/GBI6VNCRQOH7ACSTD75F47BOQX","json":"https://pith.science/pith/GBI6VNCRQOH7ACSTD75F47BOQX.json","graph_json":"https://pith.science/api/pith-number/GBI6VNCRQOH7ACSTD75F47BOQX/graph.json","events_json":"https://pith.science/api/pith-number/GBI6VNCRQOH7ACSTD75F47BOQX/events.json","paper":"https://pith.science/paper/GBI6VNCR"},"agent_actions":{"view_html":"https://pith.science/pith/GBI6VNCRQOH7ACSTD75F47BOQX","download_json":"https://pith.science/pith/GBI6VNCRQOH7ACSTD75F47BOQX.json","view_paper":"https://pith.science/paper/GBI6VNCR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.05176&json=true","fetch_graph":"https://pith.science/api/pith-number/GBI6VNCRQOH7ACSTD75F47BOQX/graph.json","fetch_events":"https://pith.science/api/pith-number/GBI6VNCRQOH7ACSTD75F47BOQX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GBI6VNCRQOH7ACSTD75F47BOQX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GBI6VNCRQOH7ACSTD75F47BOQX/action/storage_attestation","attest_author":"https://pith.science/pith/GBI6VNCRQOH7ACSTD75F47BOQX/action/author_attestation","sign_citation":"https://pith.science/pith/GBI6VNCRQOH7ACSTD75F47BOQX/action/citation_signature","submit_replication":"https://pith.science/pith/GBI6VNCRQOH7ACSTD75F47BOQX/action/replication_record"}},"created_at":"2026-05-18T00:44:32.737452+00:00","updated_at":"2026-05-18T00:44:32.737452+00:00"}