{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:CD5H23BB4V27WB6Z7IGZCMPKYN","short_pith_number":"pith:CD5H23BB","canonical_record":{"source":{"id":"1609.01078","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-09-05T09:52:25Z","cross_cats_sorted":[],"title_canon_sha256":"65aaec82b5d28b01f43f65c64051b2a3fbc8b524702395779fb1d6c71b891e09","abstract_canon_sha256":"99f34fbf212b0d2b87157ac3e9518d42387edfb074edcde294402fcd56caf1b8"},"schema_version":"1.0"},"canonical_sha256":"10fa7d6c21e575fb07d9fa0d9131eac3727f10e07312e6f0d8d046daaa393fea","source":{"kind":"arxiv","id":"1609.01078","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.01078","created_at":"2026-05-18T01:06:19Z"},{"alias_kind":"arxiv_version","alias_value":"1609.01078v1","created_at":"2026-05-18T01:06:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.01078","created_at":"2026-05-18T01:06:19Z"},{"alias_kind":"pith_short_12","alias_value":"CD5H23BB4V27","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CD5H23BB4V27WB6Z","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CD5H23BB","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:CD5H23BB4V27WB6Z7IGZCMPKYN","target":"record","payload":{"canonical_record":{"source":{"id":"1609.01078","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-09-05T09:52:25Z","cross_cats_sorted":[],"title_canon_sha256":"65aaec82b5d28b01f43f65c64051b2a3fbc8b524702395779fb1d6c71b891e09","abstract_canon_sha256":"99f34fbf212b0d2b87157ac3e9518d42387edfb074edcde294402fcd56caf1b8"},"schema_version":"1.0"},"canonical_sha256":"10fa7d6c21e575fb07d9fa0d9131eac3727f10e07312e6f0d8d046daaa393fea","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:06:19.096090Z","signature_b64":"ZVaE3yi1FRxow13f+QMKGK1XEliKUSJjqj2BXbtMO1ctSWW35UPRF/SUbrPBVARNbM9zPQD6ZvFqkX1vcEMNCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"10fa7d6c21e575fb07d9fa0d9131eac3727f10e07312e6f0d8d046daaa393fea","last_reissued_at":"2026-05-18T01:06:19.095484Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:06:19.095484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.01078","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:06:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IOC+jh+ai4T8YcWUw3oekdl09KMKMoJlsmKy7L3AU/ZqhDvCSArxMGROHPT4rv5iemDtW3f++uXu48pJ7AYCBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T21:38:40.386434Z"},"content_sha256":"03be75cb3d273e8b8ae47c9282f3d799ca95038c7e47173e52e948f58ffe5a62","schema_version":"1.0","event_id":"sha256:03be75cb3d273e8b8ae47c9282f3d799ca95038c7e47173e52e948f58ffe5a62"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:CD5H23BB4V27WB6Z7IGZCMPKYN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Subset Sum Problems With Digraph Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"J\\'er\\^ome Monnot, Laurent Gourv\\`es, Lydia Tlilane","submitted_at":"2016-09-05T09:52:25Z","abstract_excerpt":"We introduce and study four optimization problems that generalize the well-known subset sum problem. Given a node-weighted digraph, select a subset of vertices whose total weight does not exceed a given budget. Some additional constraints need to be satisfied. The (weak resp.) digraph constraint imposes that if (all incoming nodes of resp.) a node $x$ belongs to the solution, then the latter comprises all its outgoing nodes (node $x$ itself resp.). The maximality constraint ensures that a solution cannot be extended without violating the budget or the (weak) digraph constraint. We study the co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.01078","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:06:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c8HKe7EvIE/Thge3JRv109eHtxeTrqBWBxDx5bCkZFMf5lciku9JM2HUi8z4hyWJlDlpsxDSV2DtojWwOlpfCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T21:38:40.386774Z"},"content_sha256":"4d6bc1e7f2379143b47472249ea98c895c792db29bb107c49da8b1e1f3e56710","schema_version":"1.0","event_id":"sha256:4d6bc1e7f2379143b47472249ea98c895c792db29bb107c49da8b1e1f3e56710"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CD5H23BB4V27WB6Z7IGZCMPKYN/bundle.json","state_url":"https://pith.science/pith/CD5H23BB4V27WB6Z7IGZCMPKYN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CD5H23BB4V27WB6Z7IGZCMPKYN/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-04T21:38:40Z","links":{"resolver":"https://pith.science/pith/CD5H23BB4V27WB6Z7IGZCMPKYN","bundle":"https://pith.science/pith/CD5H23BB4V27WB6Z7IGZCMPKYN/bundle.json","state":"https://pith.science/pith/CD5H23BB4V27WB6Z7IGZCMPKYN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CD5H23BB4V27WB6Z7IGZCMPKYN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:CD5H23BB4V27WB6Z7IGZCMPKYN","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":"99f34fbf212b0d2b87157ac3e9518d42387edfb074edcde294402fcd56caf1b8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-09-05T09:52:25Z","title_canon_sha256":"65aaec82b5d28b01f43f65c64051b2a3fbc8b524702395779fb1d6c71b891e09"},"schema_version":"1.0","source":{"id":"1609.01078","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.01078","created_at":"2026-05-18T01:06:19Z"},{"alias_kind":"arxiv_version","alias_value":"1609.01078v1","created_at":"2026-05-18T01:06:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.01078","created_at":"2026-05-18T01:06:19Z"},{"alias_kind":"pith_short_12","alias_value":"CD5H23BB4V27","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CD5H23BB4V27WB6Z","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CD5H23BB","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:4d6bc1e7f2379143b47472249ea98c895c792db29bb107c49da8b1e1f3e56710","target":"graph","created_at":"2026-05-18T01:06:19Z","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":"We introduce and study four optimization problems that generalize the well-known subset sum problem. Given a node-weighted digraph, select a subset of vertices whose total weight does not exceed a given budget. Some additional constraints need to be satisfied. The (weak resp.) digraph constraint imposes that if (all incoming nodes of resp.) a node $x$ belongs to the solution, then the latter comprises all its outgoing nodes (node $x$ itself resp.). The maximality constraint ensures that a solution cannot be extended without violating the budget or the (weak) digraph constraint. We study the co","authors_text":"J\\'er\\^ome Monnot, Laurent Gourv\\`es, Lydia Tlilane","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-09-05T09:52:25Z","title":"Subset Sum Problems With Digraph Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.01078","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:03be75cb3d273e8b8ae47c9282f3d799ca95038c7e47173e52e948f58ffe5a62","target":"record","created_at":"2026-05-18T01:06:19Z","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":"99f34fbf212b0d2b87157ac3e9518d42387edfb074edcde294402fcd56caf1b8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-09-05T09:52:25Z","title_canon_sha256":"65aaec82b5d28b01f43f65c64051b2a3fbc8b524702395779fb1d6c71b891e09"},"schema_version":"1.0","source":{"id":"1609.01078","kind":"arxiv","version":1}},"canonical_sha256":"10fa7d6c21e575fb07d9fa0d9131eac3727f10e07312e6f0d8d046daaa393fea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"10fa7d6c21e575fb07d9fa0d9131eac3727f10e07312e6f0d8d046daaa393fea","first_computed_at":"2026-05-18T01:06:19.095484Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:06:19.095484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZVaE3yi1FRxow13f+QMKGK1XEliKUSJjqj2BXbtMO1ctSWW35UPRF/SUbrPBVARNbM9zPQD6ZvFqkX1vcEMNCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:06:19.096090Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.01078","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:03be75cb3d273e8b8ae47c9282f3d799ca95038c7e47173e52e948f58ffe5a62","sha256:4d6bc1e7f2379143b47472249ea98c895c792db29bb107c49da8b1e1f3e56710"],"state_sha256":"2e5cf7e4bd0500f0813a2f302af1cd0caaa9de6537510cd0a227cc7a2089e53a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XNPXXx8b3z1QC4l99qET6OZkKtiMyeCu/MWFj8ssqWEphdqFQv4udAusS9+ObRe4a9J6Q0iHemNjxL+qt35XBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T21:38:40.388686Z","bundle_sha256":"8386938916f4ebf90da4545126c357ab6da61c4f9c977af534fe5b0405812cc7"}}