{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:KPNWEYQSJJFAJPJJGDGPLXZBGZ","short_pith_number":"pith:KPNWEYQS","schema_version":"1.0","canonical_sha256":"53db6262124a4a04bd2930ccf5df21365f29610d1b38d5dceccca6c444d91d96","source":{"kind":"arxiv","id":"2404.08126","version":1},"attestation_state":"computed","paper":{"title":"Auctions with LLM Summaries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.GT","authors_text":"Aranyak Mehta, Di Wang, Kumar Avinava Dubey, Rahul Kidambi, Zhe Feng","submitted_at":"2024-04-11T21:05:56Z","abstract_excerpt":"We study an auction setting in which bidders bid for placement of their content within a summary generated by a large language model (LLM), e.g., an ad auction in which the display is a summary paragraph of multiple ads. This generalizes the classic ad settings such as position auctions to an LLM generated setting, which allows us to handle general display formats. We propose a novel factorized framework in which an auction module and an LLM module work together via a prediction model to provide welfare maximizing summary outputs in an incentive compatible manner. We provide a theoretical anal"},"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":"2404.08126","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2024-04-11T21:05:56Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"fbd34e4810674053bc81cd2e1b36af039d3e0e0dd292265f4f20a527bccb1d96","abstract_canon_sha256":"22d0754fcb6dd23009c85c1e92962d85068ff3f7f0626b591e2b0f019d8c72cf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:07:18.057345Z","signature_b64":"b+3RpeB9vpbtqFeqq/ldu0oFB4lpNbRU7b9OFJD51xbqQePI9CZOXMpgajwMVPsK0ZPGkjQTi9xyrt1eYRViBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53db6262124a4a04bd2930ccf5df21365f29610d1b38d5dceccca6c444d91d96","last_reissued_at":"2026-07-05T08:07:18.056864Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:07:18.056864Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Auctions with LLM Summaries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.GT","authors_text":"Aranyak Mehta, Di Wang, Kumar Avinava Dubey, Rahul Kidambi, Zhe Feng","submitted_at":"2024-04-11T21:05:56Z","abstract_excerpt":"We study an auction setting in which bidders bid for placement of their content within a summary generated by a large language model (LLM), e.g., an ad auction in which the display is a summary paragraph of multiple ads. This generalizes the classic ad settings such as position auctions to an LLM generated setting, which allows us to handle general display formats. We propose a novel factorized framework in which an auction module and an LLM module work together via a prediction model to provide welfare maximizing summary outputs in an incentive compatible manner. We provide a theoretical anal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.08126","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/2404.08126/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":"2404.08126","created_at":"2026-07-05T08:07:18.056929+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.08126v1","created_at":"2026-07-05T08:07:18.056929+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.08126","created_at":"2026-07-05T08:07:18.056929+00:00"},{"alias_kind":"pith_short_12","alias_value":"KPNWEYQSJJFA","created_at":"2026-07-05T08:07:18.056929+00:00"},{"alias_kind":"pith_short_16","alias_value":"KPNWEYQSJJFAJPJJ","created_at":"2026-07-05T08:07:18.056929+00:00"},{"alias_kind":"pith_short_8","alias_value":"KPNWEYQS","created_at":"2026-07-05T08:07:18.056929+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.24052","citing_title":"Truthful Online Preference Aggregation for LLM Fine-Tuning in Mobile Crowdsourcing","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2605.09918","citing_title":"NaiAD: Initiate Data-Driven Research for LLM Advertising","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KPNWEYQSJJFAJPJJGDGPLXZBGZ","json":"https://pith.science/pith/KPNWEYQSJJFAJPJJGDGPLXZBGZ.json","graph_json":"https://pith.science/api/pith-number/KPNWEYQSJJFAJPJJGDGPLXZBGZ/graph.json","events_json":"https://pith.science/api/pith-number/KPNWEYQSJJFAJPJJGDGPLXZBGZ/events.json","paper":"https://pith.science/paper/KPNWEYQS"},"agent_actions":{"view_html":"https://pith.science/pith/KPNWEYQSJJFAJPJJGDGPLXZBGZ","download_json":"https://pith.science/pith/KPNWEYQSJJFAJPJJGDGPLXZBGZ.json","view_paper":"https://pith.science/paper/KPNWEYQS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.08126&json=true","fetch_graph":"https://pith.science/api/pith-number/KPNWEYQSJJFAJPJJGDGPLXZBGZ/graph.json","fetch_events":"https://pith.science/api/pith-number/KPNWEYQSJJFAJPJJGDGPLXZBGZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KPNWEYQSJJFAJPJJGDGPLXZBGZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KPNWEYQSJJFAJPJJGDGPLXZBGZ/action/storage_attestation","attest_author":"https://pith.science/pith/KPNWEYQSJJFAJPJJGDGPLXZBGZ/action/author_attestation","sign_citation":"https://pith.science/pith/KPNWEYQSJJFAJPJJGDGPLXZBGZ/action/citation_signature","submit_replication":"https://pith.science/pith/KPNWEYQSJJFAJPJJGDGPLXZBGZ/action/replication_record"}},"created_at":"2026-07-05T08:07:18.056929+00:00","updated_at":"2026-07-05T08:07:18.056929+00:00"}