{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:MAGN2P3UDLQT2RQBUU2GXZON7H","short_pith_number":"pith:MAGN2P3U","schema_version":"1.0","canonical_sha256":"600cdd3f741ae13d4601a5346be5cdf9c73ef021e474939811a4c6cbe1b1f693","source":{"kind":"arxiv","id":"2605.12793","version":1},"attestation_state":"computed","paper":{"title":"On groups with D-finite cogrowth series","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"An infinite family of groups has D-finite non-algebraic cogrowth series.","cross_cats":["math.GR"],"primary_cat":"math.CO","authors_text":"Andrew Rechnitzer, Mudit Aggarwal, Murray Elder","submitted_at":"2026-05-12T22:14:53Z","abstract_excerpt":"The cogrowth series of a group with respect to a finite generating set is an important combinatorial quantity that seems very difficult to compute exactly, as evidenced by the scarcity of known examples. In this paper, we give a particular infinite family of presentations for which the cogrowth series can be determined as the constant term of an algebraic function, which shows that it is D-finite and, with more work, not algebraic.\n  Our proof exploits the fact that for a particular choice of subgroup, the corresponding Schreier graph has finite tree width, and by considering paths in the cose"},"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":true,"formal_links_present":true},"canonical_record":{"source":{"id":"2605.12793","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-12T22:14:53Z","cross_cats_sorted":["math.GR"],"title_canon_sha256":"d3d0decc77ca09fb7cc568642cfaaef649c9871f2325621cf43ca16cac3fd72f","abstract_canon_sha256":"d96867a94cfddfab310b4d70639b77e59590ad88591d08169ff7f66b25ca018c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:12.871699Z","signature_b64":"R0yOCTSAdBHn1q73BJTLhnwn44KINgH8K4OWhri9niPZdf/YtIdqUkTif9Y/xAc9xobVwWEq48jEBLdT6hhnDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"600cdd3f741ae13d4601a5346be5cdf9c73ef021e474939811a4c6cbe1b1f693","last_reissued_at":"2026-05-18T03:09:12.870918Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:12.870918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On groups with D-finite cogrowth series","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"An infinite family of groups has D-finite non-algebraic cogrowth series.","cross_cats":["math.GR"],"primary_cat":"math.CO","authors_text":"Andrew Rechnitzer, Mudit Aggarwal, Murray Elder","submitted_at":"2026-05-12T22:14:53Z","abstract_excerpt":"The cogrowth series of a group with respect to a finite generating set is an important combinatorial quantity that seems very difficult to compute exactly, as evidenced by the scarcity of known examples. In this paper, we give a particular infinite family of presentations for which the cogrowth series can be determined as the constant term of an algebraic function, which shows that it is D-finite and, with more work, not algebraic.\n  Our proof exploits the fact that for a particular choice of subgroup, the corresponding Schreier graph has finite tree width, and by considering paths in the cose"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"we give a particular infinite family of presentations for which the cogrowth series can be determined as the constant term of an algebraic function, which shows that it is D-finite and, with more work, not algebraic.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"for a particular choice of subgroup, the corresponding Schreier graph has finite tree width, and by considering paths in the cosets and the Schreier graph separately, we are able to construct a system of generating functions which count paths.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"An infinite family of groups has D-finite but non-algebraic cogrowth series, constructed as constant terms of algebraic functions via generating functions on finite-treewidth Schreier graphs.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"An infinite family of groups has D-finite non-algebraic cogrowth series.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"9243effce09d1cb11ff214f3b24135d175dc499fa47c32e6b714e73879dc3040"},"source":{"id":"2605.12793","kind":"arxiv","version":1},"verdict":{"id":"853c9db4-7a2c-4f16-9a8c-1893d5828acd","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T19:50:50.061621Z","strongest_claim":"we give a particular infinite family of presentations for which the cogrowth series can be determined as the constant term of an algebraic function, which shows that it is D-finite and, with more work, not algebraic.","one_line_summary":"An infinite family of groups has D-finite but non-algebraic cogrowth series, constructed as constant terms of algebraic functions via generating functions on finite-treewidth Schreier graphs.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"for a particular choice of subgroup, the corresponding Schreier graph has finite tree width, and by considering paths in the cosets and the Schreier graph separately, we are able to construct a system of generating functions which count paths.","pith_extraction_headline":"An infinite family of groups has D-finite non-algebraic cogrowth series."},"references":{"count":41,"sample":[{"doi":"","year":2022,"title":"Scaling limits of permutation classes with a finite specification: A dichotomy","work_id":"51b9a1c8-ab21-434a-9ae9-b5eeee9ab08a","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"Cogrowth series for free products of finite groups","work_id":"919c7e6b-c0cb-42e3-a2a2-aeffd0e7ad69","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2020,"title":"On the complexity of the cogrowth sequence.J","work_id":"ac225442-bbb0-401e-b533-fcc87dde0881","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1992,"title":"Submaps of maps","work_id":"6a78e688-5542-4eb7-865d-b82fd96cbac8","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"On groups whose cogrowth series is the diagonal of a rational series.Internat","work_id":"b65b8d8c-aebb-4f43-b3a3-5bbe21bc7513","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":41,"snapshot_sha256":"5f892f941df610718e565ba4e9c5dda602ae84f858abb7cbc39490d4beb760c6","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"c19e96829333db71ce89fa14bd337eae9d843359eb08c878e646b05813c9a1a2"},"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":"2605.12793","created_at":"2026-05-18T03:09:12.871030+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.12793v1","created_at":"2026-05-18T03:09:12.871030+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12793","created_at":"2026-05-18T03:09:12.871030+00:00"},{"alias_kind":"pith_short_12","alias_value":"MAGN2P3UDLQT","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"MAGN2P3UDLQT2RQB","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"MAGN2P3U","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MAGN2P3UDLQT2RQBUU2GXZON7H","json":"https://pith.science/pith/MAGN2P3UDLQT2RQBUU2GXZON7H.json","graph_json":"https://pith.science/api/pith-number/MAGN2P3UDLQT2RQBUU2GXZON7H/graph.json","events_json":"https://pith.science/api/pith-number/MAGN2P3UDLQT2RQBUU2GXZON7H/events.json","paper":"https://pith.science/paper/MAGN2P3U"},"agent_actions":{"view_html":"https://pith.science/pith/MAGN2P3UDLQT2RQBUU2GXZON7H","download_json":"https://pith.science/pith/MAGN2P3UDLQT2RQBUU2GXZON7H.json","view_paper":"https://pith.science/paper/MAGN2P3U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.12793&json=true","fetch_graph":"https://pith.science/api/pith-number/MAGN2P3UDLQT2RQBUU2GXZON7H/graph.json","fetch_events":"https://pith.science/api/pith-number/MAGN2P3UDLQT2RQBUU2GXZON7H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MAGN2P3UDLQT2RQBUU2GXZON7H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MAGN2P3UDLQT2RQBUU2GXZON7H/action/storage_attestation","attest_author":"https://pith.science/pith/MAGN2P3UDLQT2RQBUU2GXZON7H/action/author_attestation","sign_citation":"https://pith.science/pith/MAGN2P3UDLQT2RQBUU2GXZON7H/action/citation_signature","submit_replication":"https://pith.science/pith/MAGN2P3UDLQT2RQBUU2GXZON7H/action/replication_record"}},"created_at":"2026-05-18T03:09:12.871030+00:00","updated_at":"2026-05-18T03:09:12.871030+00:00"}