{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:UET62GIZ4CFTYQASKHX7I4MPDI","short_pith_number":"pith:UET62GIZ","schema_version":"1.0","canonical_sha256":"a127ed1919e08b3c401251eff4718f1a2bb0ede3c5178819b5e6328d7402852f","source":{"kind":"arxiv","id":"1706.04424","version":2},"attestation_state":"computed","paper":{"title":"On the complexity of torus knot recognition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"John A. Baldwin, Steven Sivek","submitted_at":"2017-06-14T12:02:27Z","abstract_excerpt":"We show that the problem of recognizing that a knot diagram represents a specific torus knot, or any torus knot at all, is in the complexity class ${\\sf NP} \\cap {\\sf co\\text{-}NP}$, assuming the generalized Riemann hypothesis. We also show that satellite knot detection is in ${\\sf NP}$ under the same assumption, and that cabled knot detection and composite knot detection are unconditionally in ${\\sf NP}$. Our algorithms are based on recent work of Kuperberg and of Lackenby on detecting knottedness."},"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":"1706.04424","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2017-06-14T12:02:27Z","cross_cats_sorted":[],"title_canon_sha256":"74737c6937520a2c4b89d23030799b885e31a63991a180bc90286deb9ac2f5fd","abstract_canon_sha256":"0fc2ab48bb0facee58859a6de9dea353db787f63792ce78c9e0bce243977e11c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:54.860256Z","signature_b64":"zSv09B49E7I+1gtC0jc9uzTpPx+dYVxi43vQtW6ZYvrU5QVkNB7tbIP2qELdjxqxKGPtfSJvqZqZnhAusZ5xBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a127ed1919e08b3c401251eff4718f1a2bb0ede3c5178819b5e6328d7402852f","last_reissued_at":"2026-05-17T23:51:54.859837Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:54.859837Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the complexity of torus knot recognition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"John A. Baldwin, Steven Sivek","submitted_at":"2017-06-14T12:02:27Z","abstract_excerpt":"We show that the problem of recognizing that a knot diagram represents a specific torus knot, or any torus knot at all, is in the complexity class ${\\sf NP} \\cap {\\sf co\\text{-}NP}$, assuming the generalized Riemann hypothesis. We also show that satellite knot detection is in ${\\sf NP}$ under the same assumption, and that cabled knot detection and composite knot detection are unconditionally in ${\\sf NP}$. Our algorithms are based on recent work of Kuperberg and of Lackenby on detecting knottedness."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.04424","kind":"arxiv","version":2},"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":"1706.04424","created_at":"2026-05-17T23:51:54.859897+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.04424v2","created_at":"2026-05-17T23:51:54.859897+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.04424","created_at":"2026-05-17T23:51:54.859897+00:00"},{"alias_kind":"pith_short_12","alias_value":"UET62GIZ4CFT","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"UET62GIZ4CFTYQAS","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"UET62GIZ","created_at":"2026-05-18T12:31:46.661854+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/UET62GIZ4CFTYQASKHX7I4MPDI","json":"https://pith.science/pith/UET62GIZ4CFTYQASKHX7I4MPDI.json","graph_json":"https://pith.science/api/pith-number/UET62GIZ4CFTYQASKHX7I4MPDI/graph.json","events_json":"https://pith.science/api/pith-number/UET62GIZ4CFTYQASKHX7I4MPDI/events.json","paper":"https://pith.science/paper/UET62GIZ"},"agent_actions":{"view_html":"https://pith.science/pith/UET62GIZ4CFTYQASKHX7I4MPDI","download_json":"https://pith.science/pith/UET62GIZ4CFTYQASKHX7I4MPDI.json","view_paper":"https://pith.science/paper/UET62GIZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.04424&json=true","fetch_graph":"https://pith.science/api/pith-number/UET62GIZ4CFTYQASKHX7I4MPDI/graph.json","fetch_events":"https://pith.science/api/pith-number/UET62GIZ4CFTYQASKHX7I4MPDI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UET62GIZ4CFTYQASKHX7I4MPDI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UET62GIZ4CFTYQASKHX7I4MPDI/action/storage_attestation","attest_author":"https://pith.science/pith/UET62GIZ4CFTYQASKHX7I4MPDI/action/author_attestation","sign_citation":"https://pith.science/pith/UET62GIZ4CFTYQASKHX7I4MPDI/action/citation_signature","submit_replication":"https://pith.science/pith/UET62GIZ4CFTYQASKHX7I4MPDI/action/replication_record"}},"created_at":"2026-05-17T23:51:54.859897+00:00","updated_at":"2026-05-17T23:51:54.859897+00:00"}