{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:FO6VKRUYPG2IQFPONTKPIPCBHP","short_pith_number":"pith:FO6VKRUY","schema_version":"1.0","canonical_sha256":"2bbd55469879b48815ee6cd4f43c413be387729398fa83fce00aa696bc4f6a58","source":{"kind":"arxiv","id":"1409.8670","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1409.8670","created_at":"2026-05-18T02:17:33.571240+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.8670v2","created_at":"2026-05-18T02:17:33.571240+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.8670","created_at":"2026-05-18T02:17:33.571240+00:00"},{"alias_kind":"pith_short_12","alias_value":"FO6VKRUYPG2I","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"FO6VKRUYPG2IQFPO","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"FO6VKRUY","created_at":"2026-05-18T12:28:28.263976+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/FO6VKRUYPG2IQFPONTKPIPCBHP","json":"https://pith.science/pith/FO6VKRUYPG2IQFPONTKPIPCBHP.json","graph_json":"https://pith.science/api/pith-number/FO6VKRUYPG2IQFPONTKPIPCBHP/graph.json","events_json":"https://pith.science/api/pith-number/FO6VKRUYPG2IQFPONTKPIPCBHP/events.json","paper":"https://pith.science/paper/FO6VKRUY"},"agent_actions":{"view_html":"https://pith.science/pith/FO6VKRUYPG2IQFPONTKPIPCBHP","download_json":"https://pith.science/pith/FO6VKRUYPG2IQFPONTKPIPCBHP.json","view_paper":"https://pith.science/paper/FO6VKRUY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.8670&json=true","fetch_graph":"https://pith.science/api/pith-number/FO6VKRUYPG2IQFPONTKPIPCBHP/graph.json","fetch_events":"https://pith.science/api/pith-number/FO6VKRUYPG2IQFPONTKPIPCBHP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FO6VKRUYPG2IQFPONTKPIPCBHP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FO6VKRUYPG2IQFPONTKPIPCBHP/action/storage_attestation","attest_author":"https://pith.science/pith/FO6VKRUYPG2IQFPONTKPIPCBHP/action/author_attestation","sign_citation":"https://pith.science/pith/FO6VKRUYPG2IQFPONTKPIPCBHP/action/citation_signature","submit_replication":"https://pith.science/pith/FO6VKRUYPG2IQFPONTKPIPCBHP/action/replication_record"}},"created_at":"2026-05-18T02:17:33.571240+00:00","updated_at":"2026-05-18T02:17:33.571240+00:00"}