{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:FO6VKRUYPG2IQFPONTKPIPCBHP","short_pith_number":"pith:FO6VKRUY","canonical_record":{"source":{"id":"1409.8670","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-30T19:49:29Z","cross_cats_sorted":[],"title_canon_sha256":"0dd871ca51414c9f229c1cf89d9601aadd8db36d001b99ce8ae181f1848064cb","abstract_canon_sha256":"e7508e28ad784325f101fef7f3740d11dc1e3619b05e551cf4dd868dcf82b17a"},"schema_version":"1.0"},"canonical_sha256":"2bbd55469879b48815ee6cd4f43c413be387729398fa83fce00aa696bc4f6a58","source":{"kind":"arxiv","id":"1409.8670","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.8670","created_at":"2026-05-18T02:17:33Z"},{"alias_kind":"arxiv_version","alias_value":"1409.8670v2","created_at":"2026-05-18T02:17:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.8670","created_at":"2026-05-18T02:17:33Z"},{"alias_kind":"pith_short_12","alias_value":"FO6VKRUYPG2I","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FO6VKRUYPG2IQFPO","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FO6VKRUY","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:FO6VKRUYPG2IQFPONTKPIPCBHP","target":"record","payload":{"canonical_record":{"source":{"id":"1409.8670","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-30T19:49:29Z","cross_cats_sorted":[],"title_canon_sha256":"0dd871ca51414c9f229c1cf89d9601aadd8db36d001b99ce8ae181f1848064cb","abstract_canon_sha256":"e7508e28ad784325f101fef7f3740d11dc1e3619b05e551cf4dd868dcf82b17a"},"schema_version":"1.0"},"canonical_sha256":"2bbd55469879b48815ee6cd4f43c413be387729398fa83fce00aa696bc4f6a58","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:33.571743Z","signature_b64":"ecKKzr0jBBDAb4jL3KS8J1Y8cfdnzJW9VrZtK7g6ygmfDFhFtDQbc6AGNTAUhQnRK2uxBQnA1JQXKji5KhzQAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2bbd55469879b48815ee6cd4f43c413be387729398fa83fce00aa696bc4f6a58","last_reissued_at":"2026-05-18T02:17:33.571143Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:33.571143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.8670","source_version":2,"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-18T02:17:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rZhL7NcmJKzmp0ZhZeHl9xmVo8Xr6qYHc8g7YPfw4R8DZ2w8uXsiLo7VHZYDUbt7azoAV8+jCFAo//VrTSCKBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:39:16.962918Z"},"content_sha256":"2efcd22e82825eaf8259d981b1262fe5419d7ebd4ec2bf330b54f146b201d93a","schema_version":"1.0","event_id":"sha256:2efcd22e82825eaf8259d981b1262fe5419d7ebd4ec2bf330b54f146b201d93a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:FO6VKRUYPG2IQFPONTKPIPCBHP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Near-Optimum Online Ad Allocation for Targeted Advertising","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David Wajc, Joseph (Seffi) Naor","submitted_at":"2014-09-30T19:49:29Z","abstract_excerpt":"Motivated by Internet targeted advertising, we address several ad allocation problems. Prior work has established these problems admit no randomized online algorithm better than $(1-\\frac{1}{e})$-competitive (\\cite{karp1990optimal,mehta2007adwords}), yet simple heuristics have been observed to perform much better in practice. We explain this phenomenon by studying a generalization of the bounded-degree inputs considered by Buchbinder et al.~\\cite{buchbinder2007online}, graphs which we call $(k,d)-bounded$. In such graphs the maximal degree on the online side is at most $d$ and the minimal degr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.8670","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":""},"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-18T02:17:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hbc5c3x5dYlyXyilDntBARA+1Reu1bDdQvxhfMX/IhgWMknTcEJMFzrRMYUGIf1RQziciInQrgiVM6J6cwsyDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:39:16.963259Z"},"content_sha256":"5e740df98af7a8b1ea884753e6e452d72bbb379727616047db39768438f2eea7","schema_version":"1.0","event_id":"sha256:5e740df98af7a8b1ea884753e6e452d72bbb379727616047db39768438f2eea7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FO6VKRUYPG2IQFPONTKPIPCBHP/bundle.json","state_url":"https://pith.science/pith/FO6VKRUYPG2IQFPONTKPIPCBHP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FO6VKRUYPG2IQFPONTKPIPCBHP/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-05-28T05:39:16Z","links":{"resolver":"https://pith.science/pith/FO6VKRUYPG2IQFPONTKPIPCBHP","bundle":"https://pith.science/pith/FO6VKRUYPG2IQFPONTKPIPCBHP/bundle.json","state":"https://pith.science/pith/FO6VKRUYPG2IQFPONTKPIPCBHP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FO6VKRUYPG2IQFPONTKPIPCBHP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:FO6VKRUYPG2IQFPONTKPIPCBHP","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":"e7508e28ad784325f101fef7f3740d11dc1e3619b05e551cf4dd868dcf82b17a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-30T19:49:29Z","title_canon_sha256":"0dd871ca51414c9f229c1cf89d9601aadd8db36d001b99ce8ae181f1848064cb"},"schema_version":"1.0","source":{"id":"1409.8670","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.8670","created_at":"2026-05-18T02:17:33Z"},{"alias_kind":"arxiv_version","alias_value":"1409.8670v2","created_at":"2026-05-18T02:17:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.8670","created_at":"2026-05-18T02:17:33Z"},{"alias_kind":"pith_short_12","alias_value":"FO6VKRUYPG2I","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FO6VKRUYPG2IQFPO","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FO6VKRUY","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:5e740df98af7a8b1ea884753e6e452d72bbb379727616047db39768438f2eea7","target":"graph","created_at":"2026-05-18T02:17:33Z","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":"Motivated by Internet targeted advertising, we address several ad allocation problems. Prior work has established these problems admit no randomized online algorithm better than $(1-\\frac{1}{e})$-competitive (\\cite{karp1990optimal,mehta2007adwords}), yet simple heuristics have been observed to perform much better in practice. We explain this phenomenon by studying a generalization of the bounded-degree inputs considered by Buchbinder et al.~\\cite{buchbinder2007online}, graphs which we call $(k,d)-bounded$. In such graphs the maximal degree on the online side is at most $d$ and the minimal degr","authors_text":"David Wajc, Joseph (Seffi) Naor","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-30T19:49:29Z","title":"Near-Optimum Online Ad Allocation for Targeted Advertising"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.8670","kind":"arxiv","version":2},"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:2efcd22e82825eaf8259d981b1262fe5419d7ebd4ec2bf330b54f146b201d93a","target":"record","created_at":"2026-05-18T02:17:33Z","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":"e7508e28ad784325f101fef7f3740d11dc1e3619b05e551cf4dd868dcf82b17a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-30T19:49:29Z","title_canon_sha256":"0dd871ca51414c9f229c1cf89d9601aadd8db36d001b99ce8ae181f1848064cb"},"schema_version":"1.0","source":{"id":"1409.8670","kind":"arxiv","version":2}},"canonical_sha256":"2bbd55469879b48815ee6cd4f43c413be387729398fa83fce00aa696bc4f6a58","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2bbd55469879b48815ee6cd4f43c413be387729398fa83fce00aa696bc4f6a58","first_computed_at":"2026-05-18T02:17:33.571143Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:17:33.571143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ecKKzr0jBBDAb4jL3KS8J1Y8cfdnzJW9VrZtK7g6ygmfDFhFtDQbc6AGNTAUhQnRK2uxBQnA1JQXKji5KhzQAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:17:33.571743Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.8670","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2efcd22e82825eaf8259d981b1262fe5419d7ebd4ec2bf330b54f146b201d93a","sha256:5e740df98af7a8b1ea884753e6e452d72bbb379727616047db39768438f2eea7"],"state_sha256":"0666d9f776b628af49981feb2271f1dc495f9c0d7689d2aacc20210e0c838e18"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DGGXYYYJpK9fjZLhEsHg49r1JXAzsVXpzLBHPoqQ+hhpFvBNQja7oGMP2ekqNzbCtF9UQfGNudQPSjDJ77zWBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T05:39:16.965192Z","bundle_sha256":"eb675660a12fb4f7da906a1762e6a8fc04f81cdb8aab54254516939e8d6f3571"}}