{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:65Z5XB2HPUL4CHUF4P47H7L5WC","short_pith_number":"pith:65Z5XB2H","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"},"canonical_sha256":"f773db87477d17c11e85e3f9f3fd7db0a6a1f81c5778328376c26d43ca5bdf0e","source":{"kind":"arxiv","id":"1610.09834","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.09834","created_at":"2026-05-18T01:00:47Z"},{"alias_kind":"arxiv_version","alias_value":"1610.09834v1","created_at":"2026-05-18T01:00:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.09834","created_at":"2026-05-18T01:00:47Z"},{"alias_kind":"pith_short_12","alias_value":"65Z5XB2HPUL4","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"65Z5XB2HPUL4CHUF","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"65Z5XB2H","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:65Z5XB2HPUL4CHUF4P47H7L5WC","target":"record","payload":{"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"},"canonical_sha256":"f773db87477d17c11e85e3f9f3fd7db0a6a1f81c5778328376c26d43ca5bdf0e","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"},"source_kind":"arxiv","source_id":"1610.09834","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:00:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ny14ZtwR0XtT5cfTSdj/xRBHae59gCygZQqH6Tovy5oyYooYJ8KndhihDulcf1ywHy3xCq5C5vg4AOB/jfZsDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T18:04:06.529503Z"},"content_sha256":"682d8543c6f362417da112102ddd6f16e14e349ff04c45612ed6b3334459757a","schema_version":"1.0","event_id":"sha256:682d8543c6f362417da112102ddd6f16e14e349ff04c45612ed6b3334459757a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:65Z5XB2HPUL4CHUF4P47H7L5WC","target":"graph","payload":{"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"},"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:00:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lG3HgIGnIq1RT9eDoithWvJyyXdGrFYNAMa5coxiGEWPUqm1JJ+LX/wBAyQBcrBQAainb0iPtQwBQHtKFkcJCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T18:04:06.529862Z"},"content_sha256":"50fbd139f40c213d51f741ffbcc2819eff3337059b87aba2158064ac61ba5522","schema_version":"1.0","event_id":"sha256:50fbd139f40c213d51f741ffbcc2819eff3337059b87aba2158064ac61ba5522"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/65Z5XB2HPUL4CHUF4P47H7L5WC/bundle.json","state_url":"https://pith.science/pith/65Z5XB2HPUL4CHUF4P47H7L5WC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/65Z5XB2HPUL4CHUF4P47H7L5WC/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-04T18:04:06Z","links":{"resolver":"https://pith.science/pith/65Z5XB2HPUL4CHUF4P47H7L5WC","bundle":"https://pith.science/pith/65Z5XB2HPUL4CHUF4P47H7L5WC/bundle.json","state":"https://pith.science/pith/65Z5XB2HPUL4CHUF4P47H7L5WC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/65Z5XB2HPUL4CHUF4P47H7L5WC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:65Z5XB2HPUL4CHUF4P47H7L5WC","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":"44f525c8d3143f508489d20609fb98dcaa341b9d8c109ccc1cf33caa6ada115d","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-10-31T09:06:53Z","title_canon_sha256":"821d10d3ff76eb0262ae11de012961bb687dca9fd8d8758438babb1a2a9ac1ac"},"schema_version":"1.0","source":{"id":"1610.09834","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.09834","created_at":"2026-05-18T01:00:47Z"},{"alias_kind":"arxiv_version","alias_value":"1610.09834v1","created_at":"2026-05-18T01:00:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.09834","created_at":"2026-05-18T01:00:47Z"},{"alias_kind":"pith_short_12","alias_value":"65Z5XB2HPUL4","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"65Z5XB2HPUL4CHUF","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"65Z5XB2H","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:50fbd139f40c213d51f741ffbcc2819eff3337059b87aba2158064ac61ba5522","target":"graph","created_at":"2026-05-18T01:00:47Z","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":"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 ","authors_text":"Igor Potapov, Sang-Ki Ko","cross_cats":["cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-10-31T09:06:53Z","title":"Matrix Semigroup Freeness Problems in $\\mathrm{SL}(2,\\mathbb{Z})$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.09834","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:682d8543c6f362417da112102ddd6f16e14e349ff04c45612ed6b3334459757a","target":"record","created_at":"2026-05-18T01:00:47Z","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":"44f525c8d3143f508489d20609fb98dcaa341b9d8c109ccc1cf33caa6ada115d","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-10-31T09:06:53Z","title_canon_sha256":"821d10d3ff76eb0262ae11de012961bb687dca9fd8d8758438babb1a2a9ac1ac"},"schema_version":"1.0","source":{"id":"1610.09834","kind":"arxiv","version":1}},"canonical_sha256":"f773db87477d17c11e85e3f9f3fd7db0a6a1f81c5778328376c26d43ca5bdf0e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f773db87477d17c11e85e3f9f3fd7db0a6a1f81c5778328376c26d43ca5bdf0e","first_computed_at":"2026-05-18T01:00:47.088804Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:47.088804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g/Emb4KAnmQ32pTBxShbNmLvuUCu9xCgC/fJNuOvjw84Y6ZR+FNdbE+/c4nOHWHgGLQ35Lc5lK7TbraVYo1cCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:47.089183Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.09834","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:682d8543c6f362417da112102ddd6f16e14e349ff04c45612ed6b3334459757a","sha256:50fbd139f40c213d51f741ffbcc2819eff3337059b87aba2158064ac61ba5522"],"state_sha256":"2563b6106c2566a2601f40692f9b859e41d143384e2e2f84814e3f1d76dec908"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mMbTVLqe1e0l4/rKMLU7QIc8eWCIY54UCw4a73/gaA8mbMWNj2iXna9/XUXd8ZxE55/sxOfiVGhzQmrLfYzsAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T18:04:06.532147Z","bundle_sha256":"114e62479ba1618997f853941a5f0f3406c299e77bccc6a7c7bc401bf1c53fce"}}