{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:36WHYSKQJIJ2TLH52K4LEHHURA","short_pith_number":"pith:36WHYSKQ","canonical_record":{"source":{"id":"1508.02596","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-11T13:58:15Z","cross_cats_sorted":[],"title_canon_sha256":"c3531194c0671996c65a96e9450d3309db9217310ea45bfa19cf41777ee3ee96","abstract_canon_sha256":"a904551eb7a32b3c055ce242db7f40bfc388eff89f3bc57d35df0a4c8640fbd2"},"schema_version":"1.0"},"canonical_sha256":"dfac7c49504a13a9acfdd2b8b21cf488017a6754565d742eeb9b1936c2e4cd81","source":{"kind":"arxiv","id":"1508.02596","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.02596","created_at":"2026-05-18T01:15:58Z"},{"alias_kind":"arxiv_version","alias_value":"1508.02596v2","created_at":"2026-05-18T01:15:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.02596","created_at":"2026-05-18T01:15:58Z"},{"alias_kind":"pith_short_12","alias_value":"36WHYSKQJIJ2","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"36WHYSKQJIJ2TLH5","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"36WHYSKQ","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:36WHYSKQJIJ2TLH52K4LEHHURA","target":"record","payload":{"canonical_record":{"source":{"id":"1508.02596","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-11T13:58:15Z","cross_cats_sorted":[],"title_canon_sha256":"c3531194c0671996c65a96e9450d3309db9217310ea45bfa19cf41777ee3ee96","abstract_canon_sha256":"a904551eb7a32b3c055ce242db7f40bfc388eff89f3bc57d35df0a4c8640fbd2"},"schema_version":"1.0"},"canonical_sha256":"dfac7c49504a13a9acfdd2b8b21cf488017a6754565d742eeb9b1936c2e4cd81","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:58.362024Z","signature_b64":"RgwnGq9+KZ0KEHjzuX7U8hnxqOuItOyb/E2mtXfkPfMaPN7im84SFuHqQ+G/PVOyiLnfZYcySIQYI0qkO876Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dfac7c49504a13a9acfdd2b8b21cf488017a6754565d742eeb9b1936c2e4cd81","last_reissued_at":"2026-05-18T01:15:58.361441Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:58.361441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.02596","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-18T01:15:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JZIe+4NJSeNCn8bW7Fkzuzca0wZmmU+1vaLvyFYr0lYHWJRgYV5LX1TofSmke+UJlDmvy+QxeUbuWJwSi2fzAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T16:31:02.371471Z"},"content_sha256":"a225a4ae390e417e29f670e6bf9c454669e95b0d5345e5cd205e69e5baa9d8de","schema_version":"1.0","event_id":"sha256:a225a4ae390e417e29f670e6bf9c454669e95b0d5345e5cd205e69e5baa9d8de"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:36WHYSKQJIJ2TLH52K4LEHHURA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A revised Moore bound for mixed graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dominique Buset, Grahame Erskine, Hebert P\\'erez-Ros\\'es, Mirka Miller, Mourad El Amiri","submitted_at":"2015-08-11T13:58:15Z","abstract_excerpt":"The degree-diameter problem seeks to find the maximum possible order of a graph with a given (maximum) degree and diameter. It is known that graphs attaining the maximum possible value (the Moore bound) are extremely rare, but much activity is focused on finding new examples of graphs or families of graph with orders approaching the bound as closely as possible.\n  There has been recent interest in this problem as it applies to mixed graphs, in which we allow some of the edges to be undirected and some directed. A 2008 paper of Nguyen and Miller derived an upper bound on the possible number of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.02596","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-18T01:15:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sWBLEi2YzGKOGEWF40vsXwCpWnx37TaJ0ylcNk+Ei24ocsQnUMZKCstBZ0/YchQcpnQS96JhAtELWEbO33PAAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T16:31:02.372100Z"},"content_sha256":"3b78139c105ff757911fb29fb9056f8565a3c5538195bc14a38475e94e2288e6","schema_version":"1.0","event_id":"sha256:3b78139c105ff757911fb29fb9056f8565a3c5538195bc14a38475e94e2288e6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/36WHYSKQJIJ2TLH52K4LEHHURA/bundle.json","state_url":"https://pith.science/pith/36WHYSKQJIJ2TLH52K4LEHHURA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/36WHYSKQJIJ2TLH52K4LEHHURA/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-31T16:31:02Z","links":{"resolver":"https://pith.science/pith/36WHYSKQJIJ2TLH52K4LEHHURA","bundle":"https://pith.science/pith/36WHYSKQJIJ2TLH52K4LEHHURA/bundle.json","state":"https://pith.science/pith/36WHYSKQJIJ2TLH52K4LEHHURA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/36WHYSKQJIJ2TLH52K4LEHHURA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:36WHYSKQJIJ2TLH52K4LEHHURA","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":"a904551eb7a32b3c055ce242db7f40bfc388eff89f3bc57d35df0a4c8640fbd2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-11T13:58:15Z","title_canon_sha256":"c3531194c0671996c65a96e9450d3309db9217310ea45bfa19cf41777ee3ee96"},"schema_version":"1.0","source":{"id":"1508.02596","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.02596","created_at":"2026-05-18T01:15:58Z"},{"alias_kind":"arxiv_version","alias_value":"1508.02596v2","created_at":"2026-05-18T01:15:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.02596","created_at":"2026-05-18T01:15:58Z"},{"alias_kind":"pith_short_12","alias_value":"36WHYSKQJIJ2","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"36WHYSKQJIJ2TLH5","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"36WHYSKQ","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:3b78139c105ff757911fb29fb9056f8565a3c5538195bc14a38475e94e2288e6","target":"graph","created_at":"2026-05-18T01:15:58Z","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 degree-diameter problem seeks to find the maximum possible order of a graph with a given (maximum) degree and diameter. It is known that graphs attaining the maximum possible value (the Moore bound) are extremely rare, but much activity is focused on finding new examples of graphs or families of graph with orders approaching the bound as closely as possible.\n  There has been recent interest in this problem as it applies to mixed graphs, in which we allow some of the edges to be undirected and some directed. A 2008 paper of Nguyen and Miller derived an upper bound on the possible number of ","authors_text":"Dominique Buset, Grahame Erskine, Hebert P\\'erez-Ros\\'es, Mirka Miller, Mourad El Amiri","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-11T13:58:15Z","title":"A revised Moore bound for mixed graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.02596","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:a225a4ae390e417e29f670e6bf9c454669e95b0d5345e5cd205e69e5baa9d8de","target":"record","created_at":"2026-05-18T01:15:58Z","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":"a904551eb7a32b3c055ce242db7f40bfc388eff89f3bc57d35df0a4c8640fbd2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-11T13:58:15Z","title_canon_sha256":"c3531194c0671996c65a96e9450d3309db9217310ea45bfa19cf41777ee3ee96"},"schema_version":"1.0","source":{"id":"1508.02596","kind":"arxiv","version":2}},"canonical_sha256":"dfac7c49504a13a9acfdd2b8b21cf488017a6754565d742eeb9b1936c2e4cd81","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dfac7c49504a13a9acfdd2b8b21cf488017a6754565d742eeb9b1936c2e4cd81","first_computed_at":"2026-05-18T01:15:58.361441Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:58.361441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RgwnGq9+KZ0KEHjzuX7U8hnxqOuItOyb/E2mtXfkPfMaPN7im84SFuHqQ+G/PVOyiLnfZYcySIQYI0qkO876Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:58.362024Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.02596","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a225a4ae390e417e29f670e6bf9c454669e95b0d5345e5cd205e69e5baa9d8de","sha256:3b78139c105ff757911fb29fb9056f8565a3c5538195bc14a38475e94e2288e6"],"state_sha256":"4063912bfaadf4d55d941a727bd186bac9111c0cf4bebcd41c55ed3d551ce30e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kegGdBUWjwCKCTi+8Sdb6HRzeEquOQy4STerIMSPad6pkwZjC+MGGaRSaLjpDXgjBXDGEkNmaXHODYClXGbFCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T16:31:02.375861Z","bundle_sha256":"382518a21aeb4b36cd0c0d205c379948376ea169f111dd62c8cf905b33cb61ec"}}