{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:VHTPS3IPVRFSKWPUJU3K3LQEEG","short_pith_number":"pith:VHTPS3IP","schema_version":"1.0","canonical_sha256":"a9e6f96d0fac4b2559f44d36adae0421b5bdb1efb1a3f2e44a2d2336d870c887","source":{"kind":"arxiv","id":"2402.14012","version":2},"attestation_state":"computed","paper":{"title":"Chasing Convex Functions with Long-term Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Adam Lechowicz, Adam Wierman, Bo Sun, Mohammad Hajiesmaili, Nicolas Christianson, Noman Bashir, Prashant Shenoy","submitted_at":"2024-02-21T18:51:42Z","abstract_excerpt":"We introduce and study a family of online metric problems with long-term constraints. In these problems, an online player makes decisions $\\mathbf{x}_t$ in a metric space $(X,d)$ to simultaneously minimize their hitting cost $f_t(\\mathbf{x}_t)$ and switching cost as determined by the metric. Over the time horizon $T$, the player must satisfy a long-term demand constraint $\\sum_{t} c(\\mathbf{x}_t) \\geq 1$, where $c(\\mathbf{x}_t)$ denotes the fraction of demand satisfied at time $t$. Such problems can find a wide array of applications to online resource allocation in sustainable energy/computing"},"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":"2402.14012","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-02-21T18:51:42Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"cc9ba48b883e8b5f526df11a43e6124d98e9c7fdf03a98c8262d901f598c6197","abstract_canon_sha256":"5dcff98984d1406ada14538840c95cbe319457a3a3449b47864450dc8a05669d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:43:08.591751Z","signature_b64":"NebLq3ClLWVRiBtltihQQS5KSqFAM1LXVliN2mxo95ED4iq01vRuoMpLEGRpNoOebqxeHZcxiyRmLmDnZMm/DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9e6f96d0fac4b2559f44d36adae0421b5bdb1efb1a3f2e44a2d2336d870c887","last_reissued_at":"2026-07-05T08:43:08.591273Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:43:08.591273Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Chasing Convex Functions with Long-term Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Adam Lechowicz, Adam Wierman, Bo Sun, Mohammad Hajiesmaili, Nicolas Christianson, Noman Bashir, Prashant Shenoy","submitted_at":"2024-02-21T18:51:42Z","abstract_excerpt":"We introduce and study a family of online metric problems with long-term constraints. In these problems, an online player makes decisions $\\mathbf{x}_t$ in a metric space $(X,d)$ to simultaneously minimize their hitting cost $f_t(\\mathbf{x}_t)$ and switching cost as determined by the metric. Over the time horizon $T$, the player must satisfy a long-term demand constraint $\\sum_{t} c(\\mathbf{x}_t) \\geq 1$, where $c(\\mathbf{x}_t)$ denotes the fraction of demand satisfied at time $t$. Such problems can find a wide array of applications to online resource allocation in sustainable energy/computing"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.14012","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/2402.14012/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":"2402.14012","created_at":"2026-07-05T08:43:08.591345+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.14012v2","created_at":"2026-07-05T08:43:08.591345+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.14012","created_at":"2026-07-05T08:43:08.591345+00:00"},{"alias_kind":"pith_short_12","alias_value":"VHTPS3IPVRFS","created_at":"2026-07-05T08:43:08.591345+00:00"},{"alias_kind":"pith_short_16","alias_value":"VHTPS3IPVRFSKWPU","created_at":"2026-07-05T08:43:08.591345+00:00"},{"alias_kind":"pith_short_8","alias_value":"VHTPS3IP","created_at":"2026-07-05T08:43:08.591345+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VHTPS3IPVRFSKWPUJU3K3LQEEG","json":"https://pith.science/pith/VHTPS3IPVRFSKWPUJU3K3LQEEG.json","graph_json":"https://pith.science/api/pith-number/VHTPS3IPVRFSKWPUJU3K3LQEEG/graph.json","events_json":"https://pith.science/api/pith-number/VHTPS3IPVRFSKWPUJU3K3LQEEG/events.json","paper":"https://pith.science/paper/VHTPS3IP"},"agent_actions":{"view_html":"https://pith.science/pith/VHTPS3IPVRFSKWPUJU3K3LQEEG","download_json":"https://pith.science/pith/VHTPS3IPVRFSKWPUJU3K3LQEEG.json","view_paper":"https://pith.science/paper/VHTPS3IP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.14012&json=true","fetch_graph":"https://pith.science/api/pith-number/VHTPS3IPVRFSKWPUJU3K3LQEEG/graph.json","fetch_events":"https://pith.science/api/pith-number/VHTPS3IPVRFSKWPUJU3K3LQEEG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VHTPS3IPVRFSKWPUJU3K3LQEEG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VHTPS3IPVRFSKWPUJU3K3LQEEG/action/storage_attestation","attest_author":"https://pith.science/pith/VHTPS3IPVRFSKWPUJU3K3LQEEG/action/author_attestation","sign_citation":"https://pith.science/pith/VHTPS3IPVRFSKWPUJU3K3LQEEG/action/citation_signature","submit_replication":"https://pith.science/pith/VHTPS3IPVRFSKWPUJU3K3LQEEG/action/replication_record"}},"created_at":"2026-07-05T08:43:08.591345+00:00","updated_at":"2026-07-05T08:43:08.591345+00:00"}