{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:W4PARGGEMGZ65MO6SYA3HIK2VZ","short_pith_number":"pith:W4PARGGE","canonical_record":{"source":{"id":"2409.00075","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-08-24T07:20:29Z","cross_cats_sorted":[],"title_canon_sha256":"8fb905e323831d0dfda44477c66b188a086d1274e52532727e20ad2ac091ef6e","abstract_canon_sha256":"c04a7e2c8cebd6a311d2a582ae763e920ff0543827c5ea6d1fe65c2f79a182ce"},"schema_version":"1.0"},"canonical_sha256":"b71e0898c461b3eeb1de9601b3a15aae7954ab969af748e8c40d0144603d9a9e","source":{"kind":"arxiv","id":"2409.00075","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.00075","created_at":"2026-07-05T09:01:40Z"},{"alias_kind":"arxiv_version","alias_value":"2409.00075v1","created_at":"2026-07-05T09:01:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.00075","created_at":"2026-07-05T09:01:40Z"},{"alias_kind":"pith_short_12","alias_value":"W4PARGGEMGZ6","created_at":"2026-07-05T09:01:40Z"},{"alias_kind":"pith_short_16","alias_value":"W4PARGGEMGZ65MO6","created_at":"2026-07-05T09:01:40Z"},{"alias_kind":"pith_short_8","alias_value":"W4PARGGE","created_at":"2026-07-05T09:01:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:W4PARGGEMGZ65MO6SYA3HIK2VZ","target":"record","payload":{"canonical_record":{"source":{"id":"2409.00075","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-08-24T07:20:29Z","cross_cats_sorted":[],"title_canon_sha256":"8fb905e323831d0dfda44477c66b188a086d1274e52532727e20ad2ac091ef6e","abstract_canon_sha256":"c04a7e2c8cebd6a311d2a582ae763e920ff0543827c5ea6d1fe65c2f79a182ce"},"schema_version":"1.0"},"canonical_sha256":"b71e0898c461b3eeb1de9601b3a15aae7954ab969af748e8c40d0144603d9a9e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:01:40.524699Z","signature_b64":"UzXqvDIPX+gbPpUViMGRrmMWyqTK1pOCYgdaiwaS5nYOL07pkNG1611Dbo0wv/4XgVFbFNKS2ZYyA9i9E3u1Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b71e0898c461b3eeb1de9601b3a15aae7954ab969af748e8c40d0144603d9a9e","last_reissued_at":"2026-07-05T09:01:40.524367Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:01:40.524367Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2409.00075","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-07-05T09:01:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E4z+VmhT/CQ0qsZWvIXHZq8ArmvkDA342Wn1qUKEOYdq6FDHShv0dorEjmbiWyfC+RSJNM7t9nO/Wt0y4KA6CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T13:07:27.308051Z"},"content_sha256":"bde702a66171aa3830f246c03fa0a954abf36c7549faeb3642c7c8d2a6fe030e","schema_version":"1.0","event_id":"sha256:bde702a66171aa3830f246c03fa0a954abf36c7549faeb3642c7c8d2a6fe030e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:W4PARGGEMGZ65MO6SYA3HIK2VZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A survey on combinatorial optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Phuong Le","submitted_at":"2024-08-24T07:20:29Z","abstract_excerpt":"This survey revisits classical combinatorial optimization algorithms and extends them to two-stage stochastic models, particularly focusing on client-element problems. We reformulate these problems to optimize element selection under uncertainty and present two key sampling algorithms: SSA and Boost-and-Sample, highlighting their performance guarantees. Additionally, we explore correlation-robust optimization, introducing the concept of the correlation gap, which enables approximations using independent distributions with minimal accuracy loss. This survey analyzes and presents foundational co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.00075","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2409.00075/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T09:01:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BfxJIP9bcHYeYcuF2qrVWrmDAfW/dd6DyOqml8NLXkXIaOC53h/qmYFrVs1ns5JAjJ44t6HY8FVZlfngCz8UCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T13:07:27.308536Z"},"content_sha256":"6525a5a4d36fd3e0a20ee3a6c5f4649e4dab9df28e29eff3f510fd246b4f6fa1","schema_version":"1.0","event_id":"sha256:6525a5a4d36fd3e0a20ee3a6c5f4649e4dab9df28e29eff3f510fd246b4f6fa1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W4PARGGEMGZ65MO6SYA3HIK2VZ/bundle.json","state_url":"https://pith.science/pith/W4PARGGEMGZ65MO6SYA3HIK2VZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W4PARGGEMGZ65MO6SYA3HIK2VZ/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-08-09T13:07:27Z","links":{"resolver":"https://pith.science/pith/W4PARGGEMGZ65MO6SYA3HIK2VZ","bundle":"https://pith.science/pith/W4PARGGEMGZ65MO6SYA3HIK2VZ/bundle.json","state":"https://pith.science/pith/W4PARGGEMGZ65MO6SYA3HIK2VZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W4PARGGEMGZ65MO6SYA3HIK2VZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:W4PARGGEMGZ65MO6SYA3HIK2VZ","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":"c04a7e2c8cebd6a311d2a582ae763e920ff0543827c5ea6d1fe65c2f79a182ce","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-08-24T07:20:29Z","title_canon_sha256":"8fb905e323831d0dfda44477c66b188a086d1274e52532727e20ad2ac091ef6e"},"schema_version":"1.0","source":{"id":"2409.00075","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.00075","created_at":"2026-07-05T09:01:40Z"},{"alias_kind":"arxiv_version","alias_value":"2409.00075v1","created_at":"2026-07-05T09:01:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.00075","created_at":"2026-07-05T09:01:40Z"},{"alias_kind":"pith_short_12","alias_value":"W4PARGGEMGZ6","created_at":"2026-07-05T09:01:40Z"},{"alias_kind":"pith_short_16","alias_value":"W4PARGGEMGZ65MO6","created_at":"2026-07-05T09:01:40Z"},{"alias_kind":"pith_short_8","alias_value":"W4PARGGE","created_at":"2026-07-05T09:01:40Z"}],"graph_snapshots":[{"event_id":"sha256:6525a5a4d36fd3e0a20ee3a6c5f4649e4dab9df28e29eff3f510fd246b4f6fa1","target":"graph","created_at":"2026-07-05T09:01:40Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2409.00075/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This survey revisits classical combinatorial optimization algorithms and extends them to two-stage stochastic models, particularly focusing on client-element problems. We reformulate these problems to optimize element selection under uncertainty and present two key sampling algorithms: SSA and Boost-and-Sample, highlighting their performance guarantees. Additionally, we explore correlation-robust optimization, introducing the concept of the correlation gap, which enables approximations using independent distributions with minimal accuracy loss. This survey analyzes and presents foundational co","authors_text":"Phuong Le","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-08-24T07:20:29Z","title":"A survey on combinatorial optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.00075","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:bde702a66171aa3830f246c03fa0a954abf36c7549faeb3642c7c8d2a6fe030e","target":"record","created_at":"2026-07-05T09:01:40Z","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":"c04a7e2c8cebd6a311d2a582ae763e920ff0543827c5ea6d1fe65c2f79a182ce","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-08-24T07:20:29Z","title_canon_sha256":"8fb905e323831d0dfda44477c66b188a086d1274e52532727e20ad2ac091ef6e"},"schema_version":"1.0","source":{"id":"2409.00075","kind":"arxiv","version":1}},"canonical_sha256":"b71e0898c461b3eeb1de9601b3a15aae7954ab969af748e8c40d0144603d9a9e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b71e0898c461b3eeb1de9601b3a15aae7954ab969af748e8c40d0144603d9a9e","first_computed_at":"2026-07-05T09:01:40.524367Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:01:40.524367Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UzXqvDIPX+gbPpUViMGRrmMWyqTK1pOCYgdaiwaS5nYOL07pkNG1611Dbo0wv/4XgVFbFNKS2ZYyA9i9E3u1Dw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:01:40.524699Z","signed_message":"canonical_sha256_bytes"},"source_id":"2409.00075","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bde702a66171aa3830f246c03fa0a954abf36c7549faeb3642c7c8d2a6fe030e","sha256:6525a5a4d36fd3e0a20ee3a6c5f4649e4dab9df28e29eff3f510fd246b4f6fa1"],"state_sha256":"e716b2396d7e93a9f546eaee6573489c05dd3540e567d7c0e54d51d82386ff1d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lLwE6MNqerQLTmjrZ2CYupA/3LEKiWA7+27JqmlWl/wgxOLC/Ak/3rraajbLpLSLWbfhc3AQ9vxf+I36smAxDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T13:07:27.312334Z","bundle_sha256":"a7c975e679bbc35ac36ed498780c6f751badef5adc705530a9b0fa13b98306c8"}}