{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ZJL5QDIIK2QZUVK4RYG3DRQOV5","short_pith_number":"pith:ZJL5QDII","schema_version":"1.0","canonical_sha256":"ca57d80d0856a19a555c8e0db1c60eaf458266647f63190b5b2ea595068a53db","source":{"kind":"arxiv","id":"1406.6736","version":1},"attestation_state":"computed","paper":{"title":"Diameter critical graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Ma, Po-Shen Loh","submitted_at":"2014-06-25T23:54:57Z","abstract_excerpt":"A graph is called diameter-$k$-critical if its diameter is $k$, and the removal of any edge strictly increases the diameter. In this paper, we prove several results related to a conjecture often attributed to Murty and Simon, regarding the maximum number of edges that any diameter-$k$-critical graph can have. In particular, we disprove a longstanding conjecture of Caccetta and H\\\"aggkvist (that in every diameter-2-critical graph, the average edge-degree is at most the number of vertices), which promised to completely solve the extremal problem for diameter-2-critical graphs.\n  On the other han"},"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":"1406.6736","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-25T23:54:57Z","cross_cats_sorted":[],"title_canon_sha256":"0fb9d7cff5131f43d795c501f21ee1640369a29a6f3fb852707115dfdc76c1e2","abstract_canon_sha256":"76a6c4b80908c05729e5e95977fe3c5b93b4382fc24b0bbd6964e877f54fe307"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:56.013056Z","signature_b64":"gNY1GawyRCnruj3wg5sZKOb/hQZ+v+qD42GgNNYCa/GVRVbBpnZTv/cU69C1F5WRWq/dmgPGqFbf5IEt2XKqAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca57d80d0856a19a555c8e0db1c60eaf458266647f63190b5b2ea595068a53db","last_reissued_at":"2026-05-18T02:48:56.012503Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:56.012503Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Diameter critical graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Ma, Po-Shen Loh","submitted_at":"2014-06-25T23:54:57Z","abstract_excerpt":"A graph is called diameter-$k$-critical if its diameter is $k$, and the removal of any edge strictly increases the diameter. In this paper, we prove several results related to a conjecture often attributed to Murty and Simon, regarding the maximum number of edges that any diameter-$k$-critical graph can have. In particular, we disprove a longstanding conjecture of Caccetta and H\\\"aggkvist (that in every diameter-2-critical graph, the average edge-degree is at most the number of vertices), which promised to completely solve the extremal problem for diameter-2-critical graphs.\n  On the other han"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.6736","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":"1406.6736","created_at":"2026-05-18T02:48:56.012586+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.6736v1","created_at":"2026-05-18T02:48:56.012586+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.6736","created_at":"2026-05-18T02:48:56.012586+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZJL5QDIIK2QZ","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZJL5QDIIK2QZUVK4","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZJL5QDII","created_at":"2026-05-18T12:28:59.999130+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/ZJL5QDIIK2QZUVK4RYG3DRQOV5","json":"https://pith.science/pith/ZJL5QDIIK2QZUVK4RYG3DRQOV5.json","graph_json":"https://pith.science/api/pith-number/ZJL5QDIIK2QZUVK4RYG3DRQOV5/graph.json","events_json":"https://pith.science/api/pith-number/ZJL5QDIIK2QZUVK4RYG3DRQOV5/events.json","paper":"https://pith.science/paper/ZJL5QDII"},"agent_actions":{"view_html":"https://pith.science/pith/ZJL5QDIIK2QZUVK4RYG3DRQOV5","download_json":"https://pith.science/pith/ZJL5QDIIK2QZUVK4RYG3DRQOV5.json","view_paper":"https://pith.science/paper/ZJL5QDII","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.6736&json=true","fetch_graph":"https://pith.science/api/pith-number/ZJL5QDIIK2QZUVK4RYG3DRQOV5/graph.json","fetch_events":"https://pith.science/api/pith-number/ZJL5QDIIK2QZUVK4RYG3DRQOV5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZJL5QDIIK2QZUVK4RYG3DRQOV5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZJL5QDIIK2QZUVK4RYG3DRQOV5/action/storage_attestation","attest_author":"https://pith.science/pith/ZJL5QDIIK2QZUVK4RYG3DRQOV5/action/author_attestation","sign_citation":"https://pith.science/pith/ZJL5QDIIK2QZUVK4RYG3DRQOV5/action/citation_signature","submit_replication":"https://pith.science/pith/ZJL5QDIIK2QZUVK4RYG3DRQOV5/action/replication_record"}},"created_at":"2026-05-18T02:48:56.012586+00:00","updated_at":"2026-05-18T02:48:56.012586+00:00"}