{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:AA6GYNQO3JKSG6FUP4PTNNFQPU","short_pith_number":"pith:AA6GYNQO","canonical_record":{"source":{"id":"1811.02822","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-11-07T10:39:13Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"452ed39b9941ec2d116f6e61ea745133bd589f9b6810814380274a37a5c00583","abstract_canon_sha256":"b38b8d11c494395e613b97642eaa24206d588bf092077606e336f5e21bd5ffb0"},"schema_version":"1.0"},"canonical_sha256":"003c6c360eda552378b47f1f36b4b07d38b4bc966b3910e45a76d202859057c9","source":{"kind":"arxiv","id":"1811.02822","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.02822","created_at":"2026-05-18T00:01:06Z"},{"alias_kind":"arxiv_version","alias_value":"1811.02822v2","created_at":"2026-05-18T00:01:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02822","created_at":"2026-05-18T00:01:06Z"},{"alias_kind":"pith_short_12","alias_value":"AA6GYNQO3JKS","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AA6GYNQO3JKSG6FU","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AA6GYNQO","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:AA6GYNQO3JKSG6FUP4PTNNFQPU","target":"record","payload":{"canonical_record":{"source":{"id":"1811.02822","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-11-07T10:39:13Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"452ed39b9941ec2d116f6e61ea745133bd589f9b6810814380274a37a5c00583","abstract_canon_sha256":"b38b8d11c494395e613b97642eaa24206d588bf092077606e336f5e21bd5ffb0"},"schema_version":"1.0"},"canonical_sha256":"003c6c360eda552378b47f1f36b4b07d38b4bc966b3910e45a76d202859057c9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:06.437970Z","signature_b64":"ldgozFh1K0U+gZltT193dxAfia5Eldd7dh5p/Pl3Vj3W68r50JGdOXsEXG1dRNP1FSw5TdPd3g+xEFpgHcUrAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"003c6c360eda552378b47f1f36b4b07d38b4bc966b3910e45a76d202859057c9","last_reissued_at":"2026-05-18T00:01:06.437366Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:06.437366Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.02822","source_version":2,"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:01:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RxP2Eo6lwySbJs5J3rkvxy7PbTnIIYayeWckHofcK5LHZ5OyyYwIgeNn5QoPxcnUfX6ZByMO7AIGgvLYrBdsCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T23:12:13.723011Z"},"content_sha256":"5701cb5416aa459ce9e81f2b0941e407aff04ea28401c11d8229bebbe318dadc","schema_version":"1.0","event_id":"sha256:5701cb5416aa459ce9e81f2b0941e407aff04ea28401c11d8229bebbe318dadc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:AA6GYNQO3JKSG6FUP4PTNNFQPU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A new exact approach for the Bilevel Knapsack with Interdiction Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Federico Della Croce, Rosario Scatamacchia","submitted_at":"2018-11-07T10:39:13Z","abstract_excerpt":"We consider the Bilevel Knapsack with Interdiction Constraints, an extension of the classic 0-1 knapsack problem formulated as a Stackelberg game with two agents, a leader and a follower, that choose items from a common set and hold their own private knapsacks. First, the leader selects some items to be interdicted for the follower while satisfying a capacity constraint. Then the follower packs a set of the remaining items according to his knapsack constraint in order to maximize the profits. The goal of the leader is to minimize the follower's profits. The presence of two decision levels make"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02822","kind":"arxiv","version":2},"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:01:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"II1JP74+Tg3OJ9puygjdZ04bLPxsMlHx/LkQQ5JTXw5fErKhISNlVNd1JMvcU3bG0HLTJmSviKd5sVPbnNVkBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T23:12:13.723373Z"},"content_sha256":"17342c9aed9be104fe007a4594932af3cbce0005db5f159a58005b95e2b32a81","schema_version":"1.0","event_id":"sha256:17342c9aed9be104fe007a4594932af3cbce0005db5f159a58005b95e2b32a81"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AA6GYNQO3JKSG6FUP4PTNNFQPU/bundle.json","state_url":"https://pith.science/pith/AA6GYNQO3JKSG6FUP4PTNNFQPU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AA6GYNQO3JKSG6FUP4PTNNFQPU/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-21T23:12:13Z","links":{"resolver":"https://pith.science/pith/AA6GYNQO3JKSG6FUP4PTNNFQPU","bundle":"https://pith.science/pith/AA6GYNQO3JKSG6FUP4PTNNFQPU/bundle.json","state":"https://pith.science/pith/AA6GYNQO3JKSG6FUP4PTNNFQPU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AA6GYNQO3JKSG6FUP4PTNNFQPU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:AA6GYNQO3JKSG6FUP4PTNNFQPU","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":"b38b8d11c494395e613b97642eaa24206d588bf092077606e336f5e21bd5ffb0","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-11-07T10:39:13Z","title_canon_sha256":"452ed39b9941ec2d116f6e61ea745133bd589f9b6810814380274a37a5c00583"},"schema_version":"1.0","source":{"id":"1811.02822","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.02822","created_at":"2026-05-18T00:01:06Z"},{"alias_kind":"arxiv_version","alias_value":"1811.02822v2","created_at":"2026-05-18T00:01:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02822","created_at":"2026-05-18T00:01:06Z"},{"alias_kind":"pith_short_12","alias_value":"AA6GYNQO3JKS","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AA6GYNQO3JKSG6FU","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AA6GYNQO","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:17342c9aed9be104fe007a4594932af3cbce0005db5f159a58005b95e2b32a81","target":"graph","created_at":"2026-05-18T00:01:06Z","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 consider the Bilevel Knapsack with Interdiction Constraints, an extension of the classic 0-1 knapsack problem formulated as a Stackelberg game with two agents, a leader and a follower, that choose items from a common set and hold their own private knapsacks. First, the leader selects some items to be interdicted for the follower while satisfying a capacity constraint. Then the follower packs a set of the remaining items according to his knapsack constraint in order to maximize the profits. The goal of the leader is to minimize the follower's profits. The presence of two decision levels make","authors_text":"Federico Della Croce, Rosario Scatamacchia","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-11-07T10:39:13Z","title":"A new exact approach for the Bilevel Knapsack with Interdiction Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02822","kind":"arxiv","version":2},"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:5701cb5416aa459ce9e81f2b0941e407aff04ea28401c11d8229bebbe318dadc","target":"record","created_at":"2026-05-18T00:01:06Z","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":"b38b8d11c494395e613b97642eaa24206d588bf092077606e336f5e21bd5ffb0","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-11-07T10:39:13Z","title_canon_sha256":"452ed39b9941ec2d116f6e61ea745133bd589f9b6810814380274a37a5c00583"},"schema_version":"1.0","source":{"id":"1811.02822","kind":"arxiv","version":2}},"canonical_sha256":"003c6c360eda552378b47f1f36b4b07d38b4bc966b3910e45a76d202859057c9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"003c6c360eda552378b47f1f36b4b07d38b4bc966b3910e45a76d202859057c9","first_computed_at":"2026-05-18T00:01:06.437366Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:06.437366Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ldgozFh1K0U+gZltT193dxAfia5Eldd7dh5p/Pl3Vj3W68r50JGdOXsEXG1dRNP1FSw5TdPd3g+xEFpgHcUrAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:06.437970Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.02822","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5701cb5416aa459ce9e81f2b0941e407aff04ea28401c11d8229bebbe318dadc","sha256:17342c9aed9be104fe007a4594932af3cbce0005db5f159a58005b95e2b32a81"],"state_sha256":"e964c99024a305fc29d5aaf7ca63e68c5bc3011638e80cba5c3c681a7459da13"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hNj4GTpQI8f6BdfoGKaRuHLtOQFl3yWuz5UQG9kl4xZ4waaMft3+stt7AdFcDTuDPKcLN4abgcxqw13biuRdCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T23:12:13.725306Z","bundle_sha256":"2eff5aaa07aa77ab1f0391e4aaef6f33311352e0925780a1c79c2714ba2e877b"}}