{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:VTTB235PUGEFQHQRASUCCAVU66","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":"40c37e8585526f7cc7ae8f6acb919dcbf722dd21b045b2345e59aa611f2132a3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-09T07:30:00Z","title_canon_sha256":"6872f71d472803f9f41f6fba2f2365a54cf32733cbab272cb0b44d58b9c43277"},"schema_version":"1.0","source":{"id":"1811.03801","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.03801","created_at":"2026-05-18T00:01:11Z"},{"alias_kind":"arxiv_version","alias_value":"1811.03801v1","created_at":"2026-05-18T00:01:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.03801","created_at":"2026-05-18T00:01:11Z"},{"alias_kind":"pith_short_12","alias_value":"VTTB235PUGEF","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VTTB235PUGEFQHQR","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VTTB235P","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:c8251ae0cb546905ad8e0c3320ebc6a63a18d6825c15d5d5eaf89d2255d580bf","target":"graph","created_at":"2026-05-18T00:01:11Z","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":"By complexity of a finite graph we mean the number of spanning trees in the graph. The aim of the present paper is to give a new approach for counting complexity $\\tau(n)$ of cyclic $n$-fold coverings of a graph. We give an explicit analytic formula for $\\tau(n)$ in terms of Chebyshev polynomials and find its asymptotic behavior as $n\\to\\infty$ through the Mahler measure of the associated voltage polynomial. We also prove that $F(x)=\\sum\\limits_{n=1}^\\infty\\tau(n)x^n$ is a rational function with integer coefficients.","authors_text":"A. D. Mednykh, I. A. Mednykh, Y. S. Kwon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-09T07:30:00Z","title":"On complexity of cyclic coverings of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.03801","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:0c0676c1be7e9f470d1eed9d5b0a0568862270d2022f6962ed83fed2c63a7d7d","target":"record","created_at":"2026-05-18T00:01:11Z","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":"40c37e8585526f7cc7ae8f6acb919dcbf722dd21b045b2345e59aa611f2132a3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-09T07:30:00Z","title_canon_sha256":"6872f71d472803f9f41f6fba2f2365a54cf32733cbab272cb0b44d58b9c43277"},"schema_version":"1.0","source":{"id":"1811.03801","kind":"arxiv","version":1}},"canonical_sha256":"ace61d6fafa188581e1104a82102b4f7b138da2dbb9e5d161987e8155ce040d0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ace61d6fafa188581e1104a82102b4f7b138da2dbb9e5d161987e8155ce040d0","first_computed_at":"2026-05-18T00:01:11.982771Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:11.982771Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n46n1xT2nCq+ExHRPGZT8ivNxSeWjTOXDrZo1rzqBApiecFQV5J5sKCCFM9p9nZa+1Ms1rYd3fyHAdALpPNqAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:11.983578Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.03801","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0c0676c1be7e9f470d1eed9d5b0a0568862270d2022f6962ed83fed2c63a7d7d","sha256:c8251ae0cb546905ad8e0c3320ebc6a63a18d6825c15d5d5eaf89d2255d580bf"],"state_sha256":"70353c404b5015b94d8f75403a9787f7f9045bfef3416378c596f0d9e34b0dca"}