{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:VIQER2PFZ372N5BIHXIAVYH7YE","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":"7c7bd1c166deb1a18779bee3777985c79f430c4a15a72f2ab2368c6fe166eba2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-12T07:27:23Z","title_canon_sha256":"cc97e24d85d72df51e9ec347c65324b39cf4084c65816d320ab39d539f7de4f5"},"schema_version":"1.0","source":{"id":"2605.11667","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.11667","created_at":"2026-06-09T02:08:43Z"},{"alias_kind":"arxiv_version","alias_value":"2605.11667v2","created_at":"2026-06-09T02:08:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.11667","created_at":"2026-06-09T02:08:43Z"},{"alias_kind":"pith_short_12","alias_value":"VIQER2PFZ372","created_at":"2026-06-09T02:08:43Z"},{"alias_kind":"pith_short_16","alias_value":"VIQER2PFZ372N5BI","created_at":"2026-06-09T02:08:43Z"},{"alias_kind":"pith_short_8","alias_value":"VIQER2PF","created_at":"2026-06-09T02:08:43Z"}],"graph_snapshots":[{"event_id":"sha256:78d15b22f91c3269fea1ab77081c591c117123e0b40969fe399795198347f716","target":"graph","created_at":"2026-06-09T02:08:43Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"In this paper, we improve the upper bound of f(4) to 18."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The proof relies on the existence of a specific orientation construction that achieves diameter 18 for arbitrary bridgeless diameter-4 graphs; if the case analysis or reduction steps in the full proof contain an uncovered configuration, the bound fails."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"The oriented diameter function satisfies f(4) ≤ 18, improving the prior upper bound of 21."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Every bridgeless graph with diameter 4 admits a strong orientation whose diameter is at most 18."}],"snapshot_sha256":"28069256f68656cc8377e7fb4932a7ea9791d0def986aba474f3b25f476818c0"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-21T00:01:32.372051Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-20T14:07:13.565330Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-20T03:42:00.549097Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T11:40:12.294538Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.11667/integrity.json","findings":[],"snapshot_sha256":"5bd2b1cd68e44bb960105db05ea4c79b06b7c7fa7730e1575ba44086bf2b13f9","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $f(d)$ be the smallest value for which every bridgeless graph $G$ with diameter $d$ admits a strong orientation $\\overrightarrow{G}$ such that the diameter of $\\overrightarrow{G}$ is at most $f(d)$. Chv\\'atal and Thomassen (JCTB, 1978) established general bounds for $f(d)$, and also proved that $f(2)=6$ and $f(4)\\geq 12$. The works of both Kwok, Liu and West (JCTB, 2010) and Wang and Chen (JCTB, 2022) together determined $f(3)=9$. In this paper, we improve the best known upper bound for $f(4)$ from $21$ (Babu et al., DAM, 2021) to \\textbf{$18$}.","authors_text":"Jifu Lin, Lihua You, Xiaolin Wang","cross_cats":[],"headline":"Every bridgeless graph with diameter 4 admits a strong orientation whose diameter is at most 18.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-12T07:27:23Z","title":"An improved upper bound on the oriented diameter of graphs with diameter $4$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.11667","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-13T01:02:55.682612Z","id":"a47325b5-1d86-44f7-b2f8-fe47eeae0e3d","model_set":{"reader":"grok-4.3"},"one_line_summary":"The oriented diameter function satisfies f(4) ≤ 18, improving the prior upper bound of 21.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Every bridgeless graph with diameter 4 admits a strong orientation whose diameter is at most 18.","strongest_claim":"In this paper, we improve the upper bound of f(4) to 18.","weakest_assumption":"The proof relies on the existence of a specific orientation construction that achieves diameter 18 for arbitrary bridgeless diameter-4 graphs; if the case analysis or reduction steps in the full proof contain an uncovered configuration, the bound fails."}},"verdict_id":"a47325b5-1d86-44f7-b2f8-fe47eeae0e3d"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d1c48ab304638113efdd66772666a9b3703aa824704e80491c2004fe9872e073","target":"record","created_at":"2026-06-09T02:08:43Z","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":"7c7bd1c166deb1a18779bee3777985c79f430c4a15a72f2ab2368c6fe166eba2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-12T07:27:23Z","title_canon_sha256":"cc97e24d85d72df51e9ec347c65324b39cf4084c65816d320ab39d539f7de4f5"},"schema_version":"1.0","source":{"id":"2605.11667","kind":"arxiv","version":2}},"canonical_sha256":"aa2048e9e5ceffa6f4283dd00ae0ffc11fb141663836c9f65ec678498ed8913c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aa2048e9e5ceffa6f4283dd00ae0ffc11fb141663836c9f65ec678498ed8913c","first_computed_at":"2026-06-09T02:08:43.774146Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-09T02:08:43.774146Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QZbE8fhzIyu+4Q6Px9XddCIIgvIMrbDRjum8omQcm/72JDjgvl4Iu4nx0J2Jl7GI1CzuR8X7pQCc2DOTKM61Dw==","signature_status":"signed_v1","signed_at":"2026-06-09T02:08:43.775075Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.11667","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d1c48ab304638113efdd66772666a9b3703aa824704e80491c2004fe9872e073","sha256:78d15b22f91c3269fea1ab77081c591c117123e0b40969fe399795198347f716"],"state_sha256":"437ca8d157bf8d5f0a52bba4358aab1912406dbea4ac70f0fd3fbd621c466d84"}