{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:5NGZOSE5WBV7PK5HNEKB6E2LCP","short_pith_number":"pith:5NGZOSE5","schema_version":"1.0","canonical_sha256":"eb4d97489db06bf7aba769141f134b13c443bc3e810916b2a7916daf6406034f","source":{"kind":"arxiv","id":"1204.4279","version":1},"attestation_state":"computed","paper":{"title":"Investigating self-similar groups using their finite $L$-presentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Ren\\'e Hartung","submitted_at":"2012-04-19T08:17:43Z","abstract_excerpt":"Self-similar groups provide a rich source of groups with interesting properties; e.g., infinite torsion groups (Burnside groups) and groups with an intermediate word growth. Various self-similar groups can be described by a recursive (possibly infinite) presentation, a so-called finite $L$-presentation. Finite $L$-presentations allow numerous algorithms for finitely presented groups to be generalized to this special class of recursive presentations. We give an overview of the algorithms for finitely $L$-presented groups. As applications, we demonstrate how their implementation in a computer al"},"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":"1204.4279","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2012-04-19T08:17:43Z","cross_cats_sorted":[],"title_canon_sha256":"6274283bef75411eaa2ace73615a81f2d197c12d5618c6a926b4ebf4396e7af2","abstract_canon_sha256":"1d40218ae4d20d624d3e33307b082d90b1dfd0910a463989bc36884a5326841f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:27.970575Z","signature_b64":"zfU1LkDJzWarMzJhq+XtVdQLqk70Hb1VO9tPiEE15dcNvB+kR1r0p2ZJxNWoqyhmLjck6CBLnlaPHneGyng5AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb4d97489db06bf7aba769141f134b13c443bc3e810916b2a7916daf6406034f","last_reissued_at":"2026-05-18T03:57:27.970019Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:27.970019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Investigating self-similar groups using their finite $L$-presentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Ren\\'e Hartung","submitted_at":"2012-04-19T08:17:43Z","abstract_excerpt":"Self-similar groups provide a rich source of groups with interesting properties; e.g., infinite torsion groups (Burnside groups) and groups with an intermediate word growth. Various self-similar groups can be described by a recursive (possibly infinite) presentation, a so-called finite $L$-presentation. Finite $L$-presentations allow numerous algorithms for finitely presented groups to be generalized to this special class of recursive presentations. We give an overview of the algorithms for finitely $L$-presented groups. As applications, we demonstrate how their implementation in a computer al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.4279","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1204.4279","created_at":"2026-05-18T03:57:27.970106+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.4279v1","created_at":"2026-05-18T03:57:27.970106+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.4279","created_at":"2026-05-18T03:57:27.970106+00:00"},{"alias_kind":"pith_short_12","alias_value":"5NGZOSE5WBV7","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"5NGZOSE5WBV7PK5H","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"5NGZOSE5","created_at":"2026-05-18T12:26:56.085431+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/5NGZOSE5WBV7PK5HNEKB6E2LCP","json":"https://pith.science/pith/5NGZOSE5WBV7PK5HNEKB6E2LCP.json","graph_json":"https://pith.science/api/pith-number/5NGZOSE5WBV7PK5HNEKB6E2LCP/graph.json","events_json":"https://pith.science/api/pith-number/5NGZOSE5WBV7PK5HNEKB6E2LCP/events.json","paper":"https://pith.science/paper/5NGZOSE5"},"agent_actions":{"view_html":"https://pith.science/pith/5NGZOSE5WBV7PK5HNEKB6E2LCP","download_json":"https://pith.science/pith/5NGZOSE5WBV7PK5HNEKB6E2LCP.json","view_paper":"https://pith.science/paper/5NGZOSE5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.4279&json=true","fetch_graph":"https://pith.science/api/pith-number/5NGZOSE5WBV7PK5HNEKB6E2LCP/graph.json","fetch_events":"https://pith.science/api/pith-number/5NGZOSE5WBV7PK5HNEKB6E2LCP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5NGZOSE5WBV7PK5HNEKB6E2LCP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5NGZOSE5WBV7PK5HNEKB6E2LCP/action/storage_attestation","attest_author":"https://pith.science/pith/5NGZOSE5WBV7PK5HNEKB6E2LCP/action/author_attestation","sign_citation":"https://pith.science/pith/5NGZOSE5WBV7PK5HNEKB6E2LCP/action/citation_signature","submit_replication":"https://pith.science/pith/5NGZOSE5WBV7PK5HNEKB6E2LCP/action/replication_record"}},"created_at":"2026-05-18T03:57:27.970106+00:00","updated_at":"2026-05-18T03:57:27.970106+00:00"}