{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:MAGN2P3UDLQT2RQBUU2GXZON7H","short_pith_number":"pith:MAGN2P3U","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"},"canonical_sha256":"600cdd3f741ae13d4601a5346be5cdf9c73ef021e474939811a4c6cbe1b1f693","source":{"kind":"arxiv","id":"2605.12793","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.12793","created_at":"2026-05-18T03:09:12Z"},{"alias_kind":"arxiv_version","alias_value":"2605.12793v1","created_at":"2026-05-18T03:09:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12793","created_at":"2026-05-18T03:09:12Z"},{"alias_kind":"pith_short_12","alias_value":"MAGN2P3UDLQT","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"MAGN2P3UDLQT2RQB","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"MAGN2P3U","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:MAGN2P3UDLQT2RQBUU2GXZON7H","target":"record","payload":{"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"},"canonical_sha256":"600cdd3f741ae13d4601a5346be5cdf9c73ef021e474939811a4c6cbe1b1f693","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"},"source_kind":"arxiv","source_id":"2605.12793","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-18T03:09:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZtgIeWxxbZ+ZXvaDW6CZp/pzzl4LGYHiy8L0ervj0w3VrVg9sBt6piSCi8XdR5PVUND4lK3++Rg4itBJepiLDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T16:45:09.148576Z"},"content_sha256":"bdca2444419b8b1ba054480176d5405f2ed566faa4261bdcfdd2c18284c13e7b","schema_version":"1.0","event_id":"sha256:bdca2444419b8b1ba054480176d5405f2ed566faa4261bdcfdd2c18284c13e7b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:MAGN2P3UDLQT2RQBUU2GXZON7H","target":"graph","payload":{"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"},"verdict_id":"853c9db4-7a2c-4f16-9a8c-1893d5828acd"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:09:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DjErHYTnzDuWBqpiXXyJQaYx9l36BXGyBlL2TICgF8yerzFiP/AvF/77LuhobjVWqFMFsL7n6GWh2EjU2UmZDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T16:45:09.149167Z"},"content_sha256":"bcbdcafe853a41f90a89bddf92dab7088682af4ba6330d470863d2fbca693088","schema_version":"1.0","event_id":"sha256:bcbdcafe853a41f90a89bddf92dab7088682af4ba6330d470863d2fbca693088"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MAGN2P3UDLQT2RQBUU2GXZON7H/bundle.json","state_url":"https://pith.science/pith/MAGN2P3UDLQT2RQBUU2GXZON7H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MAGN2P3UDLQT2RQBUU2GXZON7H/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-05-22T16:45:09Z","links":{"resolver":"https://pith.science/pith/MAGN2P3UDLQT2RQBUU2GXZON7H","bundle":"https://pith.science/pith/MAGN2P3UDLQT2RQBUU2GXZON7H/bundle.json","state":"https://pith.science/pith/MAGN2P3UDLQT2RQBUU2GXZON7H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MAGN2P3UDLQT2RQBUU2GXZON7H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:MAGN2P3UDLQT2RQBUU2GXZON7H","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":"d96867a94cfddfab310b4d70639b77e59590ad88591d08169ff7f66b25ca018c","cross_cats_sorted":["math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-12T22:14:53Z","title_canon_sha256":"d3d0decc77ca09fb7cc568642cfaaef649c9871f2325621cf43ca16cac3fd72f"},"schema_version":"1.0","source":{"id":"2605.12793","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.12793","created_at":"2026-05-18T03:09:12Z"},{"alias_kind":"arxiv_version","alias_value":"2605.12793v1","created_at":"2026-05-18T03:09:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12793","created_at":"2026-05-18T03:09:12Z"},{"alias_kind":"pith_short_12","alias_value":"MAGN2P3UDLQT","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"MAGN2P3UDLQT2RQB","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"MAGN2P3U","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:bcbdcafe853a41f90a89bddf92dab7088682af4ba6330d470863d2fbca693088","target":"graph","created_at":"2026-05-18T03:09:12Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"An infinite family of groups has D-finite non-algebraic cogrowth series."}],"snapshot_sha256":"9243effce09d1cb11ff214f3b24135d175dc499fa47c32e6b714e73879dc3040"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"c19e96829333db71ce89fa14bd337eae9d843359eb08c878e646b05813c9a1a2"},"paper":{"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","authors_text":"Andrew Rechnitzer, Mudit Aggarwal, Murray Elder","cross_cats":["math.GR"],"headline":"An infinite family of groups has D-finite non-algebraic cogrowth series.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-12T22:14:53Z","title":"On groups with D-finite cogrowth series"},"references":{"count":41,"internal_anchors":0,"resolved_work":41,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Scaling limits of permutation classes with a finite specification: A dichotomy","work_id":"51b9a1c8-ab21-434a-9ae9-b5eeee9ab08a","year":2022},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Cogrowth series for free products of finite groups","work_id":"919c7e6b-c0cb-42e3-a2a2-aeffd0e7ad69","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"On the complexity of the cogrowth sequence.J","work_id":"ac225442-bbb0-401e-b533-fcc87dde0881","year":2020},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Submaps of maps","work_id":"6a78e688-5542-4eb7-865d-b82fd96cbac8","year":1992},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"On groups whose cogrowth series is the diagonal of a rational series.Internat","work_id":"b65b8d8c-aebb-4f43-b3a3-5bbe21bc7513","year":2024}],"snapshot_sha256":"5f892f941df610718e565ba4e9c5dda602ae84f858abb7cbc39490d4beb760c6"},"source":{"id":"2605.12793","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T19:50:50.061621Z","id":"853c9db4-7a2c-4f16-9a8c-1893d5828acd","model_set":{"reader":"grok-4.3"},"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","pith_extraction_headline":"An infinite family of groups has D-finite non-algebraic cogrowth series.","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.","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."}},"verdict_id":"853c9db4-7a2c-4f16-9a8c-1893d5828acd"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:bdca2444419b8b1ba054480176d5405f2ed566faa4261bdcfdd2c18284c13e7b","target":"record","created_at":"2026-05-18T03:09:12Z","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":"d96867a94cfddfab310b4d70639b77e59590ad88591d08169ff7f66b25ca018c","cross_cats_sorted":["math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-12T22:14:53Z","title_canon_sha256":"d3d0decc77ca09fb7cc568642cfaaef649c9871f2325621cf43ca16cac3fd72f"},"schema_version":"1.0","source":{"id":"2605.12793","kind":"arxiv","version":1}},"canonical_sha256":"600cdd3f741ae13d4601a5346be5cdf9c73ef021e474939811a4c6cbe1b1f693","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"600cdd3f741ae13d4601a5346be5cdf9c73ef021e474939811a4c6cbe1b1f693","first_computed_at":"2026-05-18T03:09:12.870918Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:12.870918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R0yOCTSAdBHn1q73BJTLhnwn44KINgH8K4OWhri9niPZdf/YtIdqUkTif9Y/xAc9xobVwWEq48jEBLdT6hhnDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:12.871699Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.12793","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bdca2444419b8b1ba054480176d5405f2ed566faa4261bdcfdd2c18284c13e7b","sha256:bcbdcafe853a41f90a89bddf92dab7088682af4ba6330d470863d2fbca693088"],"state_sha256":"e6479e194cffcd7b2c3a02a5ae6184eb31d2891cc21e7dde93cce9a23b3df75e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hBFHP9qGrlC9V781AYYRgi7n8hRIvRTASegChDuEY/v4jJyCN3FT+iz/bdsAFpeIqEdXvIG6/LZ928t6H0weBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T16:45:09.152494Z","bundle_sha256":"235e10dc7fc52e13c1a8c5dc20fef1053a877abc7739458b89d7e2a01828dbec"}}