{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NGBPGCVGI3O762KDTIPNKGYSJS","short_pith_number":"pith:NGBPGCVG","canonical_record":{"source":{"id":"1811.00650","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-01T22:04:28Z","cross_cats_sorted":[],"title_canon_sha256":"71f531a05b31e820ca7f80ec0a70d9860902a07c054461b800da8e1edd17d20a","abstract_canon_sha256":"f658e3e9e1f95b82c6ea3c66f94786db376ddb551fecb26877777208cb5a3889"},"schema_version":"1.0"},"canonical_sha256":"6982f30aa646ddff69439a1ed51b124c96c45ffdc06eb8ec3f83a120a68245d3","source":{"kind":"arxiv","id":"1811.00650","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.00650","created_at":"2026-05-18T00:01:42Z"},{"alias_kind":"arxiv_version","alias_value":"1811.00650v1","created_at":"2026-05-18T00:01:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.00650","created_at":"2026-05-18T00:01:42Z"},{"alias_kind":"pith_short_12","alias_value":"NGBPGCVGI3O7","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NGBPGCVGI3O762KD","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NGBPGCVG","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NGBPGCVGI3O762KDTIPNKGYSJS","target":"record","payload":{"canonical_record":{"source":{"id":"1811.00650","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-01T22:04:28Z","cross_cats_sorted":[],"title_canon_sha256":"71f531a05b31e820ca7f80ec0a70d9860902a07c054461b800da8e1edd17d20a","abstract_canon_sha256":"f658e3e9e1f95b82c6ea3c66f94786db376ddb551fecb26877777208cb5a3889"},"schema_version":"1.0"},"canonical_sha256":"6982f30aa646ddff69439a1ed51b124c96c45ffdc06eb8ec3f83a120a68245d3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:42.591212Z","signature_b64":"chd7upni5SbTub9UqvRpJwh7TJsnUfS9zKo5lheJEgA641oKs0I2QEoGooHPzA3HvoxCno7cuHAyxfsrTQRsBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6982f30aa646ddff69439a1ed51b124c96c45ffdc06eb8ec3f83a120a68245d3","last_reissued_at":"2026-05-18T00:01:42.590788Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:42.590788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.00650","source_version":1,"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-18T00:01:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vDdeg1m935aoCTnCx+64qIfUmQgYoKKoJ32pwwjtxame5+coZYvFn2PKBc3/7Cs27oisxSQu8e/HtAuaE5PmBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:10:28.548716Z"},"content_sha256":"d7e1ff66d8bbd7432cd518a44166073f9777e55f3b1206c96f745b74405bf1d3","schema_version":"1.0","event_id":"sha256:d7e1ff66d8bbd7432cd518a44166073f9777e55f3b1206c96f745b74405bf1d3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NGBPGCVGI3O762KDTIPNKGYSJS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On total regularity of mixed graphs with order close to the Moore bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Grahame Erskine, James Tuite","submitted_at":"2018-11-01T22:04:28Z","abstract_excerpt":"The undirected degree/diameter and degree/girth problems and their directed analogues have been studied for many decades in the search for efficient network topologies. Recently such questions have received much attention in the setting of mixed graphs, i.e. networks that admit both undirected \\emph{edges} and directed \\emph{arcs}. The degree/diameter problem for mixed graphs asks for the largest possible order of a network with diameter $k$, maximum undirected degree $\\leq r$ and maximum directed out-degree $\\leq z$. It is also of interest to find smallest possible $k$-geodetic mixed graphs w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.00650","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"},"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-18T00:01:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pwqS+ErfhJTXqn8HZ9kq5E3Ytjq9S/eyaYaptxqKmAIs0GQNGS3O73V2WNbCazQUByD69C8r7apSTFAxPiLCBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:10:28.549398Z"},"content_sha256":"4aed62bc220ead65e87374fde82f6daf9a9a194a18fcdf280a6284e1c1077af9","schema_version":"1.0","event_id":"sha256:4aed62bc220ead65e87374fde82f6daf9a9a194a18fcdf280a6284e1c1077af9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NGBPGCVGI3O762KDTIPNKGYSJS/bundle.json","state_url":"https://pith.science/pith/NGBPGCVGI3O762KDTIPNKGYSJS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NGBPGCVGI3O762KDTIPNKGYSJS/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-06-08T19:10:28Z","links":{"resolver":"https://pith.science/pith/NGBPGCVGI3O762KDTIPNKGYSJS","bundle":"https://pith.science/pith/NGBPGCVGI3O762KDTIPNKGYSJS/bundle.json","state":"https://pith.science/pith/NGBPGCVGI3O762KDTIPNKGYSJS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NGBPGCVGI3O762KDTIPNKGYSJS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NGBPGCVGI3O762KDTIPNKGYSJS","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":"f658e3e9e1f95b82c6ea3c66f94786db376ddb551fecb26877777208cb5a3889","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-01T22:04:28Z","title_canon_sha256":"71f531a05b31e820ca7f80ec0a70d9860902a07c054461b800da8e1edd17d20a"},"schema_version":"1.0","source":{"id":"1811.00650","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.00650","created_at":"2026-05-18T00:01:42Z"},{"alias_kind":"arxiv_version","alias_value":"1811.00650v1","created_at":"2026-05-18T00:01:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.00650","created_at":"2026-05-18T00:01:42Z"},{"alias_kind":"pith_short_12","alias_value":"NGBPGCVGI3O7","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NGBPGCVGI3O762KD","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NGBPGCVG","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:4aed62bc220ead65e87374fde82f6daf9a9a194a18fcdf280a6284e1c1077af9","target":"graph","created_at":"2026-05-18T00:01: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 undirected degree/diameter and degree/girth problems and their directed analogues have been studied for many decades in the search for efficient network topologies. Recently such questions have received much attention in the setting of mixed graphs, i.e. networks that admit both undirected \\emph{edges} and directed \\emph{arcs}. The degree/diameter problem for mixed graphs asks for the largest possible order of a network with diameter $k$, maximum undirected degree $\\leq r$ and maximum directed out-degree $\\leq z$. It is also of interest to find smallest possible $k$-geodetic mixed graphs w","authors_text":"Grahame Erskine, James Tuite","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-01T22:04:28Z","title":"On total regularity of mixed graphs with order close to the Moore bound"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.00650","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:d7e1ff66d8bbd7432cd518a44166073f9777e55f3b1206c96f745b74405bf1d3","target":"record","created_at":"2026-05-18T00:01: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":"f658e3e9e1f95b82c6ea3c66f94786db376ddb551fecb26877777208cb5a3889","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-01T22:04:28Z","title_canon_sha256":"71f531a05b31e820ca7f80ec0a70d9860902a07c054461b800da8e1edd17d20a"},"schema_version":"1.0","source":{"id":"1811.00650","kind":"arxiv","version":1}},"canonical_sha256":"6982f30aa646ddff69439a1ed51b124c96c45ffdc06eb8ec3f83a120a68245d3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6982f30aa646ddff69439a1ed51b124c96c45ffdc06eb8ec3f83a120a68245d3","first_computed_at":"2026-05-18T00:01:42.590788Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:42.590788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"chd7upni5SbTub9UqvRpJwh7TJsnUfS9zKo5lheJEgA641oKs0I2QEoGooHPzA3HvoxCno7cuHAyxfsrTQRsBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:42.591212Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.00650","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d7e1ff66d8bbd7432cd518a44166073f9777e55f3b1206c96f745b74405bf1d3","sha256:4aed62bc220ead65e87374fde82f6daf9a9a194a18fcdf280a6284e1c1077af9"],"state_sha256":"14ec9993596d6aa39a42b9db2edc8a8f03b76a90a8094176197e0ba3b371ac0c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+MmnCTBuBNKqXmW5PKPMZTarsjhlQtne13+zOCKxKhWhFR4XVSF1K1KnOJNtC0g12jTK6Bq8NfzHEI3yRo/zCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T19:10:28.553207Z","bundle_sha256":"f051bda0589fce82205f58e6a646534c9e79ffa2636f7072b85b2ab3183910e5"}}