{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:WQ26ETSAKNIXRHXUK6VL27REQE","short_pith_number":"pith:WQ26ETSA","schema_version":"1.0","canonical_sha256":"b435e24e405351789ef457aabd7e2481119ace7323f1cd8aa5ab04d1d07963e8","source":{"kind":"arxiv","id":"1010.5841","version":1},"attestation_state":"computed","paper":{"title":"On graphs with cyclic defect or excess","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"(2) Centre for Informatics, Applied Optimization, Charles Delorme (1), Guillermo Pineda-Villavicencio (2) ((1) Laboratoire de Recherche en Informatique, Universit\\'e Paris-Sud, University of Ballarat)","submitted_at":"2010-10-28T01:59:35Z","abstract_excerpt":"The Moore bound constitutes both an upper bound on the order of a graph of maximum degree $d$ and diameter $D=k$ and a lower bound on the order of a graph of minimum degree $d$ and odd girth $g=2k+1$. Graphs missing or exceeding the Moore bound by $\\epsilon$ are called {\\it graphs with defect or excess $\\epsilon$}, respectively.\n  While {\\it Moore graphs} (graphs with $\\epsilon=0$) and graphs with defect or excess 1 have been characterized almost completely, graphs with defect or excess 2 represent a wide unexplored area.\n  Graphs with defect (excess) 2 satisfy the equation $G_{d,k}(A) = J_n +"},"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":"1010.5841","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-28T01:59:35Z","cross_cats_sorted":[],"title_canon_sha256":"35ec8c5dcbf4d420cf9da31f0a9c9c598a1d3f61e973ee7089b3f9c90db50b8d","abstract_canon_sha256":"6c0ac99e83c9322461612067f034263e8f296e5e822255c7f1e69baf7f6ac796"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:42.484785Z","signature_b64":"qTivC8keCpsvlSTB6HuQa2eF3hqzVLucSKbxtoChR8OtkjndkwZ7OzW7oREyqsN6zkf4MxDkKHehLpJsfuxfDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b435e24e405351789ef457aabd7e2481119ace7323f1cd8aa5ab04d1d07963e8","last_reissued_at":"2026-05-18T02:52:42.484313Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:42.484313Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On graphs with cyclic defect or excess","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"(2) Centre for Informatics, Applied Optimization, Charles Delorme (1), Guillermo Pineda-Villavicencio (2) ((1) Laboratoire de Recherche en Informatique, Universit\\'e Paris-Sud, University of Ballarat)","submitted_at":"2010-10-28T01:59:35Z","abstract_excerpt":"The Moore bound constitutes both an upper bound on the order of a graph of maximum degree $d$ and diameter $D=k$ and a lower bound on the order of a graph of minimum degree $d$ and odd girth $g=2k+1$. Graphs missing or exceeding the Moore bound by $\\epsilon$ are called {\\it graphs with defect or excess $\\epsilon$}, respectively.\n  While {\\it Moore graphs} (graphs with $\\epsilon=0$) and graphs with defect or excess 1 have been characterized almost completely, graphs with defect or excess 2 represent a wide unexplored area.\n  Graphs with defect (excess) 2 satisfy the equation $G_{d,k}(A) = J_n +"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.5841","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":"1010.5841","created_at":"2026-05-18T02:52:42.484390+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.5841v1","created_at":"2026-05-18T02:52:42.484390+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.5841","created_at":"2026-05-18T02:52:42.484390+00:00"},{"alias_kind":"pith_short_12","alias_value":"WQ26ETSAKNIX","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_16","alias_value":"WQ26ETSAKNIXRHXU","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_8","alias_value":"WQ26ETSA","created_at":"2026-05-18T12:26:17.028572+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/WQ26ETSAKNIXRHXUK6VL27REQE","json":"https://pith.science/pith/WQ26ETSAKNIXRHXUK6VL27REQE.json","graph_json":"https://pith.science/api/pith-number/WQ26ETSAKNIXRHXUK6VL27REQE/graph.json","events_json":"https://pith.science/api/pith-number/WQ26ETSAKNIXRHXUK6VL27REQE/events.json","paper":"https://pith.science/paper/WQ26ETSA"},"agent_actions":{"view_html":"https://pith.science/pith/WQ26ETSAKNIXRHXUK6VL27REQE","download_json":"https://pith.science/pith/WQ26ETSAKNIXRHXUK6VL27REQE.json","view_paper":"https://pith.science/paper/WQ26ETSA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.5841&json=true","fetch_graph":"https://pith.science/api/pith-number/WQ26ETSAKNIXRHXUK6VL27REQE/graph.json","fetch_events":"https://pith.science/api/pith-number/WQ26ETSAKNIXRHXUK6VL27REQE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WQ26ETSAKNIXRHXUK6VL27REQE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WQ26ETSAKNIXRHXUK6VL27REQE/action/storage_attestation","attest_author":"https://pith.science/pith/WQ26ETSAKNIXRHXUK6VL27REQE/action/author_attestation","sign_citation":"https://pith.science/pith/WQ26ETSAKNIXRHXUK6VL27REQE/action/citation_signature","submit_replication":"https://pith.science/pith/WQ26ETSAKNIXRHXUK6VL27REQE/action/replication_record"}},"created_at":"2026-05-18T02:52:42.484390+00:00","updated_at":"2026-05-18T02:52:42.484390+00:00"}