{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:KIMR3V7SUKUBLB54SVYG4OSBFX","short_pith_number":"pith:KIMR3V7S","schema_version":"1.0","canonical_sha256":"52191dd7f2a2a81587bc95706e3a412ddee0fb8cc72d84428f397eacdccfbf53","source":{"kind":"arxiv","id":"1802.03831","version":3},"attestation_state":"computed","paper":{"title":"Algorithmic Randomness For Amenable Groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Adam R. Day","submitted_at":"2018-02-11T22:24:41Z","abstract_excerpt":"We develop the theory of algorithmic randomness for the space $A^G$ where $A$ is a finite alphabet and $G$ is a computable amenable group. We give an effective version of the Shannon-McMillan-Breiman theorem in this setting. We also extend a result of Simpson equating topological entropy and Hausdorff dimension. This proof makes use of work of Ornstein and Weiss which we also present."},"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":"1802.03831","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2018-02-11T22:24:41Z","cross_cats_sorted":[],"title_canon_sha256":"de368f950e18e5cca3dfefdd7c0f1eb058231fd82ffe2333eb252c9b879364f3","abstract_canon_sha256":"1277ad8adab8c280ce047e08d5645c1a960aa530cbac2b34afc9b0d139a3ce23"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:23.875561Z","signature_b64":"K3/vAP8Hy/yFqZxVLr2INlKgCuDXEz4+6YP9UsyBE4X9Kym5GCIf0y1lc/cgRaFGXuW207ootpNSzOvP7E5MBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52191dd7f2a2a81587bc95706e3a412ddee0fb8cc72d84428f397eacdccfbf53","last_reissued_at":"2026-05-18T00:20:23.875057Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:23.875057Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithmic Randomness For Amenable Groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Adam R. Day","submitted_at":"2018-02-11T22:24:41Z","abstract_excerpt":"We develop the theory of algorithmic randomness for the space $A^G$ where $A$ is a finite alphabet and $G$ is a computable amenable group. We give an effective version of the Shannon-McMillan-Breiman theorem in this setting. We also extend a result of Simpson equating topological entropy and Hausdorff dimension. This proof makes use of work of Ornstein and Weiss which we also present."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03831","kind":"arxiv","version":3},"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":"1802.03831","created_at":"2026-05-18T00:20:23.875136+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.03831v3","created_at":"2026-05-18T00:20:23.875136+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03831","created_at":"2026-05-18T00:20:23.875136+00:00"},{"alias_kind":"pith_short_12","alias_value":"KIMR3V7SUKUB","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"KIMR3V7SUKUBLB54","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"KIMR3V7S","created_at":"2026-05-18T12:32:33.847187+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/KIMR3V7SUKUBLB54SVYG4OSBFX","json":"https://pith.science/pith/KIMR3V7SUKUBLB54SVYG4OSBFX.json","graph_json":"https://pith.science/api/pith-number/KIMR3V7SUKUBLB54SVYG4OSBFX/graph.json","events_json":"https://pith.science/api/pith-number/KIMR3V7SUKUBLB54SVYG4OSBFX/events.json","paper":"https://pith.science/paper/KIMR3V7S"},"agent_actions":{"view_html":"https://pith.science/pith/KIMR3V7SUKUBLB54SVYG4OSBFX","download_json":"https://pith.science/pith/KIMR3V7SUKUBLB54SVYG4OSBFX.json","view_paper":"https://pith.science/paper/KIMR3V7S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.03831&json=true","fetch_graph":"https://pith.science/api/pith-number/KIMR3V7SUKUBLB54SVYG4OSBFX/graph.json","fetch_events":"https://pith.science/api/pith-number/KIMR3V7SUKUBLB54SVYG4OSBFX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KIMR3V7SUKUBLB54SVYG4OSBFX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KIMR3V7SUKUBLB54SVYG4OSBFX/action/storage_attestation","attest_author":"https://pith.science/pith/KIMR3V7SUKUBLB54SVYG4OSBFX/action/author_attestation","sign_citation":"https://pith.science/pith/KIMR3V7SUKUBLB54SVYG4OSBFX/action/citation_signature","submit_replication":"https://pith.science/pith/KIMR3V7SUKUBLB54SVYG4OSBFX/action/replication_record"}},"created_at":"2026-05-18T00:20:23.875136+00:00","updated_at":"2026-05-18T00:20:23.875136+00:00"}