{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:QYHM47RB3LOS27BMPZ6O3POMLR","short_pith_number":"pith:QYHM47RB","schema_version":"1.0","canonical_sha256":"860ece7e21dadd2d7c2c7e7cedbdcc5c732e9610895508bcf5cd2d940e02f735","source":{"kind":"arxiv","id":"1902.05681","version":1},"attestation_state":"computed","paper":{"title":"Complexity of the circulant foliation over a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander Mednykh, Ilya Mednykh, Young Soo Kwon","submitted_at":"2019-02-15T04:16:26Z","abstract_excerpt":"In the present paper, we investigate the complexity of infinite family of graphs $H_n=H_n(G_1,\\,G_2,\\ldots,G_m)$ obtained as a circulant foliation over a graph $H$ on $m$ vertices with fibers $G_{1},\\,G_{2},\\ldots,G_{m}.$ Each fiber $G_{i}=C_{n}(s_{i,1},\\,s_{i,2},\\ldots,s_{i,k_{i}})$ of this foliation is the circulant graph on $n$ vertices with jumps $s_{i,1},\\,s_{i,2},\\ldots,s_{i,k_{i}}.$ This family includes the family of generalized Petersen graphs, $I$-graphs, sandwiches of circulant graphs, discrete torus graphs and others.\n  We obtain a closed formula for the number $\\tau(n)$ of spanning"},"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":"1902.05681","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-15T04:16:26Z","cross_cats_sorted":[],"title_canon_sha256":"40eb94991b3fc173d983b569cc9932ba2a32d54a01ba40cccb61a0bd1c3f79ce","abstract_canon_sha256":"4b6dc0fe97591631dbce249ff7293af67b84f575e2f489afbe85d3d780924513"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:56.523187Z","signature_b64":"Oe21xwYHUeyz1VRjqpMnwtL0ObsYqm1l4DwxGemeOhwzcKVBald6+aLRr9bPEjgn4nEkUPczT+ANeWqXX/JCDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"860ece7e21dadd2d7c2c7e7cedbdcc5c732e9610895508bcf5cd2d940e02f735","last_reissued_at":"2026-05-17T23:53:56.522579Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:56.522579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity of the circulant foliation over a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander Mednykh, Ilya Mednykh, Young Soo Kwon","submitted_at":"2019-02-15T04:16:26Z","abstract_excerpt":"In the present paper, we investigate the complexity of infinite family of graphs $H_n=H_n(G_1,\\,G_2,\\ldots,G_m)$ obtained as a circulant foliation over a graph $H$ on $m$ vertices with fibers $G_{1},\\,G_{2},\\ldots,G_{m}.$ Each fiber $G_{i}=C_{n}(s_{i,1},\\,s_{i,2},\\ldots,s_{i,k_{i}})$ of this foliation is the circulant graph on $n$ vertices with jumps $s_{i,1},\\,s_{i,2},\\ldots,s_{i,k_{i}}.$ This family includes the family of generalized Petersen graphs, $I$-graphs, sandwiches of circulant graphs, discrete torus graphs and others.\n  We obtain a closed formula for the number $\\tau(n)$ of spanning"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.05681","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":"1902.05681","created_at":"2026-05-17T23:53:56.522679+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.05681v1","created_at":"2026-05-17T23:53:56.522679+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.05681","created_at":"2026-05-17T23:53:56.522679+00:00"},{"alias_kind":"pith_short_12","alias_value":"QYHM47RB3LOS","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"QYHM47RB3LOS27BM","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"QYHM47RB","created_at":"2026-05-18T12:33:27.125529+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/QYHM47RB3LOS27BMPZ6O3POMLR","json":"https://pith.science/pith/QYHM47RB3LOS27BMPZ6O3POMLR.json","graph_json":"https://pith.science/api/pith-number/QYHM47RB3LOS27BMPZ6O3POMLR/graph.json","events_json":"https://pith.science/api/pith-number/QYHM47RB3LOS27BMPZ6O3POMLR/events.json","paper":"https://pith.science/paper/QYHM47RB"},"agent_actions":{"view_html":"https://pith.science/pith/QYHM47RB3LOS27BMPZ6O3POMLR","download_json":"https://pith.science/pith/QYHM47RB3LOS27BMPZ6O3POMLR.json","view_paper":"https://pith.science/paper/QYHM47RB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.05681&json=true","fetch_graph":"https://pith.science/api/pith-number/QYHM47RB3LOS27BMPZ6O3POMLR/graph.json","fetch_events":"https://pith.science/api/pith-number/QYHM47RB3LOS27BMPZ6O3POMLR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QYHM47RB3LOS27BMPZ6O3POMLR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QYHM47RB3LOS27BMPZ6O3POMLR/action/storage_attestation","attest_author":"https://pith.science/pith/QYHM47RB3LOS27BMPZ6O3POMLR/action/author_attestation","sign_citation":"https://pith.science/pith/QYHM47RB3LOS27BMPZ6O3POMLR/action/citation_signature","submit_replication":"https://pith.science/pith/QYHM47RB3LOS27BMPZ6O3POMLR/action/replication_record"}},"created_at":"2026-05-17T23:53:56.522679+00:00","updated_at":"2026-05-17T23:53:56.522679+00:00"}