{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:3KUO2QRDRKNLW4VNRB3XHG42DJ","short_pith_number":"pith:3KUO2QRD","canonical_record":{"source":{"id":"1812.04484","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-10T02:34:00Z","cross_cats_sorted":[],"title_canon_sha256":"ebee4dee3d6471c72b16560c4f533dea5cadd61dc22ad1748820618b9283d88e","abstract_canon_sha256":"d76c4ea7d6ccbf24519e4957fa72825a7b94c04286c66874d49c751cf25ae5cb"},"schema_version":"1.0"},"canonical_sha256":"daa8ed42238a9abb72ad8877739b9a1a7e01e18930f64568b578d57af273e06b","source":{"kind":"arxiv","id":"1812.04484","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.04484","created_at":"2026-05-17T23:58:31Z"},{"alias_kind":"arxiv_version","alias_value":"1812.04484v1","created_at":"2026-05-17T23:58:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.04484","created_at":"2026-05-17T23:58:31Z"},{"alias_kind":"pith_short_12","alias_value":"3KUO2QRDRKNL","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3KUO2QRDRKNLW4VN","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3KUO2QRD","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:3KUO2QRDRKNLW4VNRB3XHG42DJ","target":"record","payload":{"canonical_record":{"source":{"id":"1812.04484","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-10T02:34:00Z","cross_cats_sorted":[],"title_canon_sha256":"ebee4dee3d6471c72b16560c4f533dea5cadd61dc22ad1748820618b9283d88e","abstract_canon_sha256":"d76c4ea7d6ccbf24519e4957fa72825a7b94c04286c66874d49c751cf25ae5cb"},"schema_version":"1.0"},"canonical_sha256":"daa8ed42238a9abb72ad8877739b9a1a7e01e18930f64568b578d57af273e06b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:31.905244Z","signature_b64":"9rcoCtOyvOA6VvMjESxAraCvIreTUrGUGKW74zfS4QkoCBaLOaGxyuqqASJPy/vAuSJOEwEvGeuJSYBW2VYGCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"daa8ed42238a9abb72ad8877739b9a1a7e01e18930f64568b578d57af273e06b","last_reissued_at":"2026-05-17T23:58:31.904461Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:31.904461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.04484","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:58:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XYJSfmt7rIwy7faIeXObYe5vPulA/EQ+3x8E+DRxgqrK04XYKzX0ueID9dVRDbJkrYqJ0I5D4LZtXBYd3gEvAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T08:32:02.974912Z"},"content_sha256":"6086ea22a16eea31a198468e8e890d0c1750d213af9db5e7c88f36c97b4835d1","schema_version":"1.0","event_id":"sha256:6086ea22a16eea31a198468e8e890d0c1750d213af9db5e7c88f36c97b4835d1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:3KUO2QRDRKNLW4VNRB3XHG42DJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complexity of circulant graphs with non-fixed jumps, its arithmetic properties and asymptotics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander Mednykh, Ilya Mednykh","submitted_at":"2018-12-10T02:34:00Z","abstract_excerpt":"In the present paper, we investigate a family of circulant graphs with non-fixed jumps $$G_n=C_{\\beta n}(s_1, \\ldots,s_k,\\alpha_1n,\\ldots,\\alpha_\\ell n),\\, 1\\le s_1<\\ldots<s_k\\le[\\frac{\\beta n}{2}],\\, 1\\le \\alpha_1< \\ldots<\\alpha_\\ell\\le[\\frac{\\beta}{2}].$$ Here $n$ is an arbitrary large natural number and integers $s_1, \\ldots,s_k,\\alpha_1, \\ldots,\\alpha_\\ell$ are supposed to be fixed.\n  First, we present an explicit formula for the number of spanning trees in the graph $G_n.$ This formula is a product of $\\beta s_k-1$ factors, each given by the $n$-th Chebyshev polynomial of the first kind e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.04484","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:58:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jpySJiLHm4IXVQtI+DbyrpVkW0C7Ob1byuxVsEKvTfR0lY9q5UcEIU5xJCRHZqaWy1qQZCfESVQ0cT8GJw6ODw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T08:32:02.975263Z"},"content_sha256":"e38720403428f519f541cec08c9476cac9f3c9c1b8764fe52b0c360c75f8288b","schema_version":"1.0","event_id":"sha256:e38720403428f519f541cec08c9476cac9f3c9c1b8764fe52b0c360c75f8288b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3KUO2QRDRKNLW4VNRB3XHG42DJ/bundle.json","state_url":"https://pith.science/pith/3KUO2QRDRKNLW4VNRB3XHG42DJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3KUO2QRDRKNLW4VNRB3XHG42DJ/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-03T08:32:02Z","links":{"resolver":"https://pith.science/pith/3KUO2QRDRKNLW4VNRB3XHG42DJ","bundle":"https://pith.science/pith/3KUO2QRDRKNLW4VNRB3XHG42DJ/bundle.json","state":"https://pith.science/pith/3KUO2QRDRKNLW4VNRB3XHG42DJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3KUO2QRDRKNLW4VNRB3XHG42DJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:3KUO2QRDRKNLW4VNRB3XHG42DJ","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":"d76c4ea7d6ccbf24519e4957fa72825a7b94c04286c66874d49c751cf25ae5cb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-10T02:34:00Z","title_canon_sha256":"ebee4dee3d6471c72b16560c4f533dea5cadd61dc22ad1748820618b9283d88e"},"schema_version":"1.0","source":{"id":"1812.04484","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.04484","created_at":"2026-05-17T23:58:31Z"},{"alias_kind":"arxiv_version","alias_value":"1812.04484v1","created_at":"2026-05-17T23:58:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.04484","created_at":"2026-05-17T23:58:31Z"},{"alias_kind":"pith_short_12","alias_value":"3KUO2QRDRKNL","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3KUO2QRDRKNLW4VN","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3KUO2QRD","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:e38720403428f519f541cec08c9476cac9f3c9c1b8764fe52b0c360c75f8288b","target":"graph","created_at":"2026-05-17T23:58:31Z","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 the present paper, we investigate a family of circulant graphs with non-fixed jumps $$G_n=C_{\\beta n}(s_1, \\ldots,s_k,\\alpha_1n,\\ldots,\\alpha_\\ell n),\\, 1\\le s_1<\\ldots<s_k\\le[\\frac{\\beta n}{2}],\\, 1\\le \\alpha_1< \\ldots<\\alpha_\\ell\\le[\\frac{\\beta}{2}].$$ Here $n$ is an arbitrary large natural number and integers $s_1, \\ldots,s_k,\\alpha_1, \\ldots,\\alpha_\\ell$ are supposed to be fixed.\n  First, we present an explicit formula for the number of spanning trees in the graph $G_n.$ This formula is a product of $\\beta s_k-1$ factors, each given by the $n$-th Chebyshev polynomial of the first kind e","authors_text":"Alexander Mednykh, Ilya Mednykh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-10T02:34:00Z","title":"Complexity of circulant graphs with non-fixed jumps, its arithmetic properties and asymptotics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.04484","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:6086ea22a16eea31a198468e8e890d0c1750d213af9db5e7c88f36c97b4835d1","target":"record","created_at":"2026-05-17T23:58:31Z","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":"d76c4ea7d6ccbf24519e4957fa72825a7b94c04286c66874d49c751cf25ae5cb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-10T02:34:00Z","title_canon_sha256":"ebee4dee3d6471c72b16560c4f533dea5cadd61dc22ad1748820618b9283d88e"},"schema_version":"1.0","source":{"id":"1812.04484","kind":"arxiv","version":1}},"canonical_sha256":"daa8ed42238a9abb72ad8877739b9a1a7e01e18930f64568b578d57af273e06b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"daa8ed42238a9abb72ad8877739b9a1a7e01e18930f64568b578d57af273e06b","first_computed_at":"2026-05-17T23:58:31.904461Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:31.904461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9rcoCtOyvOA6VvMjESxAraCvIreTUrGUGKW74zfS4QkoCBaLOaGxyuqqASJPy/vAuSJOEwEvGeuJSYBW2VYGCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:31.905244Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.04484","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6086ea22a16eea31a198468e8e890d0c1750d213af9db5e7c88f36c97b4835d1","sha256:e38720403428f519f541cec08c9476cac9f3c9c1b8764fe52b0c360c75f8288b"],"state_sha256":"2d9913461e2bb116956c48851681d30a0f97bf58a9c883e2034d25d920c6d446"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rk38khdIiil9rqOYsWOWljDl6v0CsbmNVR9iWQ1OgH7vGFEP3X2OOY0HOaL7lS16kW01sBKdpUQVa1gElK6PAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T08:32:02.977298Z","bundle_sha256":"592faa8a5493c98bac69162f124feba773ef46c632a1e19713e95b2c333aed26"}}