{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:CD5H23BB4V27WB6Z7IGZCMPKYN","short_pith_number":"pith:CD5H23BB","schema_version":"1.0","canonical_sha256":"10fa7d6c21e575fb07d9fa0d9131eac3727f10e07312e6f0d8d046daaa393fea","source":{"kind":"arxiv","id":"1609.01078","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1609.01078","created_at":"2026-05-18T01:06:19.095590+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.01078v1","created_at":"2026-05-18T01:06:19.095590+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.01078","created_at":"2026-05-18T01:06:19.095590+00:00"},{"alias_kind":"pith_short_12","alias_value":"CD5H23BB4V27","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"CD5H23BB4V27WB6Z","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"CD5H23BB","created_at":"2026-05-18T12:30:09.641336+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/CD5H23BB4V27WB6Z7IGZCMPKYN","json":"https://pith.science/pith/CD5H23BB4V27WB6Z7IGZCMPKYN.json","graph_json":"https://pith.science/api/pith-number/CD5H23BB4V27WB6Z7IGZCMPKYN/graph.json","events_json":"https://pith.science/api/pith-number/CD5H23BB4V27WB6Z7IGZCMPKYN/events.json","paper":"https://pith.science/paper/CD5H23BB"},"agent_actions":{"view_html":"https://pith.science/pith/CD5H23BB4V27WB6Z7IGZCMPKYN","download_json":"https://pith.science/pith/CD5H23BB4V27WB6Z7IGZCMPKYN.json","view_paper":"https://pith.science/paper/CD5H23BB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.01078&json=true","fetch_graph":"https://pith.science/api/pith-number/CD5H23BB4V27WB6Z7IGZCMPKYN/graph.json","fetch_events":"https://pith.science/api/pith-number/CD5H23BB4V27WB6Z7IGZCMPKYN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CD5H23BB4V27WB6Z7IGZCMPKYN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CD5H23BB4V27WB6Z7IGZCMPKYN/action/storage_attestation","attest_author":"https://pith.science/pith/CD5H23BB4V27WB6Z7IGZCMPKYN/action/author_attestation","sign_citation":"https://pith.science/pith/CD5H23BB4V27WB6Z7IGZCMPKYN/action/citation_signature","submit_replication":"https://pith.science/pith/CD5H23BB4V27WB6Z7IGZCMPKYN/action/replication_record"}},"created_at":"2026-05-18T01:06:19.095590+00:00","updated_at":"2026-05-18T01:06:19.095590+00:00"}