{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:4FM3C3OO74TD2JCE4HFD4F25AN","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":"6d0271290ad91aa69d54259263f53c79f31a9b8a6aa6a208c0b725b7ead56215","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-05-07T15:06:31Z","title_canon_sha256":"30c50c5d42280a9e8622207ad64b6860b9cab7908956793d3275fce5b424d5a2"},"schema_version":"1.0","source":{"id":"1905.02633","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.02633","created_at":"2026-05-17T23:46:50Z"},{"alias_kind":"arxiv_version","alias_value":"1905.02633v1","created_at":"2026-05-17T23:46:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.02633","created_at":"2026-05-17T23:46:50Z"},{"alias_kind":"pith_short_12","alias_value":"4FM3C3OO74TD","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4FM3C3OO74TD2JCE","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4FM3C3OO","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:dc46c738c4684ef56fdd39245c0ed518971adda71ffdbb6db422d38c9374e941","target":"graph","created_at":"2026-05-17T23:46:50Z","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":"The Wiener index (the distance) of a connected graph is the sum of distances between all pairs of vertices. In this paper, we study the maximum possible value of this invariant among graphs on $n$ vertices with fixed number of blocks $p$. It is known that among graphs on $n$ vertices that have just one block, the $n$-cycle has the largest Wiener index. And the $n$-path, which has $n-1$ blocks, has the maximum Wiener index in the class of graphs on $n$ vertices. We show that among all graphs on $n$ vertices which have $p\\ge 2$ blocks, the maximum Wiener index is attained by a graph composed of ","authors_text":"Fran\\c{c}ois Dross, Katar\\'ina Hri\\v{n}\\'akov\\'a, Martin Knor, Riste \\v{S}krekovski, St\\'ephane Bessy","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-05-07T15:06:31Z","title":"The structure of graphs with given number of blocks and the maximum Wiener index"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.02633","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:5144c43aa704a82f53800ed3f293a3b127fc4390a5cedbf26bb0b9abfe3c2093","target":"record","created_at":"2026-05-17T23:46:50Z","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":"6d0271290ad91aa69d54259263f53c79f31a9b8a6aa6a208c0b725b7ead56215","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-05-07T15:06:31Z","title_canon_sha256":"30c50c5d42280a9e8622207ad64b6860b9cab7908956793d3275fce5b424d5a2"},"schema_version":"1.0","source":{"id":"1905.02633","kind":"arxiv","version":1}},"canonical_sha256":"e159b16dceff263d2444e1ca3e175d034c20d5d1c056ceff2121faf00b261c58","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e159b16dceff263d2444e1ca3e175d034c20d5d1c056ceff2121faf00b261c58","first_computed_at":"2026-05-17T23:46:50.866841Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:50.866841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HkNoBOm1cqqfysZCCKjxn8V6/whL1eoV3SQMapDcRnIr6cs2HSrGhGlYUvWaCC63ZTPNzVqfrTNOwGj1UhuwDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:50.867250Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.02633","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5144c43aa704a82f53800ed3f293a3b127fc4390a5cedbf26bb0b9abfe3c2093","sha256:dc46c738c4684ef56fdd39245c0ed518971adda71ffdbb6db422d38c9374e941"],"state_sha256":"b1e01cc2c1419c7f900e2f1cfb5e1c6101df2be1d266c163b14433c269950a99"}