{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:CIWYB6V76C2BKJSLNG2XEQQXYL","short_pith_number":"pith:CIWYB6V7","schema_version":"1.0","canonical_sha256":"122d80fabff0b415264b69b5724217c2eae2275d5e998b08716a5500bf0e1caf","source":{"kind":"arxiv","id":"1604.02303","version":1},"attestation_state":"computed","paper":{"title":"Decidability of the Membership Problem for $2\\times 2$ integer matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.DM","authors_text":"Igor Potapov, Pavel Semukhin","submitted_at":"2016-04-08T10:53:55Z","abstract_excerpt":"The main result of this paper is the decidability of the membership problem for $2\\times 2$ nonsingular integer matrices. Namely, we will construct the first algorithm that for any nonsingular $2\\times 2$ integer matrices $M_1,\\dots,M_n$ and $M$ decides whether $M$ belongs to the semigroup generated by $\\{M_1,\\dots,M_n\\}$.\n  Our algorithm relies on a translation of the numerical problem on matrices into combinatorial problems on words. It also makes use of some algebraical properties of well-known subgroups of $\\mathrm{GL}(2,\\mathbb{Z})$ and various new techniques and constructions that help t"},"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":"1604.02303","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-04-08T10:53:55Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"1ba800480a976fd0be97d83293b5a3d065e6d439ae24525aba25c3e4d720988c","abstract_canon_sha256":"3701f7ae6c0c69b0327e370af0d99188023859ff8df75f48c068bce04ea26b99"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:26.921096Z","signature_b64":"HmzOKNTEB6dWUhS87b8spWQH1YW5wku+4+UKj3XcKl4nT2cATt/YUpUUM84grb/KUZ96N/PWeSOzJ2JVgm+yDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"122d80fabff0b415264b69b5724217c2eae2275d5e998b08716a5500bf0e1caf","last_reissued_at":"2026-05-18T01:17:26.920556Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:26.920556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decidability of the Membership Problem for $2\\times 2$ integer matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.DM","authors_text":"Igor Potapov, Pavel Semukhin","submitted_at":"2016-04-08T10:53:55Z","abstract_excerpt":"The main result of this paper is the decidability of the membership problem for $2\\times 2$ nonsingular integer matrices. Namely, we will construct the first algorithm that for any nonsingular $2\\times 2$ integer matrices $M_1,\\dots,M_n$ and $M$ decides whether $M$ belongs to the semigroup generated by $\\{M_1,\\dots,M_n\\}$.\n  Our algorithm relies on a translation of the numerical problem on matrices into combinatorial problems on words. It also makes use of some algebraical properties of well-known subgroups of $\\mathrm{GL}(2,\\mathbb{Z})$ and various new techniques and constructions that help t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.02303","kind":"arxiv","version":1},"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":"1604.02303","created_at":"2026-05-18T01:17:26.920652+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.02303v1","created_at":"2026-05-18T01:17:26.920652+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02303","created_at":"2026-05-18T01:17:26.920652+00:00"},{"alias_kind":"pith_short_12","alias_value":"CIWYB6V76C2B","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"CIWYB6V76C2BKJSL","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"CIWYB6V7","created_at":"2026-05-18T12:30:09.641336+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/CIWYB6V76C2BKJSLNG2XEQQXYL","json":"https://pith.science/pith/CIWYB6V76C2BKJSLNG2XEQQXYL.json","graph_json":"https://pith.science/api/pith-number/CIWYB6V76C2BKJSLNG2XEQQXYL/graph.json","events_json":"https://pith.science/api/pith-number/CIWYB6V76C2BKJSLNG2XEQQXYL/events.json","paper":"https://pith.science/paper/CIWYB6V7"},"agent_actions":{"view_html":"https://pith.science/pith/CIWYB6V76C2BKJSLNG2XEQQXYL","download_json":"https://pith.science/pith/CIWYB6V76C2BKJSLNG2XEQQXYL.json","view_paper":"https://pith.science/paper/CIWYB6V7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.02303&json=true","fetch_graph":"https://pith.science/api/pith-number/CIWYB6V76C2BKJSLNG2XEQQXYL/graph.json","fetch_events":"https://pith.science/api/pith-number/CIWYB6V76C2BKJSLNG2XEQQXYL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CIWYB6V76C2BKJSLNG2XEQQXYL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CIWYB6V76C2BKJSLNG2XEQQXYL/action/storage_attestation","attest_author":"https://pith.science/pith/CIWYB6V76C2BKJSLNG2XEQQXYL/action/author_attestation","sign_citation":"https://pith.science/pith/CIWYB6V76C2BKJSLNG2XEQQXYL/action/citation_signature","submit_replication":"https://pith.science/pith/CIWYB6V76C2BKJSLNG2XEQQXYL/action/replication_record"}},"created_at":"2026-05-18T01:17:26.920652+00:00","updated_at":"2026-05-18T01:17:26.920652+00:00"}