{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:CIWYB6V76C2BKJSLNG2XEQQXYL","short_pith_number":"pith:CIWYB6V7","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"},"canonical_sha256":"122d80fabff0b415264b69b5724217c2eae2275d5e998b08716a5500bf0e1caf","source":{"kind":"arxiv","id":"1604.02303","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.02303","created_at":"2026-05-18T01:17:26Z"},{"alias_kind":"arxiv_version","alias_value":"1604.02303v1","created_at":"2026-05-18T01:17:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02303","created_at":"2026-05-18T01:17:26Z"},{"alias_kind":"pith_short_12","alias_value":"CIWYB6V76C2B","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CIWYB6V76C2BKJSL","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CIWYB6V7","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:CIWYB6V76C2BKJSLNG2XEQQXYL","target":"record","payload":{"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"},"canonical_sha256":"122d80fabff0b415264b69b5724217c2eae2275d5e998b08716a5500bf0e1caf","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"},"source_kind":"arxiv","source_id":"1604.02303","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:17:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NDyduCWczSkcJCoquWy7SR1PJioFhYQHHddHB3VZAXdj6m9utehvu6YRluDyn3bdvjTmai4kOMJUMeP1iqHjAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T11:26:36.397130Z"},"content_sha256":"83f078ee0349f8152873649b7b208b5498facd12193e3625df1cab87cb3bee8c","schema_version":"1.0","event_id":"sha256:83f078ee0349f8152873649b7b208b5498facd12193e3625df1cab87cb3bee8c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:CIWYB6V76C2BKJSLNG2XEQQXYL","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:17:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hw9p6J5LARflmUTdWG4RI0iDOqdo31OXHxIPPrx3S8G6f4HxjhIJIGQTgKEd/h4Rgkm7uZx3ct+hSZOhcTUeDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T11:26:36.397817Z"},"content_sha256":"134ddfd92662c7816e19643442dffd6f2d7f48671dfcfeff02ffac938430bcce","schema_version":"1.0","event_id":"sha256:134ddfd92662c7816e19643442dffd6f2d7f48671dfcfeff02ffac938430bcce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CIWYB6V76C2BKJSLNG2XEQQXYL/bundle.json","state_url":"https://pith.science/pith/CIWYB6V76C2BKJSLNG2XEQQXYL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CIWYB6V76C2BKJSLNG2XEQQXYL/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-09T11:26:36Z","links":{"resolver":"https://pith.science/pith/CIWYB6V76C2BKJSLNG2XEQQXYL","bundle":"https://pith.science/pith/CIWYB6V76C2BKJSLNG2XEQQXYL/bundle.json","state":"https://pith.science/pith/CIWYB6V76C2BKJSLNG2XEQQXYL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CIWYB6V76C2BKJSLNG2XEQQXYL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:CIWYB6V76C2BKJSLNG2XEQQXYL","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3701f7ae6c0c69b0327e370af0d99188023859ff8df75f48c068bce04ea26b99","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-04-08T10:53:55Z","title_canon_sha256":"1ba800480a976fd0be97d83293b5a3d065e6d439ae24525aba25c3e4d720988c"},"schema_version":"1.0","source":{"id":"1604.02303","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.02303","created_at":"2026-05-18T01:17:26Z"},{"alias_kind":"arxiv_version","alias_value":"1604.02303v1","created_at":"2026-05-18T01:17:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02303","created_at":"2026-05-18T01:17:26Z"},{"alias_kind":"pith_short_12","alias_value":"CIWYB6V76C2B","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CIWYB6V76C2BKJSL","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CIWYB6V7","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:134ddfd92662c7816e19643442dffd6f2d7f48671dfcfeff02ffac938430bcce","target":"graph","created_at":"2026-05-18T01:17:26Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Igor Potapov, Pavel Semukhin","cross_cats":["cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-04-08T10:53:55Z","title":"Decidability of the Membership Problem for $2\\times 2$ integer matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.02303","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:83f078ee0349f8152873649b7b208b5498facd12193e3625df1cab87cb3bee8c","target":"record","created_at":"2026-05-18T01:17:26Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"3701f7ae6c0c69b0327e370af0d99188023859ff8df75f48c068bce04ea26b99","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-04-08T10:53:55Z","title_canon_sha256":"1ba800480a976fd0be97d83293b5a3d065e6d439ae24525aba25c3e4d720988c"},"schema_version":"1.0","source":{"id":"1604.02303","kind":"arxiv","version":1}},"canonical_sha256":"122d80fabff0b415264b69b5724217c2eae2275d5e998b08716a5500bf0e1caf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"122d80fabff0b415264b69b5724217c2eae2275d5e998b08716a5500bf0e1caf","first_computed_at":"2026-05-18T01:17:26.920556Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:26.920556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HmzOKNTEB6dWUhS87b8spWQH1YW5wku+4+UKj3XcKl4nT2cATt/YUpUUM84grb/KUZ96N/PWeSOzJ2JVgm+yDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:26.921096Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.02303","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:83f078ee0349f8152873649b7b208b5498facd12193e3625df1cab87cb3bee8c","sha256:134ddfd92662c7816e19643442dffd6f2d7f48671dfcfeff02ffac938430bcce"],"state_sha256":"df15e903a7e6cf90b7baa63a7bcd8003e3c5740d1f6f5dbad5fc445839007fee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6j6zpdD2S34DLXueqcWjk/0o7eySjaTlwcGKOpbaK4++opW601t865W+4WpdOF5DI7dhslI7M2noyy+49RY/Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T11:26:36.401201Z","bundle_sha256":"7efc75e665f3350ef45ead673bdef5db3fbb89770cc2759fbe864357c68baf15"}}