{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:YYANDI3HOPKBDUXYVDT4TA7BY2","short_pith_number":"pith:YYANDI3H","canonical_record":{"source":{"id":"1610.00360","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-02T22:05:14Z","cross_cats_sorted":[],"title_canon_sha256":"62f99f28f4032e1d34bc2ec9ee988e33b0ca465e752abbc0151812d05d5be927","abstract_canon_sha256":"09559d29e930049ea3845a33d00060785abb5f8bb5c40222ff1bf5d9c9954ff1"},"schema_version":"1.0"},"canonical_sha256":"c600d1a36773d411d2f8a8e7c983e1c68da7e77d5a0a807eaf0c82f0bf482d7a","source":{"kind":"arxiv","id":"1610.00360","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.00360","created_at":"2026-05-18T01:02:51Z"},{"alias_kind":"arxiv_version","alias_value":"1610.00360v2","created_at":"2026-05-18T01:02:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.00360","created_at":"2026-05-18T01:02:51Z"},{"alias_kind":"pith_short_12","alias_value":"YYANDI3HOPKB","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YYANDI3HOPKBDUXY","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YYANDI3H","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:YYANDI3HOPKBDUXYVDT4TA7BY2","target":"record","payload":{"canonical_record":{"source":{"id":"1610.00360","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-02T22:05:14Z","cross_cats_sorted":[],"title_canon_sha256":"62f99f28f4032e1d34bc2ec9ee988e33b0ca465e752abbc0151812d05d5be927","abstract_canon_sha256":"09559d29e930049ea3845a33d00060785abb5f8bb5c40222ff1bf5d9c9954ff1"},"schema_version":"1.0"},"canonical_sha256":"c600d1a36773d411d2f8a8e7c983e1c68da7e77d5a0a807eaf0c82f0bf482d7a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:51.644246Z","signature_b64":"3qkqsKq0UcewkUgOR04GoAOg3LEgN//jK4gfVTk/D/qK2Yw5+Ex2vmrA+yltNj/skrKoZm3OXjxfrDhJvjmJDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c600d1a36773d411d2f8a8e7c983e1c68da7e77d5a0a807eaf0c82f0bf482d7a","last_reissued_at":"2026-05-18T01:02:51.643802Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:51.643802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.00360","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:02:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UyLZf1R9NZ0B7Be/oupMXBrLs1wZsRfcEf5q0mnSBnBD/GXreqGbkl5+e0On+3mK9sxE2wlG0ET2TJWkEzQDCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T18:13:37.068422Z"},"content_sha256":"86b5783a059134a13f3962507b48cf9208bc7ced141c9793d0c1e96042414136","schema_version":"1.0","event_id":"sha256:86b5783a059134a13f3962507b48cf9208bc7ced141c9793d0c1e96042414136"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:YYANDI3HOPKBDUXYVDT4TA7BY2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improving the Bounds On Murty_Simon Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Afrouz Jabalameli, Amin behjati, MohammadMahdi Shokri, Mohsen Ferdosi, Morteza Saghafian, Sorush Bahariyan","submitted_at":"2016-10-02T22:05:14Z","abstract_excerpt":"A graph is said to be diameter-$k$-critical if its diameter is $k$ and removal of any of its edges increases its diameter. A beautiful conjecture by Murty and Simon, says that every diameter-2-critical graph of order $n$ has at most $\\lfloor n^2/4\\rfloor$ edges and equality holds only for $K_{\\lceil n/2 \\rceil,\\lfloor n/2 \\rfloor }$. Haynes et al. proved that the conjecture is true for $\\Delta\\geq 0.7n$. They also proved that for $n>2000$, if $\\Delta \\geq 0.6789n$ then the conjecture is true. We will improve this bound by showing that the conjecture is true for every $n$ if $\\Delta\\geq\\ 0.676n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.00360","kind":"arxiv","version":2},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:02:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fDWhkFM0TcHWYVAqHkJhCtHi1btbnv31xsvR/jehLfH0t5kGf3k5pbzjstGUPUWNJ9CRvhE8jOIPddzAKOuyDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T18:13:37.068785Z"},"content_sha256":"711db60138326b0e66dd176ba7085d0f06ac0deae1c90458324480b1cdfdb038","schema_version":"1.0","event_id":"sha256:711db60138326b0e66dd176ba7085d0f06ac0deae1c90458324480b1cdfdb038"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YYANDI3HOPKBDUXYVDT4TA7BY2/bundle.json","state_url":"https://pith.science/pith/YYANDI3HOPKBDUXYVDT4TA7BY2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YYANDI3HOPKBDUXYVDT4TA7BY2/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-04T18:13:37Z","links":{"resolver":"https://pith.science/pith/YYANDI3HOPKBDUXYVDT4TA7BY2","bundle":"https://pith.science/pith/YYANDI3HOPKBDUXYVDT4TA7BY2/bundle.json","state":"https://pith.science/pith/YYANDI3HOPKBDUXYVDT4TA7BY2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YYANDI3HOPKBDUXYVDT4TA7BY2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YYANDI3HOPKBDUXYVDT4TA7BY2","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":"09559d29e930049ea3845a33d00060785abb5f8bb5c40222ff1bf5d9c9954ff1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-02T22:05:14Z","title_canon_sha256":"62f99f28f4032e1d34bc2ec9ee988e33b0ca465e752abbc0151812d05d5be927"},"schema_version":"1.0","source":{"id":"1610.00360","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.00360","created_at":"2026-05-18T01:02:51Z"},{"alias_kind":"arxiv_version","alias_value":"1610.00360v2","created_at":"2026-05-18T01:02:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.00360","created_at":"2026-05-18T01:02:51Z"},{"alias_kind":"pith_short_12","alias_value":"YYANDI3HOPKB","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YYANDI3HOPKBDUXY","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YYANDI3H","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:711db60138326b0e66dd176ba7085d0f06ac0deae1c90458324480b1cdfdb038","target":"graph","created_at":"2026-05-18T01:02:51Z","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 graph is said to be diameter-$k$-critical if its diameter is $k$ and removal of any of its edges increases its diameter. A beautiful conjecture by Murty and Simon, says that every diameter-2-critical graph of order $n$ has at most $\\lfloor n^2/4\\rfloor$ edges and equality holds only for $K_{\\lceil n/2 \\rceil,\\lfloor n/2 \\rfloor }$. Haynes et al. proved that the conjecture is true for $\\Delta\\geq 0.7n$. They also proved that for $n>2000$, if $\\Delta \\geq 0.6789n$ then the conjecture is true. We will improve this bound by showing that the conjecture is true for every $n$ if $\\Delta\\geq\\ 0.676n","authors_text":"Afrouz Jabalameli, Amin behjati, MohammadMahdi Shokri, Mohsen Ferdosi, Morteza Saghafian, Sorush Bahariyan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-02T22:05:14Z","title":"Improving the Bounds On Murty_Simon Conjecture"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.00360","kind":"arxiv","version":2},"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:86b5783a059134a13f3962507b48cf9208bc7ced141c9793d0c1e96042414136","target":"record","created_at":"2026-05-18T01:02:51Z","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":"09559d29e930049ea3845a33d00060785abb5f8bb5c40222ff1bf5d9c9954ff1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-02T22:05:14Z","title_canon_sha256":"62f99f28f4032e1d34bc2ec9ee988e33b0ca465e752abbc0151812d05d5be927"},"schema_version":"1.0","source":{"id":"1610.00360","kind":"arxiv","version":2}},"canonical_sha256":"c600d1a36773d411d2f8a8e7c983e1c68da7e77d5a0a807eaf0c82f0bf482d7a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c600d1a36773d411d2f8a8e7c983e1c68da7e77d5a0a807eaf0c82f0bf482d7a","first_computed_at":"2026-05-18T01:02:51.643802Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:51.643802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3qkqsKq0UcewkUgOR04GoAOg3LEgN//jK4gfVTk/D/qK2Yw5+Ex2vmrA+yltNj/skrKoZm3OXjxfrDhJvjmJDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:51.644246Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.00360","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:86b5783a059134a13f3962507b48cf9208bc7ced141c9793d0c1e96042414136","sha256:711db60138326b0e66dd176ba7085d0f06ac0deae1c90458324480b1cdfdb038"],"state_sha256":"3bbf65e60777e1c0280bf1bebb396926b4b7a94a0cb5145f9e88287908121d28"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Je//E6MsukMMvIiG745lGIzIk+tBd5Uyic+/Trt2Ryv57fVvd4iKAnQjQwuAqakjJml/AttOgrM99sftRiq8Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T18:13:37.070735Z","bundle_sha256":"26933b23eb3481fcc632c1e9a83b28e03554bf82f8bf53c53b9e141ea231ba9c"}}