{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:3JB6ECELWTKMBFKFPNMX3ZEX46","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":"7422a642f2f30d04cfb5f49277701d77d53ea063664b216e532534b2e5864c46","cross_cats_sorted":["math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OA","submitted_at":"2018-06-26T17:08:20Z","title_canon_sha256":"b86bab6e0e72c7a8c80893d80c3bd7626f5a47d86c61ae50b978943ed6102c51"},"schema_version":"1.0","source":{"id":"1806.10110","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.10110","created_at":"2026-05-18T00:12:13Z"},{"alias_kind":"arxiv_version","alias_value":"1806.10110v1","created_at":"2026-05-18T00:12:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.10110","created_at":"2026-05-18T00:12:13Z"},{"alias_kind":"pith_short_12","alias_value":"3JB6ECELWTKM","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3JB6ECELWTKMBFKF","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3JB6ECEL","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:9cbc3eccedfd6379582a9fb31b69b8d9ac2affe388b12a249212fc29c6b8d8ba","target":"graph","created_at":"2026-05-18T00:12:13Z","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":"Answering a question of J. Rosenberg, we construct the first examples of infinite characters on $GL_n(\\mathbf{K})$ for a global field $\\mathbf{K}$ and $n\\geq 2.$ The case $n=2$ is deduced from the following more general result. Let $G$ a non amenable countable subgroup acting on locally finite tree $X$. Assume either that the stabilizer in $G$ of every vertex of $X$ is finite or that the closure of the image of $G$ in ${\\rm Aut}(X)$ is not amenable. We show that $G$ has uncountably many infinite dimensional irreducible unitary representations $(\\pi, \\mathcal{H})$ of $G$ which are traceable, th","authors_text":"Bachir Bekka","cross_cats":["math.GR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OA","submitted_at":"2018-06-26T17:08:20Z","title":"Infinite characters on $GL_n(\\mathbf{Q})$, on $SL_n(\\mathbf{Z}),$ and on groups acting on trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.10110","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:68df1fa21c9f35dfee816493fb55b2dda71cfeba3226db5f5111e2285853690f","target":"record","created_at":"2026-05-18T00:12:13Z","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":"7422a642f2f30d04cfb5f49277701d77d53ea063664b216e532534b2e5864c46","cross_cats_sorted":["math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OA","submitted_at":"2018-06-26T17:08:20Z","title_canon_sha256":"b86bab6e0e72c7a8c80893d80c3bd7626f5a47d86c61ae50b978943ed6102c51"},"schema_version":"1.0","source":{"id":"1806.10110","kind":"arxiv","version":1}},"canonical_sha256":"da43e2088bb4d4c095457b597de497e7b7bece715d7d67bbf5b7232f6abcac14","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da43e2088bb4d4c095457b597de497e7b7bece715d7d67bbf5b7232f6abcac14","first_computed_at":"2026-05-18T00:12:13.355764Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:13.355764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Gi3Zfx6FIjW2NBRgByg0bdx4gNdL7nDdwBsqkNbmAS9kZv5aViLiRR6aolV/LxsH9NlfN28mFFDfGiX/P6xSDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:13.356308Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.10110","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:68df1fa21c9f35dfee816493fb55b2dda71cfeba3226db5f5111e2285853690f","sha256:9cbc3eccedfd6379582a9fb31b69b8d9ac2affe388b12a249212fc29c6b8d8ba"],"state_sha256":"e4140bf8026d892de2c10f3a671e83f5c4857f98f2ae7481f3e136f1aee1b7ab"}