{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:HEAZYJ46MRF73HPHRKIGSP2FOR","short_pith_number":"pith:HEAZYJ46","schema_version":"1.0","canonical_sha256":"39019c279e644bfd9de78a90693f4574417f322e0ddb92e88f8055fa406b8acc","source":{"kind":"arxiv","id":"1402.0887","version":2},"attestation_state":"computed","paper":{"title":"Residually finite algorithmically finite groups, their subgroups and direct products","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.LO","math.RA"],"primary_cat":"math.GR","authors_text":"Anton A. Klyachko, Ayrana K. Mongush","submitted_at":"2014-02-04T21:28:33Z","abstract_excerpt":"We construct an infinite finitely generated recursively presented residually finite algorithmically finite group $G$ answering thereby a question of Myasnikov and Osin. Moreover, $G$ is \"very infinite\" and \"very algorithmically finite\" in the sense that $G$ contains an infinite abelian normal subgroup while all finite Cartesian powers of $G$ are algorithmically finite (i.e., for any positive integer $n$, there is no algorithm which writes out an infinite sequence of pairwise different elements of $G^n$). We also state several related problems."},"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":"1402.0887","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2014-02-04T21:28:33Z","cross_cats_sorted":["math.LO","math.RA"],"title_canon_sha256":"d46baa5361f6a6dfaa9ac98e4efa7900dc847940287b6cf2cb4a7afc93bcd7c5","abstract_canon_sha256":"f68cebb1cf63fbe534f64e628f431359384a8b1fb1778d8063e1a5ddca99eb9b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:21.889910Z","signature_b64":"Yg/l64g97O7fsgraQ4PyytW+NHvKhkQeVYX7xvi+B/ViULwwlhoilx1EOmwlDrkCwT6k/5pnC/BAkvPDfQLMCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39019c279e644bfd9de78a90693f4574417f322e0ddb92e88f8055fa406b8acc","last_reissued_at":"2026-05-18T01:29:21.889394Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:21.889394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Residually finite algorithmically finite groups, their subgroups and direct products","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.LO","math.RA"],"primary_cat":"math.GR","authors_text":"Anton A. Klyachko, Ayrana K. Mongush","submitted_at":"2014-02-04T21:28:33Z","abstract_excerpt":"We construct an infinite finitely generated recursively presented residually finite algorithmically finite group $G$ answering thereby a question of Myasnikov and Osin. Moreover, $G$ is \"very infinite\" and \"very algorithmically finite\" in the sense that $G$ contains an infinite abelian normal subgroup while all finite Cartesian powers of $G$ are algorithmically finite (i.e., for any positive integer $n$, there is no algorithm which writes out an infinite sequence of pairwise different elements of $G^n$). We also state several related problems."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.0887","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":"1402.0887","created_at":"2026-05-18T01:29:21.889476+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.0887v2","created_at":"2026-05-18T01:29:21.889476+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.0887","created_at":"2026-05-18T01:29:21.889476+00:00"},{"alias_kind":"pith_short_12","alias_value":"HEAZYJ46MRF7","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"HEAZYJ46MRF73HPH","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"HEAZYJ46","created_at":"2026-05-18T12:28:30.664211+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/HEAZYJ46MRF73HPHRKIGSP2FOR","json":"https://pith.science/pith/HEAZYJ46MRF73HPHRKIGSP2FOR.json","graph_json":"https://pith.science/api/pith-number/HEAZYJ46MRF73HPHRKIGSP2FOR/graph.json","events_json":"https://pith.science/api/pith-number/HEAZYJ46MRF73HPHRKIGSP2FOR/events.json","paper":"https://pith.science/paper/HEAZYJ46"},"agent_actions":{"view_html":"https://pith.science/pith/HEAZYJ46MRF73HPHRKIGSP2FOR","download_json":"https://pith.science/pith/HEAZYJ46MRF73HPHRKIGSP2FOR.json","view_paper":"https://pith.science/paper/HEAZYJ46","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.0887&json=true","fetch_graph":"https://pith.science/api/pith-number/HEAZYJ46MRF73HPHRKIGSP2FOR/graph.json","fetch_events":"https://pith.science/api/pith-number/HEAZYJ46MRF73HPHRKIGSP2FOR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HEAZYJ46MRF73HPHRKIGSP2FOR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HEAZYJ46MRF73HPHRKIGSP2FOR/action/storage_attestation","attest_author":"https://pith.science/pith/HEAZYJ46MRF73HPHRKIGSP2FOR/action/author_attestation","sign_citation":"https://pith.science/pith/HEAZYJ46MRF73HPHRKIGSP2FOR/action/citation_signature","submit_replication":"https://pith.science/pith/HEAZYJ46MRF73HPHRKIGSP2FOR/action/replication_record"}},"created_at":"2026-05-18T01:29:21.889476+00:00","updated_at":"2026-05-18T01:29:21.889476+00:00"}