{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ACQZM4DRAXR5S5667ALERRST2W","short_pith_number":"pith:ACQZM4DR","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"},"canonical_sha256":"00a196707105e3d977def81648c653d5a84ef0bc323bffceed31b36c7b3a086f","source":{"kind":"arxiv","id":"1409.5308","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.5308","created_at":"2026-05-18T02:32:21Z"},{"alias_kind":"arxiv_version","alias_value":"1409.5308v2","created_at":"2026-05-18T02:32:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.5308","created_at":"2026-05-18T02:32:21Z"},{"alias_kind":"pith_short_12","alias_value":"ACQZM4DRAXR5","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"ACQZM4DRAXR5S566","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"ACQZM4DR","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ACQZM4DRAXR5S5667ALERRST2W","target":"record","payload":{"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"},"canonical_sha256":"00a196707105e3d977def81648c653d5a84ef0bc323bffceed31b36c7b3a086f","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"},"source_kind":"arxiv","source_id":"1409.5308","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-18T02:32:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PusKFr5wUFFeNV3VcPAm7BFPKFLAEvQPnXAUrgAuOJoqjaIXrzTZwx1rP4MvbdskvT3q2cezDbqDPEHAmExqAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:37:49.306166Z"},"content_sha256":"be6383df74dfc78fe23bc40004abc19406ee908c652dc2feca16c4f07c13e726","schema_version":"1.0","event_id":"sha256:be6383df74dfc78fe23bc40004abc19406ee908c652dc2feca16c4f07c13e726"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ACQZM4DRAXR5S5667ALERRST2W","target":"graph","payload":{"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"},"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-18T02:32:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x7AkRlHoTxI1OBdQNf+IPUe4qfvWw03tMR7pRrTrF/XNyfcpvgcs57+Gdvx9TnmkFJuSgTa7g1x4UmZKcBXDDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:37:49.306766Z"},"content_sha256":"03808d0f6683f0ad18335e7a570ab15ea5ea9623d99013743edb7d06787f170c","schema_version":"1.0","event_id":"sha256:03808d0f6683f0ad18335e7a570ab15ea5ea9623d99013743edb7d06787f170c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ACQZM4DRAXR5S5667ALERRST2W/bundle.json","state_url":"https://pith.science/pith/ACQZM4DRAXR5S5667ALERRST2W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ACQZM4DRAXR5S5667ALERRST2W/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-05-26T14:37:49Z","links":{"resolver":"https://pith.science/pith/ACQZM4DRAXR5S5667ALERRST2W","bundle":"https://pith.science/pith/ACQZM4DRAXR5S5667ALERRST2W/bundle.json","state":"https://pith.science/pith/ACQZM4DRAXR5S5667ALERRST2W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ACQZM4DRAXR5S5667ALERRST2W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ACQZM4DRAXR5S5667ALERRST2W","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":"df2b07612ac908184bf616c92488f7ca7bcc8fa20da4b9d09469ecdc74daa984","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-18T14:15:45Z","title_canon_sha256":"aee67b1add459cbe301ca5b66e7bbd72ab650731d9f487309dc86b6d26c8c122"},"schema_version":"1.0","source":{"id":"1409.5308","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.5308","created_at":"2026-05-18T02:32:21Z"},{"alias_kind":"arxiv_version","alias_value":"1409.5308v2","created_at":"2026-05-18T02:32:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.5308","created_at":"2026-05-18T02:32:21Z"},{"alias_kind":"pith_short_12","alias_value":"ACQZM4DRAXR5","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"ACQZM4DRAXR5S566","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"ACQZM4DR","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:03808d0f6683f0ad18335e7a570ab15ea5ea9623d99013743edb7d06787f170c","target":"graph","created_at":"2026-05-18T02:32: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":"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 ","authors_text":"Gunnar W. Klau, Mohammed El-Kebir","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-18T14:15:45Z","title":"Solving the Maximum-Weight Connected Subgraph Problem to Optimality"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.5308","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:be6383df74dfc78fe23bc40004abc19406ee908c652dc2feca16c4f07c13e726","target":"record","created_at":"2026-05-18T02:32: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":"df2b07612ac908184bf616c92488f7ca7bcc8fa20da4b9d09469ecdc74daa984","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-18T14:15:45Z","title_canon_sha256":"aee67b1add459cbe301ca5b66e7bbd72ab650731d9f487309dc86b6d26c8c122"},"schema_version":"1.0","source":{"id":"1409.5308","kind":"arxiv","version":2}},"canonical_sha256":"00a196707105e3d977def81648c653d5a84ef0bc323bffceed31b36c7b3a086f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"00a196707105e3d977def81648c653d5a84ef0bc323bffceed31b36c7b3a086f","first_computed_at":"2026-05-18T02:32:21.799152Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:32:21.799152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"up6W4JMOFItTJ/BdLB0V9Lr7MMeQLFSsoniyOAb7IWutrTL0JWfWk8NzZ0DODKm6YzV5eLiGlCuYWPPJyOcLAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:32:21.799607Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.5308","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be6383df74dfc78fe23bc40004abc19406ee908c652dc2feca16c4f07c13e726","sha256:03808d0f6683f0ad18335e7a570ab15ea5ea9623d99013743edb7d06787f170c"],"state_sha256":"64f5ac88ca45d8ae8c477d007aade7769de2b25f7542ae940fd1c3ffb7daf912"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"otn/6CQ5kbSpMAIVXxNkYxAun9RSsh5DA6qTIo55eCYk3ded/Vvql9I8i2sSd32UlhF6XDpHaL984u3emla4Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T14:37:49.309209Z","bundle_sha256":"85a9eae77272f5cbb61c9a41a8be8ebc75652a83e444fd3bdb31945f7e66df0d"}}