{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:BO32ZG2QBSUPBBKYBS6LG7E43B","short_pith_number":"pith:BO32ZG2Q","schema_version":"1.0","canonical_sha256":"0bb7ac9b500ca8f085580cbcb37c9cd86c6f58aec1e2bdfc5a0c9c0c5b27c578","source":{"kind":"arxiv","id":"math/0601525","version":5},"attestation_state":"computed","paper":{"title":"Hard Unknots and Collapsing Tangles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Louis H. Kauffman, Sofia Lambropoulou","submitted_at":"2006-01-22T04:32:02Z","abstract_excerpt":"This paper gives infinitely many examples of unknot diagrams that are hard, in the sense that the diagrams need to be made more complicated by Reidemeister moves before they can be simplified. In order to construct these diagrams, we prove theorems characterizing when the numerator of the sum of two rational tangles is an unknot. The key theorem shows that the numerator of the sum of two rational tangles [P/Q] and [R/S] is unknotted if and only if PS + QR has absolute value equal to 1. The paper uses these results in studying processive DNA recombination, finding minimal size unknot diagrams, "},"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/0601525","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2006-01-22T04:32:02Z","cross_cats_sorted":[],"title_canon_sha256":"b228a01d83c47c0ba0fb914b2557c9cb3ad6eb644dab68da8b610b7bc8377ade","abstract_canon_sha256":"36ed18c1376b4a31a987d813b85e4cd9287ca885d4ab4638ad5d7f5c9f7abf10"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:22.981938Z","signature_b64":"2gpCblO69psS+Z8RfH4onegiGG2iuhkeF8DF43RJ7I/NTHCJAaJWZpDAeKmxm0Z5yL1SuZPYUjRjeqHDJXosBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0bb7ac9b500ca8f085580cbcb37c9cd86c6f58aec1e2bdfc5a0c9c0c5b27c578","last_reissued_at":"2026-05-18T02:46:22.981505Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:22.981505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hard Unknots and Collapsing Tangles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Louis H. Kauffman, Sofia Lambropoulou","submitted_at":"2006-01-22T04:32:02Z","abstract_excerpt":"This paper gives infinitely many examples of unknot diagrams that are hard, in the sense that the diagrams need to be made more complicated by Reidemeister moves before they can be simplified. In order to construct these diagrams, we prove theorems characterizing when the numerator of the sum of two rational tangles is an unknot. The key theorem shows that the numerator of the sum of two rational tangles [P/Q] and [R/S] is unknotted if and only if PS + QR has absolute value equal to 1. The paper uses these results in studying processive DNA recombination, finding minimal size unknot diagrams, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0601525","kind":"arxiv","version":5},"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/0601525","created_at":"2026-05-18T02:46:22.981564+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0601525v5","created_at":"2026-05-18T02:46:22.981564+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0601525","created_at":"2026-05-18T02:46:22.981564+00:00"},{"alias_kind":"pith_short_12","alias_value":"BO32ZG2QBSUP","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_16","alias_value":"BO32ZG2QBSUPBBKY","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_8","alias_value":"BO32ZG2Q","created_at":"2026-05-18T12:25:53.939244+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/BO32ZG2QBSUPBBKYBS6LG7E43B","json":"https://pith.science/pith/BO32ZG2QBSUPBBKYBS6LG7E43B.json","graph_json":"https://pith.science/api/pith-number/BO32ZG2QBSUPBBKYBS6LG7E43B/graph.json","events_json":"https://pith.science/api/pith-number/BO32ZG2QBSUPBBKYBS6LG7E43B/events.json","paper":"https://pith.science/paper/BO32ZG2Q"},"agent_actions":{"view_html":"https://pith.science/pith/BO32ZG2QBSUPBBKYBS6LG7E43B","download_json":"https://pith.science/pith/BO32ZG2QBSUPBBKYBS6LG7E43B.json","view_paper":"https://pith.science/paper/BO32ZG2Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0601525&json=true","fetch_graph":"https://pith.science/api/pith-number/BO32ZG2QBSUPBBKYBS6LG7E43B/graph.json","fetch_events":"https://pith.science/api/pith-number/BO32ZG2QBSUPBBKYBS6LG7E43B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BO32ZG2QBSUPBBKYBS6LG7E43B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BO32ZG2QBSUPBBKYBS6LG7E43B/action/storage_attestation","attest_author":"https://pith.science/pith/BO32ZG2QBSUPBBKYBS6LG7E43B/action/author_attestation","sign_citation":"https://pith.science/pith/BO32ZG2QBSUPBBKYBS6LG7E43B/action/citation_signature","submit_replication":"https://pith.science/pith/BO32ZG2QBSUPBBKYBS6LG7E43B/action/replication_record"}},"created_at":"2026-05-18T02:46:22.981564+00:00","updated_at":"2026-05-18T02:46:22.981564+00:00"}