{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:EUQE5HTHSJIALZEPBVUTG5A63I","short_pith_number":"pith:EUQE5HTH","schema_version":"1.0","canonical_sha256":"25204e9e67925005e48f0d6933741eda0070b9a5578be7b454954507354f5055","source":{"kind":"arxiv","id":"2501.01716","version":2},"attestation_state":"computed","paper":{"title":"Beyond Non-Degeneracy: Revisiting Certainty Equivalent Heuristic for Online Linear Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG","math.PR"],"primary_cat":"math.OC","authors_text":"Wenjia Wang, Yilun Chen","submitted_at":"2025-01-03T09:21:27Z","abstract_excerpt":"The Certainty Equivalent heuristic (CE) is a widely-used algorithm for various dynamic resource allocation problems in OR and OM. Despite its popularity, existing theoretical guarantees of CE are limited to settings satisfying restrictive fluid regularity conditions, particularly, the non-degeneracy conditions, under the widely held belief that the violation of such conditions leads to performance deterioration and necessitates algorithmic innovation beyond CE.\n  In this work, we conduct a refined performance analysis of CE within the general framework of online linear programming. We show tha"},"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":"2501.01716","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-01-03T09:21:27Z","cross_cats_sorted":["cs.DS","cs.LG","math.PR"],"title_canon_sha256":"6dec806a0023e0649aa2be5fcdae86cd1a3323c984eeb9962aa0fdb95ea5bae6","abstract_canon_sha256":"739748621fc5e746024eb43cfc85b6cbbb93aa9e688a56dbe61e532cb532fcdf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:13:46.030245Z","signature_b64":"LQSxjNE6eiRt57xz/p/0NZwntQdCYW4/sGcRi90AYpUI9UGpO6iyeoVFQ7e4DvYxpHh3cxqpYc528zco2yuWBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25204e9e67925005e48f0d6933741eda0070b9a5578be7b454954507354f5055","last_reissued_at":"2026-07-05T10:13:46.029713Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:13:46.029713Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Beyond Non-Degeneracy: Revisiting Certainty Equivalent Heuristic for Online Linear Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG","math.PR"],"primary_cat":"math.OC","authors_text":"Wenjia Wang, Yilun Chen","submitted_at":"2025-01-03T09:21:27Z","abstract_excerpt":"The Certainty Equivalent heuristic (CE) is a widely-used algorithm for various dynamic resource allocation problems in OR and OM. Despite its popularity, existing theoretical guarantees of CE are limited to settings satisfying restrictive fluid regularity conditions, particularly, the non-degeneracy conditions, under the widely held belief that the violation of such conditions leads to performance deterioration and necessitates algorithmic innovation beyond CE.\n  In this work, we conduct a refined performance analysis of CE within the general framework of online linear programming. We show tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.01716","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2501.01716/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":"2501.01716","created_at":"2026-07-05T10:13:46.029773+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.01716v2","created_at":"2026-07-05T10:13:46.029773+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.01716","created_at":"2026-07-05T10:13:46.029773+00:00"},{"alias_kind":"pith_short_12","alias_value":"EUQE5HTHSJIA","created_at":"2026-07-05T10:13:46.029773+00:00"},{"alias_kind":"pith_short_16","alias_value":"EUQE5HTHSJIALZEP","created_at":"2026-07-05T10:13:46.029773+00:00"},{"alias_kind":"pith_short_8","alias_value":"EUQE5HTH","created_at":"2026-07-05T10:13:46.029773+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.02196","citing_title":"Online Resource Allocation with Continuous Random Consumption: Regret under Degeneracy","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2607.02150","citing_title":"Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates","ref_index":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EUQE5HTHSJIALZEPBVUTG5A63I","json":"https://pith.science/pith/EUQE5HTHSJIALZEPBVUTG5A63I.json","graph_json":"https://pith.science/api/pith-number/EUQE5HTHSJIALZEPBVUTG5A63I/graph.json","events_json":"https://pith.science/api/pith-number/EUQE5HTHSJIALZEPBVUTG5A63I/events.json","paper":"https://pith.science/paper/EUQE5HTH"},"agent_actions":{"view_html":"https://pith.science/pith/EUQE5HTHSJIALZEPBVUTG5A63I","download_json":"https://pith.science/pith/EUQE5HTHSJIALZEPBVUTG5A63I.json","view_paper":"https://pith.science/paper/EUQE5HTH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.01716&json=true","fetch_graph":"https://pith.science/api/pith-number/EUQE5HTHSJIALZEPBVUTG5A63I/graph.json","fetch_events":"https://pith.science/api/pith-number/EUQE5HTHSJIALZEPBVUTG5A63I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EUQE5HTHSJIALZEPBVUTG5A63I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EUQE5HTHSJIALZEPBVUTG5A63I/action/storage_attestation","attest_author":"https://pith.science/pith/EUQE5HTHSJIALZEPBVUTG5A63I/action/author_attestation","sign_citation":"https://pith.science/pith/EUQE5HTHSJIALZEPBVUTG5A63I/action/citation_signature","submit_replication":"https://pith.science/pith/EUQE5HTHSJIALZEPBVUTG5A63I/action/replication_record"}},"created_at":"2026-07-05T10:13:46.029773+00:00","updated_at":"2026-07-05T10:13:46.029773+00:00"}