{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:LWPS5B3RCN5I622MS52LRM6MRX","short_pith_number":"pith:LWPS5B3R","schema_version":"1.0","canonical_sha256":"5d9f2e8771137a8f6b4c9774b8b3cc8de1dd7429d7f133ec87e4935cc5b7ee61","source":{"kind":"arxiv","id":"1709.03218","version":1},"attestation_state":"computed","paper":{"title":"Enumeration of Labelled and Unlabelled Hamiltonian Cycles in Complete $k$-partite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander Omelchenko, Evgeniy Krasko, Igor Labutin","submitted_at":"2017-09-11T02:36:11Z","abstract_excerpt":"We enumerate labelled and unlabelled Hamiltonian cycles in complete $n$-partite graphs $K_{d,d,\\ldots,d}$ having exactly $d$ vertices in each part (in other words, Tur\\'an graphs $T(nd, n))$. We obtain recurrence relations that allow us to find the exact values $b_{n}^{(d)}$ of such cycles for arbitrary $n$ and $d$"},"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":"1709.03218","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-11T02:36:11Z","cross_cats_sorted":[],"title_canon_sha256":"134d02e57468bdeee85ddd442b6246da706e6a060dd2060034a68b7de79b9f2c","abstract_canon_sha256":"f3f0f0ebced2b84cef8043c9400082936b02ad78a75121ab7be86fc33bec5739"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:38.999428Z","signature_b64":"3dIk5MNlWuNPf+yskNG5eSyx2zfMweeOqYrHHPA9JKZcUi5YAh5z2I7SP2Ui97xN1BgHwEI7804Mq+Z6TJabDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d9f2e8771137a8f6b4c9774b8b3cc8de1dd7429d7f133ec87e4935cc5b7ee61","last_reissued_at":"2026-05-18T00:35:38.998760Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:38.998760Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Enumeration of Labelled and Unlabelled Hamiltonian Cycles in Complete $k$-partite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander Omelchenko, Evgeniy Krasko, Igor Labutin","submitted_at":"2017-09-11T02:36:11Z","abstract_excerpt":"We enumerate labelled and unlabelled Hamiltonian cycles in complete $n$-partite graphs $K_{d,d,\\ldots,d}$ having exactly $d$ vertices in each part (in other words, Tur\\'an graphs $T(nd, n))$. We obtain recurrence relations that allow us to find the exact values $b_{n}^{(d)}$ of such cycles for arbitrary $n$ and $d$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.03218","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":"1709.03218","created_at":"2026-05-18T00:35:38.998854+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.03218v1","created_at":"2026-05-18T00:35:38.998854+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.03218","created_at":"2026-05-18T00:35:38.998854+00:00"},{"alias_kind":"pith_short_12","alias_value":"LWPS5B3RCN5I","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"LWPS5B3RCN5I622M","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"LWPS5B3R","created_at":"2026-05-18T12:31:28.150371+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/LWPS5B3RCN5I622MS52LRM6MRX","json":"https://pith.science/pith/LWPS5B3RCN5I622MS52LRM6MRX.json","graph_json":"https://pith.science/api/pith-number/LWPS5B3RCN5I622MS52LRM6MRX/graph.json","events_json":"https://pith.science/api/pith-number/LWPS5B3RCN5I622MS52LRM6MRX/events.json","paper":"https://pith.science/paper/LWPS5B3R"},"agent_actions":{"view_html":"https://pith.science/pith/LWPS5B3RCN5I622MS52LRM6MRX","download_json":"https://pith.science/pith/LWPS5B3RCN5I622MS52LRM6MRX.json","view_paper":"https://pith.science/paper/LWPS5B3R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.03218&json=true","fetch_graph":"https://pith.science/api/pith-number/LWPS5B3RCN5I622MS52LRM6MRX/graph.json","fetch_events":"https://pith.science/api/pith-number/LWPS5B3RCN5I622MS52LRM6MRX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LWPS5B3RCN5I622MS52LRM6MRX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LWPS5B3RCN5I622MS52LRM6MRX/action/storage_attestation","attest_author":"https://pith.science/pith/LWPS5B3RCN5I622MS52LRM6MRX/action/author_attestation","sign_citation":"https://pith.science/pith/LWPS5B3RCN5I622MS52LRM6MRX/action/citation_signature","submit_replication":"https://pith.science/pith/LWPS5B3RCN5I622MS52LRM6MRX/action/replication_record"}},"created_at":"2026-05-18T00:35:38.998854+00:00","updated_at":"2026-05-18T00:35:38.998854+00:00"}