{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LISFTORFJ4X5M3FGXSCRUH6VEC","short_pith_number":"pith:LISFTORF","schema_version":"1.0","canonical_sha256":"5a2459ba254f2fd66ca6bc851a1fd520867139e4f104a5ac57fcea57df2356eb","source":{"kind":"arxiv","id":"1801.03887","version":2},"attestation_state":"computed","paper":{"title":"Words have bounded width in $SL(n,\\mathbb{Z})$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Chen Meiri, Nir Avni","submitted_at":"2018-01-11T17:24:35Z","abstract_excerpt":"We prove two results about width of words in $SL_n(\\mathbb{Z})$. The first is that, for every $n \\geq 3$, there is a constant $C(n)$ such that the width of any word in $SL_n(\\mathbb{Z})$ is less than $C(n)$. The second result is that, for any word $w$, if $n$ is big enough, the width of $w$ in $SL_n(\\mathbb{Z})$ is at most 87."},"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":"1801.03887","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2018-01-11T17:24:35Z","cross_cats_sorted":[],"title_canon_sha256":"19172632ee930f211a42cb276a926b5d8cfb29e77e840a3c6b44be5afa21f62b","abstract_canon_sha256":"8105f6e7064ef4fabd6c6e4cb384d6d7ba9fdd0a583112786130d12006cff342"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:07.181384Z","signature_b64":"/UQMPX3dlQXt1DtjoQXSpCZzDEKGkKqpnKyrkjUUM/WEC1IdH1BugqsA3+hX1ySTodo5xvVJfDyCJUBVV2tqDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a2459ba254f2fd66ca6bc851a1fd520867139e4f104a5ac57fcea57df2356eb","last_reissued_at":"2026-05-17T23:43:07.180763Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:07.180763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Words have bounded width in $SL(n,\\mathbb{Z})$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Chen Meiri, Nir Avni","submitted_at":"2018-01-11T17:24:35Z","abstract_excerpt":"We prove two results about width of words in $SL_n(\\mathbb{Z})$. The first is that, for every $n \\geq 3$, there is a constant $C(n)$ such that the width of any word in $SL_n(\\mathbb{Z})$ is less than $C(n)$. The second result is that, for any word $w$, if $n$ is big enough, the width of $w$ in $SL_n(\\mathbb{Z})$ is at most 87."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.03887","kind":"arxiv","version":2},"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":"1801.03887","created_at":"2026-05-17T23:43:07.180849+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.03887v2","created_at":"2026-05-17T23:43:07.180849+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.03887","created_at":"2026-05-17T23:43:07.180849+00:00"},{"alias_kind":"pith_short_12","alias_value":"LISFTORFJ4X5","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"LISFTORFJ4X5M3FG","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"LISFTORF","created_at":"2026-05-18T12:32:37.024351+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/LISFTORFJ4X5M3FGXSCRUH6VEC","json":"https://pith.science/pith/LISFTORFJ4X5M3FGXSCRUH6VEC.json","graph_json":"https://pith.science/api/pith-number/LISFTORFJ4X5M3FGXSCRUH6VEC/graph.json","events_json":"https://pith.science/api/pith-number/LISFTORFJ4X5M3FGXSCRUH6VEC/events.json","paper":"https://pith.science/paper/LISFTORF"},"agent_actions":{"view_html":"https://pith.science/pith/LISFTORFJ4X5M3FGXSCRUH6VEC","download_json":"https://pith.science/pith/LISFTORFJ4X5M3FGXSCRUH6VEC.json","view_paper":"https://pith.science/paper/LISFTORF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.03887&json=true","fetch_graph":"https://pith.science/api/pith-number/LISFTORFJ4X5M3FGXSCRUH6VEC/graph.json","fetch_events":"https://pith.science/api/pith-number/LISFTORFJ4X5M3FGXSCRUH6VEC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LISFTORFJ4X5M3FGXSCRUH6VEC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LISFTORFJ4X5M3FGXSCRUH6VEC/action/storage_attestation","attest_author":"https://pith.science/pith/LISFTORFJ4X5M3FGXSCRUH6VEC/action/author_attestation","sign_citation":"https://pith.science/pith/LISFTORFJ4X5M3FGXSCRUH6VEC/action/citation_signature","submit_replication":"https://pith.science/pith/LISFTORFJ4X5M3FGXSCRUH6VEC/action/replication_record"}},"created_at":"2026-05-17T23:43:07.180849+00:00","updated_at":"2026-05-17T23:43:07.180849+00:00"}