{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:V5IVQYF7DQB7I4ESKDP7ADIZ7M","short_pith_number":"pith:V5IVQYF7","schema_version":"1.0","canonical_sha256":"af515860bf1c03f4709250dff00d19fb02d993e003e681790d558929976d2d19","source":{"kind":"arxiv","id":"1708.01942","version":1},"attestation_state":"computed","paper":{"title":"The complexity of computing the cylindrical and the $t$-circle crossing number of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carolina Medina, C\\'esar Hern\\'andez-V\\'elez, Frank Duque, Hern\\'an Gonz\\'alez-Aguilar, Jes\\'us Lea\\~nos","submitted_at":"2017-08-06T22:16:27Z","abstract_excerpt":"A plane drawing of a graph is {\\em cylindrical} if there exist two concentric circles that contain all the vertices of the graph, and no edge intersects (other than at its endpoints) any of these circles. The {\\em cylindrical crossing number} of a graph \\(G\\) is the minimum number of crossings in a cylindrical drawing of \\(G\\). In his influential survey on the variants of the definition of the crossing number of a graph, Schaefer lists the complexity of computing the cylindrical crossing number of a graph as an open question. In this paper we settle this by showing that this problem is NP-comp"},"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":"1708.01942","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-06T22:16:27Z","cross_cats_sorted":[],"title_canon_sha256":"43acceaffe4bf26bea0274fc5a27b13f2dc5205a0296e11af3930a4d52e377a0","abstract_canon_sha256":"9a433d1d7336b1cf63b8903e464a726a283ddc1c389e234f8b126b099cbd9546"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:44.519342Z","signature_b64":"ISho6bEV4bMJYao/ppgvok2Nl6Dcop/iWMjLJ845qrgUu8JZkZjFIw3rY3Yj7vPc2c03GnvTi0UFBIM5dxYdCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af515860bf1c03f4709250dff00d19fb02d993e003e681790d558929976d2d19","last_reissued_at":"2026-05-17T23:47:44.518817Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:44.518817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The complexity of computing the cylindrical and the $t$-circle crossing number of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carolina Medina, C\\'esar Hern\\'andez-V\\'elez, Frank Duque, Hern\\'an Gonz\\'alez-Aguilar, Jes\\'us Lea\\~nos","submitted_at":"2017-08-06T22:16:27Z","abstract_excerpt":"A plane drawing of a graph is {\\em cylindrical} if there exist two concentric circles that contain all the vertices of the graph, and no edge intersects (other than at its endpoints) any of these circles. The {\\em cylindrical crossing number} of a graph \\(G\\) is the minimum number of crossings in a cylindrical drawing of \\(G\\). In his influential survey on the variants of the definition of the crossing number of a graph, Schaefer lists the complexity of computing the cylindrical crossing number of a graph as an open question. In this paper we settle this by showing that this problem is NP-comp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.01942","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":"1708.01942","created_at":"2026-05-17T23:47:44.518912+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.01942v1","created_at":"2026-05-17T23:47:44.518912+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01942","created_at":"2026-05-17T23:47:44.518912+00:00"},{"alias_kind":"pith_short_12","alias_value":"V5IVQYF7DQB7","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"V5IVQYF7DQB7I4ES","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"V5IVQYF7","created_at":"2026-05-18T12:31:49.984773+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/V5IVQYF7DQB7I4ESKDP7ADIZ7M","json":"https://pith.science/pith/V5IVQYF7DQB7I4ESKDP7ADIZ7M.json","graph_json":"https://pith.science/api/pith-number/V5IVQYF7DQB7I4ESKDP7ADIZ7M/graph.json","events_json":"https://pith.science/api/pith-number/V5IVQYF7DQB7I4ESKDP7ADIZ7M/events.json","paper":"https://pith.science/paper/V5IVQYF7"},"agent_actions":{"view_html":"https://pith.science/pith/V5IVQYF7DQB7I4ESKDP7ADIZ7M","download_json":"https://pith.science/pith/V5IVQYF7DQB7I4ESKDP7ADIZ7M.json","view_paper":"https://pith.science/paper/V5IVQYF7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.01942&json=true","fetch_graph":"https://pith.science/api/pith-number/V5IVQYF7DQB7I4ESKDP7ADIZ7M/graph.json","fetch_events":"https://pith.science/api/pith-number/V5IVQYF7DQB7I4ESKDP7ADIZ7M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V5IVQYF7DQB7I4ESKDP7ADIZ7M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V5IVQYF7DQB7I4ESKDP7ADIZ7M/action/storage_attestation","attest_author":"https://pith.science/pith/V5IVQYF7DQB7I4ESKDP7ADIZ7M/action/author_attestation","sign_citation":"https://pith.science/pith/V5IVQYF7DQB7I4ESKDP7ADIZ7M/action/citation_signature","submit_replication":"https://pith.science/pith/V5IVQYF7DQB7I4ESKDP7ADIZ7M/action/replication_record"}},"created_at":"2026-05-17T23:47:44.518912+00:00","updated_at":"2026-05-17T23:47:44.518912+00:00"}