{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YHPWOC2ZNVBRO7JH5DC2HA63DP","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":"bc1697aecad6a277b24f70b451315b0c88c566c8f6afcc41d49cdae1bf028d0f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-18T09:28:14Z","title_canon_sha256":"93c350668655fecb8b6513ce9ae7df5236f082937ac3eed6a496c326ad849768"},"schema_version":"1.0","source":{"id":"1712.06308","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.06308","created_at":"2026-05-18T00:27:50Z"},{"alias_kind":"arxiv_version","alias_value":"1712.06308v1","created_at":"2026-05-18T00:27:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.06308","created_at":"2026-05-18T00:27:50Z"},{"alias_kind":"pith_short_12","alias_value":"YHPWOC2ZNVBR","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YHPWOC2ZNVBRO7JH","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YHPWOC2Z","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:67ec8400f4dda9cbe802eb0c84a3f88df95c7d8eb3cb641ac1a7418b7b20ff8b","target":"graph","created_at":"2026-05-18T00:27:50Z","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 largest possible number of vertices in a graph having given diameter and given maximum degree. There has been much recent interest in the problem for mixed graphs, where we allow both undirected edges and directed arcs in the graph. For a diameter 2 graph with maximum undirected degree $r$ and directed out-degree $z$, a straightforward counting argument yields an upper bound $M(z,r,2)=(z+r)^2+z+1$ for the order of the graph. Apart from the case $r=1$, the only three known examples of mixed graphs attaining this bound are Cayley graphs, and there ar","authors_text":"Grahame Erskine","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-18T09:28:14Z","title":"Mixed Moore Cayley graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.06308","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:cb98a808d7811c8014029f0263ecbcee4fc1a9ba3ec457b3002b490b6459b69d","target":"record","created_at":"2026-05-18T00:27:50Z","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":"bc1697aecad6a277b24f70b451315b0c88c566c8f6afcc41d49cdae1bf028d0f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-18T09:28:14Z","title_canon_sha256":"93c350668655fecb8b6513ce9ae7df5236f082937ac3eed6a496c326ad849768"},"schema_version":"1.0","source":{"id":"1712.06308","kind":"arxiv","version":1}},"canonical_sha256":"c1df670b596d43177d27e8c5a383db1bc97254275600ea4c43dfa1f15fd171ce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c1df670b596d43177d27e8c5a383db1bc97254275600ea4c43dfa1f15fd171ce","first_computed_at":"2026-05-18T00:27:50.681552Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:50.681552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bwuN58lThW7ScQ4ZWu/Wp8H8MjYcfsvsGETTAGPiJygaflpVvsL7KQ+H+R7hWj0uLIK2YwoaM6M4wb06PtksDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:50.682087Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.06308","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cb98a808d7811c8014029f0263ecbcee4fc1a9ba3ec457b3002b490b6459b69d","sha256:67ec8400f4dda9cbe802eb0c84a3f88df95c7d8eb3cb641ac1a7418b7b20ff8b"],"state_sha256":"eb2d074bbb6fab54e34eb9c6464ef72b944bfe5577a9431d2e25b5bc03560638"}