{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:VREQ7HBGKAS4E5UJRGDTD6KNOO","short_pith_number":"pith:VREQ7HBG","canonical_record":{"source":{"id":"2605.24855","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-24T04:22:24Z","cross_cats_sorted":[],"title_canon_sha256":"d8f74041ff1ec458ac4338692e3048e6fccb499948534168dce2c9e5c2cd79f4","abstract_canon_sha256":"019b84960617b83af11cecd8982d2b5e38ab9589d3496c2d8407bdd1d32dba31"},"schema_version":"1.0"},"canonical_sha256":"ac490f9c265025c27689898731f94d738146dbe5d822131db88af78ce434d6c2","source":{"kind":"arxiv","id":"2605.24855","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.24855","created_at":"2026-05-26T01:04:01Z"},{"alias_kind":"arxiv_version","alias_value":"2605.24855v1","created_at":"2026-05-26T01:04:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.24855","created_at":"2026-05-26T01:04:01Z"},{"alias_kind":"pith_short_12","alias_value":"VREQ7HBGKAS4","created_at":"2026-05-26T01:04:01Z"},{"alias_kind":"pith_short_16","alias_value":"VREQ7HBGKAS4E5UJ","created_at":"2026-05-26T01:04:01Z"},{"alias_kind":"pith_short_8","alias_value":"VREQ7HBG","created_at":"2026-05-26T01:04:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:VREQ7HBGKAS4E5UJRGDTD6KNOO","target":"record","payload":{"canonical_record":{"source":{"id":"2605.24855","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-24T04:22:24Z","cross_cats_sorted":[],"title_canon_sha256":"d8f74041ff1ec458ac4338692e3048e6fccb499948534168dce2c9e5c2cd79f4","abstract_canon_sha256":"019b84960617b83af11cecd8982d2b5e38ab9589d3496c2d8407bdd1d32dba31"},"schema_version":"1.0"},"canonical_sha256":"ac490f9c265025c27689898731f94d738146dbe5d822131db88af78ce434d6c2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T01:04:01.873958Z","signature_b64":"ha2u9rWKZQiUOTBeE/adY0dj/8lZ2ooEzoNMi7lDc33Oq2R8e1+0ISLtqtiIPuT6/qohn0nvK/xKCuDW3PggAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac490f9c265025c27689898731f94d738146dbe5d822131db88af78ce434d6c2","last_reissued_at":"2026-05-26T01:04:01.873131Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T01:04:01.873131Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.24855","source_version":1,"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-26T01:04:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qm7DGjY8jnOOuiITMNbD6GJrhTC8DikWk3yGFb/FlhJpb6sBxZWMFLOfuOXt1dKDPJ/J4eVYfdFaDvwC5H/4Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T17:39:32.441232Z"},"content_sha256":"a2da90500836d2f7e0238cce709032d9fece472ef5f378c7301a31893cf68a3e","schema_version":"1.0","event_id":"sha256:a2da90500836d2f7e0238cce709032d9fece472ef5f378c7301a31893cf68a3e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:VREQ7HBGKAS4E5UJRGDTD6KNOO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On a conjecture of DeLaVi\\~na and Waller","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dinesh Pandey, Peruvemba Sundaram Ravi","submitted_at":"2026-05-24T04:22:24Z","abstract_excerpt":"The Wiener index of a connected graph is defined as the sum of distances between all its unordered pairs of vertices. Characterising graphs on $n$ vertices with a fixed diameter that maximise the Wiener index is a long-standing open problem. This problem has been resolved fully for trees on $n$ vertices with diameter $d \\in \\{1,2,3,4,n-3,n-2,n-1\\}$ while partial results are available for $d=5$ and $6$. In this context, a conjecture proposed by DeLaVi\\~na and Waller has remained open for the last 18 years.\n  In this paper, we establish a necessary condition for a tree to attain the maximum Wien"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.24855","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.24855/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-26T01:04:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uXq8vSOCTc/2FdZ3nZwks/M6hzCPy9chlbEIJWkC06J03AXyhYqX92DvNVgUoaVWXCIkFcc/UIaVo9HNyn8PAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T17:39:32.441616Z"},"content_sha256":"8c0662462ea42e116d5125b91eabf4706132b56d27ec73a8a0953fe67aa0192a","schema_version":"1.0","event_id":"sha256:8c0662462ea42e116d5125b91eabf4706132b56d27ec73a8a0953fe67aa0192a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VREQ7HBGKAS4E5UJRGDTD6KNOO/bundle.json","state_url":"https://pith.science/pith/VREQ7HBGKAS4E5UJRGDTD6KNOO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VREQ7HBGKAS4E5UJRGDTD6KNOO/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-22T17:39:32Z","links":{"resolver":"https://pith.science/pith/VREQ7HBGKAS4E5UJRGDTD6KNOO","bundle":"https://pith.science/pith/VREQ7HBGKAS4E5UJRGDTD6KNOO/bundle.json","state":"https://pith.science/pith/VREQ7HBGKAS4E5UJRGDTD6KNOO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VREQ7HBGKAS4E5UJRGDTD6KNOO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:VREQ7HBGKAS4E5UJRGDTD6KNOO","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":"019b84960617b83af11cecd8982d2b5e38ab9589d3496c2d8407bdd1d32dba31","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-24T04:22:24Z","title_canon_sha256":"d8f74041ff1ec458ac4338692e3048e6fccb499948534168dce2c9e5c2cd79f4"},"schema_version":"1.0","source":{"id":"2605.24855","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.24855","created_at":"2026-05-26T01:04:01Z"},{"alias_kind":"arxiv_version","alias_value":"2605.24855v1","created_at":"2026-05-26T01:04:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.24855","created_at":"2026-05-26T01:04:01Z"},{"alias_kind":"pith_short_12","alias_value":"VREQ7HBGKAS4","created_at":"2026-05-26T01:04:01Z"},{"alias_kind":"pith_short_16","alias_value":"VREQ7HBGKAS4E5UJ","created_at":"2026-05-26T01:04:01Z"},{"alias_kind":"pith_short_8","alias_value":"VREQ7HBG","created_at":"2026-05-26T01:04:01Z"}],"graph_snapshots":[{"event_id":"sha256:8c0662462ea42e116d5125b91eabf4706132b56d27ec73a8a0953fe67aa0192a","target":"graph","created_at":"2026-05-26T01:04:01Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2605.24855/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Wiener index of a connected graph is defined as the sum of distances between all its unordered pairs of vertices. Characterising graphs on $n$ vertices with a fixed diameter that maximise the Wiener index is a long-standing open problem. This problem has been resolved fully for trees on $n$ vertices with diameter $d \\in \\{1,2,3,4,n-3,n-2,n-1\\}$ while partial results are available for $d=5$ and $6$. In this context, a conjecture proposed by DeLaVi\\~na and Waller has remained open for the last 18 years.\n  In this paper, we establish a necessary condition for a tree to attain the maximum Wien","authors_text":"Dinesh Pandey, Peruvemba Sundaram Ravi","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-24T04:22:24Z","title":"On a conjecture of DeLaVi\\~na and Waller"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.24855","kind":"arxiv","version":1},"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:a2da90500836d2f7e0238cce709032d9fece472ef5f378c7301a31893cf68a3e","target":"record","created_at":"2026-05-26T01:04:01Z","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":"019b84960617b83af11cecd8982d2b5e38ab9589d3496c2d8407bdd1d32dba31","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-24T04:22:24Z","title_canon_sha256":"d8f74041ff1ec458ac4338692e3048e6fccb499948534168dce2c9e5c2cd79f4"},"schema_version":"1.0","source":{"id":"2605.24855","kind":"arxiv","version":1}},"canonical_sha256":"ac490f9c265025c27689898731f94d738146dbe5d822131db88af78ce434d6c2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ac490f9c265025c27689898731f94d738146dbe5d822131db88af78ce434d6c2","first_computed_at":"2026-05-26T01:04:01.873131Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-26T01:04:01.873131Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ha2u9rWKZQiUOTBeE/adY0dj/8lZ2ooEzoNMi7lDc33Oq2R8e1+0ISLtqtiIPuT6/qohn0nvK/xKCuDW3PggAQ==","signature_status":"signed_v1","signed_at":"2026-05-26T01:04:01.873958Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.24855","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a2da90500836d2f7e0238cce709032d9fece472ef5f378c7301a31893cf68a3e","sha256:8c0662462ea42e116d5125b91eabf4706132b56d27ec73a8a0953fe67aa0192a"],"state_sha256":"585ec9d3330af6044a2fdd3b1b5c5d3b4f49eb0a0b7e156e7d0faddd6a5a7fd0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wRLK2VZge5AKSF6kvXgWx4UpqTXYDCidxE33jieoVTT/hjC5Ooa1p1Xv2Pnf6T8gXBTm97jo3gMXybejL+0GAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T17:39:32.443670Z","bundle_sha256":"2b17f7ce0c1f43f95a8584010d748b23808c775a9f783ed05da8dc76b2b2a377"}}