{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:RZWBZ4WLZD2VAIDM2S6WGOHSVK","short_pith_number":"pith:RZWBZ4WL","schema_version":"1.0","canonical_sha256":"8e6c1cf2cbc8f550206cd4bd6338f2aab5232a1d31ec03789db80168d0b1c3b1","source":{"kind":"arxiv","id":"1512.05917","version":1},"attestation_state":"computed","paper":{"title":"On Cyclic Kautz Digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Clemens Huemer, Cristina Dalf\\'o, Katerina B\\\"ohmov\\'a","submitted_at":"2015-12-18T12:05:08Z","abstract_excerpt":"A prominent problem in Graph Theory is to find extremal graphs or digraphs with restrictions in their diameter, degree and number of vertices. Here we obtain a new family of digraphs with minimal diameter, that is, given the number of vertices and out-degree there is no other digraph with a smaller diameter. This new family is called modified cyclic digraphs $MCK(d,\\ell)$ and it is derived from the Kautz digraphs $K(d,\\ell)$. %It is not common to find non-regular digraphs with minimal diameter given their number of vertices and out-degree.\n  It is well-known that the Kautz digraphs $K(d,\\ell)$"},"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":"1512.05917","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-18T12:05:08Z","cross_cats_sorted":[],"title_canon_sha256":"41d19c33026f11e351bee4213e5a28fc508f3d6074b91e34b05881d55d819e68","abstract_canon_sha256":"6b233753c9aa4eeea965e4d0a009ff9e099a75282c78c63cfc9fa40c8a983008"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:05.918861Z","signature_b64":"KoxZ0Muaswbpq30V/DGa2Ga6sC5Qdzg2bPeXFwHTekAHShO/bWwm/w1AE2KGOYcIZaWCXSWPi4A8UmY/am6cBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e6c1cf2cbc8f550206cd4bd6338f2aab5232a1d31ec03789db80168d0b1c3b1","last_reissued_at":"2026-05-18T01:24:05.918310Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:05.918310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Cyclic Kautz Digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Clemens Huemer, Cristina Dalf\\'o, Katerina B\\\"ohmov\\'a","submitted_at":"2015-12-18T12:05:08Z","abstract_excerpt":"A prominent problem in Graph Theory is to find extremal graphs or digraphs with restrictions in their diameter, degree and number of vertices. Here we obtain a new family of digraphs with minimal diameter, that is, given the number of vertices and out-degree there is no other digraph with a smaller diameter. This new family is called modified cyclic digraphs $MCK(d,\\ell)$ and it is derived from the Kautz digraphs $K(d,\\ell)$. %It is not common to find non-regular digraphs with minimal diameter given their number of vertices and out-degree.\n  It is well-known that the Kautz digraphs $K(d,\\ell)$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.05917","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":"1512.05917","created_at":"2026-05-18T01:24:05.918419+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.05917v1","created_at":"2026-05-18T01:24:05.918419+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.05917","created_at":"2026-05-18T01:24:05.918419+00:00"},{"alias_kind":"pith_short_12","alias_value":"RZWBZ4WLZD2V","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"RZWBZ4WLZD2VAIDM","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"RZWBZ4WL","created_at":"2026-05-18T12:29:39.896362+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/RZWBZ4WLZD2VAIDM2S6WGOHSVK","json":"https://pith.science/pith/RZWBZ4WLZD2VAIDM2S6WGOHSVK.json","graph_json":"https://pith.science/api/pith-number/RZWBZ4WLZD2VAIDM2S6WGOHSVK/graph.json","events_json":"https://pith.science/api/pith-number/RZWBZ4WLZD2VAIDM2S6WGOHSVK/events.json","paper":"https://pith.science/paper/RZWBZ4WL"},"agent_actions":{"view_html":"https://pith.science/pith/RZWBZ4WLZD2VAIDM2S6WGOHSVK","download_json":"https://pith.science/pith/RZWBZ4WLZD2VAIDM2S6WGOHSVK.json","view_paper":"https://pith.science/paper/RZWBZ4WL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.05917&json=true","fetch_graph":"https://pith.science/api/pith-number/RZWBZ4WLZD2VAIDM2S6WGOHSVK/graph.json","fetch_events":"https://pith.science/api/pith-number/RZWBZ4WLZD2VAIDM2S6WGOHSVK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RZWBZ4WLZD2VAIDM2S6WGOHSVK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RZWBZ4WLZD2VAIDM2S6WGOHSVK/action/storage_attestation","attest_author":"https://pith.science/pith/RZWBZ4WLZD2VAIDM2S6WGOHSVK/action/author_attestation","sign_citation":"https://pith.science/pith/RZWBZ4WLZD2VAIDM2S6WGOHSVK/action/citation_signature","submit_replication":"https://pith.science/pith/RZWBZ4WLZD2VAIDM2S6WGOHSVK/action/replication_record"}},"created_at":"2026-05-18T01:24:05.918419+00:00","updated_at":"2026-05-18T01:24:05.918419+00:00"}