{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ACQZM4DRAXR5S5667ALERRST2W","short_pith_number":"pith:ACQZM4DR","schema_version":"1.0","canonical_sha256":"00a196707105e3d977def81648c653d5a84ef0bc323bffceed31b36c7b3a086f","source":{"kind":"arxiv","id":"1409.5308","version":2},"attestation_state":"computed","paper":{"title":"Solving the Maximum-Weight Connected Subgraph Problem to Optimality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gunnar W. Klau, Mohammed El-Kebir","submitted_at":"2014-09-18T14:15:45Z","abstract_excerpt":"Given an undirected node-weighted graph, the Maximum-Weight Connected Subgraph problem (MWCS) is to identify a subset of nodes of maximalsum of weights that induce a connected subgraph. MWCS is closely related to the well-studied Prize Collecting Steiner Tree problem and has many applications in different areas, including computational biology, network design and computer vision. The problem is NP-hard and even hard to approximate within a constant factor. In this work we describe an algorithmic scheme for solving MWCS to provable optimality, which is based on preprocessing rules, new results "},"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":"1409.5308","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-18T14:15:45Z","cross_cats_sorted":[],"title_canon_sha256":"aee67b1add459cbe301ca5b66e7bbd72ab650731d9f487309dc86b6d26c8c122","abstract_canon_sha256":"df2b07612ac908184bf616c92488f7ca7bcc8fa20da4b9d09469ecdc74daa984"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:21.799607Z","signature_b64":"up6W4JMOFItTJ/BdLB0V9Lr7MMeQLFSsoniyOAb7IWutrTL0JWfWk8NzZ0DODKm6YzV5eLiGlCuYWPPJyOcLAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00a196707105e3d977def81648c653d5a84ef0bc323bffceed31b36c7b3a086f","last_reissued_at":"2026-05-18T02:32:21.799152Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:21.799152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving the Maximum-Weight Connected Subgraph Problem to Optimality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gunnar W. Klau, Mohammed El-Kebir","submitted_at":"2014-09-18T14:15:45Z","abstract_excerpt":"Given an undirected node-weighted graph, the Maximum-Weight Connected Subgraph problem (MWCS) is to identify a subset of nodes of maximalsum of weights that induce a connected subgraph. MWCS is closely related to the well-studied Prize Collecting Steiner Tree problem and has many applications in different areas, including computational biology, network design and computer vision. The problem is NP-hard and even hard to approximate within a constant factor. In this work we describe an algorithmic scheme for solving MWCS to provable optimality, which is based on preprocessing rules, new results "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.5308","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":"1409.5308","created_at":"2026-05-18T02:32:21.799228+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.5308v2","created_at":"2026-05-18T02:32:21.799228+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.5308","created_at":"2026-05-18T02:32:21.799228+00:00"},{"alias_kind":"pith_short_12","alias_value":"ACQZM4DRAXR5","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"ACQZM4DRAXR5S566","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"ACQZM4DR","created_at":"2026-05-18T12:28:19.803747+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/ACQZM4DRAXR5S5667ALERRST2W","json":"https://pith.science/pith/ACQZM4DRAXR5S5667ALERRST2W.json","graph_json":"https://pith.science/api/pith-number/ACQZM4DRAXR5S5667ALERRST2W/graph.json","events_json":"https://pith.science/api/pith-number/ACQZM4DRAXR5S5667ALERRST2W/events.json","paper":"https://pith.science/paper/ACQZM4DR"},"agent_actions":{"view_html":"https://pith.science/pith/ACQZM4DRAXR5S5667ALERRST2W","download_json":"https://pith.science/pith/ACQZM4DRAXR5S5667ALERRST2W.json","view_paper":"https://pith.science/paper/ACQZM4DR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.5308&json=true","fetch_graph":"https://pith.science/api/pith-number/ACQZM4DRAXR5S5667ALERRST2W/graph.json","fetch_events":"https://pith.science/api/pith-number/ACQZM4DRAXR5S5667ALERRST2W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ACQZM4DRAXR5S5667ALERRST2W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ACQZM4DRAXR5S5667ALERRST2W/action/storage_attestation","attest_author":"https://pith.science/pith/ACQZM4DRAXR5S5667ALERRST2W/action/author_attestation","sign_citation":"https://pith.science/pith/ACQZM4DRAXR5S5667ALERRST2W/action/citation_signature","submit_replication":"https://pith.science/pith/ACQZM4DRAXR5S5667ALERRST2W/action/replication_record"}},"created_at":"2026-05-18T02:32:21.799228+00:00","updated_at":"2026-05-18T02:32:21.799228+00:00"}