{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:SM7AMPC5IFLGJRTLABKATUVZHR","short_pith_number":"pith:SM7AMPC5","canonical_record":{"source":{"id":"1504.00513","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-04-02T11:36:56Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"c7dd8696bb2998bad7e7bdfe0822bf828c7955a2fd1309cd1297a72d6bde2049","abstract_canon_sha256":"67c1f9e24c82ef881e47fa0a0293363b7765b5287879ec8698fea99e99edab2c"},"schema_version":"1.0"},"canonical_sha256":"933e063c5d415664c66b005409d2b93c4b61ba15456d9dbba36aad020ef290d5","source":{"kind":"arxiv","id":"1504.00513","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.00513","created_at":"2026-05-18T01:02:13Z"},{"alias_kind":"arxiv_version","alias_value":"1504.00513v2","created_at":"2026-05-18T01:02:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.00513","created_at":"2026-05-18T01:02:13Z"},{"alias_kind":"pith_short_12","alias_value":"SM7AMPC5IFLG","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"SM7AMPC5IFLGJRTL","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"SM7AMPC5","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:SM7AMPC5IFLGJRTLABKATUVZHR","target":"record","payload":{"canonical_record":{"source":{"id":"1504.00513","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-04-02T11:36:56Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"c7dd8696bb2998bad7e7bdfe0822bf828c7955a2fd1309cd1297a72d6bde2049","abstract_canon_sha256":"67c1f9e24c82ef881e47fa0a0293363b7765b5287879ec8698fea99e99edab2c"},"schema_version":"1.0"},"canonical_sha256":"933e063c5d415664c66b005409d2b93c4b61ba15456d9dbba36aad020ef290d5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:13.994266Z","signature_b64":"s6LPppA00N9AOZYFgkTprf67evQ35gpaihLD9OBRgfbP4ET3VndJ70lSSDzJt3eRW03fUPV4PTW82L3rszkgCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"933e063c5d415664c66b005409d2b93c4b61ba15456d9dbba36aad020ef290d5","last_reissued_at":"2026-05-18T01:02:13.993538Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:13.993538Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.00513","source_version":2,"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-18T01:02:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UUsVRO3ZGBN9cV4DexMusGRnPuTiKYLcr7FZovikHCWyF0I7uXaGrJv8ob+vJSVnSxptSxvJ1Oa0oE99HwNFDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T07:31:47.335804Z"},"content_sha256":"aed652c491b0eb17ea2f57234047ccac87c375c7ecf94f068058212cf901fe3b","schema_version":"1.0","event_id":"sha256:aed652c491b0eb17ea2f57234047ccac87c375c7ecf94f068058212cf901fe3b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:SM7AMPC5IFLGJRTLABKATUVZHR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Minimum Wiener Connector","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.SI","authors_text":"David Garcia-Soriano, Francesco Bonchi, Francesco Gullo, Natali Ruchansky, Nicolas Kourtellis","submitted_at":"2015-04-02T11:36:56Z","abstract_excerpt":"The Wiener index of a graph is the sum of all pairwise shortest-path distances between its vertices. In this paper we study the novel problem of finding a minimum Wiener connector: given a connected graph $G=(V,E)$ and a set $Q\\subseteq V$ of query vertices, find a subgraph of $G$ that connects all query vertices and has minimum Wiener index.\n  We show that The Minimum Wiener Connector admits a polynomial-time (albeit impractical) exact algorithm for the special case where the number of query vertices is bounded. We show that in general the problem is NP-hard, and has no PTAS unless $\\mathbf{P"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.00513","kind":"arxiv","version":2},"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-18T01:02:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CIoXdinxe+yXENRTATRFGRfO7JGbGLrZaN0yemF8hHCcuTA9EkfSBDJAlqjesShnhYYy8r1Yic4IyIhfBUdrDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T07:31:47.336144Z"},"content_sha256":"e1b83e37e130814e49239c169831357eb51dcc54e4fce9b7c4e6adbaeaa7e5c2","schema_version":"1.0","event_id":"sha256:e1b83e37e130814e49239c169831357eb51dcc54e4fce9b7c4e6adbaeaa7e5c2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SM7AMPC5IFLGJRTLABKATUVZHR/bundle.json","state_url":"https://pith.science/pith/SM7AMPC5IFLGJRTLABKATUVZHR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SM7AMPC5IFLGJRTLABKATUVZHR/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-22T07:31:47Z","links":{"resolver":"https://pith.science/pith/SM7AMPC5IFLGJRTLABKATUVZHR","bundle":"https://pith.science/pith/SM7AMPC5IFLGJRTLABKATUVZHR/bundle.json","state":"https://pith.science/pith/SM7AMPC5IFLGJRTLABKATUVZHR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SM7AMPC5IFLGJRTLABKATUVZHR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:SM7AMPC5IFLGJRTLABKATUVZHR","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":"67c1f9e24c82ef881e47fa0a0293363b7765b5287879ec8698fea99e99edab2c","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-04-02T11:36:56Z","title_canon_sha256":"c7dd8696bb2998bad7e7bdfe0822bf828c7955a2fd1309cd1297a72d6bde2049"},"schema_version":"1.0","source":{"id":"1504.00513","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.00513","created_at":"2026-05-18T01:02:13Z"},{"alias_kind":"arxiv_version","alias_value":"1504.00513v2","created_at":"2026-05-18T01:02:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.00513","created_at":"2026-05-18T01:02:13Z"},{"alias_kind":"pith_short_12","alias_value":"SM7AMPC5IFLG","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"SM7AMPC5IFLGJRTL","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"SM7AMPC5","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:e1b83e37e130814e49239c169831357eb51dcc54e4fce9b7c4e6adbaeaa7e5c2","target":"graph","created_at":"2026-05-18T01:02:13Z","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 graph is the sum of all pairwise shortest-path distances between its vertices. In this paper we study the novel problem of finding a minimum Wiener connector: given a connected graph $G=(V,E)$ and a set $Q\\subseteq V$ of query vertices, find a subgraph of $G$ that connects all query vertices and has minimum Wiener index.\n  We show that The Minimum Wiener Connector admits a polynomial-time (albeit impractical) exact algorithm for the special case where the number of query vertices is bounded. We show that in general the problem is NP-hard, and has no PTAS unless $\\mathbf{P","authors_text":"David Garcia-Soriano, Francesco Bonchi, Francesco Gullo, Natali Ruchansky, Nicolas Kourtellis","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-04-02T11:36:56Z","title":"The Minimum Wiener Connector"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.00513","kind":"arxiv","version":2},"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:aed652c491b0eb17ea2f57234047ccac87c375c7ecf94f068058212cf901fe3b","target":"record","created_at":"2026-05-18T01:02:13Z","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":"67c1f9e24c82ef881e47fa0a0293363b7765b5287879ec8698fea99e99edab2c","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-04-02T11:36:56Z","title_canon_sha256":"c7dd8696bb2998bad7e7bdfe0822bf828c7955a2fd1309cd1297a72d6bde2049"},"schema_version":"1.0","source":{"id":"1504.00513","kind":"arxiv","version":2}},"canonical_sha256":"933e063c5d415664c66b005409d2b93c4b61ba15456d9dbba36aad020ef290d5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"933e063c5d415664c66b005409d2b93c4b61ba15456d9dbba36aad020ef290d5","first_computed_at":"2026-05-18T01:02:13.993538Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:13.993538Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s6LPppA00N9AOZYFgkTprf67evQ35gpaihLD9OBRgfbP4ET3VndJ70lSSDzJt3eRW03fUPV4PTW82L3rszkgCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:13.994266Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.00513","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aed652c491b0eb17ea2f57234047ccac87c375c7ecf94f068058212cf901fe3b","sha256:e1b83e37e130814e49239c169831357eb51dcc54e4fce9b7c4e6adbaeaa7e5c2"],"state_sha256":"87a6deed57d4f49fc62ad8ea2de67362dd1e91bc4bbcb3043adfe61f46c72025"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ucrehXaLwsdUbzQL6uR7WHsXtVON8SbUxEQsjmDbO4v7aQPaipkJLKVt2w6w1b9QCGCNZknalWEtavGAQAToBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T07:31:47.338083Z","bundle_sha256":"22fda03d1b6c3052689f0ae70068ae3079e5ab490d75a0f8004911841c1ed53c"}}