{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1998:XUCQMQLQ2WEGKZXDE7NEGEMVG7","short_pith_number":"pith:XUCQMQLQ","schema_version":"1.0","canonical_sha256":"bd05064170d5886566e327da43119537e59c59bb4e95de58fbf05c1a19fb61a6","source":{"kind":"arxiv","id":"math/9801126","version":3},"attestation_state":"computed","paper":{"title":"A new algorithm for recognizing the unknot","license":"","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Joan S. Birman, Michael D. Hirsch","submitted_at":"1998-01-28T16:01:54Z","abstract_excerpt":"The topological underpinnings are presented for a new algorithm which answers the question: `Is a given knot the unknot?' The algorithm uses the braid foliation technology of Bennequin and of Birman and Menasco. The approach is to consider the knot as a closed braid, and to use the fact that a knot is unknotted if and only if it is the boundary of a disc with a combinatorial foliation. The main problems which are solved in this paper are: how to systematically enumerate combinatorial braid foliations of a disc; how to verify whether a combinatorial foliation can be realized by an embedded disc"},"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":"math/9801126","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"math.GT","submitted_at":"1998-01-28T16:01:54Z","cross_cats_sorted":[],"title_canon_sha256":"f07af64ea1ffd097a508fa706865ad674ab316e878ef61beb8518d0017edc076","abstract_canon_sha256":"bc221969d2df049c2e1abe95c0b5711ef665cfaa908b00d6857930bae084a69a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:37:59.330889Z","signature_b64":"VoVj/vWHPldOkw+5+/Vi9GJVn642n4G744UKgsjunOn12odTDBnGBZawKk+u3NN0Xi57idrvasANPVpc6mCJCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd05064170d5886566e327da43119537e59c59bb4e95de58fbf05c1a19fb61a6","last_reissued_at":"2026-05-18T02:37:59.330567Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:37:59.330567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A new algorithm for recognizing the unknot","license":"","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Joan S. Birman, Michael D. Hirsch","submitted_at":"1998-01-28T16:01:54Z","abstract_excerpt":"The topological underpinnings are presented for a new algorithm which answers the question: `Is a given knot the unknot?' The algorithm uses the braid foliation technology of Bennequin and of Birman and Menasco. The approach is to consider the knot as a closed braid, and to use the fact that a knot is unknotted if and only if it is the boundary of a disc with a combinatorial foliation. The main problems which are solved in this paper are: how to systematically enumerate combinatorial braid foliations of a disc; how to verify whether a combinatorial foliation can be realized by an embedded disc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/9801126","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":"math/9801126","created_at":"2026-05-18T02:37:59.330613+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/9801126v3","created_at":"2026-05-18T02:37:59.330613+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/9801126","created_at":"2026-05-18T02:37:59.330613+00:00"},{"alias_kind":"pith_short_12","alias_value":"XUCQMQLQ2WEG","created_at":"2026-05-18T12:25:49.038998+00:00"},{"alias_kind":"pith_short_16","alias_value":"XUCQMQLQ2WEGKZXD","created_at":"2026-05-18T12:25:49.038998+00:00"},{"alias_kind":"pith_short_8","alias_value":"XUCQMQLQ","created_at":"2026-05-18T12:25:49.038998+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/XUCQMQLQ2WEGKZXDE7NEGEMVG7","json":"https://pith.science/pith/XUCQMQLQ2WEGKZXDE7NEGEMVG7.json","graph_json":"https://pith.science/api/pith-number/XUCQMQLQ2WEGKZXDE7NEGEMVG7/graph.json","events_json":"https://pith.science/api/pith-number/XUCQMQLQ2WEGKZXDE7NEGEMVG7/events.json","paper":"https://pith.science/paper/XUCQMQLQ"},"agent_actions":{"view_html":"https://pith.science/pith/XUCQMQLQ2WEGKZXDE7NEGEMVG7","download_json":"https://pith.science/pith/XUCQMQLQ2WEGKZXDE7NEGEMVG7.json","view_paper":"https://pith.science/paper/XUCQMQLQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/9801126&json=true","fetch_graph":"https://pith.science/api/pith-number/XUCQMQLQ2WEGKZXDE7NEGEMVG7/graph.json","fetch_events":"https://pith.science/api/pith-number/XUCQMQLQ2WEGKZXDE7NEGEMVG7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XUCQMQLQ2WEGKZXDE7NEGEMVG7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XUCQMQLQ2WEGKZXDE7NEGEMVG7/action/storage_attestation","attest_author":"https://pith.science/pith/XUCQMQLQ2WEGKZXDE7NEGEMVG7/action/author_attestation","sign_citation":"https://pith.science/pith/XUCQMQLQ2WEGKZXDE7NEGEMVG7/action/citation_signature","submit_replication":"https://pith.science/pith/XUCQMQLQ2WEGKZXDE7NEGEMVG7/action/replication_record"}},"created_at":"2026-05-18T02:37:59.330613+00:00","updated_at":"2026-05-18T02:37:59.330613+00:00"}