{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:WQ26ETSAKNIXRHXUK6VL27REQE","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6c0ac99e83c9322461612067f034263e8f296e5e822255c7f1e69baf7f6ac796","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-28T01:59:35Z","title_canon_sha256":"35ec8c5dcbf4d420cf9da31f0a9c9c598a1d3f61e973ee7089b3f9c90db50b8d"},"schema_version":"1.0","source":{"id":"1010.5841","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.5841","created_at":"2026-05-18T02:52:42Z"},{"alias_kind":"arxiv_version","alias_value":"1010.5841v1","created_at":"2026-05-18T02:52:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.5841","created_at":"2026-05-18T02:52:42Z"},{"alias_kind":"pith_short_12","alias_value":"WQ26ETSAKNIX","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"WQ26ETSAKNIXRHXU","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"WQ26ETSA","created_at":"2026-05-18T12:26:17Z"}],"graph_snapshots":[{"event_id":"sha256:73aac69966c53e9cea4b0ed89938b5e8b976b6bb6034f2fa49b6f12cd37249b8","target":"graph","created_at":"2026-05-18T02:52:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 +","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)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-28T01:59:35Z","title":"On graphs with cyclic defect or excess"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.5841","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4d7708e58e71d0a5b1a7a62c8ca69349047855b54787dc9c18becacc0f7166b3","target":"record","created_at":"2026-05-18T02:52:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6c0ac99e83c9322461612067f034263e8f296e5e822255c7f1e69baf7f6ac796","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-28T01:59:35Z","title_canon_sha256":"35ec8c5dcbf4d420cf9da31f0a9c9c598a1d3f61e973ee7089b3f9c90db50b8d"},"schema_version":"1.0","source":{"id":"1010.5841","kind":"arxiv","version":1}},"canonical_sha256":"b435e24e405351789ef457aabd7e2481119ace7323f1cd8aa5ab04d1d07963e8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b435e24e405351789ef457aabd7e2481119ace7323f1cd8aa5ab04d1d07963e8","first_computed_at":"2026-05-18T02:52:42.484313Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:42.484313Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qTivC8keCpsvlSTB6HuQa2eF3hqzVLucSKbxtoChR8OtkjndkwZ7OzW7oREyqsN6zkf4MxDkKHehLpJsfuxfDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:42.484785Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.5841","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4d7708e58e71d0a5b1a7a62c8ca69349047855b54787dc9c18becacc0f7166b3","sha256:73aac69966c53e9cea4b0ed89938b5e8b976b6bb6034f2fa49b6f12cd37249b8"],"state_sha256":"503637e5412bcd6a875abdfcc53dfd4eb585151460ef314f6811bc262e67053d"}