{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:TW4OQRQMOCX77ZWJFFTCLYCI74","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":"492555befb9370464539682a9fcc3a07849ca5836fbd1cb68daf489c3ef956ee","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-05-07T14:56:21Z","title_canon_sha256":"e3906956cf1576ca05b9c136ee623d74076607dcee43000eb9656a5fd6bf73b0"},"schema_version":"1.0","source":{"id":"1905.04291","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.04291","created_at":"2026-05-17T23:46:25Z"},{"alias_kind":"arxiv_version","alias_value":"1905.04291v1","created_at":"2026-05-17T23:46:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.04291","created_at":"2026-05-17T23:46:25Z"},{"alias_kind":"pith_short_12","alias_value":"TW4OQRQMOCX7","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"TW4OQRQMOCX77ZWJ","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"TW4OQRQM","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:4cf74af3257e7de1d7f3f4d7435b252b7487d322e4fdd726373223ecbcbfbb8b","target":"graph","created_at":"2026-05-17T23:46:25Z","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":"Wiener index, defined as the sum of distances between all unordered pairs of vertices, is one of the most popular molecular descriptors. It is well known that among 2-vertex connected graphs on $n\\ge 3$ vertices, the cycle $C_n$ attains the maximum value of Wiener index. We show that the second maximum graph is obtained from $C_n$ by introducing a new edge that connects two vertices at distance two on the cycle if $n\\ne 6$. If $n\\ge 11$, the third maximum graph is obtained from a $4$-cycle by connecting opposite vertices by a path of length $n-3$. We completely describe also the situation for ","authors_text":"Fran\\c{c}ois Dross, 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-07T14:56:21Z","title":"Graphs with the second and third maximum Wiener index over the 2-vertex connected graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.04291","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:330d3a95ce5118859c077faf1c0f606ca4fa6d98e90a87f8a6da9fc2f752cf41","target":"record","created_at":"2026-05-17T23:46:25Z","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":"492555befb9370464539682a9fcc3a07849ca5836fbd1cb68daf489c3ef956ee","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-05-07T14:56:21Z","title_canon_sha256":"e3906956cf1576ca05b9c136ee623d74076607dcee43000eb9656a5fd6bf73b0"},"schema_version":"1.0","source":{"id":"1905.04291","kind":"arxiv","version":1}},"canonical_sha256":"9db8e8460c70afffe6c9296625e048ff22e05dd3a11ce83a3a027a961646fa88","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9db8e8460c70afffe6c9296625e048ff22e05dd3a11ce83a3a027a961646fa88","first_computed_at":"2026-05-17T23:46:25.412549Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:25.412549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h53h8BjABKfsZRb5ERy4cT9emY680rj0aEmznOu0IqG50lukx4Wq7RHNxPeXEE65Nq9zdO1yO61oO+wn0USKDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:25.413165Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.04291","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:330d3a95ce5118859c077faf1c0f606ca4fa6d98e90a87f8a6da9fc2f752cf41","sha256:4cf74af3257e7de1d7f3f4d7435b252b7487d322e4fdd726373223ecbcbfbb8b"],"state_sha256":"87b1a4b0a0adb62fbf6df7aaf0e0f7d90733f2a61e2e7b61658c33a3c160143a"}