{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:6XOMVWFA5MCH6CE237RWUB7EBJ","short_pith_number":"pith:6XOMVWFA","canonical_record":{"source":{"id":"1012.1653","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2010-12-08T00:34:11Z","cross_cats_sorted":[],"title_canon_sha256":"57ffb498377acb66d0a58ab204a57768ec38da181299225ad88d5956d76afec2","abstract_canon_sha256":"029b16412e5ef512db8c80b6aea9c9c4959ce40f138248dcf6993ae27326b4bc"},"schema_version":"1.0"},"canonical_sha256":"f5dccad8a0eb047f089adfe36a07e40a5cd8fd0f75533b58bf90ec5c8581ebda","source":{"kind":"arxiv","id":"1012.1653","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.1653","created_at":"2026-05-18T04:33:51Z"},{"alias_kind":"arxiv_version","alias_value":"1012.1653v1","created_at":"2026-05-18T04:33:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.1653","created_at":"2026-05-18T04:33:51Z"},{"alias_kind":"pith_short_12","alias_value":"6XOMVWFA5MCH","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"6XOMVWFA5MCH6CE2","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"6XOMVWFA","created_at":"2026-05-18T12:26:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:6XOMVWFA5MCH6CE237RWUB7EBJ","target":"record","payload":{"canonical_record":{"source":{"id":"1012.1653","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2010-12-08T00:34:11Z","cross_cats_sorted":[],"title_canon_sha256":"57ffb498377acb66d0a58ab204a57768ec38da181299225ad88d5956d76afec2","abstract_canon_sha256":"029b16412e5ef512db8c80b6aea9c9c4959ce40f138248dcf6993ae27326b4bc"},"schema_version":"1.0"},"canonical_sha256":"f5dccad8a0eb047f089adfe36a07e40a5cd8fd0f75533b58bf90ec5c8581ebda","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:33:51.547658Z","signature_b64":"jUhOyHhI82De7kLVndEnonDDb19dOylSLLSQYbluvLOETDIiRMxCguQ2G5gb8bJ8bQAJvz1QIxVFlV2bZ8iEBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5dccad8a0eb047f089adfe36a07e40a5cd8fd0f75533b58bf90ec5c8581ebda","last_reissued_at":"2026-05-18T04:33:51.547132Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:33:51.547132Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1012.1653","source_version":1,"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-18T04:33:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UTQ/mJZaa3BlivOQp98A9sCs/j7XaIf6E3sS/CQga1W3lYOmiN/5ZJfxsTwVuEUo/mgyiNv8mYawn60zVq5+AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T15:19:13.490454Z"},"content_sha256":"8c8e625f77541d3cc0fe5c6a3485f70184b014fc715af8db5dae42db3d632df0","schema_version":"1.0","event_id":"sha256:8c8e625f77541d3cc0fe5c6a3485f70184b014fc715af8db5dae42db3d632df0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:6XOMVWFA5MCH6CE237RWUB7EBJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithmically finite groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"A. Myasnikov, D. Osin","submitted_at":"2010-12-08T00:34:11Z","abstract_excerpt":"We call a group $G$ {\\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their properties. For instance, we show that the Equality Problem is decidable in our groups only on strongly (exponentially) negligible sets of inputs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.1653","kind":"arxiv","version":1},"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-18T04:33:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xa5NT+HBv0d/hgjWKg+53WYTR/pOn9nClYmnlBorOQ/977e7IdACQ+SQacIZY5D2AKI+H149uxjiS1/HsXnyAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T15:19:13.490807Z"},"content_sha256":"beee27d80d1367457a2d8770f09752a65d525c357f01f46f1225a6ded00bc247","schema_version":"1.0","event_id":"sha256:beee27d80d1367457a2d8770f09752a65d525c357f01f46f1225a6ded00bc247"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6XOMVWFA5MCH6CE237RWUB7EBJ/bundle.json","state_url":"https://pith.science/pith/6XOMVWFA5MCH6CE237RWUB7EBJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6XOMVWFA5MCH6CE237RWUB7EBJ/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-07-01T15:19:13Z","links":{"resolver":"https://pith.science/pith/6XOMVWFA5MCH6CE237RWUB7EBJ","bundle":"https://pith.science/pith/6XOMVWFA5MCH6CE237RWUB7EBJ/bundle.json","state":"https://pith.science/pith/6XOMVWFA5MCH6CE237RWUB7EBJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6XOMVWFA5MCH6CE237RWUB7EBJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:6XOMVWFA5MCH6CE237RWUB7EBJ","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":"029b16412e5ef512db8c80b6aea9c9c4959ce40f138248dcf6993ae27326b4bc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2010-12-08T00:34:11Z","title_canon_sha256":"57ffb498377acb66d0a58ab204a57768ec38da181299225ad88d5956d76afec2"},"schema_version":"1.0","source":{"id":"1012.1653","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.1653","created_at":"2026-05-18T04:33:51Z"},{"alias_kind":"arxiv_version","alias_value":"1012.1653v1","created_at":"2026-05-18T04:33:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.1653","created_at":"2026-05-18T04:33:51Z"},{"alias_kind":"pith_short_12","alias_value":"6XOMVWFA5MCH","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"6XOMVWFA5MCH6CE2","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"6XOMVWFA","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:beee27d80d1367457a2d8770f09752a65d525c357f01f46f1225a6ded00bc247","target":"graph","created_at":"2026-05-18T04:33:51Z","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 call a group $G$ {\\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their properties. For instance, we show that the Equality Problem is decidable in our groups only on strongly (exponentially) negligible sets of inputs.","authors_text":"A. Myasnikov, D. Osin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2010-12-08T00:34:11Z","title":"Algorithmically finite groups"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.1653","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:8c8e625f77541d3cc0fe5c6a3485f70184b014fc715af8db5dae42db3d632df0","target":"record","created_at":"2026-05-18T04:33:51Z","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":"029b16412e5ef512db8c80b6aea9c9c4959ce40f138248dcf6993ae27326b4bc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2010-12-08T00:34:11Z","title_canon_sha256":"57ffb498377acb66d0a58ab204a57768ec38da181299225ad88d5956d76afec2"},"schema_version":"1.0","source":{"id":"1012.1653","kind":"arxiv","version":1}},"canonical_sha256":"f5dccad8a0eb047f089adfe36a07e40a5cd8fd0f75533b58bf90ec5c8581ebda","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f5dccad8a0eb047f089adfe36a07e40a5cd8fd0f75533b58bf90ec5c8581ebda","first_computed_at":"2026-05-18T04:33:51.547132Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:33:51.547132Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jUhOyHhI82De7kLVndEnonDDb19dOylSLLSQYbluvLOETDIiRMxCguQ2G5gb8bJ8bQAJvz1QIxVFlV2bZ8iEBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:33:51.547658Z","signed_message":"canonical_sha256_bytes"},"source_id":"1012.1653","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c8e625f77541d3cc0fe5c6a3485f70184b014fc715af8db5dae42db3d632df0","sha256:beee27d80d1367457a2d8770f09752a65d525c357f01f46f1225a6ded00bc247"],"state_sha256":"717b90bdfba20cc1c3f0910876605a9a881b1a632fc48bf5c360726575f0b712"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3yuz9aaDcfeol3GPHRTyga2E8a+H81r27gEdSCaHXZZTVpS0brOmuT6/C6ciQFjHz7rRplCDGQk9hr0RZpg1CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T15:19:13.492702Z","bundle_sha256":"723480bab045a4d4819068991e6c6ae15eb8e986ff8192a373e4beb419ef6315"}}