{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3JFBQPWDCMGTO2IUZ2VZAFJEKA","short_pith_number":"pith:3JFBQPWD","schema_version":"1.0","canonical_sha256":"da4a183ec3130d376914ceab901524500bf0c7dd7a4b7ef3ae8f5b2a19c1ec81","source":{"kind":"arxiv","id":"1705.00075","version":2},"attestation_state":"computed","paper":{"title":"On diregular digraphs with degree two and excess two","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"James Tuite","submitted_at":"2017-04-28T21:05:11Z","abstract_excerpt":"An important topic in the design of efficient networks is the construction of $(d,k,+\\epsilon )$-digraphs, i.e. $k$-geodetic digraphs with minimum out-degree $\\geq d$ and order $M(d,k)+ \\epsilon $, where $M(d,k)$ represents the Moore bound for degree $d$ and diameter $k$ and $\\epsilon > 0$ is the (small) excess of the digraph. Previous work has shown that there are no $(2,k,+1)$-digraphs for $k \\geq 2$. In a separate paper, the present author has shown that any $(2,k,+2)$-digraph must be diregular for $k \\geq 2$. In the present work, this analysis is completed by proving the nonexistence of di"},"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":"1705.00075","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-28T21:05:11Z","cross_cats_sorted":[],"title_canon_sha256":"e3d416c9a43d983b5dc1003399eddb3ab6de3fc5bccef2451c2e51e3ad6bea5a","abstract_canon_sha256":"8f171ddabd64cff753ea5b6301184170b4a87091aa72cb7f31bcc0bbfe6b1458"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:59.156852Z","signature_b64":"eToe6GdtAadyi8MH978zh1OocE27DMppwbbXJheX4dH4uX07OHdRYessri0KbpAYZgteMOf01AvJRvkMatkdBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da4a183ec3130d376914ceab901524500bf0c7dd7a4b7ef3ae8f5b2a19c1ec81","last_reissued_at":"2026-05-18T00:33:59.156242Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:59.156242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On diregular digraphs with degree two and excess two","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"James Tuite","submitted_at":"2017-04-28T21:05:11Z","abstract_excerpt":"An important topic in the design of efficient networks is the construction of $(d,k,+\\epsilon )$-digraphs, i.e. $k$-geodetic digraphs with minimum out-degree $\\geq d$ and order $M(d,k)+ \\epsilon $, where $M(d,k)$ represents the Moore bound for degree $d$ and diameter $k$ and $\\epsilon > 0$ is the (small) excess of the digraph. Previous work has shown that there are no $(2,k,+1)$-digraphs for $k \\geq 2$. In a separate paper, the present author has shown that any $(2,k,+2)$-digraph must be diregular for $k \\geq 2$. In the present work, this analysis is completed by proving the nonexistence of di"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.00075","kind":"arxiv","version":2},"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":"1705.00075","created_at":"2026-05-18T00:33:59.156328+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.00075v2","created_at":"2026-05-18T00:33:59.156328+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.00075","created_at":"2026-05-18T00:33:59.156328+00:00"},{"alias_kind":"pith_short_12","alias_value":"3JFBQPWDCMGT","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3JFBQPWDCMGTO2IU","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3JFBQPWD","created_at":"2026-05-18T12:30:58.224056+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/3JFBQPWDCMGTO2IUZ2VZAFJEKA","json":"https://pith.science/pith/3JFBQPWDCMGTO2IUZ2VZAFJEKA.json","graph_json":"https://pith.science/api/pith-number/3JFBQPWDCMGTO2IUZ2VZAFJEKA/graph.json","events_json":"https://pith.science/api/pith-number/3JFBQPWDCMGTO2IUZ2VZAFJEKA/events.json","paper":"https://pith.science/paper/3JFBQPWD"},"agent_actions":{"view_html":"https://pith.science/pith/3JFBQPWDCMGTO2IUZ2VZAFJEKA","download_json":"https://pith.science/pith/3JFBQPWDCMGTO2IUZ2VZAFJEKA.json","view_paper":"https://pith.science/paper/3JFBQPWD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.00075&json=true","fetch_graph":"https://pith.science/api/pith-number/3JFBQPWDCMGTO2IUZ2VZAFJEKA/graph.json","fetch_events":"https://pith.science/api/pith-number/3JFBQPWDCMGTO2IUZ2VZAFJEKA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3JFBQPWDCMGTO2IUZ2VZAFJEKA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3JFBQPWDCMGTO2IUZ2VZAFJEKA/action/storage_attestation","attest_author":"https://pith.science/pith/3JFBQPWDCMGTO2IUZ2VZAFJEKA/action/author_attestation","sign_citation":"https://pith.science/pith/3JFBQPWDCMGTO2IUZ2VZAFJEKA/action/citation_signature","submit_replication":"https://pith.science/pith/3JFBQPWDCMGTO2IUZ2VZAFJEKA/action/replication_record"}},"created_at":"2026-05-18T00:33:59.156328+00:00","updated_at":"2026-05-18T00:33:59.156328+00:00"}