{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:HY6ZY6NJE235Z7UHGUATR3DUZ3","short_pith_number":"pith:HY6ZY6NJ","schema_version":"1.0","canonical_sha256":"3e3d9c79a926b7dcfe87350138ec74cef9b697a281973563d692f8b5caab65c0","source":{"kind":"arxiv","id":"2409.07819","version":1},"attestation_state":"computed","paper":{"title":"Selling Joint Ads: A Regret Minimization Perspective","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.GT","authors_text":"Ashwinkumar Badanidiyuru, Federico Fusco, Gagan Aggarwal, Paul D\\\"utting","submitted_at":"2024-09-12T07:59:10Z","abstract_excerpt":"Motivated by online retail, we consider the problem of selling one item (e.g., an ad slot) to two non-excludable buyers (say, a merchant and a brand). This problem captures, for example, situations where a merchant and a brand cooperatively bid in an auction to advertise a product, and both benefit from the ad being shown. A mechanism collects bids from the two and decides whether to allocate and which payments the two parties should make. This gives rise to intricate incentive compatibility constraints, e.g., on how to split payments between the two parties. We approach the problem of finding"},"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":"2409.07819","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2024-09-12T07:59:10Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"2c1cf6d88fcaddcb97ecd9afff071e85278d9e4a6c457d94efc41af61955f2eb","abstract_canon_sha256":"fceb9639e90d317126b7087e26d8c27f3e42a524cfb664341a574f6d3303c149"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:08:00.482688Z","signature_b64":"4UyF6OkQmq9+wpxI+llu8bu9EWjQZhh5eaGv+NH+cl/p2CwOHKGPHyoz9VziSxmTN8uLbCTg4SvLExLejG/HCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e3d9c79a926b7dcfe87350138ec74cef9b697a281973563d692f8b5caab65c0","last_reissued_at":"2026-07-05T11:08:00.482192Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:08:00.482192Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Selling Joint Ads: A Regret Minimization Perspective","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.GT","authors_text":"Ashwinkumar Badanidiyuru, Federico Fusco, Gagan Aggarwal, Paul D\\\"utting","submitted_at":"2024-09-12T07:59:10Z","abstract_excerpt":"Motivated by online retail, we consider the problem of selling one item (e.g., an ad slot) to two non-excludable buyers (say, a merchant and a brand). This problem captures, for example, situations where a merchant and a brand cooperatively bid in an auction to advertise a product, and both benefit from the ad being shown. A mechanism collects bids from the two and decides whether to allocate and which payments the two parties should make. This gives rise to intricate incentive compatibility constraints, e.g., on how to split payments between the two parties. We approach the problem of finding"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.07819","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2409.07819/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":"2409.07819","created_at":"2026-07-05T11:08:00.482248+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.07819v1","created_at":"2026-07-05T11:08:00.482248+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.07819","created_at":"2026-07-05T11:08:00.482248+00:00"},{"alias_kind":"pith_short_12","alias_value":"HY6ZY6NJE235","created_at":"2026-07-05T11:08:00.482248+00:00"},{"alias_kind":"pith_short_16","alias_value":"HY6ZY6NJE235Z7UH","created_at":"2026-07-05T11:08:00.482248+00:00"},{"alias_kind":"pith_short_8","alias_value":"HY6ZY6NJ","created_at":"2026-07-05T11:08:00.482248+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.23445","citing_title":"AI Safety Training Can be Clinically Harmful","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HY6ZY6NJE235Z7UHGUATR3DUZ3","json":"https://pith.science/pith/HY6ZY6NJE235Z7UHGUATR3DUZ3.json","graph_json":"https://pith.science/api/pith-number/HY6ZY6NJE235Z7UHGUATR3DUZ3/graph.json","events_json":"https://pith.science/api/pith-number/HY6ZY6NJE235Z7UHGUATR3DUZ3/events.json","paper":"https://pith.science/paper/HY6ZY6NJ"},"agent_actions":{"view_html":"https://pith.science/pith/HY6ZY6NJE235Z7UHGUATR3DUZ3","download_json":"https://pith.science/pith/HY6ZY6NJE235Z7UHGUATR3DUZ3.json","view_paper":"https://pith.science/paper/HY6ZY6NJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.07819&json=true","fetch_graph":"https://pith.science/api/pith-number/HY6ZY6NJE235Z7UHGUATR3DUZ3/graph.json","fetch_events":"https://pith.science/api/pith-number/HY6ZY6NJE235Z7UHGUATR3DUZ3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HY6ZY6NJE235Z7UHGUATR3DUZ3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HY6ZY6NJE235Z7UHGUATR3DUZ3/action/storage_attestation","attest_author":"https://pith.science/pith/HY6ZY6NJE235Z7UHGUATR3DUZ3/action/author_attestation","sign_citation":"https://pith.science/pith/HY6ZY6NJE235Z7UHGUATR3DUZ3/action/citation_signature","submit_replication":"https://pith.science/pith/HY6ZY6NJE235Z7UHGUATR3DUZ3/action/replication_record"}},"created_at":"2026-07-05T11:08:00.482248+00:00","updated_at":"2026-07-05T11:08:00.482248+00:00"}