{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:VTTB235PUGEFQHQRASUCCAVU66","short_pith_number":"pith:VTTB235P","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"},"canonical_sha256":"ace61d6fafa188581e1104a82102b4f7b138da2dbb9e5d161987e8155ce040d0","source":{"kind":"arxiv","id":"1811.03801","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:VTTB235PUGEFQHQRASUCCAVU66","target":"record","payload":{"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"},"canonical_sha256":"ace61d6fafa188581e1104a82102b4f7b138da2dbb9e5d161987e8155ce040d0","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"},"source_kind":"arxiv","source_id":"1811.03801","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-18T00:01:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M1Mc4R+1W1ag+ax17M4Sj/WI5Zhk9vFlanbNAG0mF5NYGU48kuYankJzJ80hC4Vn7tkq588tbrCHljJptDC8Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T18:37:40.751233Z"},"content_sha256":"0c0676c1be7e9f470d1eed9d5b0a0568862270d2022f6962ed83fed2c63a7d7d","schema_version":"1.0","event_id":"sha256:0c0676c1be7e9f470d1eed9d5b0a0568862270d2022f6962ed83fed2c63a7d7d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:VTTB235PUGEFQHQRASUCCAVU66","target":"graph","payload":{"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"},"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-18T00:01:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mcxtTwVeCdNRD1KvSRJLW4sSi7AXHb11mvPCKW7ilkTsO70bMzMVc5G1onvLsLnetjNeRTgCffPOrgoNaw2gDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T18:37:40.751591Z"},"content_sha256":"c8251ae0cb546905ad8e0c3320ebc6a63a18d6825c15d5d5eaf89d2255d580bf","schema_version":"1.0","event_id":"sha256:c8251ae0cb546905ad8e0c3320ebc6a63a18d6825c15d5d5eaf89d2255d580bf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VTTB235PUGEFQHQRASUCCAVU66/bundle.json","state_url":"https://pith.science/pith/VTTB235PUGEFQHQRASUCCAVU66/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VTTB235PUGEFQHQRASUCCAVU66/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-06-27T18:37:40Z","links":{"resolver":"https://pith.science/pith/VTTB235PUGEFQHQRASUCCAVU66","bundle":"https://pith.science/pith/VTTB235PUGEFQHQRASUCCAVU66/bundle.json","state":"https://pith.science/pith/VTTB235PUGEFQHQRASUCCAVU66/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VTTB235PUGEFQHQRASUCCAVU66/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TmypgGO4YXu+rGiyPGoKjATAnyi3AAXI0toVAanPu95rDzMY+uTWFO4yrRZN69nmlqTvYiFlkRRbbX2ITHg6DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T18:37:40.753574Z","bundle_sha256":"4a7b9240dc70dcd6048e9a401f41ec8e2af839139f0ebc7d1902ce236f8e36e5"}}