{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:J5WN6UEPSZ3DSXJBQ6WFHDKZ4I","short_pith_number":"pith:J5WN6UEP","schema_version":"1.0","canonical_sha256":"4f6cdf508f9676395d2187ac538d59e231bccf787aed75f8d86d89cd5d5478fa","source":{"kind":"arxiv","id":"0908.3127","version":3},"attestation_state":"computed","paper":{"title":"Minimal generating sets of Reidemeister moves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Michael Polyak","submitted_at":"2009-08-21T13:41:05Z","abstract_excerpt":"It is well known that any two diagrams representing the same oriented link are related by a finite sequence of Reidemeister moves O1, O2 and O3. Depending on orientations of fragments involved in the moves, one may distinguish 4 different versions of each of the O1 and O2 moves, and 8 versions of the O3 move. We introduce a minimal generating set of four oriented Reidemeister moves, which includes two O1 moves, one O2 move, and one O3 move. We then study which other sets of up to 5 oriented moves generate all moves, and show that only few of them do. Some commonly considered sets are shown not"},"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":"0908.3127","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2009-08-21T13:41:05Z","cross_cats_sorted":[],"title_canon_sha256":"d3919ec3414fe055926edb90393d1fdd86764365b34d191d7f6cc46498016b2b","abstract_canon_sha256":"31079534d74c88eabc4a9656058edc544dad4f61dc65709d500f25cf6a46e47f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:47.623109Z","signature_b64":"mjIRsImZn6TtqBadI1r+lxEtXr6+ou6wEiK+XAiAdYkRIQY4fewe/OBr9vq7myWtO16GSJGKtNfAHjjCk7CWAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f6cdf508f9676395d2187ac538d59e231bccf787aed75f8d86d89cd5d5478fa","last_reissued_at":"2026-05-18T02:24:47.622543Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:47.622543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimal generating sets of Reidemeister moves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Michael Polyak","submitted_at":"2009-08-21T13:41:05Z","abstract_excerpt":"It is well known that any two diagrams representing the same oriented link are related by a finite sequence of Reidemeister moves O1, O2 and O3. Depending on orientations of fragments involved in the moves, one may distinguish 4 different versions of each of the O1 and O2 moves, and 8 versions of the O3 move. We introduce a minimal generating set of four oriented Reidemeister moves, which includes two O1 moves, one O2 move, and one O3 move. We then study which other sets of up to 5 oriented moves generate all moves, and show that only few of them do. Some commonly considered sets are shown not"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0908.3127","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":"0908.3127","created_at":"2026-05-18T02:24:47.622627+00:00"},{"alias_kind":"arxiv_version","alias_value":"0908.3127v3","created_at":"2026-05-18T02:24:47.622627+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0908.3127","created_at":"2026-05-18T02:24:47.622627+00:00"},{"alias_kind":"pith_short_12","alias_value":"J5WN6UEPSZ3D","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_16","alias_value":"J5WN6UEPSZ3DSXJB","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_8","alias_value":"J5WN6UEP","created_at":"2026-05-18T12:26:00.592388+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.18456","citing_title":"A Fast, Strong, Topologically Meaningful and Fun Knot Invariant","ref_index":34,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/J5WN6UEPSZ3DSXJBQ6WFHDKZ4I","json":"https://pith.science/pith/J5WN6UEPSZ3DSXJBQ6WFHDKZ4I.json","graph_json":"https://pith.science/api/pith-number/J5WN6UEPSZ3DSXJBQ6WFHDKZ4I/graph.json","events_json":"https://pith.science/api/pith-number/J5WN6UEPSZ3DSXJBQ6WFHDKZ4I/events.json","paper":"https://pith.science/paper/J5WN6UEP"},"agent_actions":{"view_html":"https://pith.science/pith/J5WN6UEPSZ3DSXJBQ6WFHDKZ4I","download_json":"https://pith.science/pith/J5WN6UEPSZ3DSXJBQ6WFHDKZ4I.json","view_paper":"https://pith.science/paper/J5WN6UEP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0908.3127&json=true","fetch_graph":"https://pith.science/api/pith-number/J5WN6UEPSZ3DSXJBQ6WFHDKZ4I/graph.json","fetch_events":"https://pith.science/api/pith-number/J5WN6UEPSZ3DSXJBQ6WFHDKZ4I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J5WN6UEPSZ3DSXJBQ6WFHDKZ4I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J5WN6UEPSZ3DSXJBQ6WFHDKZ4I/action/storage_attestation","attest_author":"https://pith.science/pith/J5WN6UEPSZ3DSXJBQ6WFHDKZ4I/action/author_attestation","sign_citation":"https://pith.science/pith/J5WN6UEPSZ3DSXJBQ6WFHDKZ4I/action/citation_signature","submit_replication":"https://pith.science/pith/J5WN6UEPSZ3DSXJBQ6WFHDKZ4I/action/replication_record"}},"created_at":"2026-05-18T02:24:47.622627+00:00","updated_at":"2026-05-18T02:24:47.622627+00:00"}