{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:2KZGVJCXL3RM5RBKEGEC3PS4VJ","short_pith_number":"pith:2KZGVJCX","schema_version":"1.0","canonical_sha256":"d2b26aa4575ee2cec42a21882dbe5caa4bc70fdb91a23d7cd067d3488958a64d","source":{"kind":"arxiv","id":"1211.1149","version":2},"attestation_state":"computed","paper":{"title":"Stochastic Combinatorial Optimization via Poisson Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jian Li, Wen Yuan","submitted_at":"2012-11-06T09:12:49Z","abstract_excerpt":"We study several stochastic combinatorial problems, including the expected utility maximization problem, the stochastic knapsack problem and the stochastic bin packing problem. A common technical challenge in these problems is to optimize some function of the sum of a set of random variables. The difficulty is mainly due to the fact that the probability distribution of the sum is the convolution of a set of distributions, which is not an easy objective function to work with. To tackle this difficulty, we introduce the Poisson approximation technique. The technique is based on the Poisson appro"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1211.1149","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-06T09:12:49Z","cross_cats_sorted":[],"title_canon_sha256":"4f8a94db7fded57e4c2f1fda01bdb2c5626fdf2985a84300f00cbedf5e676a06","abstract_canon_sha256":"b8f6a859e9f3f711ffcf087e05cbec906b28b8c8110944f6afa045857024c7a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:27.744604Z","signature_b64":"e1BY5zx2BuLlMCv9204NL3cG8WqJwZq3sL4FiLmeOYw0LHcZfbECY6kooJNMRqPooY/4BRiijiy68hA+NfcxBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2b26aa4575ee2cec42a21882dbe5caa4bc70fdb91a23d7cd067d3488958a64d","last_reissued_at":"2026-05-18T03:30:27.743764Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:27.743764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stochastic Combinatorial Optimization via Poisson Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jian Li, Wen Yuan","submitted_at":"2012-11-06T09:12:49Z","abstract_excerpt":"We study several stochastic combinatorial problems, including the expected utility maximization problem, the stochastic knapsack problem and the stochastic bin packing problem. A common technical challenge in these problems is to optimize some function of the sum of a set of random variables. The difficulty is mainly due to the fact that the probability distribution of the sum is the convolution of a set of distributions, which is not an easy objective function to work with. To tackle this difficulty, we introduce the Poisson approximation technique. The technique is based on the Poisson appro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.1149","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1211.1149","created_at":"2026-05-18T03:30:27.743915+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.1149v2","created_at":"2026-05-18T03:30:27.743915+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.1149","created_at":"2026-05-18T03:30:27.743915+00:00"},{"alias_kind":"pith_short_12","alias_value":"2KZGVJCXL3RM","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"2KZGVJCXL3RM5RBK","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"2KZGVJCX","created_at":"2026-05-18T12:26:50.516681+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2KZGVJCXL3RM5RBKEGEC3PS4VJ","json":"https://pith.science/pith/2KZGVJCXL3RM5RBKEGEC3PS4VJ.json","graph_json":"https://pith.science/api/pith-number/2KZGVJCXL3RM5RBKEGEC3PS4VJ/graph.json","events_json":"https://pith.science/api/pith-number/2KZGVJCXL3RM5RBKEGEC3PS4VJ/events.json","paper":"https://pith.science/paper/2KZGVJCX"},"agent_actions":{"view_html":"https://pith.science/pith/2KZGVJCXL3RM5RBKEGEC3PS4VJ","download_json":"https://pith.science/pith/2KZGVJCXL3RM5RBKEGEC3PS4VJ.json","view_paper":"https://pith.science/paper/2KZGVJCX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.1149&json=true","fetch_graph":"https://pith.science/api/pith-number/2KZGVJCXL3RM5RBKEGEC3PS4VJ/graph.json","fetch_events":"https://pith.science/api/pith-number/2KZGVJCXL3RM5RBKEGEC3PS4VJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2KZGVJCXL3RM5RBKEGEC3PS4VJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2KZGVJCXL3RM5RBKEGEC3PS4VJ/action/storage_attestation","attest_author":"https://pith.science/pith/2KZGVJCXL3RM5RBKEGEC3PS4VJ/action/author_attestation","sign_citation":"https://pith.science/pith/2KZGVJCXL3RM5RBKEGEC3PS4VJ/action/citation_signature","submit_replication":"https://pith.science/pith/2KZGVJCXL3RM5RBKEGEC3PS4VJ/action/replication_record"}},"created_at":"2026-05-18T03:30:27.743915+00:00","updated_at":"2026-05-18T03:30:27.743915+00:00"}