{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:4KHLJHGTDEG52CG2J6T3VCI6IK","short_pith_number":"pith:4KHLJHGT","schema_version":"1.0","canonical_sha256":"e28eb49cd3190ddd08da4fa7ba891e42816bba94ba2c42ebe391aa1d64b137ce","source":{"kind":"arxiv","id":"math/0701925","version":3},"attestation_state":"computed","paper":{"title":"The rank gradient from a combinatorial viewpoint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Andrei Jaikin-Zapirain, Miklos Abert, Nikolay Nikolov","submitted_at":"2007-01-31T14:50:04Z","abstract_excerpt":"This paper investigates the asymptotic behaviour of the minimal number of generators of finite index subgroups in residually finite groups. We analyze three natural classes of groups: amenable groups, groups possessing an infinite soluble normal subgroup and virtually free groups. As a tool for the amenable case we generalize Lackenby's trichotomy theorem on finitely presented groups."},"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":"math/0701925","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2007-01-31T14:50:04Z","cross_cats_sorted":[],"title_canon_sha256":"9d3d554b1160b7aa98404501cbcd67fea19ffceaa42e80f105dc373c66526af6","abstract_canon_sha256":"f5f79e78b22175b85994fe414cae07faabc0afc8ab15e4d3158c8fa5c318c6b5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:28:37.152109Z","signature_b64":"qu9teJvC3HjE/liuC7YiMm62C1j/K+D/sLpKMaBCYRDRvTD+7arYqKZxS3928rrjCUvwE1GTSV85tWjuOm3ACg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e28eb49cd3190ddd08da4fa7ba891e42816bba94ba2c42ebe391aa1d64b137ce","last_reissued_at":"2026-05-18T04:28:37.151641Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:28:37.151641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The rank gradient from a combinatorial viewpoint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Andrei Jaikin-Zapirain, Miklos Abert, Nikolay Nikolov","submitted_at":"2007-01-31T14:50:04Z","abstract_excerpt":"This paper investigates the asymptotic behaviour of the minimal number of generators of finite index subgroups in residually finite groups. We analyze three natural classes of groups: amenable groups, groups possessing an infinite soluble normal subgroup and virtually free groups. As a tool for the amenable case we generalize Lackenby's trichotomy theorem on finitely presented groups."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0701925","kind":"arxiv","version":3},"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":"math/0701925","created_at":"2026-05-18T04:28:37.151708+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0701925v3","created_at":"2026-05-18T04:28:37.151708+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0701925","created_at":"2026-05-18T04:28:37.151708+00:00"},{"alias_kind":"pith_short_12","alias_value":"4KHLJHGTDEG5","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_16","alias_value":"4KHLJHGTDEG52CG2","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_8","alias_value":"4KHLJHGT","created_at":"2026-05-18T12:25:54.717736+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/4KHLJHGTDEG52CG2J6T3VCI6IK","json":"https://pith.science/pith/4KHLJHGTDEG52CG2J6T3VCI6IK.json","graph_json":"https://pith.science/api/pith-number/4KHLJHGTDEG52CG2J6T3VCI6IK/graph.json","events_json":"https://pith.science/api/pith-number/4KHLJHGTDEG52CG2J6T3VCI6IK/events.json","paper":"https://pith.science/paper/4KHLJHGT"},"agent_actions":{"view_html":"https://pith.science/pith/4KHLJHGTDEG52CG2J6T3VCI6IK","download_json":"https://pith.science/pith/4KHLJHGTDEG52CG2J6T3VCI6IK.json","view_paper":"https://pith.science/paper/4KHLJHGT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0701925&json=true","fetch_graph":"https://pith.science/api/pith-number/4KHLJHGTDEG52CG2J6T3VCI6IK/graph.json","fetch_events":"https://pith.science/api/pith-number/4KHLJHGTDEG52CG2J6T3VCI6IK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4KHLJHGTDEG52CG2J6T3VCI6IK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4KHLJHGTDEG52CG2J6T3VCI6IK/action/storage_attestation","attest_author":"https://pith.science/pith/4KHLJHGTDEG52CG2J6T3VCI6IK/action/author_attestation","sign_citation":"https://pith.science/pith/4KHLJHGTDEG52CG2J6T3VCI6IK/action/citation_signature","submit_replication":"https://pith.science/pith/4KHLJHGTDEG52CG2J6T3VCI6IK/action/replication_record"}},"created_at":"2026-05-18T04:28:37.151708+00:00","updated_at":"2026-05-18T04:28:37.151708+00:00"}