{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:V5IVQYF7DQB7I4ESKDP7ADIZ7M","short_pith_number":"pith:V5IVQYF7","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"},"canonical_sha256":"af515860bf1c03f4709250dff00d19fb02d993e003e681790d558929976d2d19","source":{"kind":"arxiv","id":"1708.01942","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.01942","created_at":"2026-05-17T23:47:44Z"},{"alias_kind":"arxiv_version","alias_value":"1708.01942v1","created_at":"2026-05-17T23:47:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01942","created_at":"2026-05-17T23:47:44Z"},{"alias_kind":"pith_short_12","alias_value":"V5IVQYF7DQB7","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"V5IVQYF7DQB7I4ES","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"V5IVQYF7","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:V5IVQYF7DQB7I4ESKDP7ADIZ7M","target":"record","payload":{"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"},"canonical_sha256":"af515860bf1c03f4709250dff00d19fb02d993e003e681790d558929976d2d19","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"},"source_kind":"arxiv","source_id":"1708.01942","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:47:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EQebR/ZIrufyZpwcB7mxXAdseumRqwGCgc2SGiPVZcXGYpIKAxa8My8g1DWNaHkPzXw7zi1dmsOssm9CsZHaAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:09:08.895684Z"},"content_sha256":"5c184774cf6aca61b3aa95fd706b952e22cabff9609ca90e32a403fcf9a918ac","schema_version":"1.0","event_id":"sha256:5c184774cf6aca61b3aa95fd706b952e22cabff9609ca90e32a403fcf9a918ac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:V5IVQYF7DQB7I4ESKDP7ADIZ7M","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:47:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3wrycv1RZ2RYz9Vw2zg/KRZ1IZ+1gJ1y4HhwsKxaiNG/YcITmYLQLR703ywaPiPGKn44+dwrCw/obomTuNQvAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:09:08.896030Z"},"content_sha256":"089ca5286540e53e3c3f90864380f968284f11b30cbbda8a5bcb7bf08806ef1d","schema_version":"1.0","event_id":"sha256:089ca5286540e53e3c3f90864380f968284f11b30cbbda8a5bcb7bf08806ef1d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V5IVQYF7DQB7I4ESKDP7ADIZ7M/bundle.json","state_url":"https://pith.science/pith/V5IVQYF7DQB7I4ESKDP7ADIZ7M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V5IVQYF7DQB7I4ESKDP7ADIZ7M/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T12:09:08Z","links":{"resolver":"https://pith.science/pith/V5IVQYF7DQB7I4ESKDP7ADIZ7M","bundle":"https://pith.science/pith/V5IVQYF7DQB7I4ESKDP7ADIZ7M/bundle.json","state":"https://pith.science/pith/V5IVQYF7DQB7I4ESKDP7ADIZ7M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V5IVQYF7DQB7I4ESKDP7ADIZ7M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:V5IVQYF7DQB7I4ESKDP7ADIZ7M","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":"9a433d1d7336b1cf63b8903e464a726a283ddc1c389e234f8b126b099cbd9546","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-06T22:16:27Z","title_canon_sha256":"43acceaffe4bf26bea0274fc5a27b13f2dc5205a0296e11af3930a4d52e377a0"},"schema_version":"1.0","source":{"id":"1708.01942","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.01942","created_at":"2026-05-17T23:47:44Z"},{"alias_kind":"arxiv_version","alias_value":"1708.01942v1","created_at":"2026-05-17T23:47:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01942","created_at":"2026-05-17T23:47:44Z"},{"alias_kind":"pith_short_12","alias_value":"V5IVQYF7DQB7","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"V5IVQYF7DQB7I4ES","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"V5IVQYF7","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:089ca5286540e53e3c3f90864380f968284f11b30cbbda8a5bcb7bf08806ef1d","target":"graph","created_at":"2026-05-17T23:47:44Z","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":"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","authors_text":"Carolina Medina, C\\'esar Hern\\'andez-V\\'elez, Frank Duque, Hern\\'an Gonz\\'alez-Aguilar, Jes\\'us Lea\\~nos","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-06T22:16:27Z","title":"The complexity of computing the cylindrical and the $t$-circle crossing number of a graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.01942","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:5c184774cf6aca61b3aa95fd706b952e22cabff9609ca90e32a403fcf9a918ac","target":"record","created_at":"2026-05-17T23:47:44Z","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":"9a433d1d7336b1cf63b8903e464a726a283ddc1c389e234f8b126b099cbd9546","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-06T22:16:27Z","title_canon_sha256":"43acceaffe4bf26bea0274fc5a27b13f2dc5205a0296e11af3930a4d52e377a0"},"schema_version":"1.0","source":{"id":"1708.01942","kind":"arxiv","version":1}},"canonical_sha256":"af515860bf1c03f4709250dff00d19fb02d993e003e681790d558929976d2d19","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"af515860bf1c03f4709250dff00d19fb02d993e003e681790d558929976d2d19","first_computed_at":"2026-05-17T23:47:44.518817Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:44.518817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ISho6bEV4bMJYao/ppgvok2Nl6Dcop/iWMjLJ845qrgUu8JZkZjFIw3rY3Yj7vPc2c03GnvTi0UFBIM5dxYdCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:44.519342Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.01942","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5c184774cf6aca61b3aa95fd706b952e22cabff9609ca90e32a403fcf9a918ac","sha256:089ca5286540e53e3c3f90864380f968284f11b30cbbda8a5bcb7bf08806ef1d"],"state_sha256":"95021fcafe6a5825e217692b608c17cb5f5b95509f2c87236a2bba16824fbedf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zLgBcLVQxbpjprV1VXan4qS8B/VvuYrRgY+TlbyBI9TsSmdFZQzivI3xWbmrrYp4hIXJEK1uCebO+/IGa90XAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T12:09:08.898617Z","bundle_sha256":"467b11a49b2243de5ab69a4c44a31688ad6f90c4b2222c4b2e2cd5218ed88fa0"}}