{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:INMCJXRKRZ5FGWI2OV5VA2VKD5","short_pith_number":"pith:INMCJXRK","canonical_record":{"source":{"id":"1605.02168","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-07T10:32:57Z","cross_cats_sorted":[],"title_canon_sha256":"0e6f601bd07ce9eb24761798bcfa5bf396915753f83f1ca00e545be36219137e","abstract_canon_sha256":"d1013a16ed140756238561480a614b98b6ddb2ede66acf4301673b6dfbf7f5b3"},"schema_version":"1.0"},"canonical_sha256":"435824de2a8e7a53591a757b506aaa1f52025e39773baa31b5d322adecfb6f52","source":{"kind":"arxiv","id":"1605.02168","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.02168","created_at":"2026-05-18T01:15:21Z"},{"alias_kind":"arxiv_version","alias_value":"1605.02168v1","created_at":"2026-05-18T01:15:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.02168","created_at":"2026-05-18T01:15:21Z"},{"alias_kind":"pith_short_12","alias_value":"INMCJXRKRZ5F","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"INMCJXRKRZ5FGWI2","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"INMCJXRK","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:INMCJXRKRZ5FGWI2OV5VA2VKD5","target":"record","payload":{"canonical_record":{"source":{"id":"1605.02168","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-07T10:32:57Z","cross_cats_sorted":[],"title_canon_sha256":"0e6f601bd07ce9eb24761798bcfa5bf396915753f83f1ca00e545be36219137e","abstract_canon_sha256":"d1013a16ed140756238561480a614b98b6ddb2ede66acf4301673b6dfbf7f5b3"},"schema_version":"1.0"},"canonical_sha256":"435824de2a8e7a53591a757b506aaa1f52025e39773baa31b5d322adecfb6f52","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:21.905443Z","signature_b64":"/8Ruh+4hBrQPDkKi3lVVFLwG0B2dJrCVYub/g2EFFnNo9dbzVokayHr5+dq08Hi6ULs10SvxoQe/KY+JeJoyAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"435824de2a8e7a53591a757b506aaa1f52025e39773baa31b5d322adecfb6f52","last_reissued_at":"2026-05-18T01:15:21.904817Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:21.904817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.02168","source_version":1,"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:15:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jlHBu8l4RCnLXQp5j86wZbJtcxh59WdkxnWRPX3RFddfPq8w8qspZ2i0fK5AHXvFXrmrSGGv5Bo9Bat82INODQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T22:37:49.524333Z"},"content_sha256":"90996d0e5e6fe30c144fd5479eecaf1902f5acf1b42230ba972ecfef64d3a4e4","schema_version":"1.0","event_id":"sha256:90996d0e5e6fe30c144fd5479eecaf1902f5acf1b42230ba972ecfef64d3a4e4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:INMCJXRKRZ5FGWI2OV5VA2VKD5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving generalized maximum-weight connected subgraph problem for network enrichment analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexander A. Loboda, Alexey A. Sergushichev, Maxim N. Artyomov","submitted_at":"2016-05-07T10:32:57Z","abstract_excerpt":"Network enrichment analysis methods allow to identify active modules without being biased towards a priori defined pathways. One of mathematical formulations of such analysis is a reduction to a maximum-weight connected subgraph problem. In particular, in analysis of metabolic networks a generalized maximum-weight connected subgraph (GMWCS) problem, where both nodes and edges are scored, naturally arises. Here we present the first to our knowledge practical exact GMWCS solver. We have tested it on real-world instances and compared to similar solvers. First, the results show that on node-weight"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.02168","kind":"arxiv","version":1},"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:15:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jkhuXjLQpiorVcjageDqC6expUtsrbCE8n1bejzlc19itskvdqIccyc0n2+LBk+dptOzmunh5ImahSOJsFmtCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T22:37:49.524688Z"},"content_sha256":"87c66b02647deaaeb8c861f083a31261beba36b32a2dd1b58a22ce10e066eccc","schema_version":"1.0","event_id":"sha256:87c66b02647deaaeb8c861f083a31261beba36b32a2dd1b58a22ce10e066eccc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/INMCJXRKRZ5FGWI2OV5VA2VKD5/bundle.json","state_url":"https://pith.science/pith/INMCJXRKRZ5FGWI2OV5VA2VKD5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/INMCJXRKRZ5FGWI2OV5VA2VKD5/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-21T22:37:49Z","links":{"resolver":"https://pith.science/pith/INMCJXRKRZ5FGWI2OV5VA2VKD5","bundle":"https://pith.science/pith/INMCJXRKRZ5FGWI2OV5VA2VKD5/bundle.json","state":"https://pith.science/pith/INMCJXRKRZ5FGWI2OV5VA2VKD5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/INMCJXRKRZ5FGWI2OV5VA2VKD5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:INMCJXRKRZ5FGWI2OV5VA2VKD5","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":"d1013a16ed140756238561480a614b98b6ddb2ede66acf4301673b6dfbf7f5b3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-07T10:32:57Z","title_canon_sha256":"0e6f601bd07ce9eb24761798bcfa5bf396915753f83f1ca00e545be36219137e"},"schema_version":"1.0","source":{"id":"1605.02168","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.02168","created_at":"2026-05-18T01:15:21Z"},{"alias_kind":"arxiv_version","alias_value":"1605.02168v1","created_at":"2026-05-18T01:15:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.02168","created_at":"2026-05-18T01:15:21Z"},{"alias_kind":"pith_short_12","alias_value":"INMCJXRKRZ5F","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"INMCJXRKRZ5FGWI2","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"INMCJXRK","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:87c66b02647deaaeb8c861f083a31261beba36b32a2dd1b58a22ce10e066eccc","target":"graph","created_at":"2026-05-18T01:15: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":"Network enrichment analysis methods allow to identify active modules without being biased towards a priori defined pathways. One of mathematical formulations of such analysis is a reduction to a maximum-weight connected subgraph problem. In particular, in analysis of metabolic networks a generalized maximum-weight connected subgraph (GMWCS) problem, where both nodes and edges are scored, naturally arises. Here we present the first to our knowledge practical exact GMWCS solver. We have tested it on real-world instances and compared to similar solvers. First, the results show that on node-weight","authors_text":"Alexander A. Loboda, Alexey A. Sergushichev, Maxim N. Artyomov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-07T10:32:57Z","title":"Solving generalized maximum-weight connected subgraph problem for network enrichment analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.02168","kind":"arxiv","version":1},"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:90996d0e5e6fe30c144fd5479eecaf1902f5acf1b42230ba972ecfef64d3a4e4","target":"record","created_at":"2026-05-18T01:15: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":"d1013a16ed140756238561480a614b98b6ddb2ede66acf4301673b6dfbf7f5b3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-07T10:32:57Z","title_canon_sha256":"0e6f601bd07ce9eb24761798bcfa5bf396915753f83f1ca00e545be36219137e"},"schema_version":"1.0","source":{"id":"1605.02168","kind":"arxiv","version":1}},"canonical_sha256":"435824de2a8e7a53591a757b506aaa1f52025e39773baa31b5d322adecfb6f52","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"435824de2a8e7a53591a757b506aaa1f52025e39773baa31b5d322adecfb6f52","first_computed_at":"2026-05-18T01:15:21.904817Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:21.904817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/8Ruh+4hBrQPDkKi3lVVFLwG0B2dJrCVYub/g2EFFnNo9dbzVokayHr5+dq08Hi6ULs10SvxoQe/KY+JeJoyAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:21.905443Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.02168","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:90996d0e5e6fe30c144fd5479eecaf1902f5acf1b42230ba972ecfef64d3a4e4","sha256:87c66b02647deaaeb8c861f083a31261beba36b32a2dd1b58a22ce10e066eccc"],"state_sha256":"a91bf31d94a543f4dab9872678674e7fbc104fb0cfd3edd75b3be55a599e753f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FXFNxLZUJ0l/2GqThX8nL6+ytW43s5YkhASY2qfI6EbQ4VylBJU6c3so68uARmiUGExXOpKCr9HFRbWdLQbzBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T22:37:49.526707Z","bundle_sha256":"0355d1c23ea3599ca403b881124c90709a83f6019782d269a7c47f6607a44dad"}}