{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:A3QHX5E7EPXREIJKHIQLIFGIWR","short_pith_number":"pith:A3QHX5E7","schema_version":"1.0","canonical_sha256":"06e07bf49f23ef12212a3a20b414c8b471df52832939a3dce4d165d98ae06fe1","source":{"kind":"arxiv","id":"1602.08427","version":3},"attestation_state":"computed","paper":{"title":"Some conditionally hard problems on links and 3-manifolds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Marc Lackenby","submitted_at":"2016-02-26T18:34:17Z","abstract_excerpt":"We show that three natural decision problems about links and 3-manifolds are computationally hard, assuming some conjectures in complexity theory. The first problem is determining whether a link in the 3-sphere bounds a Seifert surface with Thurston norm at most a given integer; this is shown to be NP-complete. The second problem is the homeomorphism problem for closed 3-manifolds; this is shown to be at least as hard as the graph isomorphism problem. The third problem is determining whether a given link in the 3-sphere is a sublink of another given link; this is shown to be NP-hard."},"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":"1602.08427","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2016-02-26T18:34:17Z","cross_cats_sorted":[],"title_canon_sha256":"d55059b6480619eb14b7f03323a7641678e61f0c3343157d6ef5f7aead7db6bf","abstract_canon_sha256":"2bb97b88706c24fef30d97578a48c7313bf528f274359841d6ccd215dfaa6045"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:30.579050Z","signature_b64":"X2JOhi2AZWltXv4Q4ygU6ua+vn6Fusf1nf/WJ+IfF1fxueN03Z2/AdpboeHsbwvxG6cUHglSkmevmdFA9NufAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06e07bf49f23ef12212a3a20b414c8b471df52832939a3dce4d165d98ae06fe1","last_reissued_at":"2026-05-18T00:45:30.578680Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:30.578680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Some conditionally hard problems on links and 3-manifolds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Marc Lackenby","submitted_at":"2016-02-26T18:34:17Z","abstract_excerpt":"We show that three natural decision problems about links and 3-manifolds are computationally hard, assuming some conjectures in complexity theory. The first problem is determining whether a link in the 3-sphere bounds a Seifert surface with Thurston norm at most a given integer; this is shown to be NP-complete. The second problem is the homeomorphism problem for closed 3-manifolds; this is shown to be at least as hard as the graph isomorphism problem. The third problem is determining whether a given link in the 3-sphere is a sublink of another given link; this is shown to be NP-hard."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08427","kind":"arxiv","version":3},"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":"1602.08427","created_at":"2026-05-18T00:45:30.578732+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.08427v3","created_at":"2026-05-18T00:45:30.578732+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08427","created_at":"2026-05-18T00:45:30.578732+00:00"},{"alias_kind":"pith_short_12","alias_value":"A3QHX5E7EPXR","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"A3QHX5E7EPXREIJK","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"A3QHX5E7","created_at":"2026-05-18T12:30:04.600751+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/A3QHX5E7EPXREIJKHIQLIFGIWR","json":"https://pith.science/pith/A3QHX5E7EPXREIJKHIQLIFGIWR.json","graph_json":"https://pith.science/api/pith-number/A3QHX5E7EPXREIJKHIQLIFGIWR/graph.json","events_json":"https://pith.science/api/pith-number/A3QHX5E7EPXREIJKHIQLIFGIWR/events.json","paper":"https://pith.science/paper/A3QHX5E7"},"agent_actions":{"view_html":"https://pith.science/pith/A3QHX5E7EPXREIJKHIQLIFGIWR","download_json":"https://pith.science/pith/A3QHX5E7EPXREIJKHIQLIFGIWR.json","view_paper":"https://pith.science/paper/A3QHX5E7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.08427&json=true","fetch_graph":"https://pith.science/api/pith-number/A3QHX5E7EPXREIJKHIQLIFGIWR/graph.json","fetch_events":"https://pith.science/api/pith-number/A3QHX5E7EPXREIJKHIQLIFGIWR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A3QHX5E7EPXREIJKHIQLIFGIWR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A3QHX5E7EPXREIJKHIQLIFGIWR/action/storage_attestation","attest_author":"https://pith.science/pith/A3QHX5E7EPXREIJKHIQLIFGIWR/action/author_attestation","sign_citation":"https://pith.science/pith/A3QHX5E7EPXREIJKHIQLIFGIWR/action/citation_signature","submit_replication":"https://pith.science/pith/A3QHX5E7EPXREIJKHIQLIFGIWR/action/replication_record"}},"created_at":"2026-05-18T00:45:30.578732+00:00","updated_at":"2026-05-18T00:45:30.578732+00:00"}