{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:DFOPF6456TGFSHB4EKW2S6AG4S","short_pith_number":"pith:DFOPF645","schema_version":"1.0","canonical_sha256":"195cf2fb9df4cc591c3c22ada97806e49a419e0280b50cf0dccaded4b00396fd","source":{"kind":"arxiv","id":"2401.07051","version":1},"attestation_state":"computed","paper":{"title":"COIN: Chance-Constrained Imitation Learning for Uncertainty-aware Adaptive Resource Oversubscription Policy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Bo Qiao, Chao Duo, Chetan Bansal, Dongmei Zhang, Fangkai Yang, Hang Dong, Lu Wang, Mayukh Das, Qingwei Lin, Qi Zhang, Saravan Rajmohan, Si Qin","submitted_at":"2024-01-13T11:43:25Z","abstract_excerpt":"We address the challenge of learning safe and robust decision policies in presence of uncertainty in context of the real scientific problem of adaptive resource oversubscription to enhance resource efficiency while ensuring safety against resource congestion risk.\n  Traditional supervised prediction or forecasting models are ineffective in learning adaptive policies whereas standard online optimization or reinforcement learning is difficult to deploy on real systems. Offline methods such as imitation learning (IL) are ideal since we can directly leverage historical resource usage telemetry. Bu"},"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":"2401.07051","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-01-13T11:43:25Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"c9af4bac2db291695009d8fd2a3f3a7673ee2df52e36d10fd3f4cb5383f469b8","abstract_canon_sha256":"e2bd14e10c2754c4e0817f75eb929500c9e1959209069102ee05fc5270283a16"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:33:30.553722Z","signature_b64":"Zm+DzLS757q+TSBESddfDmeBogZnkGIkgw9/xyPWuhYXf/8K7lqDETrjEy2rFqrMzkx4L23DM6bxFG/e5wCyAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"195cf2fb9df4cc591c3c22ada97806e49a419e0280b50cf0dccaded4b00396fd","last_reissued_at":"2026-07-05T07:33:30.553289Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:33:30.553289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"COIN: Chance-Constrained Imitation Learning for Uncertainty-aware Adaptive Resource Oversubscription Policy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Bo Qiao, Chao Duo, Chetan Bansal, Dongmei Zhang, Fangkai Yang, Hang Dong, Lu Wang, Mayukh Das, Qingwei Lin, Qi Zhang, Saravan Rajmohan, Si Qin","submitted_at":"2024-01-13T11:43:25Z","abstract_excerpt":"We address the challenge of learning safe and robust decision policies in presence of uncertainty in context of the real scientific problem of adaptive resource oversubscription to enhance resource efficiency while ensuring safety against resource congestion risk.\n  Traditional supervised prediction or forecasting models are ineffective in learning adaptive policies whereas standard online optimization or reinforcement learning is difficult to deploy on real systems. Offline methods such as imitation learning (IL) are ideal since we can directly leverage historical resource usage telemetry. Bu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.07051","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/2401.07051/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":"2401.07051","created_at":"2026-07-05T07:33:30.553359+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.07051v1","created_at":"2026-07-05T07:33:30.553359+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.07051","created_at":"2026-07-05T07:33:30.553359+00:00"},{"alias_kind":"pith_short_12","alias_value":"DFOPF6456TGF","created_at":"2026-07-05T07:33:30.553359+00:00"},{"alias_kind":"pith_short_16","alias_value":"DFOPF6456TGFSHB4","created_at":"2026-07-05T07:33:30.553359+00:00"},{"alias_kind":"pith_short_8","alias_value":"DFOPF645","created_at":"2026-07-05T07:33:30.553359+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.12327","citing_title":"Robust Planning for Autonomous Driving via Mixed Adversarial Diffusion Predictions","ref_index":20,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DFOPF6456TGFSHB4EKW2S6AG4S","json":"https://pith.science/pith/DFOPF6456TGFSHB4EKW2S6AG4S.json","graph_json":"https://pith.science/api/pith-number/DFOPF6456TGFSHB4EKW2S6AG4S/graph.json","events_json":"https://pith.science/api/pith-number/DFOPF6456TGFSHB4EKW2S6AG4S/events.json","paper":"https://pith.science/paper/DFOPF645"},"agent_actions":{"view_html":"https://pith.science/pith/DFOPF6456TGFSHB4EKW2S6AG4S","download_json":"https://pith.science/pith/DFOPF6456TGFSHB4EKW2S6AG4S.json","view_paper":"https://pith.science/paper/DFOPF645","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.07051&json=true","fetch_graph":"https://pith.science/api/pith-number/DFOPF6456TGFSHB4EKW2S6AG4S/graph.json","fetch_events":"https://pith.science/api/pith-number/DFOPF6456TGFSHB4EKW2S6AG4S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DFOPF6456TGFSHB4EKW2S6AG4S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DFOPF6456TGFSHB4EKW2S6AG4S/action/storage_attestation","attest_author":"https://pith.science/pith/DFOPF6456TGFSHB4EKW2S6AG4S/action/author_attestation","sign_citation":"https://pith.science/pith/DFOPF6456TGFSHB4EKW2S6AG4S/action/citation_signature","submit_replication":"https://pith.science/pith/DFOPF6456TGFSHB4EKW2S6AG4S/action/replication_record"}},"created_at":"2026-07-05T07:33:30.553359+00:00","updated_at":"2026-07-05T07:33:30.553359+00:00"}