{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:2VVXUUBL3JWJDH5MCPW2HZUSAH","short_pith_number":"pith:2VVXUUBL","schema_version":"1.0","canonical_sha256":"d56b7a502bda6c919fac13eda3e69201c7844159e11d1864f5ca77ac2b3f9d62","source":{"kind":"arxiv","id":"2306.17054","version":2},"attestation_state":"computed","paper":{"title":"Learning-based Two-tiered Online Optimization of Region-wide Datacenter Resource Allocation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Chang-Lin Chen, Chi Zhou, Hanhan Zhou, Hongbo Dong, Jiayu Chen, Mohammad Pedramfar, Neeraj Kumar, Pol Mauri Ruiz, Tian Lan, Vaneet Aggarwal, Zheqing Zhu","submitted_at":"2023-06-29T16:00:06Z","abstract_excerpt":"Online optimization of resource management for large-scale data centers and infrastructures to meet dynamic capacity reservation demands and various practical constraints (e.g., feasibility and robustness) is a very challenging problem. Mixed Integer Programming (MIP) approaches suffer from recognized limitations in such a dynamic environment, while learning-based approaches may face with prohibitively large state/action spaces. To this end, this paper presents a novel two-tiered online optimization to enable a learning-based Resource Allowance System (RAS). To solve optimal server-to-reservat"},"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":"2306.17054","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2023-06-29T16:00:06Z","cross_cats_sorted":[],"title_canon_sha256":"4843ad2a547b9bf9c943a5cf3bd19aa0713b122b938eca0613d5ce2d014b5cb1","abstract_canon_sha256":"eb6ba096a2c109d62656b87327b426d4aa63e5f266d7ff8b5c8b24d93bcf207c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:21:37.600296Z","signature_b64":"ofI01LCH8qqCzHHqYnJyPWe/8k1oD7AfLrFxxWyn2Am4cb8tFQ2oxNeePiu3Xaa2orydyvBAZCS3iD7DSFMcDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d56b7a502bda6c919fac13eda3e69201c7844159e11d1864f5ca77ac2b3f9d62","last_reissued_at":"2026-07-05T09:21:37.599726Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:21:37.599726Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning-based Two-tiered Online Optimization of Region-wide Datacenter Resource Allocation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Chang-Lin Chen, Chi Zhou, Hanhan Zhou, Hongbo Dong, Jiayu Chen, Mohammad Pedramfar, Neeraj Kumar, Pol Mauri Ruiz, Tian Lan, Vaneet Aggarwal, Zheqing Zhu","submitted_at":"2023-06-29T16:00:06Z","abstract_excerpt":"Online optimization of resource management for large-scale data centers and infrastructures to meet dynamic capacity reservation demands and various practical constraints (e.g., feasibility and robustness) is a very challenging problem. Mixed Integer Programming (MIP) approaches suffer from recognized limitations in such a dynamic environment, while learning-based approaches may face with prohibitively large state/action spaces. To this end, this paper presents a novel two-tiered online optimization to enable a learning-based Resource Allowance System (RAS). To solve optimal server-to-reservat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.17054","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/2306.17054/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":"2306.17054","created_at":"2026-07-05T09:21:37.599793+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.17054v2","created_at":"2026-07-05T09:21:37.599793+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.17054","created_at":"2026-07-05T09:21:37.599793+00:00"},{"alias_kind":"pith_short_12","alias_value":"2VVXUUBL3JWJ","created_at":"2026-07-05T09:21:37.599793+00:00"},{"alias_kind":"pith_short_16","alias_value":"2VVXUUBL3JWJDH5M","created_at":"2026-07-05T09:21:37.599793+00:00"},{"alias_kind":"pith_short_8","alias_value":"2VVXUUBL","created_at":"2026-07-05T09:21:37.599793+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.08378","citing_title":"Reinforcement Learning for Scalable and Trustworthy Intelligent Systems","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2VVXUUBL3JWJDH5MCPW2HZUSAH","json":"https://pith.science/pith/2VVXUUBL3JWJDH5MCPW2HZUSAH.json","graph_json":"https://pith.science/api/pith-number/2VVXUUBL3JWJDH5MCPW2HZUSAH/graph.json","events_json":"https://pith.science/api/pith-number/2VVXUUBL3JWJDH5MCPW2HZUSAH/events.json","paper":"https://pith.science/paper/2VVXUUBL"},"agent_actions":{"view_html":"https://pith.science/pith/2VVXUUBL3JWJDH5MCPW2HZUSAH","download_json":"https://pith.science/pith/2VVXUUBL3JWJDH5MCPW2HZUSAH.json","view_paper":"https://pith.science/paper/2VVXUUBL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.17054&json=true","fetch_graph":"https://pith.science/api/pith-number/2VVXUUBL3JWJDH5MCPW2HZUSAH/graph.json","fetch_events":"https://pith.science/api/pith-number/2VVXUUBL3JWJDH5MCPW2HZUSAH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2VVXUUBL3JWJDH5MCPW2HZUSAH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2VVXUUBL3JWJDH5MCPW2HZUSAH/action/storage_attestation","attest_author":"https://pith.science/pith/2VVXUUBL3JWJDH5MCPW2HZUSAH/action/author_attestation","sign_citation":"https://pith.science/pith/2VVXUUBL3JWJDH5MCPW2HZUSAH/action/citation_signature","submit_replication":"https://pith.science/pith/2VVXUUBL3JWJDH5MCPW2HZUSAH/action/replication_record"}},"created_at":"2026-07-05T09:21:37.599793+00:00","updated_at":"2026-07-05T09:21:37.599793+00:00"}