{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:MCDUVGTX2AHXFS53QVGW7P2OL4","short_pith_number":"pith:MCDUVGTX","schema_version":"1.0","canonical_sha256":"60874a9a77d00f72cbbb854d6fbf4e5f2d0bd1fddc53c6f772a1be523a824f3e","source":{"kind":"arxiv","id":"1811.05314","version":1},"attestation_state":"computed","paper":{"title":"The largest graphs with given order and diameter: A simple proof","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Pu Qiao, Xingzhi Zhan","submitted_at":"2018-11-10T01:56:49Z","abstract_excerpt":"A consequence of Ore's classic theorem characterizing the maximal graphs with given order and diameter is a determination of the largest such graphs. We give a very short and simple proof of this smaller result, based on a well-known elementary observation."},"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":"1811.05314","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-10T01:56:49Z","cross_cats_sorted":[],"title_canon_sha256":"2ab30ceafd90bf17f16e9d60c4dcbffdf0d3a15fa7c77e50c2c2e5e9c5815915","abstract_canon_sha256":"e03f2ee1e92cc780db70f4c101cd1153d2b00859e7e36982d9ff235a8111e752"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:46.361894Z","signature_b64":"D6kQqNWLOPhcy16dwGyziixFHk0YY9NLddVAu1iiIKHpRb613O5qlPjZtvpYdA9ISYlaG/fMbOdVqsnF3sipAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60874a9a77d00f72cbbb854d6fbf4e5f2d0bd1fddc53c6f772a1be523a824f3e","last_reissued_at":"2026-05-18T00:00:46.361434Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:46.361434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The largest graphs with given order and diameter: A simple proof","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Pu Qiao, Xingzhi Zhan","submitted_at":"2018-11-10T01:56:49Z","abstract_excerpt":"A consequence of Ore's classic theorem characterizing the maximal graphs with given order and diameter is a determination of the largest such graphs. We give a very short and simple proof of this smaller result, based on a well-known elementary observation."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.05314","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1811.05314","created_at":"2026-05-18T00:00:46.361523+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.05314v1","created_at":"2026-05-18T00:00:46.361523+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.05314","created_at":"2026-05-18T00:00:46.361523+00:00"},{"alias_kind":"pith_short_12","alias_value":"MCDUVGTX2AHX","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"MCDUVGTX2AHXFS53","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"MCDUVGTX","created_at":"2026-05-18T12:32:37.024351+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/MCDUVGTX2AHXFS53QVGW7P2OL4","json":"https://pith.science/pith/MCDUVGTX2AHXFS53QVGW7P2OL4.json","graph_json":"https://pith.science/api/pith-number/MCDUVGTX2AHXFS53QVGW7P2OL4/graph.json","events_json":"https://pith.science/api/pith-number/MCDUVGTX2AHXFS53QVGW7P2OL4/events.json","paper":"https://pith.science/paper/MCDUVGTX"},"agent_actions":{"view_html":"https://pith.science/pith/MCDUVGTX2AHXFS53QVGW7P2OL4","download_json":"https://pith.science/pith/MCDUVGTX2AHXFS53QVGW7P2OL4.json","view_paper":"https://pith.science/paper/MCDUVGTX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.05314&json=true","fetch_graph":"https://pith.science/api/pith-number/MCDUVGTX2AHXFS53QVGW7P2OL4/graph.json","fetch_events":"https://pith.science/api/pith-number/MCDUVGTX2AHXFS53QVGW7P2OL4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MCDUVGTX2AHXFS53QVGW7P2OL4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MCDUVGTX2AHXFS53QVGW7P2OL4/action/storage_attestation","attest_author":"https://pith.science/pith/MCDUVGTX2AHXFS53QVGW7P2OL4/action/author_attestation","sign_citation":"https://pith.science/pith/MCDUVGTX2AHXFS53QVGW7P2OL4/action/citation_signature","submit_replication":"https://pith.science/pith/MCDUVGTX2AHXFS53QVGW7P2OL4/action/replication_record"}},"created_at":"2026-05-18T00:00:46.361523+00:00","updated_at":"2026-05-18T00:00:46.361523+00:00"}