{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:KR3LC7PZH64HW2UI2MIXWQVHG3","short_pith_number":"pith:KR3LC7PZ","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"},"canonical_sha256":"5476b17df93fb87b6a88d3117b42a736d5bc3d95be6457bab36382861881aaf8","source":{"kind":"arxiv","id":"1308.5444","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.5444","created_at":"2026-05-18T03:15:04Z"},{"alias_kind":"arxiv_version","alias_value":"1308.5444v1","created_at":"2026-05-18T03:15:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.5444","created_at":"2026-05-18T03:15:04Z"},{"alias_kind":"pith_short_12","alias_value":"KR3LC7PZH64H","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"KR3LC7PZH64HW2UI","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"KR3LC7PZ","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:KR3LC7PZH64HW2UI2MIXWQVHG3","target":"record","payload":{"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"},"canonical_sha256":"5476b17df93fb87b6a88d3117b42a736d5bc3d95be6457bab36382861881aaf8","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"},"source_kind":"arxiv","source_id":"1308.5444","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:15:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bKlp/QJRHrd+V+NV3QPjOBEhDrYi/9oc+3gmHCv8s5wPMwdWJibiJjk+uWW5hsuG56fGHCLJDpR1F0/a+wGTCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:05:14.714124Z"},"content_sha256":"b342457d7070afa025d3c4edcec07b4d313c8c10f83083176b175433309d1fef","schema_version":"1.0","event_id":"sha256:b342457d7070afa025d3c4edcec07b4d313c8c10f83083176b175433309d1fef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:KR3LC7PZH64HW2UI2MIXWQVHG3","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:15:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7/XN5790n7iVAeXW4cptllJnIsl58D7OpwXOP9lMnE8AoAq6884O6Br/5u+RM8uISvDNQS/7m2g0A3xNM5C6AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:05:14.714482Z"},"content_sha256":"02c94cbe3ce4a9fc062b906ca5b059691e56b8744d391e80283f48a223b1fa9c","schema_version":"1.0","event_id":"sha256:02c94cbe3ce4a9fc062b906ca5b059691e56b8744d391e80283f48a223b1fa9c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KR3LC7PZH64HW2UI2MIXWQVHG3/bundle.json","state_url":"https://pith.science/pith/KR3LC7PZH64HW2UI2MIXWQVHG3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KR3LC7PZH64HW2UI2MIXWQVHG3/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-05T14:05:14Z","links":{"resolver":"https://pith.science/pith/KR3LC7PZH64HW2UI2MIXWQVHG3","bundle":"https://pith.science/pith/KR3LC7PZH64HW2UI2MIXWQVHG3/bundle.json","state":"https://pith.science/pith/KR3LC7PZH64HW2UI2MIXWQVHG3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KR3LC7PZH64HW2UI2MIXWQVHG3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:KR3LC7PZH64HW2UI2MIXWQVHG3","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4b810385b019fa842d75bb28ea03d9200e9a28c73ed72f861100ca5f1c450b06","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-25T20:14:08Z","title_canon_sha256":"b3deaf674c03fc4ed4625e3da1e2eb4076df90fdef8e7edc7aadddad5b278f2f"},"schema_version":"1.0","source":{"id":"1308.5444","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.5444","created_at":"2026-05-18T03:15:04Z"},{"alias_kind":"arxiv_version","alias_value":"1308.5444v1","created_at":"2026-05-18T03:15:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.5444","created_at":"2026-05-18T03:15:04Z"},{"alias_kind":"pith_short_12","alias_value":"KR3LC7PZH64H","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"KR3LC7PZH64HW2UI","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"KR3LC7PZ","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:02c94cbe3ce4a9fc062b906ca5b059691e56b8744d391e80283f48a223b1fa9c","target":"graph","created_at":"2026-05-18T03:15:04Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Rad Niazadeh, Robert D. Kleinberg","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-25T20:14:08Z","title":"A Unified Approach to Online Allocation Algorithms via Randomized Dual Fitting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.5444","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b342457d7070afa025d3c4edcec07b4d313c8c10f83083176b175433309d1fef","target":"record","created_at":"2026-05-18T03:15:04Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"4b810385b019fa842d75bb28ea03d9200e9a28c73ed72f861100ca5f1c450b06","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-25T20:14:08Z","title_canon_sha256":"b3deaf674c03fc4ed4625e3da1e2eb4076df90fdef8e7edc7aadddad5b278f2f"},"schema_version":"1.0","source":{"id":"1308.5444","kind":"arxiv","version":1}},"canonical_sha256":"5476b17df93fb87b6a88d3117b42a736d5bc3d95be6457bab36382861881aaf8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5476b17df93fb87b6a88d3117b42a736d5bc3d95be6457bab36382861881aaf8","first_computed_at":"2026-05-18T03:15:04.611773Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:15:04.611773Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gwcvXq3bBbxqtdUQm9D0KZmSY6Z0VAfZQjzndFxMq0cO8UTS2nTLw2yWgiKcNFLa73JotB2nuP5waLAOolhOCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:15:04.612610Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.5444","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b342457d7070afa025d3c4edcec07b4d313c8c10f83083176b175433309d1fef","sha256:02c94cbe3ce4a9fc062b906ca5b059691e56b8744d391e80283f48a223b1fa9c"],"state_sha256":"7ad2aa55727b8a6addd8339041360e99b81a2dbfe85c0c4380c2cba8f711ed2a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LiNRWMGF8+Zoub9dzFdZjqIl37DHUhrMlfaZadBExhq+rkciez1qplSMndqn3N/5jchnsma9PZzu4clerEbLBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T14:05:14.716370Z","bundle_sha256":"7e9765151af736ea73f0d661f8c00511c15f1527858c93a8b77c9751f92cbcfc"}}