{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:L7R6ZF6SCKE5MMZBBIRZLWWZDE","short_pith_number":"pith:L7R6ZF6S","canonical_record":{"source":{"id":"1010.5658","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-27T11:55:22Z","cross_cats_sorted":[],"title_canon_sha256":"1a9e59c577ae5e119171f6a0dae3cbf5c0999ad820c00554b28fde10f7d3f4bb","abstract_canon_sha256":"5a6bf323b8d6d14c1cc3c609da6e46d5583abf778ab247f6c317377ec5582d63"},"schema_version":"1.0"},"canonical_sha256":"5fe3ec97d21289d633210a2395dad9192ec2a8f0457330c45722844f3f0cf45c","source":{"kind":"arxiv","id":"1010.5658","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.5658","created_at":"2026-05-18T02:52:42Z"},{"alias_kind":"arxiv_version","alias_value":"1010.5658v2","created_at":"2026-05-18T02:52:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.5658","created_at":"2026-05-18T02:52:42Z"},{"alias_kind":"pith_short_12","alias_value":"L7R6ZF6SCKE5","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"L7R6ZF6SCKE5MMZB","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"L7R6ZF6S","created_at":"2026-05-18T12:26:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:L7R6ZF6SCKE5MMZBBIRZLWWZDE","target":"record","payload":{"canonical_record":{"source":{"id":"1010.5658","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-27T11:55:22Z","cross_cats_sorted":[],"title_canon_sha256":"1a9e59c577ae5e119171f6a0dae3cbf5c0999ad820c00554b28fde10f7d3f4bb","abstract_canon_sha256":"5a6bf323b8d6d14c1cc3c609da6e46d5583abf778ab247f6c317377ec5582d63"},"schema_version":"1.0"},"canonical_sha256":"5fe3ec97d21289d633210a2395dad9192ec2a8f0457330c45722844f3f0cf45c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:42.491265Z","signature_b64":"85NGxZWRV74peYFiIGXSGNcNkKySa5UnWKuezh+vTgnpUYKNYv0k1yeE146RUcegOYI+xDh7AB+nyzQ2YQDhCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5fe3ec97d21289d633210a2395dad9192ec2a8f0457330c45722844f3f0cf45c","last_reissued_at":"2026-05-18T02:52:42.490809Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:42.490809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1010.5658","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:52:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0l29wGh13tKOIesYWrKR+cMfkihmur4jX0zjUEuKGV6xtMr8bsCgFpU8/ljp4moMmTtMKRBs/oWv7RKL7ZgZAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T15:30:21.211480Z"},"content_sha256":"6b2167e72ddde71c82b561216e156890e8fc954516405b09b6d9e20bb2795a04","schema_version":"1.0","event_id":"sha256:6b2167e72ddde71c82b561216e156890e8fc954516405b09b6d9e20bb2795a04"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:L7R6ZF6SCKE5MMZBBIRZLWWZDE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On graphs of defect at most 2","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guillermo Pineda-Villavicencio, Mirka Miller, Ramiro Feria-Pur\\'on","submitted_at":"2010-10-27T11:55:22Z","abstract_excerpt":"In this paper we consider the degree/diameter problem, namely, given natural numbers {\\Delta} \\geq 2 and D \\geq 1, find the maximum number N({\\Delta},D) of vertices in a graph of maximum degree {\\Delta} and diameter D. In this context, the Moore bound M({\\Delta},D) represents an upper bound for N({\\Delta},D). Graphs of maximum degree {\\Delta}, diameter D and order M({\\Delta},D), called Moore graphs, turned out to be very rare. Therefore, it is very interesting to investigate graphs of maximum degree {\\Delta} \\geq 2, diameter D \\geq 1 and order M({\\Delta},D) - {\\epsilon} with small {\\epsilon} >"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.5658","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:52:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G5KdwwE3b7QTg85NkXYtbNTErUSa/Li+9w83W544aBF7ASHndyDjYpK/ve35Tn+nLPBRlKIfA8EiGiVwkx7HCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T15:30:21.212366Z"},"content_sha256":"eff2af7799a0f0aa325ee04299b54b9973ddc5f67492d4021a553f2402e42482","schema_version":"1.0","event_id":"sha256:eff2af7799a0f0aa325ee04299b54b9973ddc5f67492d4021a553f2402e42482"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L7R6ZF6SCKE5MMZBBIRZLWWZDE/bundle.json","state_url":"https://pith.science/pith/L7R6ZF6SCKE5MMZBBIRZLWWZDE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L7R6ZF6SCKE5MMZBBIRZLWWZDE/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T15:30:21Z","links":{"resolver":"https://pith.science/pith/L7R6ZF6SCKE5MMZBBIRZLWWZDE","bundle":"https://pith.science/pith/L7R6ZF6SCKE5MMZBBIRZLWWZDE/bundle.json","state":"https://pith.science/pith/L7R6ZF6SCKE5MMZBBIRZLWWZDE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L7R6ZF6SCKE5MMZBBIRZLWWZDE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:L7R6ZF6SCKE5MMZBBIRZLWWZDE","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":"5a6bf323b8d6d14c1cc3c609da6e46d5583abf778ab247f6c317377ec5582d63","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-27T11:55:22Z","title_canon_sha256":"1a9e59c577ae5e119171f6a0dae3cbf5c0999ad820c00554b28fde10f7d3f4bb"},"schema_version":"1.0","source":{"id":"1010.5658","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.5658","created_at":"2026-05-18T02:52:42Z"},{"alias_kind":"arxiv_version","alias_value":"1010.5658v2","created_at":"2026-05-18T02:52:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.5658","created_at":"2026-05-18T02:52:42Z"},{"alias_kind":"pith_short_12","alias_value":"L7R6ZF6SCKE5","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"L7R6ZF6SCKE5MMZB","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"L7R6ZF6S","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:eff2af7799a0f0aa325ee04299b54b9973ddc5f67492d4021a553f2402e42482","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":"In this paper we consider the degree/diameter problem, namely, given natural numbers {\\Delta} \\geq 2 and D \\geq 1, find the maximum number N({\\Delta},D) of vertices in a graph of maximum degree {\\Delta} and diameter D. In this context, the Moore bound M({\\Delta},D) represents an upper bound for N({\\Delta},D). Graphs of maximum degree {\\Delta}, diameter D and order M({\\Delta},D), called Moore graphs, turned out to be very rare. Therefore, it is very interesting to investigate graphs of maximum degree {\\Delta} \\geq 2, diameter D \\geq 1 and order M({\\Delta},D) - {\\epsilon} with small {\\epsilon} >","authors_text":"Guillermo Pineda-Villavicencio, Mirka Miller, Ramiro Feria-Pur\\'on","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-27T11:55:22Z","title":"On graphs of defect at most 2"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.5658","kind":"arxiv","version":2},"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:6b2167e72ddde71c82b561216e156890e8fc954516405b09b6d9e20bb2795a04","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":"5a6bf323b8d6d14c1cc3c609da6e46d5583abf778ab247f6c317377ec5582d63","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-27T11:55:22Z","title_canon_sha256":"1a9e59c577ae5e119171f6a0dae3cbf5c0999ad820c00554b28fde10f7d3f4bb"},"schema_version":"1.0","source":{"id":"1010.5658","kind":"arxiv","version":2}},"canonical_sha256":"5fe3ec97d21289d633210a2395dad9192ec2a8f0457330c45722844f3f0cf45c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5fe3ec97d21289d633210a2395dad9192ec2a8f0457330c45722844f3f0cf45c","first_computed_at":"2026-05-18T02:52:42.490809Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:42.490809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"85NGxZWRV74peYFiIGXSGNcNkKySa5UnWKuezh+vTgnpUYKNYv0k1yeE146RUcegOYI+xDh7AB+nyzQ2YQDhCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:42.491265Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.5658","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6b2167e72ddde71c82b561216e156890e8fc954516405b09b6d9e20bb2795a04","sha256:eff2af7799a0f0aa325ee04299b54b9973ddc5f67492d4021a553f2402e42482"],"state_sha256":"d3abd8477de79b9c9dd84f90bf908084ab38ff2569e87e0888a2c19dfc03070e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9AG1tzx4f/MJVVIvV14VF4jEbPhV7dywuQWMbT4BB55GiG+rWiMBc9cgjsPfhjFrBTkKg99yxQE84SRr+FomBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T15:30:21.216553Z","bundle_sha256":"5c6ef56795a9beb12301bfed0980517c818779e4b7545166820b915027306f78"}}