{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ZBFSIR4LJL5VVYQA6UF73GIJU2","short_pith_number":"pith:ZBFSIR4L","canonical_record":{"source":{"id":"1811.02664","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-06T21:29:48Z","cross_cats_sorted":[],"title_canon_sha256":"0f8b67db77ef420b6656fae9148d4c8f13784bb49383c6b203dbc7f4f09fa8e5","abstract_canon_sha256":"3e6958e203d32b61a9e66a6257b31e8bd122963bc508edecfc2ddea65e9270cd"},"schema_version":"1.0"},"canonical_sha256":"c84b24478b4afb5ae200f50bfd9909a6809976962f40b9834d3ea64eac209b1e","source":{"kind":"arxiv","id":"1811.02664","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.02664","created_at":"2026-05-18T00:01:21Z"},{"alias_kind":"arxiv_version","alias_value":"1811.02664v1","created_at":"2026-05-18T00:01:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02664","created_at":"2026-05-18T00:01:21Z"},{"alias_kind":"pith_short_12","alias_value":"ZBFSIR4LJL5V","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"ZBFSIR4LJL5VVYQA","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"ZBFSIR4L","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ZBFSIR4LJL5VVYQA6UF73GIJU2","target":"record","payload":{"canonical_record":{"source":{"id":"1811.02664","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-06T21:29:48Z","cross_cats_sorted":[],"title_canon_sha256":"0f8b67db77ef420b6656fae9148d4c8f13784bb49383c6b203dbc7f4f09fa8e5","abstract_canon_sha256":"3e6958e203d32b61a9e66a6257b31e8bd122963bc508edecfc2ddea65e9270cd"},"schema_version":"1.0"},"canonical_sha256":"c84b24478b4afb5ae200f50bfd9909a6809976962f40b9834d3ea64eac209b1e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:21.084482Z","signature_b64":"r83T78vh/aFqXzuLEctF3KzP9TwOktNWjfdyeMlZfSl6En5JTBKWShqAFPYsKjLaVowinO/R9pUaUMf/1Ud+Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c84b24478b4afb5ae200f50bfd9909a6809976962f40b9834d3ea64eac209b1e","last_reissued_at":"2026-05-18T00:01:21.083911Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:21.083911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.02664","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-18T00:01:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7SHY26/3i6x8098AO1sAAGKp33b7zA3D+c5T2aVj/ROpB2rLgUHX5oBoY8EneXTFr5WwxVWF9x1STXh7+JoRDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T05:28:48.709788Z"},"content_sha256":"fdb63e148e9586f7b17cc02166f81c0b1ff39bb1b182a678b8f420e9ce28d67c","schema_version":"1.0","event_id":"sha256:fdb63e148e9586f7b17cc02166f81c0b1ff39bb1b182a678b8f420e9ce28d67c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ZBFSIR4LJL5VVYQA6UF73GIJU2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An upper bound on the Wiener Index of a k-connected graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Karen L. Collins, Zhongyuan Che","submitted_at":"2018-11-06T21:29:48Z","abstract_excerpt":"The Wiener index of a connected graph is the summation of all distances between unordered pairs of vertices of the graph. In this paper, we give an upper bound on the Wiener index of a $k$-connected graph $G$ of order $n$ for integers $n-1>k \\ge 1$:\n  \\[W(G) \\le \\frac{1}{4} n \\lfloor \\frac{n+k-2}{k} \\rfloor (2n+k-2-k\\lfloor \\frac{n+k-2}{k} \\rfloor).\\] Moreover, we show that this upper bound is sharp when $k \\ge 2$ is even, and can be obtained by the Wiener index of Harary graph $H_{k,n}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02664","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"},"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-18T00:01:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uay+gAakS52EMXvxcrDcK6DI/p5OLJkxWfHvBnlMepT0W+lRHdG6JzFCTTv4PLBhKmzwvel0NYTzJm72+vxgAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T05:28:48.710387Z"},"content_sha256":"1b3b207528c6f951bae012ac9e9d48619b169a8c42a363a9d3bc12a4fe531bd5","schema_version":"1.0","event_id":"sha256:1b3b207528c6f951bae012ac9e9d48619b169a8c42a363a9d3bc12a4fe531bd5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZBFSIR4LJL5VVYQA6UF73GIJU2/bundle.json","state_url":"https://pith.science/pith/ZBFSIR4LJL5VVYQA6UF73GIJU2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZBFSIR4LJL5VVYQA6UF73GIJU2/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-07-01T05:28:48Z","links":{"resolver":"https://pith.science/pith/ZBFSIR4LJL5VVYQA6UF73GIJU2","bundle":"https://pith.science/pith/ZBFSIR4LJL5VVYQA6UF73GIJU2/bundle.json","state":"https://pith.science/pith/ZBFSIR4LJL5VVYQA6UF73GIJU2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZBFSIR4LJL5VVYQA6UF73GIJU2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ZBFSIR4LJL5VVYQA6UF73GIJU2","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":"3e6958e203d32b61a9e66a6257b31e8bd122963bc508edecfc2ddea65e9270cd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-06T21:29:48Z","title_canon_sha256":"0f8b67db77ef420b6656fae9148d4c8f13784bb49383c6b203dbc7f4f09fa8e5"},"schema_version":"1.0","source":{"id":"1811.02664","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.02664","created_at":"2026-05-18T00:01:21Z"},{"alias_kind":"arxiv_version","alias_value":"1811.02664v1","created_at":"2026-05-18T00:01:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02664","created_at":"2026-05-18T00:01:21Z"},{"alias_kind":"pith_short_12","alias_value":"ZBFSIR4LJL5V","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"ZBFSIR4LJL5VVYQA","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"ZBFSIR4L","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:1b3b207528c6f951bae012ac9e9d48619b169a8c42a363a9d3bc12a4fe531bd5","target":"graph","created_at":"2026-05-18T00:01:21Z","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 of a connected graph is the summation of all distances between unordered pairs of vertices of the graph. In this paper, we give an upper bound on the Wiener index of a $k$-connected graph $G$ of order $n$ for integers $n-1>k \\ge 1$:\n  \\[W(G) \\le \\frac{1}{4} n \\lfloor \\frac{n+k-2}{k} \\rfloor (2n+k-2-k\\lfloor \\frac{n+k-2}{k} \\rfloor).\\] Moreover, we show that this upper bound is sharp when $k \\ge 2$ is even, and can be obtained by the Wiener index of Harary graph $H_{k,n}$.","authors_text":"Karen L. Collins, Zhongyuan Che","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-06T21:29:48Z","title":"An upper bound on the Wiener Index of a k-connected graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02664","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:fdb63e148e9586f7b17cc02166f81c0b1ff39bb1b182a678b8f420e9ce28d67c","target":"record","created_at":"2026-05-18T00:01:21Z","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":"3e6958e203d32b61a9e66a6257b31e8bd122963bc508edecfc2ddea65e9270cd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-06T21:29:48Z","title_canon_sha256":"0f8b67db77ef420b6656fae9148d4c8f13784bb49383c6b203dbc7f4f09fa8e5"},"schema_version":"1.0","source":{"id":"1811.02664","kind":"arxiv","version":1}},"canonical_sha256":"c84b24478b4afb5ae200f50bfd9909a6809976962f40b9834d3ea64eac209b1e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c84b24478b4afb5ae200f50bfd9909a6809976962f40b9834d3ea64eac209b1e","first_computed_at":"2026-05-18T00:01:21.083911Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:21.083911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r83T78vh/aFqXzuLEctF3KzP9TwOktNWjfdyeMlZfSl6En5JTBKWShqAFPYsKjLaVowinO/R9pUaUMf/1Ud+Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:21.084482Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.02664","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fdb63e148e9586f7b17cc02166f81c0b1ff39bb1b182a678b8f420e9ce28d67c","sha256:1b3b207528c6f951bae012ac9e9d48619b169a8c42a363a9d3bc12a4fe531bd5"],"state_sha256":"aa6741449cb5dba08ae1beefd893e88a995ec1c24d5ac65b47bf73604df00602"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ia+GO2/yfj6/FnEZD6ZIDHd20MSdysqIDhq3IfUShpr7S2sV70vAjALn5yTjUnT3xIPx0HWP7rxoZxh97UhIAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T05:28:48.713654Z","bundle_sha256":"38330c22883ac490b1d2044daf645caff3e3ac10784303f0f3af0d61674300ac"}}