{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:X4FQTNXDF4TIQMTTUCO7L24GOZ","short_pith_number":"pith:X4FQTNXD","canonical_record":{"source":{"id":"0910.0777","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-10-05T14:34:09Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"f9dde460ed08fa71e252c6183a63e7223f157ddeebadb7c7a4ac5be97548e2c9","abstract_canon_sha256":"68b37c78aeb5fb8384015e3a1d5776ab812f6cac550cace7d35186c15d407458"},"schema_version":"1.0"},"canonical_sha256":"bf0b09b6e32f26883273a09df5eb86764b29165effc91b3816626f013d142568","source":{"kind":"arxiv","id":"0910.0777","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0910.0777","created_at":"2026-05-18T04:12:18Z"},{"alias_kind":"arxiv_version","alias_value":"0910.0777v4","created_at":"2026-05-18T04:12:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.0777","created_at":"2026-05-18T04:12:18Z"},{"alias_kind":"pith_short_12","alias_value":"X4FQTNXDF4TI","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_16","alias_value":"X4FQTNXDF4TIQMTT","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_8","alias_value":"X4FQTNXD","created_at":"2026-05-18T12:26:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:X4FQTNXDF4TIQMTTUCO7L24GOZ","target":"record","payload":{"canonical_record":{"source":{"id":"0910.0777","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-10-05T14:34:09Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"f9dde460ed08fa71e252c6183a63e7223f157ddeebadb7c7a4ac5be97548e2c9","abstract_canon_sha256":"68b37c78aeb5fb8384015e3a1d5776ab812f6cac550cace7d35186c15d407458"},"schema_version":"1.0"},"canonical_sha256":"bf0b09b6e32f26883273a09df5eb86764b29165effc91b3816626f013d142568","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:18.851353Z","signature_b64":"YMUjpjJOmsSKdEj5h90VIG9I96AwrnqR4uHuIeXxEImGO4GLN9zhqSzhMtE+1KoI0rnP5+G4QnCPzPk1awuWAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf0b09b6e32f26883273a09df5eb86764b29165effc91b3816626f013d142568","last_reissued_at":"2026-05-18T04:12:18.850876Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:18.850876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0910.0777","source_version":4,"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-18T04:12:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XJ4wvUw5DR6Q50+XEm97w6XleZXyPmXln2qtG0kvOLZTmscG+wW/N89OSsBVEm2xuP/K+bLiOX86fMgJqnPuAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T13:23:00.544204Z"},"content_sha256":"6b317ac6466294a864a7a1be165de5e3865fea9cec90ea8d2b406a4575660c56","schema_version":"1.0","event_id":"sha256:6b317ac6466294a864a7a1be165de5e3865fea9cec90ea8d2b406a4575660c56"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:X4FQTNXDF4TIQMTTUCO7L24GOZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Knapsack Problem with Neighbour Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Brent Heeringa, Glencora Borradaile, Gordon Wilfong","submitted_at":"2009-10-05T14:34:09Z","abstract_excerpt":"We study a constrained version of the knapsack problem in which dependencies between items are given by the adjacencies of a graph. In the 1-neighbour knapsack problem, an item can be selected only if at least one of its neighbours is also selected. In the all-neighbours knapsack problem, an item can be selected only if all its neighbours are also selected. We give approximation algorithms and hardness results when the nodes have both uniform and arbitrary weight and profit functions, and when the dependency graph is directed and undirected."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.0777","kind":"arxiv","version":4},"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-18T04:12:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yjEl8haQxERnhubdoSY7Z8qKKAKnFnex4ONkRgJPSg0pp4p3q4uTZWXgB3301HcvW2muv86yuRDi249ZOP3oCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T13:23:00.544944Z"},"content_sha256":"9fa725898b716804633eb02e244b11d58c9f4d63255b7d7896ff9e5145459804","schema_version":"1.0","event_id":"sha256:9fa725898b716804633eb02e244b11d58c9f4d63255b7d7896ff9e5145459804"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X4FQTNXDF4TIQMTTUCO7L24GOZ/bundle.json","state_url":"https://pith.science/pith/X4FQTNXDF4TIQMTTUCO7L24GOZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X4FQTNXDF4TIQMTTUCO7L24GOZ/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-10T13:23:00Z","links":{"resolver":"https://pith.science/pith/X4FQTNXDF4TIQMTTUCO7L24GOZ","bundle":"https://pith.science/pith/X4FQTNXDF4TIQMTTUCO7L24GOZ/bundle.json","state":"https://pith.science/pith/X4FQTNXDF4TIQMTTUCO7L24GOZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X4FQTNXDF4TIQMTTUCO7L24GOZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:X4FQTNXDF4TIQMTTUCO7L24GOZ","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":"68b37c78aeb5fb8384015e3a1d5776ab812f6cac550cace7d35186c15d407458","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-10-05T14:34:09Z","title_canon_sha256":"f9dde460ed08fa71e252c6183a63e7223f157ddeebadb7c7a4ac5be97548e2c9"},"schema_version":"1.0","source":{"id":"0910.0777","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0910.0777","created_at":"2026-05-18T04:12:18Z"},{"alias_kind":"arxiv_version","alias_value":"0910.0777v4","created_at":"2026-05-18T04:12:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.0777","created_at":"2026-05-18T04:12:18Z"},{"alias_kind":"pith_short_12","alias_value":"X4FQTNXDF4TI","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_16","alias_value":"X4FQTNXDF4TIQMTT","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_8","alias_value":"X4FQTNXD","created_at":"2026-05-18T12:26:02Z"}],"graph_snapshots":[{"event_id":"sha256:9fa725898b716804633eb02e244b11d58c9f4d63255b7d7896ff9e5145459804","target":"graph","created_at":"2026-05-18T04:12:18Z","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 study a constrained version of the knapsack problem in which dependencies between items are given by the adjacencies of a graph. In the 1-neighbour knapsack problem, an item can be selected only if at least one of its neighbours is also selected. In the all-neighbours knapsack problem, an item can be selected only if all its neighbours are also selected. We give approximation algorithms and hardness results when the nodes have both uniform and arbitrary weight and profit functions, and when the dependency graph is directed and undirected.","authors_text":"Brent Heeringa, Glencora Borradaile, Gordon Wilfong","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-10-05T14:34:09Z","title":"The Knapsack Problem with Neighbour Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.0777","kind":"arxiv","version":4},"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:6b317ac6466294a864a7a1be165de5e3865fea9cec90ea8d2b406a4575660c56","target":"record","created_at":"2026-05-18T04:12:18Z","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":"68b37c78aeb5fb8384015e3a1d5776ab812f6cac550cace7d35186c15d407458","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-10-05T14:34:09Z","title_canon_sha256":"f9dde460ed08fa71e252c6183a63e7223f157ddeebadb7c7a4ac5be97548e2c9"},"schema_version":"1.0","source":{"id":"0910.0777","kind":"arxiv","version":4}},"canonical_sha256":"bf0b09b6e32f26883273a09df5eb86764b29165effc91b3816626f013d142568","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bf0b09b6e32f26883273a09df5eb86764b29165effc91b3816626f013d142568","first_computed_at":"2026-05-18T04:12:18.850876Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:12:18.850876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YMUjpjJOmsSKdEj5h90VIG9I96AwrnqR4uHuIeXxEImGO4GLN9zhqSzhMtE+1KoI0rnP5+G4QnCPzPk1awuWAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:12:18.851353Z","signed_message":"canonical_sha256_bytes"},"source_id":"0910.0777","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6b317ac6466294a864a7a1be165de5e3865fea9cec90ea8d2b406a4575660c56","sha256:9fa725898b716804633eb02e244b11d58c9f4d63255b7d7896ff9e5145459804"],"state_sha256":"42611458a4b2ee7fa3728eefef11d7613ca883af0dcc4519c03889056bb37101"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PNCHYTPc1l8LWli8RwME9hRNlaFAnMtfn3OHoF0IaKEMtA+WLKol1oVphfDb/aOFCfS6W0FHeCUpr4gY+ShbAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T13:23:00.549285Z","bundle_sha256":"626d639d6957417c381f59d3f27a264d329f52676932040922530bec39105e0a"}}