{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:W4PARGGEMGZ65MO6SYA3HIK2VZ","short_pith_number":"pith:W4PARGGE","schema_version":"1.0","canonical_sha256":"b71e0898c461b3eeb1de9601b3a15aae7954ab969af748e8c40d0144603d9a9e","source":{"kind":"arxiv","id":"2409.00075","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2409.00075","created_at":"2026-07-05T09:01:40.524420+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.00075v1","created_at":"2026-07-05T09:01:40.524420+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.00075","created_at":"2026-07-05T09:01:40.524420+00:00"},{"alias_kind":"pith_short_12","alias_value":"W4PARGGEMGZ6","created_at":"2026-07-05T09:01:40.524420+00:00"},{"alias_kind":"pith_short_16","alias_value":"W4PARGGEMGZ65MO6","created_at":"2026-07-05T09:01:40.524420+00:00"},{"alias_kind":"pith_short_8","alias_value":"W4PARGGE","created_at":"2026-07-05T09:01:40.524420+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.05981","citing_title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/W4PARGGEMGZ65MO6SYA3HIK2VZ","json":"https://pith.science/pith/W4PARGGEMGZ65MO6SYA3HIK2VZ.json","graph_json":"https://pith.science/api/pith-number/W4PARGGEMGZ65MO6SYA3HIK2VZ/graph.json","events_json":"https://pith.science/api/pith-number/W4PARGGEMGZ65MO6SYA3HIK2VZ/events.json","paper":"https://pith.science/paper/W4PARGGE"},"agent_actions":{"view_html":"https://pith.science/pith/W4PARGGEMGZ65MO6SYA3HIK2VZ","download_json":"https://pith.science/pith/W4PARGGEMGZ65MO6SYA3HIK2VZ.json","view_paper":"https://pith.science/paper/W4PARGGE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.00075&json=true","fetch_graph":"https://pith.science/api/pith-number/W4PARGGEMGZ65MO6SYA3HIK2VZ/graph.json","fetch_events":"https://pith.science/api/pith-number/W4PARGGEMGZ65MO6SYA3HIK2VZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W4PARGGEMGZ65MO6SYA3HIK2VZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W4PARGGEMGZ65MO6SYA3HIK2VZ/action/storage_attestation","attest_author":"https://pith.science/pith/W4PARGGEMGZ65MO6SYA3HIK2VZ/action/author_attestation","sign_citation":"https://pith.science/pith/W4PARGGEMGZ65MO6SYA3HIK2VZ/action/citation_signature","submit_replication":"https://pith.science/pith/W4PARGGEMGZ65MO6SYA3HIK2VZ/action/replication_record"}},"created_at":"2026-07-05T09:01:40.524420+00:00","updated_at":"2026-07-05T09:01:40.524420+00:00"}