{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:65Z5XB2HPUL4CHUF4P47H7L5WC","short_pith_number":"pith:65Z5XB2H","schema_version":"1.0","canonical_sha256":"f773db87477d17c11e85e3f9f3fd7db0a6a1f81c5778328376c26d43ca5bdf0e","source":{"kind":"arxiv","id":"1610.09834","version":1},"attestation_state":"computed","paper":{"title":"Matrix Semigroup Freeness Problems in $\\mathrm{SL}(2,\\mathbb{Z})$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.CC","authors_text":"Igor Potapov, Sang-Ki Ko","submitted_at":"2016-10-31T09:06:53Z","abstract_excerpt":"In this paper we study decidability and complexity of decision problems on matrices from the special linear group $\\mathrm{SL}(2,\\mathbb{Z})$. In particular, we study the freeness problem: given a finite set of matrices $G$ generating a multiplicative semigroup $S$, decide whether each element of $S$ has at most one factorization over $G$. In other words, is $G$ a code? We show that the problem of deciding whether a matrix semigroup in $\\mathrm{SL}(2,\\mathbb{Z})$ is non-free is NP-hard. Then, we study questions about the number of factorizations of matrices in the matrix semigroup such as the "},"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":"1610.09834","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-10-31T09:06:53Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"821d10d3ff76eb0262ae11de012961bb687dca9fd8d8758438babb1a2a9ac1ac","abstract_canon_sha256":"44f525c8d3143f508489d20609fb98dcaa341b9d8c109ccc1cf33caa6ada115d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:47.089183Z","signature_b64":"g/Emb4KAnmQ32pTBxShbNmLvuUCu9xCgC/fJNuOvjw84Y6ZR+FNdbE+/c4nOHWHgGLQ35Lc5lK7TbraVYo1cCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f773db87477d17c11e85e3f9f3fd7db0a6a1f81c5778328376c26d43ca5bdf0e","last_reissued_at":"2026-05-18T01:00:47.088804Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:47.088804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Matrix Semigroup Freeness Problems in $\\mathrm{SL}(2,\\mathbb{Z})$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.CC","authors_text":"Igor Potapov, Sang-Ki Ko","submitted_at":"2016-10-31T09:06:53Z","abstract_excerpt":"In this paper we study decidability and complexity of decision problems on matrices from the special linear group $\\mathrm{SL}(2,\\mathbb{Z})$. In particular, we study the freeness problem: given a finite set of matrices $G$ generating a multiplicative semigroup $S$, decide whether each element of $S$ has at most one factorization over $G$. In other words, is $G$ a code? We show that the problem of deciding whether a matrix semigroup in $\\mathrm{SL}(2,\\mathbb{Z})$ is non-free is NP-hard. Then, we study questions about the number of factorizations of matrices in the matrix semigroup such as the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.09834","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":"1610.09834","created_at":"2026-05-18T01:00:47.088852+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.09834v1","created_at":"2026-05-18T01:00:47.088852+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.09834","created_at":"2026-05-18T01:00:47.088852+00:00"},{"alias_kind":"pith_short_12","alias_value":"65Z5XB2HPUL4","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"65Z5XB2HPUL4CHUF","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"65Z5XB2H","created_at":"2026-05-18T12:30:01.593930+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/65Z5XB2HPUL4CHUF4P47H7L5WC","json":"https://pith.science/pith/65Z5XB2HPUL4CHUF4P47H7L5WC.json","graph_json":"https://pith.science/api/pith-number/65Z5XB2HPUL4CHUF4P47H7L5WC/graph.json","events_json":"https://pith.science/api/pith-number/65Z5XB2HPUL4CHUF4P47H7L5WC/events.json","paper":"https://pith.science/paper/65Z5XB2H"},"agent_actions":{"view_html":"https://pith.science/pith/65Z5XB2HPUL4CHUF4P47H7L5WC","download_json":"https://pith.science/pith/65Z5XB2HPUL4CHUF4P47H7L5WC.json","view_paper":"https://pith.science/paper/65Z5XB2H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.09834&json=true","fetch_graph":"https://pith.science/api/pith-number/65Z5XB2HPUL4CHUF4P47H7L5WC/graph.json","fetch_events":"https://pith.science/api/pith-number/65Z5XB2HPUL4CHUF4P47H7L5WC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/65Z5XB2HPUL4CHUF4P47H7L5WC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/65Z5XB2HPUL4CHUF4P47H7L5WC/action/storage_attestation","attest_author":"https://pith.science/pith/65Z5XB2HPUL4CHUF4P47H7L5WC/action/author_attestation","sign_citation":"https://pith.science/pith/65Z5XB2HPUL4CHUF4P47H7L5WC/action/citation_signature","submit_replication":"https://pith.science/pith/65Z5XB2HPUL4CHUF4P47H7L5WC/action/replication_record"}},"created_at":"2026-05-18T01:00:47.088852+00:00","updated_at":"2026-05-18T01:00:47.088852+00:00"}