{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:HCDJINK73R7HR3C6WQ6466ZTUL","short_pith_number":"pith:HCDJINK7","canonical_record":{"source":{"id":"2606.22018","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2026-06-20T12:45:22Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"2428bd6907feac9e7018fbb803680becfbf29a6114c4ce3548301de290269266","abstract_canon_sha256":"cb7a44de7fb7d136de662dec4b11b95dde124888271259ff3c4a81702857d88e"},"schema_version":"1.0"},"canonical_sha256":"388694355fdc7e78ec5eb43dcf7b33a2d14a9d06c6c1422729ffbf9aa1c1717c","source":{"kind":"arxiv","id":"2606.22018","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.22018","created_at":"2026-06-23T02:13:05Z"},{"alias_kind":"arxiv_version","alias_value":"2606.22018v1","created_at":"2026-06-23T02:13:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.22018","created_at":"2026-06-23T02:13:05Z"},{"alias_kind":"pith_short_12","alias_value":"HCDJINK73R7H","created_at":"2026-06-23T02:13:05Z"},{"alias_kind":"pith_short_16","alias_value":"HCDJINK73R7HR3C6","created_at":"2026-06-23T02:13:05Z"},{"alias_kind":"pith_short_8","alias_value":"HCDJINK7","created_at":"2026-06-23T02:13:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:HCDJINK73R7HR3C6WQ6466ZTUL","target":"record","payload":{"canonical_record":{"source":{"id":"2606.22018","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2026-06-20T12:45:22Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"2428bd6907feac9e7018fbb803680becfbf29a6114c4ce3548301de290269266","abstract_canon_sha256":"cb7a44de7fb7d136de662dec4b11b95dde124888271259ff3c4a81702857d88e"},"schema_version":"1.0"},"canonical_sha256":"388694355fdc7e78ec5eb43dcf7b33a2d14a9d06c6c1422729ffbf9aa1c1717c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T02:13:05.684571Z","signature_b64":"+r3gTxNbdVaCmL9IwKLlIZ3qoJCYVyDyw23hYu38CvouhM6Fhaxn2bWLBGrS5ghvQX1of41RkzVb6u9YUkxlDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"388694355fdc7e78ec5eb43dcf7b33a2d14a9d06c6c1422729ffbf9aa1c1717c","last_reissued_at":"2026-06-23T02:13:05.684088Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T02:13:05.684088Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.22018","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-06-23T02:13:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I9R5fhrKxp/yGQsU/YSMYi2a4K+Hu9VYJUx+opVC8o8xrrVVXLOXSIOL66czM9Yzch1ZbNDT2QIP/4hlQTnBAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T02:33:01.708093Z"},"content_sha256":"ac8f241beb6e9433cd876ae1d4be85fc2d6720102187eebf7473f9bb7e367040","schema_version":"1.0","event_id":"sha256:ac8f241beb6e9433cd876ae1d4be85fc2d6720102187eebf7473f9bb7e367040"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:HCDJINK73R7HR3C6WQ6466ZTUL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Macroitem Sequences in the Precedence Constrained Knapsack Problem","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Fabio Furini, Marco Locatelli, Valerio Dose","submitted_at":"2026-06-20T12:45:22Z","abstract_excerpt":"The Precedence Constrained Knapsack Problem (PCKP) asks for a maximum-profit subset of items, subject to a knapsack capacity constraint and precedence constraints encoded by a directed acyclic graph. We study the structure of optimal solutions of the Linear Programming (LP) relaxation of the natural Integer Linear Programming formulation of the PCKP. We introduce the notion of macroitem and of feasible sequence of macroitems, which partitions the item set while respecting the precedence structure. We establish that an optimal LP solution is fully characterized by the optimal sequence of macroi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.22018","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.22018/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-06-23T02:13:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vfhYPg3hUPEYwk6DHlMehYpLmcmMRGafyVxVi3zcaEIUtMmwnnrWayy67U1shHvy1T14awzF3A/yXctFSD/tCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T02:33:01.708490Z"},"content_sha256":"7a60c3b4f1f81787c2dd4c42d0badcf75efb21ddffe6870f92a196ccbafa2acb","schema_version":"1.0","event_id":"sha256:7a60c3b4f1f81787c2dd4c42d0badcf75efb21ddffe6870f92a196ccbafa2acb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HCDJINK73R7HR3C6WQ6466ZTUL/bundle.json","state_url":"https://pith.science/pith/HCDJINK73R7HR3C6WQ6466ZTUL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HCDJINK73R7HR3C6WQ6466ZTUL/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-26T02:33:01Z","links":{"resolver":"https://pith.science/pith/HCDJINK73R7HR3C6WQ6466ZTUL","bundle":"https://pith.science/pith/HCDJINK73R7HR3C6WQ6466ZTUL/bundle.json","state":"https://pith.science/pith/HCDJINK73R7HR3C6WQ6466ZTUL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HCDJINK73R7HR3C6WQ6466ZTUL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:HCDJINK73R7HR3C6WQ6466ZTUL","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":"cb7a44de7fb7d136de662dec4b11b95dde124888271259ff3c4a81702857d88e","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2026-06-20T12:45:22Z","title_canon_sha256":"2428bd6907feac9e7018fbb803680becfbf29a6114c4ce3548301de290269266"},"schema_version":"1.0","source":{"id":"2606.22018","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.22018","created_at":"2026-06-23T02:13:05Z"},{"alias_kind":"arxiv_version","alias_value":"2606.22018v1","created_at":"2026-06-23T02:13:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.22018","created_at":"2026-06-23T02:13:05Z"},{"alias_kind":"pith_short_12","alias_value":"HCDJINK73R7H","created_at":"2026-06-23T02:13:05Z"},{"alias_kind":"pith_short_16","alias_value":"HCDJINK73R7HR3C6","created_at":"2026-06-23T02:13:05Z"},{"alias_kind":"pith_short_8","alias_value":"HCDJINK7","created_at":"2026-06-23T02:13:05Z"}],"graph_snapshots":[{"event_id":"sha256:7a60c3b4f1f81787c2dd4c42d0badcf75efb21ddffe6870f92a196ccbafa2acb","target":"graph","created_at":"2026-06-23T02:13:05Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.22018/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Precedence Constrained Knapsack Problem (PCKP) asks for a maximum-profit subset of items, subject to a knapsack capacity constraint and precedence constraints encoded by a directed acyclic graph. We study the structure of optimal solutions of the Linear Programming (LP) relaxation of the natural Integer Linear Programming formulation of the PCKP. We introduce the notion of macroitem and of feasible sequence of macroitems, which partitions the item set while respecting the precedence structure. We establish that an optimal LP solution is fully characterized by the optimal sequence of macroi","authors_text":"Fabio Furini, Marco Locatelli, Valerio Dose","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2026-06-20T12:45:22Z","title":"Optimal Macroitem Sequences in the Precedence Constrained Knapsack Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.22018","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:ac8f241beb6e9433cd876ae1d4be85fc2d6720102187eebf7473f9bb7e367040","target":"record","created_at":"2026-06-23T02:13:05Z","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":"cb7a44de7fb7d136de662dec4b11b95dde124888271259ff3c4a81702857d88e","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2026-06-20T12:45:22Z","title_canon_sha256":"2428bd6907feac9e7018fbb803680becfbf29a6114c4ce3548301de290269266"},"schema_version":"1.0","source":{"id":"2606.22018","kind":"arxiv","version":1}},"canonical_sha256":"388694355fdc7e78ec5eb43dcf7b33a2d14a9d06c6c1422729ffbf9aa1c1717c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"388694355fdc7e78ec5eb43dcf7b33a2d14a9d06c6c1422729ffbf9aa1c1717c","first_computed_at":"2026-06-23T02:13:05.684088Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-23T02:13:05.684088Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+r3gTxNbdVaCmL9IwKLlIZ3qoJCYVyDyw23hYu38CvouhM6Fhaxn2bWLBGrS5ghvQX1of41RkzVb6u9YUkxlDQ==","signature_status":"signed_v1","signed_at":"2026-06-23T02:13:05.684571Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.22018","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ac8f241beb6e9433cd876ae1d4be85fc2d6720102187eebf7473f9bb7e367040","sha256:7a60c3b4f1f81787c2dd4c42d0badcf75efb21ddffe6870f92a196ccbafa2acb"],"state_sha256":"d9820e5b13cbd0a5a660a1a3f360c32160302098d54f4ed50297bc52ce42d22d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jnwpz9IprcBLC3cGsOIu+CuIx/0UmLfK3H01zTuT4F6YZXYjskzK70xM3f3sBx8bxRHVWPklQ5jn08YZ/DVFBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T02:33:01.710576Z","bundle_sha256":"d63d910df59ca7d7dc5ff2eb0d2ea2063229268f773392383210f4a83c9d201c"}}