{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:XY6O2YWKGETSINZ6O5T65DSC2M","short_pith_number":"pith:XY6O2YWK","canonical_record":{"source":{"id":"1712.00918","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-04T06:09:50Z","cross_cats_sorted":[],"title_canon_sha256":"337070425d8dc9ce60cb1c5014e06e02e47e57816e572e00b9551c22d59b238c","abstract_canon_sha256":"bf818198a25752479398f5d25cf0750b3069e332be08127db8716c8d3931158b"},"schema_version":"1.0"},"canonical_sha256":"be3ced62ca312724373e7767ee8e42d33b91f9d4c221abf1a99713c60c18ae04","source":{"kind":"arxiv","id":"1712.00918","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.00918","created_at":"2026-05-18T00:28:59Z"},{"alias_kind":"arxiv_version","alias_value":"1712.00918v1","created_at":"2026-05-18T00:28:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.00918","created_at":"2026-05-18T00:28:59Z"},{"alias_kind":"pith_short_12","alias_value":"XY6O2YWKGETS","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XY6O2YWKGETSINZ6","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XY6O2YWK","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:XY6O2YWKGETSINZ6O5T65DSC2M","target":"record","payload":{"canonical_record":{"source":{"id":"1712.00918","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-04T06:09:50Z","cross_cats_sorted":[],"title_canon_sha256":"337070425d8dc9ce60cb1c5014e06e02e47e57816e572e00b9551c22d59b238c","abstract_canon_sha256":"bf818198a25752479398f5d25cf0750b3069e332be08127db8716c8d3931158b"},"schema_version":"1.0"},"canonical_sha256":"be3ced62ca312724373e7767ee8e42d33b91f9d4c221abf1a99713c60c18ae04","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:59.985143Z","signature_b64":"C3fI10MtuKJtdHvoXvapn5IdbfngV9Zin6domceq/S7GcdGc4xaAuYhY7NtVvlInx7ZVVJRIVt/yd3qf5tChCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be3ced62ca312724373e7767ee8e42d33b91f9d4c221abf1a99713c60c18ae04","last_reissued_at":"2026-05-18T00:28:59.984664Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:59.984664Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.00918","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-18T00:28:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ceodzVLSyLls/3m9o6LC5rWHF3f7/rU1VUhxrCzv6aIe6ZcZjJDyioRHWV9nvV3I3fiTxu/ImQJDd5aIcGuEBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:44:52.958388Z"},"content_sha256":"14eefb8205923bd2f885d7f571fa7dac4398b403cf9e8d82330fff7e3be7ddf4","schema_version":"1.0","event_id":"sha256:14eefb8205923bd2f885d7f571fa7dac4398b403cf9e8d82330fff7e3be7ddf4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:XY6O2YWKGETSINZ6O5T65DSC2M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Boolean function analysis meets stochastic optimization: An approximation scheme for stochastic knapsack","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anindya De","submitted_at":"2017-12-04T06:09:50Z","abstract_excerpt":"The stochastic knapsack problem is the stochastic variant of the classical knapsack problem in which the algorithm designer is given a a knapsack with a given capacity and a collection of items where each item is associated with a profit and a probability distribution on its size. The goal is to select a subset of items with maximum profit and violate the capacity constraint with probability at most $p$ (referred to as the overflow probability). While several approximation algorithms have been developed for this problem, most of these algorithms relax the capacity constraint of the knapsack. I"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.00918","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-18T00:28:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DrpjGbO9lH6AVO6DsONDLjGpx7fy9mon/E8jbs/f1Zh7NYVJY1WHbwRfx6YVraAlUqLQTSnxZ6uv18vqSoM2AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:44:52.958858Z"},"content_sha256":"76326bfa32d9e015fa18187b432fbc69ea3ef8aae30fb57a00e26db22ff67a88","schema_version":"1.0","event_id":"sha256:76326bfa32d9e015fa18187b432fbc69ea3ef8aae30fb57a00e26db22ff67a88"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XY6O2YWKGETSINZ6O5T65DSC2M/bundle.json","state_url":"https://pith.science/pith/XY6O2YWKGETSINZ6O5T65DSC2M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XY6O2YWKGETSINZ6O5T65DSC2M/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-05-27T01:44:52Z","links":{"resolver":"https://pith.science/pith/XY6O2YWKGETSINZ6O5T65DSC2M","bundle":"https://pith.science/pith/XY6O2YWKGETSINZ6O5T65DSC2M/bundle.json","state":"https://pith.science/pith/XY6O2YWKGETSINZ6O5T65DSC2M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XY6O2YWKGETSINZ6O5T65DSC2M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:XY6O2YWKGETSINZ6O5T65DSC2M","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":"bf818198a25752479398f5d25cf0750b3069e332be08127db8716c8d3931158b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-04T06:09:50Z","title_canon_sha256":"337070425d8dc9ce60cb1c5014e06e02e47e57816e572e00b9551c22d59b238c"},"schema_version":"1.0","source":{"id":"1712.00918","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.00918","created_at":"2026-05-18T00:28:59Z"},{"alias_kind":"arxiv_version","alias_value":"1712.00918v1","created_at":"2026-05-18T00:28:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.00918","created_at":"2026-05-18T00:28:59Z"},{"alias_kind":"pith_short_12","alias_value":"XY6O2YWKGETS","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XY6O2YWKGETSINZ6","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XY6O2YWK","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:76326bfa32d9e015fa18187b432fbc69ea3ef8aae30fb57a00e26db22ff67a88","target":"graph","created_at":"2026-05-18T00:28:59Z","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":"The stochastic knapsack problem is the stochastic variant of the classical knapsack problem in which the algorithm designer is given a a knapsack with a given capacity and a collection of items where each item is associated with a profit and a probability distribution on its size. The goal is to select a subset of items with maximum profit and violate the capacity constraint with probability at most $p$ (referred to as the overflow probability). While several approximation algorithms have been developed for this problem, most of these algorithms relax the capacity constraint of the knapsack. I","authors_text":"Anindya De","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-04T06:09:50Z","title":"Boolean function analysis meets stochastic optimization: An approximation scheme for stochastic knapsack"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.00918","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:14eefb8205923bd2f885d7f571fa7dac4398b403cf9e8d82330fff7e3be7ddf4","target":"record","created_at":"2026-05-18T00:28:59Z","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":"bf818198a25752479398f5d25cf0750b3069e332be08127db8716c8d3931158b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-04T06:09:50Z","title_canon_sha256":"337070425d8dc9ce60cb1c5014e06e02e47e57816e572e00b9551c22d59b238c"},"schema_version":"1.0","source":{"id":"1712.00918","kind":"arxiv","version":1}},"canonical_sha256":"be3ced62ca312724373e7767ee8e42d33b91f9d4c221abf1a99713c60c18ae04","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"be3ced62ca312724373e7767ee8e42d33b91f9d4c221abf1a99713c60c18ae04","first_computed_at":"2026-05-18T00:28:59.984664Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:59.984664Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C3fI10MtuKJtdHvoXvapn5IdbfngV9Zin6domceq/S7GcdGc4xaAuYhY7NtVvlInx7ZVVJRIVt/yd3qf5tChCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:59.985143Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.00918","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:14eefb8205923bd2f885d7f571fa7dac4398b403cf9e8d82330fff7e3be7ddf4","sha256:76326bfa32d9e015fa18187b432fbc69ea3ef8aae30fb57a00e26db22ff67a88"],"state_sha256":"68e52d43d22cbb5557e17762f7eb3a1f33fe56d02f659179225aff2ce8c9652c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y+9o46ifN+k+UcyAwQHycvwweIiwJXHKyspudJYZQpgTuLfpD4Iv6ED25PW3S82qqfvM4kFh4Zr3nJGHzvTiBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T01:44:52.961615Z","bundle_sha256":"1f7e035489d1028a690a924e3a126c0c3a33710e8664ab86a5f085d3fb471084"}}