{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:BD4XEFW77SRRPEG6JRQII7HECY","short_pith_number":"pith:BD4XEFW7","schema_version":"1.0","canonical_sha256":"08f97216dffca31790de4c60847ce41605fdea0371b5306b68db10950c93d596","source":{"kind":"arxiv","id":"1610.00116","version":3},"attestation_state":"computed","paper":{"title":"An improved Moore bound for mixed graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"C. Dalf\\'o, M.A. Fiol, N. L\\'opez","submitted_at":"2016-10-01T10:46:53Z","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1610.00116","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-01T10:46:53Z","cross_cats_sorted":[],"title_canon_sha256":"775209903315fe339f7a2b7d5b157552bf7372c0c8fbe06535c2f8765ca739f2","abstract_canon_sha256":"728b6da6ed4f49ea9d6691fa0e01a6360e0199f6f573c3636264e9e11f0aaeee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:35.728033Z","signature_b64":"nG0tm4BA/GICzggPHqoCl5tg2Tv1O44qtf2Ps4PwDRjGwOMftv00AbSFlN6aASR0IXrn7DGbQyqCp3yNH69BAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08f97216dffca31790de4c60847ce41605fdea0371b5306b68db10950c93d596","last_reissued_at":"2026-05-18T00:17:35.727342Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:35.727342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An improved Moore bound for mixed graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"C. Dalf\\'o, M.A. Fiol, N. L\\'opez","submitted_at":"2016-10-01T10:46:53Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.00116","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1610.00116","created_at":"2026-05-18T00:17:35.727447+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.00116v3","created_at":"2026-05-18T00:17:35.727447+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.00116","created_at":"2026-05-18T00:17:35.727447+00:00"},{"alias_kind":"pith_short_12","alias_value":"BD4XEFW77SRR","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"BD4XEFW77SRRPEG6","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"BD4XEFW7","created_at":"2026-05-18T12:30:07.202191+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BD4XEFW77SRRPEG6JRQII7HECY","json":"https://pith.science/pith/BD4XEFW77SRRPEG6JRQII7HECY.json","graph_json":"https://pith.science/api/pith-number/BD4XEFW77SRRPEG6JRQII7HECY/graph.json","events_json":"https://pith.science/api/pith-number/BD4XEFW77SRRPEG6JRQII7HECY/events.json","paper":"https://pith.science/paper/BD4XEFW7"},"agent_actions":{"view_html":"https://pith.science/pith/BD4XEFW77SRRPEG6JRQII7HECY","download_json":"https://pith.science/pith/BD4XEFW77SRRPEG6JRQII7HECY.json","view_paper":"https://pith.science/paper/BD4XEFW7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.00116&json=true","fetch_graph":"https://pith.science/api/pith-number/BD4XEFW77SRRPEG6JRQII7HECY/graph.json","fetch_events":"https://pith.science/api/pith-number/BD4XEFW77SRRPEG6JRQII7HECY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BD4XEFW77SRRPEG6JRQII7HECY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BD4XEFW77SRRPEG6JRQII7HECY/action/storage_attestation","attest_author":"https://pith.science/pith/BD4XEFW77SRRPEG6JRQII7HECY/action/author_attestation","sign_citation":"https://pith.science/pith/BD4XEFW77SRRPEG6JRQII7HECY/action/citation_signature","submit_replication":"https://pith.science/pith/BD4XEFW77SRRPEG6JRQII7HECY/action/replication_record"}},"created_at":"2026-05-18T00:17:35.727447+00:00","updated_at":"2026-05-18T00:17:35.727447+00:00"}