{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:GIWG5XBSOTAUSDUWGRNUFXRC3C","short_pith_number":"pith:GIWG5XBS","schema_version":"1.0","canonical_sha256":"322c6edc3274c1490e96345b42de22d8a569e1ac29cb20dc7d719c543cdaec38","source":{"kind":"arxiv","id":"1502.06565","version":1},"attestation_state":"computed","paper":{"title":"Words in Linear Groups, Random Walks, Automata and P-Recursiveness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR","math.PR"],"primary_cat":"math.CO","authors_text":"Igor Pak, Scott Garrabrant","submitted_at":"2015-02-23T19:27:57Z","abstract_excerpt":"Fix a finite set $S \\subset {GL}(k,\\mathbb{Z})$. Denote by $a_n$ the number of products of matrices in $S$ of length $n$ that are equal to 1. We show that the sequence $\\{a_n\\}$ is not always P-recursive. This answers a question of Kontsevich."},"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":"1502.06565","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-23T19:27:57Z","cross_cats_sorted":["math.GR","math.PR"],"title_canon_sha256":"8917a3ca4f34d3e264269cb89aee0026624a5d8800e9bf04b1ccf774aa50057c","abstract_canon_sha256":"0fc42055c5150c9ac659b57e4d4ca3c622bbb94a275a515720efd6695fa1501e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:29.638376Z","signature_b64":"Wj9H/qM6/BBJcr18hf5Kx7OGd3hBilu4UKnqUSnABNQuW4iEHkD2xmnLauDnaXJ3zG8o4ZlZmWD27tOvBrx1Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"322c6edc3274c1490e96345b42de22d8a569e1ac29cb20dc7d719c543cdaec38","last_reissued_at":"2026-05-18T02:26:29.637986Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:29.637986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Words in Linear Groups, Random Walks, Automata and P-Recursiveness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR","math.PR"],"primary_cat":"math.CO","authors_text":"Igor Pak, Scott Garrabrant","submitted_at":"2015-02-23T19:27:57Z","abstract_excerpt":"Fix a finite set $S \\subset {GL}(k,\\mathbb{Z})$. Denote by $a_n$ the number of products of matrices in $S$ of length $n$ that are equal to 1. We show that the sequence $\\{a_n\\}$ is not always P-recursive. This answers a question of Kontsevich."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.06565","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":"1502.06565","created_at":"2026-05-18T02:26:29.638043+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.06565v1","created_at":"2026-05-18T02:26:29.638043+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.06565","created_at":"2026-05-18T02:26:29.638043+00:00"},{"alias_kind":"pith_short_12","alias_value":"GIWG5XBSOTAU","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"GIWG5XBSOTAUSDUW","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"GIWG5XBS","created_at":"2026-05-18T12:29:22.688609+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/GIWG5XBSOTAUSDUWGRNUFXRC3C","json":"https://pith.science/pith/GIWG5XBSOTAUSDUWGRNUFXRC3C.json","graph_json":"https://pith.science/api/pith-number/GIWG5XBSOTAUSDUWGRNUFXRC3C/graph.json","events_json":"https://pith.science/api/pith-number/GIWG5XBSOTAUSDUWGRNUFXRC3C/events.json","paper":"https://pith.science/paper/GIWG5XBS"},"agent_actions":{"view_html":"https://pith.science/pith/GIWG5XBSOTAUSDUWGRNUFXRC3C","download_json":"https://pith.science/pith/GIWG5XBSOTAUSDUWGRNUFXRC3C.json","view_paper":"https://pith.science/paper/GIWG5XBS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.06565&json=true","fetch_graph":"https://pith.science/api/pith-number/GIWG5XBSOTAUSDUWGRNUFXRC3C/graph.json","fetch_events":"https://pith.science/api/pith-number/GIWG5XBSOTAUSDUWGRNUFXRC3C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GIWG5XBSOTAUSDUWGRNUFXRC3C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GIWG5XBSOTAUSDUWGRNUFXRC3C/action/storage_attestation","attest_author":"https://pith.science/pith/GIWG5XBSOTAUSDUWGRNUFXRC3C/action/author_attestation","sign_citation":"https://pith.science/pith/GIWG5XBSOTAUSDUWGRNUFXRC3C/action/citation_signature","submit_replication":"https://pith.science/pith/GIWG5XBSOTAUSDUWGRNUFXRC3C/action/replication_record"}},"created_at":"2026-05-18T02:26:29.638043+00:00","updated_at":"2026-05-18T02:26:29.638043+00:00"}