{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:SM7AMPC5IFLGJRTLABKATUVZHR","short_pith_number":"pith:SM7AMPC5","schema_version":"1.0","canonical_sha256":"933e063c5d415664c66b005409d2b93c4b61ba15456d9dbba36aad020ef290d5","source":{"kind":"arxiv","id":"1504.00513","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1504.00513","created_at":"2026-05-18T01:02:13.993646+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.00513v2","created_at":"2026-05-18T01:02:13.993646+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.00513","created_at":"2026-05-18T01:02:13.993646+00:00"},{"alias_kind":"pith_short_12","alias_value":"SM7AMPC5IFLG","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"SM7AMPC5IFLGJRTL","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"SM7AMPC5","created_at":"2026-05-18T12:29:42.218222+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/SM7AMPC5IFLGJRTLABKATUVZHR","json":"https://pith.science/pith/SM7AMPC5IFLGJRTLABKATUVZHR.json","graph_json":"https://pith.science/api/pith-number/SM7AMPC5IFLGJRTLABKATUVZHR/graph.json","events_json":"https://pith.science/api/pith-number/SM7AMPC5IFLGJRTLABKATUVZHR/events.json","paper":"https://pith.science/paper/SM7AMPC5"},"agent_actions":{"view_html":"https://pith.science/pith/SM7AMPC5IFLGJRTLABKATUVZHR","download_json":"https://pith.science/pith/SM7AMPC5IFLGJRTLABKATUVZHR.json","view_paper":"https://pith.science/paper/SM7AMPC5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.00513&json=true","fetch_graph":"https://pith.science/api/pith-number/SM7AMPC5IFLGJRTLABKATUVZHR/graph.json","fetch_events":"https://pith.science/api/pith-number/SM7AMPC5IFLGJRTLABKATUVZHR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SM7AMPC5IFLGJRTLABKATUVZHR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SM7AMPC5IFLGJRTLABKATUVZHR/action/storage_attestation","attest_author":"https://pith.science/pith/SM7AMPC5IFLGJRTLABKATUVZHR/action/author_attestation","sign_citation":"https://pith.science/pith/SM7AMPC5IFLGJRTLABKATUVZHR/action/citation_signature","submit_replication":"https://pith.science/pith/SM7AMPC5IFLGJRTLABKATUVZHR/action/replication_record"}},"created_at":"2026-05-18T01:02:13.993646+00:00","updated_at":"2026-05-18T01:02:13.993646+00:00"}