{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:BD4XEFW77SRRPEG6JRQII7HECY","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":"728b6da6ed4f49ea9d6691fa0e01a6360e0199f6f573c3636264e9e11f0aaeee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-01T10:46:53Z","title_canon_sha256":"775209903315fe339f7a2b7d5b157552bf7372c0c8fbe06535c2f8765ca739f2"},"schema_version":"1.0","source":{"id":"1610.00116","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.00116","created_at":"2026-05-18T00:17:35Z"},{"alias_kind":"arxiv_version","alias_value":"1610.00116v3","created_at":"2026-05-18T00:17:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.00116","created_at":"2026-05-18T00:17:35Z"},{"alias_kind":"pith_short_12","alias_value":"BD4XEFW77SRR","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BD4XEFW77SRRPEG6","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BD4XEFW7","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:879bd38d3fb92c36ea589ff28f3ee7fb9e72674fa0ff5f68213dc314475ab29c","target":"graph","created_at":"2026-05-18T00:17:35Z","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":"A mixed graph $G$ can contain both (undirected) edges and arcs (directed edges). Here we derive an improved Moore-like bound for the maximum number of vertices of a mixed graph with diameter at least three. Moreover, a complete enumeration of all optimal $(1,1)$-regular mixed graphs with diameter three is presented, so proving that, in general, the proposed bound cannot be improved.","authors_text":"C. Dalf\\'o, M.A. Fiol, N. L\\'opez","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-01T10:46:53Z","title":"An improved Moore bound for mixed graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.00116","kind":"arxiv","version":3},"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:318ff7ab459eb9efc24154f36116b87136e795883328d3df15ed0e35674f3bef","target":"record","created_at":"2026-05-18T00:17:35Z","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":"728b6da6ed4f49ea9d6691fa0e01a6360e0199f6f573c3636264e9e11f0aaeee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-01T10:46:53Z","title_canon_sha256":"775209903315fe339f7a2b7d5b157552bf7372c0c8fbe06535c2f8765ca739f2"},"schema_version":"1.0","source":{"id":"1610.00116","kind":"arxiv","version":3}},"canonical_sha256":"08f97216dffca31790de4c60847ce41605fdea0371b5306b68db10950c93d596","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"08f97216dffca31790de4c60847ce41605fdea0371b5306b68db10950c93d596","first_computed_at":"2026-05-18T00:17:35.727342Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:35.727342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nG0tm4BA/GICzggPHqoCl5tg2Tv1O44qtf2Ps4PwDRjGwOMftv00AbSFlN6aASR0IXrn7DGbQyqCp3yNH69BAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:35.728033Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.00116","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:318ff7ab459eb9efc24154f36116b87136e795883328d3df15ed0e35674f3bef","sha256:879bd38d3fb92c36ea589ff28f3ee7fb9e72674fa0ff5f68213dc314475ab29c"],"state_sha256":"619dcf7af22aabfeda649bc40cd7440d0acb2486a0a8771c76820ac38007afe7"}