{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:KR3LC7PZH64HW2UI2MIXWQVHG3","short_pith_number":"pith:KR3LC7PZ","schema_version":"1.0","canonical_sha256":"5476b17df93fb87b6a88d3117b42a736d5bc3d95be6457bab36382861881aaf8","source":{"kind":"arxiv","id":"1308.5444","version":1},"attestation_state":"computed","paper":{"title":"A Unified Approach to Online Allocation Algorithms via Randomized Dual Fitting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Rad Niazadeh, Robert D. Kleinberg","submitted_at":"2013-08-25T20:14:08Z","abstract_excerpt":"We present a unified framework for designing and analyzing algorithms for online budgeted allocation problems (including online matching) and their generalization, the Online Generalized Assignment Problem (OnGAP). These problems have been intensively studied as models of how to allocate impressions for online advertising. In contrast to previous analyses of online budgeted allocation algorithms (the so-called \"balance\" or \"water-filling\" family of algorithms) our analysis is based on the method of randomized dual fitting, analogous to the recent analysis of the RANKING algorithm for online ma"},"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":"1308.5444","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-25T20:14:08Z","cross_cats_sorted":[],"title_canon_sha256":"b3deaf674c03fc4ed4625e3da1e2eb4076df90fdef8e7edc7aadddad5b278f2f","abstract_canon_sha256":"4b810385b019fa842d75bb28ea03d9200e9a28c73ed72f861100ca5f1c450b06"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:04.612610Z","signature_b64":"gwcvXq3bBbxqtdUQm9D0KZmSY6Z0VAfZQjzndFxMq0cO8UTS2nTLw2yWgiKcNFLa73JotB2nuP5waLAOolhOCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5476b17df93fb87b6a88d3117b42a736d5bc3d95be6457bab36382861881aaf8","last_reissued_at":"2026-05-18T03:15:04.611773Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:04.611773Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Unified Approach to Online Allocation Algorithms via Randomized Dual Fitting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Rad Niazadeh, Robert D. Kleinberg","submitted_at":"2013-08-25T20:14:08Z","abstract_excerpt":"We present a unified framework for designing and analyzing algorithms for online budgeted allocation problems (including online matching) and their generalization, the Online Generalized Assignment Problem (OnGAP). These problems have been intensively studied as models of how to allocate impressions for online advertising. In contrast to previous analyses of online budgeted allocation algorithms (the so-called \"balance\" or \"water-filling\" family of algorithms) our analysis is based on the method of randomized dual fitting, analogous to the recent analysis of the RANKING algorithm for online ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.5444","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":""},"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":"1308.5444","created_at":"2026-05-18T03:15:04.611897+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.5444v1","created_at":"2026-05-18T03:15:04.611897+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.5444","created_at":"2026-05-18T03:15:04.611897+00:00"},{"alias_kind":"pith_short_12","alias_value":"KR3LC7PZH64H","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"KR3LC7PZH64HW2UI","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"KR3LC7PZ","created_at":"2026-05-18T12:27:51.066281+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/KR3LC7PZH64HW2UI2MIXWQVHG3","json":"https://pith.science/pith/KR3LC7PZH64HW2UI2MIXWQVHG3.json","graph_json":"https://pith.science/api/pith-number/KR3LC7PZH64HW2UI2MIXWQVHG3/graph.json","events_json":"https://pith.science/api/pith-number/KR3LC7PZH64HW2UI2MIXWQVHG3/events.json","paper":"https://pith.science/paper/KR3LC7PZ"},"agent_actions":{"view_html":"https://pith.science/pith/KR3LC7PZH64HW2UI2MIXWQVHG3","download_json":"https://pith.science/pith/KR3LC7PZH64HW2UI2MIXWQVHG3.json","view_paper":"https://pith.science/paper/KR3LC7PZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.5444&json=true","fetch_graph":"https://pith.science/api/pith-number/KR3LC7PZH64HW2UI2MIXWQVHG3/graph.json","fetch_events":"https://pith.science/api/pith-number/KR3LC7PZH64HW2UI2MIXWQVHG3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KR3LC7PZH64HW2UI2MIXWQVHG3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KR3LC7PZH64HW2UI2MIXWQVHG3/action/storage_attestation","attest_author":"https://pith.science/pith/KR3LC7PZH64HW2UI2MIXWQVHG3/action/author_attestation","sign_citation":"https://pith.science/pith/KR3LC7PZH64HW2UI2MIXWQVHG3/action/citation_signature","submit_replication":"https://pith.science/pith/KR3LC7PZH64HW2UI2MIXWQVHG3/action/replication_record"}},"created_at":"2026-05-18T03:15:04.611897+00:00","updated_at":"2026-05-18T03:15:04.611897+00:00"}