{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:HEAZYJ46MRF73HPHRKIGSP2FOR","short_pith_number":"pith:HEAZYJ46","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"},"canonical_sha256":"39019c279e644bfd9de78a90693f4574417f322e0ddb92e88f8055fa406b8acc","source":{"kind":"arxiv","id":"1402.0887","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.0887","created_at":"2026-05-18T01:29:21Z"},{"alias_kind":"arxiv_version","alias_value":"1402.0887v2","created_at":"2026-05-18T01:29:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.0887","created_at":"2026-05-18T01:29:21Z"},{"alias_kind":"pith_short_12","alias_value":"HEAZYJ46MRF7","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HEAZYJ46MRF73HPH","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HEAZYJ46","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:HEAZYJ46MRF73HPHRKIGSP2FOR","target":"record","payload":{"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"},"canonical_sha256":"39019c279e644bfd9de78a90693f4574417f322e0ddb92e88f8055fa406b8acc","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"},"source_kind":"arxiv","source_id":"1402.0887","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:29:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A3t4VuHrrr1vct3Fwk/jJiiZhUvb74CKS95r4zlSl8Z02c+AQYkdrUsu6eSfZYFX/EX1iBGfc/tPTXuGiVFXCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T22:38:27.709175Z"},"content_sha256":"2db24ad2455b5d7445705513eb0a29e4da7647b1dc3a7cc921b5761e37443fa0","schema_version":"1.0","event_id":"sha256:2db24ad2455b5d7445705513eb0a29e4da7647b1dc3a7cc921b5761e37443fa0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:HEAZYJ46MRF73HPHRKIGSP2FOR","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:29:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GRCCMKbvIzx0HgXyZUzUfRZchM2ywjCRNWAdUFjOFfsWqmUuvx7//j78QCarICSzEWOrPHAaDDhW6zHLkp1WCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T22:38:27.709546Z"},"content_sha256":"a411c9fd6e614d72cca53b59e4d735593a6562dd91a2c3cfe29013ad42a1be23","schema_version":"1.0","event_id":"sha256:a411c9fd6e614d72cca53b59e4d735593a6562dd91a2c3cfe29013ad42a1be23"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HEAZYJ46MRF73HPHRKIGSP2FOR/bundle.json","state_url":"https://pith.science/pith/HEAZYJ46MRF73HPHRKIGSP2FOR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HEAZYJ46MRF73HPHRKIGSP2FOR/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-22T22:38:27Z","links":{"resolver":"https://pith.science/pith/HEAZYJ46MRF73HPHRKIGSP2FOR","bundle":"https://pith.science/pith/HEAZYJ46MRF73HPHRKIGSP2FOR/bundle.json","state":"https://pith.science/pith/HEAZYJ46MRF73HPHRKIGSP2FOR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HEAZYJ46MRF73HPHRKIGSP2FOR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:HEAZYJ46MRF73HPHRKIGSP2FOR","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":"f68cebb1cf63fbe534f64e628f431359384a8b1fb1778d8063e1a5ddca99eb9b","cross_cats_sorted":["math.LO","math.RA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2014-02-04T21:28:33Z","title_canon_sha256":"d46baa5361f6a6dfaa9ac98e4efa7900dc847940287b6cf2cb4a7afc93bcd7c5"},"schema_version":"1.0","source":{"id":"1402.0887","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.0887","created_at":"2026-05-18T01:29:21Z"},{"alias_kind":"arxiv_version","alias_value":"1402.0887v2","created_at":"2026-05-18T01:29:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.0887","created_at":"2026-05-18T01:29:21Z"},{"alias_kind":"pith_short_12","alias_value":"HEAZYJ46MRF7","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HEAZYJ46MRF73HPH","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HEAZYJ46","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:a411c9fd6e614d72cca53b59e4d735593a6562dd91a2c3cfe29013ad42a1be23","target":"graph","created_at":"2026-05-18T01:29:21Z","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":"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.","authors_text":"Anton A. Klyachko, Ayrana K. Mongush","cross_cats":["math.LO","math.RA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2014-02-04T21:28:33Z","title":"Residually finite algorithmically finite groups, their subgroups and direct products"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.0887","kind":"arxiv","version":2},"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:2db24ad2455b5d7445705513eb0a29e4da7647b1dc3a7cc921b5761e37443fa0","target":"record","created_at":"2026-05-18T01:29:21Z","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":"f68cebb1cf63fbe534f64e628f431359384a8b1fb1778d8063e1a5ddca99eb9b","cross_cats_sorted":["math.LO","math.RA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2014-02-04T21:28:33Z","title_canon_sha256":"d46baa5361f6a6dfaa9ac98e4efa7900dc847940287b6cf2cb4a7afc93bcd7c5"},"schema_version":"1.0","source":{"id":"1402.0887","kind":"arxiv","version":2}},"canonical_sha256":"39019c279e644bfd9de78a90693f4574417f322e0ddb92e88f8055fa406b8acc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"39019c279e644bfd9de78a90693f4574417f322e0ddb92e88f8055fa406b8acc","first_computed_at":"2026-05-18T01:29:21.889394Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:29:21.889394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Yg/l64g97O7fsgraQ4PyytW+NHvKhkQeVYX7xvi+B/ViULwwlhoilx1EOmwlDrkCwT6k/5pnC/BAkvPDfQLMCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:29:21.889910Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.0887","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2db24ad2455b5d7445705513eb0a29e4da7647b1dc3a7cc921b5761e37443fa0","sha256:a411c9fd6e614d72cca53b59e4d735593a6562dd91a2c3cfe29013ad42a1be23"],"state_sha256":"a2e59d90d979e094bc514b1aca14c371a1dd1b0c0c63e2f0964be3ad6548b48d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C4+xf8tRklEg5VdbDw4dMhEInjaKFLZVj/WcpSYUALa6zkkdgc1mZcRVrXh28LbVSuByZ4m7XvwplhuqaOnPBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T22:38:27.711587Z","bundle_sha256":"e8eb00b0be99bd0a100f2a25f089f1f5d9a2b36d631182d0b55efc131d473b26"}}