{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:W22UFSFZPON23QWGX2TI2SIT6G","short_pith_number":"pith:W22UFSFZ","schema_version":"1.0","canonical_sha256":"b6b542c8b97b9badc2c6bea68d4913f1a6cc6ee6c2ecabff16d9d48a90ea4eac","source":{"kind":"arxiv","id":"2606.15501","version":2},"attestation_state":"computed","paper":{"title":"Modern Primal-Dual Frameworks for Prior-Free Online Resource Allocation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Rad Niazadeh, Rajan Udwani","submitted_at":"2026-06-13T23:12:38Z","abstract_excerpt":"Linear-programming (LP)-based primal-dual methods are fundamental for designing and analyzing algorithms in adversarial (prior-free) online resource allocation. This chapter provides a tutorial on two modern primal-dual frameworks, emphasizing recent developments and contemporary models in operations research. Part~I develops an LP-based convex-programming framework where solving a regularized convex program at each arrival captures the tradeoff between greediness and hedging, yielding a dual certificate via Karush-Kuhn-Tucker (KKT) conditions. Because standard LP relaxations can be weak or in"},"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":"2606.15501","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-06-13T23:12:38Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"99f416c7d667d12f8542db0eb7d6c6c0f7318b95659e9f2227ddc4e873d03522","abstract_canon_sha256":"09aa52e75b985ba54f07759c0f0cd181e9f3905a8b61dc7115ae20de08be7002"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T02:13:26.476954Z","signature_b64":"3T2q0/ZFZyk0E+mILZbo7Ew0ML29S3r0cDPzjcHXeRvhq3I5um/WRVHtewFe7Tbq6D43QicO21s9Ak9CsAdEBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6b542c8b97b9badc2c6bea68d4913f1a6cc6ee6c2ecabff16d9d48a90ea4eac","last_reissued_at":"2026-06-23T02:13:26.476443Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T02:13:26.476443Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Modern Primal-Dual Frameworks for Prior-Free Online Resource Allocation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Rad Niazadeh, Rajan Udwani","submitted_at":"2026-06-13T23:12:38Z","abstract_excerpt":"Linear-programming (LP)-based primal-dual methods are fundamental for designing and analyzing algorithms in adversarial (prior-free) online resource allocation. This chapter provides a tutorial on two modern primal-dual frameworks, emphasizing recent developments and contemporary models in operations research. Part~I develops an LP-based convex-programming framework where solving a regularized convex program at each arrival captures the tradeoff between greediness and hedging, yielding a dual certificate via Karush-Kuhn-Tucker (KKT) conditions. Because standard LP relaxations can be weak or in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.15501","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/2606.15501/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":"2606.15501","created_at":"2026-06-23T02:13:26.476500+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.15501v2","created_at":"2026-06-23T02:13:26.476500+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.15501","created_at":"2026-06-23T02:13:26.476500+00:00"},{"alias_kind":"pith_short_12","alias_value":"W22UFSFZPON2","created_at":"2026-06-23T02:13:26.476500+00:00"},{"alias_kind":"pith_short_16","alias_value":"W22UFSFZPON23QWG","created_at":"2026-06-23T02:13:26.476500+00:00"},{"alias_kind":"pith_short_8","alias_value":"W22UFSFZ","created_at":"2026-06-23T02:13:26.476500+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/W22UFSFZPON23QWGX2TI2SIT6G","json":"https://pith.science/pith/W22UFSFZPON23QWGX2TI2SIT6G.json","graph_json":"https://pith.science/api/pith-number/W22UFSFZPON23QWGX2TI2SIT6G/graph.json","events_json":"https://pith.science/api/pith-number/W22UFSFZPON23QWGX2TI2SIT6G/events.json","paper":"https://pith.science/paper/W22UFSFZ"},"agent_actions":{"view_html":"https://pith.science/pith/W22UFSFZPON23QWGX2TI2SIT6G","download_json":"https://pith.science/pith/W22UFSFZPON23QWGX2TI2SIT6G.json","view_paper":"https://pith.science/paper/W22UFSFZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.15501&json=true","fetch_graph":"https://pith.science/api/pith-number/W22UFSFZPON23QWGX2TI2SIT6G/graph.json","fetch_events":"https://pith.science/api/pith-number/W22UFSFZPON23QWGX2TI2SIT6G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W22UFSFZPON23QWGX2TI2SIT6G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W22UFSFZPON23QWGX2TI2SIT6G/action/storage_attestation","attest_author":"https://pith.science/pith/W22UFSFZPON23QWGX2TI2SIT6G/action/author_attestation","sign_citation":"https://pith.science/pith/W22UFSFZPON23QWGX2TI2SIT6G/action/citation_signature","submit_replication":"https://pith.science/pith/W22UFSFZPON23QWGX2TI2SIT6G/action/replication_record"}},"created_at":"2026-06-23T02:13:26.476500+00:00","updated_at":"2026-06-23T02:13:26.476500+00:00"}