{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:CTQ5CTN2MER6VZWUGQQWSTDAY6","short_pith_number":"pith:CTQ5CTN2","canonical_record":{"source":{"id":"1907.02635","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-04T03:03:47Z","cross_cats_sorted":[],"title_canon_sha256":"3bc20ce4043a0d88e7af6450ab41c94a181f594bdcc4b78d3cbaa6f948248f0a","abstract_canon_sha256":"cc7741ee19a54f99d1f4113c124ce4d6f86339f8cfae625f05398d47f5263c92"},"schema_version":"1.0"},"canonical_sha256":"14e1d14dba6123eae6d43421694c60c7a356ddd249428a9a719881d0971a092e","source":{"kind":"arxiv","id":"1907.02635","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.02635","created_at":"2026-05-17T23:41:23Z"},{"alias_kind":"arxiv_version","alias_value":"1907.02635v1","created_at":"2026-05-17T23:41:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02635","created_at":"2026-05-17T23:41:23Z"},{"alias_kind":"pith_short_12","alias_value":"CTQ5CTN2MER6","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"CTQ5CTN2MER6VZWU","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"CTQ5CTN2","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:CTQ5CTN2MER6VZWUGQQWSTDAY6","target":"record","payload":{"canonical_record":{"source":{"id":"1907.02635","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-04T03:03:47Z","cross_cats_sorted":[],"title_canon_sha256":"3bc20ce4043a0d88e7af6450ab41c94a181f594bdcc4b78d3cbaa6f948248f0a","abstract_canon_sha256":"cc7741ee19a54f99d1f4113c124ce4d6f86339f8cfae625f05398d47f5263c92"},"schema_version":"1.0"},"canonical_sha256":"14e1d14dba6123eae6d43421694c60c7a356ddd249428a9a719881d0971a092e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:23.686741Z","signature_b64":"2L9w190mLD5EojOK4SPiQx1hWk+YKH7zbLJUR+Fbx4Ee/qpHRnLbq5liZZSLKrkBC5C1wBs0+9Larf6LtHKmAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14e1d14dba6123eae6d43421694c60c7a356ddd249428a9a719881d0971a092e","last_reissued_at":"2026-05-17T23:41:23.686040Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:23.686040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.02635","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-17T23:41:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MJbg82emoDrR+ADkJuyq7w69zFQ0sJ2VytkRUQ4KnpiYRlt/VjftddtgzEVF+x38Lu6a+trZejZ2H9trUwAsCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:33:40.946357Z"},"content_sha256":"503cf2d98d9b87498beaaa6be30d37971bd256009f665a654a5680458f409597","schema_version":"1.0","event_id":"sha256:503cf2d98d9b87498beaaa6be30d37971bd256009f665a654a5680458f409597"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:CTQ5CTN2MER6VZWUGQQWSTDAY6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The number of rooted forests in circulant graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"I.A. Mednykh, L.A. Grunwald","submitted_at":"2019-07-04T03:03:47Z","abstract_excerpt":"In this paper, we develop a new method to produce explicit formulas for the number $f_{G}(n)$ of rooted spanning forests in the circulant graphs $ G=C_{n}(s_1,s_2,\\ldots,s_k)$ and $ G=C_{2n}(s_1,s_2,\\ldots,s_k,n).$ These formulas are expressed through Chebyshev polynomials. We prove that in both cases the number of rooted spanning forests can be represented in the form $f_{G}(n)=p\\,a(n)^2,$ where $a(n)$ is an integer sequence and $p$ is a prescribed natural number depending on the parity of $n$. Finally, we find an asymptotic formula for $f_{G}(n)$ through the Mahler measure of the associated "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.02635","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"},"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-05-17T23:41:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kYP7TSASBnzKywC5TkI3rRtW4LpGbATCEj0MGcJgs90CfsmYYI4sPc76pkedtGI0Re/+m/4g14x2asLUSJrLCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:33:40.947074Z"},"content_sha256":"3c8de880b70bdd9ab02280cb3724231ded44db2940e4b1fa430fde2b31e0e1a8","schema_version":"1.0","event_id":"sha256:3c8de880b70bdd9ab02280cb3724231ded44db2940e4b1fa430fde2b31e0e1a8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CTQ5CTN2MER6VZWUGQQWSTDAY6/bundle.json","state_url":"https://pith.science/pith/CTQ5CTN2MER6VZWUGQQWSTDAY6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CTQ5CTN2MER6VZWUGQQWSTDAY6/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-26T10:33:40Z","links":{"resolver":"https://pith.science/pith/CTQ5CTN2MER6VZWUGQQWSTDAY6","bundle":"https://pith.science/pith/CTQ5CTN2MER6VZWUGQQWSTDAY6/bundle.json","state":"https://pith.science/pith/CTQ5CTN2MER6VZWUGQQWSTDAY6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CTQ5CTN2MER6VZWUGQQWSTDAY6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:CTQ5CTN2MER6VZWUGQQWSTDAY6","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":"cc7741ee19a54f99d1f4113c124ce4d6f86339f8cfae625f05398d47f5263c92","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-04T03:03:47Z","title_canon_sha256":"3bc20ce4043a0d88e7af6450ab41c94a181f594bdcc4b78d3cbaa6f948248f0a"},"schema_version":"1.0","source":{"id":"1907.02635","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.02635","created_at":"2026-05-17T23:41:23Z"},{"alias_kind":"arxiv_version","alias_value":"1907.02635v1","created_at":"2026-05-17T23:41:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02635","created_at":"2026-05-17T23:41:23Z"},{"alias_kind":"pith_short_12","alias_value":"CTQ5CTN2MER6","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"CTQ5CTN2MER6VZWU","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"CTQ5CTN2","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:3c8de880b70bdd9ab02280cb3724231ded44db2940e4b1fa430fde2b31e0e1a8","target":"graph","created_at":"2026-05-17T23:41:23Z","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"},"paper":{"abstract_excerpt":"In this paper, we develop a new method to produce explicit formulas for the number $f_{G}(n)$ of rooted spanning forests in the circulant graphs $ G=C_{n}(s_1,s_2,\\ldots,s_k)$ and $ G=C_{2n}(s_1,s_2,\\ldots,s_k,n).$ These formulas are expressed through Chebyshev polynomials. We prove that in both cases the number of rooted spanning forests can be represented in the form $f_{G}(n)=p\\,a(n)^2,$ where $a(n)$ is an integer sequence and $p$ is a prescribed natural number depending on the parity of $n$. Finally, we find an asymptotic formula for $f_{G}(n)$ through the Mahler measure of the associated ","authors_text":"I.A. Mednykh, L.A. Grunwald","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-04T03:03:47Z","title":"The number of rooted forests in circulant graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.02635","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:503cf2d98d9b87498beaaa6be30d37971bd256009f665a654a5680458f409597","target":"record","created_at":"2026-05-17T23:41:23Z","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":"cc7741ee19a54f99d1f4113c124ce4d6f86339f8cfae625f05398d47f5263c92","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-04T03:03:47Z","title_canon_sha256":"3bc20ce4043a0d88e7af6450ab41c94a181f594bdcc4b78d3cbaa6f948248f0a"},"schema_version":"1.0","source":{"id":"1907.02635","kind":"arxiv","version":1}},"canonical_sha256":"14e1d14dba6123eae6d43421694c60c7a356ddd249428a9a719881d0971a092e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"14e1d14dba6123eae6d43421694c60c7a356ddd249428a9a719881d0971a092e","first_computed_at":"2026-05-17T23:41:23.686040Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:23.686040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2L9w190mLD5EojOK4SPiQx1hWk+YKH7zbLJUR+Fbx4Ee/qpHRnLbq5liZZSLKrkBC5C1wBs0+9Larf6LtHKmAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:23.686741Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.02635","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:503cf2d98d9b87498beaaa6be30d37971bd256009f665a654a5680458f409597","sha256:3c8de880b70bdd9ab02280cb3724231ded44db2940e4b1fa430fde2b31e0e1a8"],"state_sha256":"17708de1593163d6254eea23bf312837231607cc77bf5ebd5363e97c6c2331b7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lzzjzWfnzLWqJUL1E48nN7w0kQlg7jrkbX7/1m+Q9lqH5VnycSDWI8SPjC4scnYdReJWFihJHvPsS11GBn7NBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T10:33:40.950951Z","bundle_sha256":"a457265dbe87d5812bb1430f6c7f538f5ef7b4d0ce29196431041a088a9183ef"}}