{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:V4F3YYJYLPCTNXBHRP3IUTQWHQ","short_pith_number":"pith:V4F3YYJY","schema_version":"1.0","canonical_sha256":"af0bbc61385bc536dc278bf68a4e163c2cd80e5ec741461accfda94f69a141fd","source":{"kind":"arxiv","id":"2209.00399","version":2},"attestation_state":"computed","paper":{"title":"Optimal Regularized Online Allocation by Adaptive Re-Solving","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT","math.OC"],"primary_cat":"cs.LG","authors_text":"Danny H.K. Tsang, Dong Xia, Wanteng Ma, Ying Cao","submitted_at":"2022-09-01T12:23:26Z","abstract_excerpt":"This paper introduces a dual-based algorithm framework for solving the regularized online resource allocation problems, which have potentially non-concave cumulative rewards, hard resource constraints, and a non-separable regularizer. Under a strategy of adaptively updating the resource constraints, the proposed framework only requests approximate solutions to the empirical dual problems up to a certain accuracy and yet delivers an optimal logarithmic regret under a locally second-order growth condition. Surprisingly, a delicate analysis of the dual objective function enables us to eliminate t"},"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":"2209.00399","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-09-01T12:23:26Z","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"title_canon_sha256":"4884229ea4037f211853bce8a345277a7dd4a19a3ca3562d8486d5359df33449","abstract_canon_sha256":"6401b631cf5273598ec46c75340747302c30c3c2de928baa2c3851f857ba5c3a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:31:05.219013Z","signature_b64":"ue8+KkZxqQ9/rxkSciHam+N5NfivHv44MjdsWIHoeOzMJbTGHUtmbgVAfKADiVrt0rLf+QiiAp6ztYy0zXLVAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af0bbc61385bc536dc278bf68a4e163c2cd80e5ec741461accfda94f69a141fd","last_reissued_at":"2026-07-05T06:31:05.218494Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:31:05.218494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Regularized Online Allocation by Adaptive Re-Solving","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT","math.OC"],"primary_cat":"cs.LG","authors_text":"Danny H.K. Tsang, Dong Xia, Wanteng Ma, Ying Cao","submitted_at":"2022-09-01T12:23:26Z","abstract_excerpt":"This paper introduces a dual-based algorithm framework for solving the regularized online resource allocation problems, which have potentially non-concave cumulative rewards, hard resource constraints, and a non-separable regularizer. Under a strategy of adaptively updating the resource constraints, the proposed framework only requests approximate solutions to the empirical dual problems up to a certain accuracy and yet delivers an optimal logarithmic regret under a locally second-order growth condition. Surprisingly, a delicate analysis of the dual objective function enables us to eliminate t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.00399","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/2209.00399/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":"2209.00399","created_at":"2026-07-05T06:31:05.218561+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.00399v2","created_at":"2026-07-05T06:31:05.218561+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.00399","created_at":"2026-07-05T06:31:05.218561+00:00"},{"alias_kind":"pith_short_12","alias_value":"V4F3YYJYLPCT","created_at":"2026-07-05T06:31:05.218561+00:00"},{"alias_kind":"pith_short_16","alias_value":"V4F3YYJYLPCTNXBH","created_at":"2026-07-05T06:31:05.218561+00:00"},{"alias_kind":"pith_short_8","alias_value":"V4F3YYJY","created_at":"2026-07-05T06:31:05.218561+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.12037","citing_title":"Adaptive Resolving Methods for Reinforcement Learning with Function Approximations","ref_index":40,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/V4F3YYJYLPCTNXBHRP3IUTQWHQ","json":"https://pith.science/pith/V4F3YYJYLPCTNXBHRP3IUTQWHQ.json","graph_json":"https://pith.science/api/pith-number/V4F3YYJYLPCTNXBHRP3IUTQWHQ/graph.json","events_json":"https://pith.science/api/pith-number/V4F3YYJYLPCTNXBHRP3IUTQWHQ/events.json","paper":"https://pith.science/paper/V4F3YYJY"},"agent_actions":{"view_html":"https://pith.science/pith/V4F3YYJYLPCTNXBHRP3IUTQWHQ","download_json":"https://pith.science/pith/V4F3YYJYLPCTNXBHRP3IUTQWHQ.json","view_paper":"https://pith.science/paper/V4F3YYJY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.00399&json=true","fetch_graph":"https://pith.science/api/pith-number/V4F3YYJYLPCTNXBHRP3IUTQWHQ/graph.json","fetch_events":"https://pith.science/api/pith-number/V4F3YYJYLPCTNXBHRP3IUTQWHQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V4F3YYJYLPCTNXBHRP3IUTQWHQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V4F3YYJYLPCTNXBHRP3IUTQWHQ/action/storage_attestation","attest_author":"https://pith.science/pith/V4F3YYJYLPCTNXBHRP3IUTQWHQ/action/author_attestation","sign_citation":"https://pith.science/pith/V4F3YYJYLPCTNXBHRP3IUTQWHQ/action/citation_signature","submit_replication":"https://pith.science/pith/V4F3YYJYLPCTNXBHRP3IUTQWHQ/action/replication_record"}},"created_at":"2026-07-05T06:31:05.218561+00:00","updated_at":"2026-07-05T06:31:05.218561+00:00"}