{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FBHLFZRNGMEA5ZO2UGXRTZFXS3","short_pith_number":"pith:FBHLFZRN","canonical_record":{"source":{"id":"1801.07456","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-01-23T09:52:58Z","cross_cats_sorted":[],"title_canon_sha256":"d6d487b052c34b06706f05e000170205024d15557aeefa5f4372ce050616df85","abstract_canon_sha256":"3dd7247f1ba869dd89af02439e60f6dfb166b083a53e033047753f313eed835a"},"schema_version":"1.0"},"canonical_sha256":"284eb2e62d33080ee5daa1af19e4b796dc0c3617d61995d7b4901dff5ca661f3","source":{"kind":"arxiv","id":"1801.07456","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.07456","created_at":"2026-05-18T00:23:44Z"},{"alias_kind":"arxiv_version","alias_value":"1801.07456v3","created_at":"2026-05-18T00:23:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07456","created_at":"2026-05-18T00:23:44Z"},{"alias_kind":"pith_short_12","alias_value":"FBHLFZRNGMEA","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FBHLFZRNGMEA5ZO2","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FBHLFZRN","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FBHLFZRNGMEA5ZO2UGXRTZFXS3","target":"record","payload":{"canonical_record":{"source":{"id":"1801.07456","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-01-23T09:52:58Z","cross_cats_sorted":[],"title_canon_sha256":"d6d487b052c34b06706f05e000170205024d15557aeefa5f4372ce050616df85","abstract_canon_sha256":"3dd7247f1ba869dd89af02439e60f6dfb166b083a53e033047753f313eed835a"},"schema_version":"1.0"},"canonical_sha256":"284eb2e62d33080ee5daa1af19e4b796dc0c3617d61995d7b4901dff5ca661f3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:44.838809Z","signature_b64":"ylErWrv3KV1xy6c/MgeCoMAqUnAyLXsGOXWFIgWxl+qMZ8MGmJQH+BPWp2ZyOtNy2foslOXZzDJ8ZmKILClRCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"284eb2e62d33080ee5daa1af19e4b796dc0c3617d61995d7b4901dff5ca661f3","last_reissued_at":"2026-05-18T00:23:44.838298Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:44.838298Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.07456","source_version":3,"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:23:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jDoSdj9f2gkANEK88iC/p1q45Ykd7nnMMfyq46XlXdeiSEdDqlwH9y144RveXLicDL/VHYWjmLF+MMI2whUSBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T18:41:39.834586Z"},"content_sha256":"dc540604c39f69f6210accd12b9f5c52cfe8ab506d11f4ce0b356f0037db2d9f","schema_version":"1.0","event_id":"sha256:dc540604c39f69f6210accd12b9f5c52cfe8ab506d11f4ce0b356f0037db2d9f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FBHLFZRNGMEA5ZO2UGXRTZFXS3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Heuristic algorithms for the Maximum Colorful Subtree problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kai D\\\"uhrkop, Marie Anne Lataretu, Sebastian B\\\"ocker, W. Timothy J. White","submitted_at":"2018-01-23T09:52:58Z","abstract_excerpt":"In metabolomics, small molecules are structurally elucidated using tandem mass spectrometry (MS/MS); this resulted in the computational Maximum Colorful Subtree problem, which is NP-hard. Unfortunately, data from a single metabolite requires us to solve hundreds or thousands of instances of this problem; and in a single Liquid Chromatography MS/MS run, hundreds or thousands of metabolites are measured.\n  Here, we comprehensively evaluate the performance of several heuristic algorithms for the problem against an exact algorithm. We put particular emphasis on whether a heuristic is able to rank "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07456","kind":"arxiv","version":3},"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:23:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wpoeJbF1ntEqceZc3faa22OmLWoII9lTZLgoNEC2dt60UXD/nkzm1pnuKx3LVxCRTA0jtkv4XmSbQuf0giNGCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T18:41:39.835301Z"},"content_sha256":"5a25d1a0eccbf6bb710774384001d7247c25ea406c10da7aa7a11b53f04aa4dd","schema_version":"1.0","event_id":"sha256:5a25d1a0eccbf6bb710774384001d7247c25ea406c10da7aa7a11b53f04aa4dd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FBHLFZRNGMEA5ZO2UGXRTZFXS3/bundle.json","state_url":"https://pith.science/pith/FBHLFZRNGMEA5ZO2UGXRTZFXS3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FBHLFZRNGMEA5ZO2UGXRTZFXS3/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-08T18:41:39Z","links":{"resolver":"https://pith.science/pith/FBHLFZRNGMEA5ZO2UGXRTZFXS3","bundle":"https://pith.science/pith/FBHLFZRNGMEA5ZO2UGXRTZFXS3/bundle.json","state":"https://pith.science/pith/FBHLFZRNGMEA5ZO2UGXRTZFXS3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FBHLFZRNGMEA5ZO2UGXRTZFXS3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FBHLFZRNGMEA5ZO2UGXRTZFXS3","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":"3dd7247f1ba869dd89af02439e60f6dfb166b083a53e033047753f313eed835a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-01-23T09:52:58Z","title_canon_sha256":"d6d487b052c34b06706f05e000170205024d15557aeefa5f4372ce050616df85"},"schema_version":"1.0","source":{"id":"1801.07456","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.07456","created_at":"2026-05-18T00:23:44Z"},{"alias_kind":"arxiv_version","alias_value":"1801.07456v3","created_at":"2026-05-18T00:23:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07456","created_at":"2026-05-18T00:23:44Z"},{"alias_kind":"pith_short_12","alias_value":"FBHLFZRNGMEA","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FBHLFZRNGMEA5ZO2","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FBHLFZRN","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:5a25d1a0eccbf6bb710774384001d7247c25ea406c10da7aa7a11b53f04aa4dd","target":"graph","created_at":"2026-05-18T00:23:44Z","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":"In metabolomics, small molecules are structurally elucidated using tandem mass spectrometry (MS/MS); this resulted in the computational Maximum Colorful Subtree problem, which is NP-hard. Unfortunately, data from a single metabolite requires us to solve hundreds or thousands of instances of this problem; and in a single Liquid Chromatography MS/MS run, hundreds or thousands of metabolites are measured.\n  Here, we comprehensively evaluate the performance of several heuristic algorithms for the problem against an exact algorithm. We put particular emphasis on whether a heuristic is able to rank ","authors_text":"Kai D\\\"uhrkop, Marie Anne Lataretu, Sebastian B\\\"ocker, W. Timothy J. White","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-01-23T09:52:58Z","title":"Heuristic algorithms for the Maximum Colorful Subtree problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07456","kind":"arxiv","version":3},"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:dc540604c39f69f6210accd12b9f5c52cfe8ab506d11f4ce0b356f0037db2d9f","target":"record","created_at":"2026-05-18T00:23:44Z","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":"3dd7247f1ba869dd89af02439e60f6dfb166b083a53e033047753f313eed835a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-01-23T09:52:58Z","title_canon_sha256":"d6d487b052c34b06706f05e000170205024d15557aeefa5f4372ce050616df85"},"schema_version":"1.0","source":{"id":"1801.07456","kind":"arxiv","version":3}},"canonical_sha256":"284eb2e62d33080ee5daa1af19e4b796dc0c3617d61995d7b4901dff5ca661f3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"284eb2e62d33080ee5daa1af19e4b796dc0c3617d61995d7b4901dff5ca661f3","first_computed_at":"2026-05-18T00:23:44.838298Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:44.838298Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ylErWrv3KV1xy6c/MgeCoMAqUnAyLXsGOXWFIgWxl+qMZ8MGmJQH+BPWp2ZyOtNy2foslOXZzDJ8ZmKILClRCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:44.838809Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.07456","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dc540604c39f69f6210accd12b9f5c52cfe8ab506d11f4ce0b356f0037db2d9f","sha256:5a25d1a0eccbf6bb710774384001d7247c25ea406c10da7aa7a11b53f04aa4dd"],"state_sha256":"029bb8102bf606ebd90e0b67a4e8287784b3b0c168910f4e9bfb670d0d23f2d8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"smCjxUSnhEiqSDEA3A+6S1yNN10JavQRG+ZPv5Mf2Bx6duMdjnHvsxCDogTytjf70akb/ywsDibs4ZGEVjXtBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T18:41:39.839034Z","bundle_sha256":"a21a7fe4c450c49f31c8656d3ab274abaa0d24b66117dea8cda5199dad81e805"}}