{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VTTB235PUGEFQHQRASUCCAVU66","short_pith_number":"pith:VTTB235P","schema_version":"1.0","canonical_sha256":"ace61d6fafa188581e1104a82102b4f7b138da2dbb9e5d161987e8155ce040d0","source":{"kind":"arxiv","id":"1811.03801","version":1},"attestation_state":"computed","paper":{"title":"On complexity of cyclic coverings of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A. D. Mednykh, I. A. Mednykh, Y. S. Kwon","submitted_at":"2018-11-09T07:30:00Z","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."},"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":"1811.03801","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-09T07:30:00Z","cross_cats_sorted":[],"title_canon_sha256":"6872f71d472803f9f41f6fba2f2365a54cf32733cbab272cb0b44d58b9c43277","abstract_canon_sha256":"40c37e8585526f7cc7ae8f6acb919dcbf722dd21b045b2345e59aa611f2132a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:11.983578Z","signature_b64":"n46n1xT2nCq+ExHRPGZT8ivNxSeWjTOXDrZo1rzqBApiecFQV5J5sKCCFM9p9nZa+1Ms1rYd3fyHAdALpPNqAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ace61d6fafa188581e1104a82102b4f7b138da2dbb9e5d161987e8155ce040d0","last_reissued_at":"2026-05-18T00:01:11.982771Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:11.982771Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On complexity of cyclic coverings of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A. D. Mednykh, I. A. Mednykh, Y. S. Kwon","submitted_at":"2018-11-09T07:30:00Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.03801","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1811.03801","created_at":"2026-05-18T00:01:11.982898+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.03801v1","created_at":"2026-05-18T00:01:11.982898+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.03801","created_at":"2026-05-18T00:01:11.982898+00:00"},{"alias_kind":"pith_short_12","alias_value":"VTTB235PUGEF","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VTTB235PUGEFQHQR","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VTTB235P","created_at":"2026-05-18T12:32:59.047623+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/VTTB235PUGEFQHQRASUCCAVU66","json":"https://pith.science/pith/VTTB235PUGEFQHQRASUCCAVU66.json","graph_json":"https://pith.science/api/pith-number/VTTB235PUGEFQHQRASUCCAVU66/graph.json","events_json":"https://pith.science/api/pith-number/VTTB235PUGEFQHQRASUCCAVU66/events.json","paper":"https://pith.science/paper/VTTB235P"},"agent_actions":{"view_html":"https://pith.science/pith/VTTB235PUGEFQHQRASUCCAVU66","download_json":"https://pith.science/pith/VTTB235PUGEFQHQRASUCCAVU66.json","view_paper":"https://pith.science/paper/VTTB235P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.03801&json=true","fetch_graph":"https://pith.science/api/pith-number/VTTB235PUGEFQHQRASUCCAVU66/graph.json","fetch_events":"https://pith.science/api/pith-number/VTTB235PUGEFQHQRASUCCAVU66/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VTTB235PUGEFQHQRASUCCAVU66/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VTTB235PUGEFQHQRASUCCAVU66/action/storage_attestation","attest_author":"https://pith.science/pith/VTTB235PUGEFQHQRASUCCAVU66/action/author_attestation","sign_citation":"https://pith.science/pith/VTTB235PUGEFQHQRASUCCAVU66/action/citation_signature","submit_replication":"https://pith.science/pith/VTTB235PUGEFQHQRASUCCAVU66/action/replication_record"}},"created_at":"2026-05-18T00:01:11.982898+00:00","updated_at":"2026-05-18T00:01:11.982898+00:00"}