{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:4DMTXHGMADC3DXXERE2HJXKTPF","short_pith_number":"pith:4DMTXHGM","canonical_record":{"source":{"id":"2509.03927","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.GR","submitted_at":"2025-09-04T06:31:46Z","cross_cats_sorted":[],"title_canon_sha256":"133fc5fa1e6ac1c74501ab5cac53d18f72b8728be57b6f2c55c4df3fcd125b92","abstract_canon_sha256":"ce3384b8c9e9c0fc05cbe2f4675e29b63be1e572daaa57c7f69e982baa998d53"},"schema_version":"1.0"},"canonical_sha256":"e0d93b9ccc00c5b1dee4893474dd53794792e7f245a86f5251749846f46777d4","source":{"kind":"arxiv","id":"2509.03927","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.03927","created_at":"2026-07-05T12:04:49Z"},{"alias_kind":"arxiv_version","alias_value":"2509.03927v1","created_at":"2026-07-05T12:04:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.03927","created_at":"2026-07-05T12:04:49Z"},{"alias_kind":"pith_short_12","alias_value":"4DMTXHGMADC3","created_at":"2026-07-05T12:04:49Z"},{"alias_kind":"pith_short_16","alias_value":"4DMTXHGMADC3DXXE","created_at":"2026-07-05T12:04:49Z"},{"alias_kind":"pith_short_8","alias_value":"4DMTXHGM","created_at":"2026-07-05T12:04:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:4DMTXHGMADC3DXXERE2HJXKTPF","target":"record","payload":{"canonical_record":{"source":{"id":"2509.03927","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.GR","submitted_at":"2025-09-04T06:31:46Z","cross_cats_sorted":[],"title_canon_sha256":"133fc5fa1e6ac1c74501ab5cac53d18f72b8728be57b6f2c55c4df3fcd125b92","abstract_canon_sha256":"ce3384b8c9e9c0fc05cbe2f4675e29b63be1e572daaa57c7f69e982baa998d53"},"schema_version":"1.0"},"canonical_sha256":"e0d93b9ccc00c5b1dee4893474dd53794792e7f245a86f5251749846f46777d4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:04:49.968377Z","signature_b64":"oT5zDK6bgx3TRbXNt7fVupUsk+MKG2DYHhIkQoVnUB3pshywgR+euYz1GkHGoUCcqpg0BbE9+Qg5+E5nzM/6AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0d93b9ccc00c5b1dee4893474dd53794792e7f245a86f5251749846f46777d4","last_reissued_at":"2026-07-05T12:04:49.967857Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:04:49.967857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2509.03927","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-07-05T12:04:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rB+dSjIZ2ohaLeL7UOIe1QnMctCOfezTMw+zc7vWBXIcr3kmblO5I0wHCEKbiFL/RIdhv3aS//+4MPqXdgtcAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T01:22:35.307802Z"},"content_sha256":"3a0a11a3ea4ef04330b094ffe0fafb85961385176db549a6441df932c15e5479","schema_version":"1.0","event_id":"sha256:3a0a11a3ea4ef04330b094ffe0fafb85961385176db549a6441df932c15e5479"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:4DMTXHGMADC3DXXERE2HJXKTPF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Groups of finite type: classification and structural properties","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Santiago Radi","submitted_at":"2025-09-04T06:31:46Z","abstract_excerpt":"Groups of finite type (also called finitely constrained groups), introduced by Grigorchuk, are known to be the closure of regular branch groups. This article explores many of their properties.\n  Firstly, we prove that being finitely generated, just-infinite and strongly complete are equivalent in a vast family of groups of finite type. As a consequence, we prove that the closure of the Hanoi towers group on 3 pegs is just-infinite although the group itself is not.\n  Secondly, we improve the algorithm given by Bondarenko and Samoilovych in [9], to compute all the groups of finite type of a give"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.03927","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2509.03927/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T12:04:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KMKoDQUrztDhS5sJnV6yv6PZlcyxExfy9IuC2oxhBmFebnaxoQ9Hzj1Loo6FFr6rg885mlk/qZ2EFWyGVetlCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T01:22:35.308294Z"},"content_sha256":"ec51f95de97efae18aa127b61b2bb50ff1d847efc43d92ba9eaf6683535b714c","schema_version":"1.0","event_id":"sha256:ec51f95de97efae18aa127b61b2bb50ff1d847efc43d92ba9eaf6683535b714c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4DMTXHGMADC3DXXERE2HJXKTPF/bundle.json","state_url":"https://pith.science/pith/4DMTXHGMADC3DXXERE2HJXKTPF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4DMTXHGMADC3DXXERE2HJXKTPF/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-08-09T01:22:35Z","links":{"resolver":"https://pith.science/pith/4DMTXHGMADC3DXXERE2HJXKTPF","bundle":"https://pith.science/pith/4DMTXHGMADC3DXXERE2HJXKTPF/bundle.json","state":"https://pith.science/pith/4DMTXHGMADC3DXXERE2HJXKTPF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4DMTXHGMADC3DXXERE2HJXKTPF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:4DMTXHGMADC3DXXERE2HJXKTPF","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":"ce3384b8c9e9c0fc05cbe2f4675e29b63be1e572daaa57c7f69e982baa998d53","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.GR","submitted_at":"2025-09-04T06:31:46Z","title_canon_sha256":"133fc5fa1e6ac1c74501ab5cac53d18f72b8728be57b6f2c55c4df3fcd125b92"},"schema_version":"1.0","source":{"id":"2509.03927","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.03927","created_at":"2026-07-05T12:04:49Z"},{"alias_kind":"arxiv_version","alias_value":"2509.03927v1","created_at":"2026-07-05T12:04:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.03927","created_at":"2026-07-05T12:04:49Z"},{"alias_kind":"pith_short_12","alias_value":"4DMTXHGMADC3","created_at":"2026-07-05T12:04:49Z"},{"alias_kind":"pith_short_16","alias_value":"4DMTXHGMADC3DXXE","created_at":"2026-07-05T12:04:49Z"},{"alias_kind":"pith_short_8","alias_value":"4DMTXHGM","created_at":"2026-07-05T12:04:49Z"}],"graph_snapshots":[{"event_id":"sha256:ec51f95de97efae18aa127b61b2bb50ff1d847efc43d92ba9eaf6683535b714c","target":"graph","created_at":"2026-07-05T12:04:49Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2509.03927/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Groups of finite type (also called finitely constrained groups), introduced by Grigorchuk, are known to be the closure of regular branch groups. This article explores many of their properties.\n  Firstly, we prove that being finitely generated, just-infinite and strongly complete are equivalent in a vast family of groups of finite type. As a consequence, we prove that the closure of the Hanoi towers group on 3 pegs is just-infinite although the group itself is not.\n  Secondly, we improve the algorithm given by Bondarenko and Samoilovych in [9], to compute all the groups of finite type of a give","authors_text":"Santiago Radi","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.GR","submitted_at":"2025-09-04T06:31:46Z","title":"Groups of finite type: classification and structural properties"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.03927","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:3a0a11a3ea4ef04330b094ffe0fafb85961385176db549a6441df932c15e5479","target":"record","created_at":"2026-07-05T12:04:49Z","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":"ce3384b8c9e9c0fc05cbe2f4675e29b63be1e572daaa57c7f69e982baa998d53","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.GR","submitted_at":"2025-09-04T06:31:46Z","title_canon_sha256":"133fc5fa1e6ac1c74501ab5cac53d18f72b8728be57b6f2c55c4df3fcd125b92"},"schema_version":"1.0","source":{"id":"2509.03927","kind":"arxiv","version":1}},"canonical_sha256":"e0d93b9ccc00c5b1dee4893474dd53794792e7f245a86f5251749846f46777d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e0d93b9ccc00c5b1dee4893474dd53794792e7f245a86f5251749846f46777d4","first_computed_at":"2026-07-05T12:04:49.967857Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:04:49.967857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oT5zDK6bgx3TRbXNt7fVupUsk+MKG2DYHhIkQoVnUB3pshywgR+euYz1GkHGoUCcqpg0BbE9+Qg5+E5nzM/6AQ==","signature_status":"signed_v1","signed_at":"2026-07-05T12:04:49.968377Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.03927","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3a0a11a3ea4ef04330b094ffe0fafb85961385176db549a6441df932c15e5479","sha256:ec51f95de97efae18aa127b61b2bb50ff1d847efc43d92ba9eaf6683535b714c"],"state_sha256":"d2ac86072f4c5b94cc9ec5799779713bb26fd1d4142693412fbd4b363bcfd0f1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l41rjACzEnnfcmSYXRbNe8Q7yDFOgjhUHLgOe1YBn009MufDRDDCQTsR6X3qOm97K8q9Kz54+sjxOfYjX0zSDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T01:22:35.311809Z","bundle_sha256":"9d302c5f267a668f96b9db2f58a7d0a539769a14913094280343e7e3be6cc18a"}}