{"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"}