{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:TW4OQRQMOCX77ZWJFFTCLYCI74","short_pith_number":"pith:TW4OQRQM","schema_version":"1.0","canonical_sha256":"9db8e8460c70afffe6c9296625e048ff22e05dd3a11ce83a3a027a961646fa88","source":{"kind":"arxiv","id":"1905.04291","version":1},"attestation_state":"computed","paper":{"title":"Graphs with the second and third maximum Wiener index over the 2-vertex connected graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Fran\\c{c}ois Dross, Martin Knor, Riste \\v{S}krekovski, St\\'ephane Bessy","submitted_at":"2019-05-07T14:56:21Z","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1905.04291","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-05-07T14:56:21Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"e3906956cf1576ca05b9c136ee623d74076607dcee43000eb9656a5fd6bf73b0","abstract_canon_sha256":"492555befb9370464539682a9fcc3a07849ca5836fbd1cb68daf489c3ef956ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:25.413165Z","signature_b64":"h53h8BjABKfsZRb5ERy4cT9emY680rj0aEmznOu0IqG50lukx4Wq7RHNxPeXEE65Nq9zdO1yO61oO+wn0USKDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9db8e8460c70afffe6c9296625e048ff22e05dd3a11ce83a3a027a961646fa88","last_reissued_at":"2026-05-17T23:46:25.412549Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:25.412549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graphs with the second and third maximum Wiener index over the 2-vertex connected graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Fran\\c{c}ois Dross, Martin Knor, Riste \\v{S}krekovski, St\\'ephane Bessy","submitted_at":"2019-05-07T14:56:21Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.04291","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":""},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1905.04291","created_at":"2026-05-17T23:46:25.412644+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.04291v1","created_at":"2026-05-17T23:46:25.412644+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.04291","created_at":"2026-05-17T23:46:25.412644+00:00"},{"alias_kind":"pith_short_12","alias_value":"TW4OQRQMOCX7","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"TW4OQRQMOCX77ZWJ","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"TW4OQRQM","created_at":"2026-05-18T12:33:30.264802+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TW4OQRQMOCX77ZWJFFTCLYCI74","json":"https://pith.science/pith/TW4OQRQMOCX77ZWJFFTCLYCI74.json","graph_json":"https://pith.science/api/pith-number/TW4OQRQMOCX77ZWJFFTCLYCI74/graph.json","events_json":"https://pith.science/api/pith-number/TW4OQRQMOCX77ZWJFFTCLYCI74/events.json","paper":"https://pith.science/paper/TW4OQRQM"},"agent_actions":{"view_html":"https://pith.science/pith/TW4OQRQMOCX77ZWJFFTCLYCI74","download_json":"https://pith.science/pith/TW4OQRQMOCX77ZWJFFTCLYCI74.json","view_paper":"https://pith.science/paper/TW4OQRQM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.04291&json=true","fetch_graph":"https://pith.science/api/pith-number/TW4OQRQMOCX77ZWJFFTCLYCI74/graph.json","fetch_events":"https://pith.science/api/pith-number/TW4OQRQMOCX77ZWJFFTCLYCI74/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TW4OQRQMOCX77ZWJFFTCLYCI74/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TW4OQRQMOCX77ZWJFFTCLYCI74/action/storage_attestation","attest_author":"https://pith.science/pith/TW4OQRQMOCX77ZWJFFTCLYCI74/action/author_attestation","sign_citation":"https://pith.science/pith/TW4OQRQMOCX77ZWJFFTCLYCI74/action/citation_signature","submit_replication":"https://pith.science/pith/TW4OQRQMOCX77ZWJFFTCLYCI74/action/replication_record"}},"created_at":"2026-05-17T23:46:25.412644+00:00","updated_at":"2026-05-17T23:46:25.412644+00:00"}