{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:3DQS4PFEVAMFFFGW2X45T2ZCXW","short_pith_number":"pith:3DQS4PFE","schema_version":"1.0","canonical_sha256":"d8e12e3ca4a8185294d6d5f9d9eb22bd9c67dc517758ea56f0790d755ababab6","source":{"kind":"arxiv","id":"2407.05484","version":2},"attestation_state":"computed","paper":{"title":"Learning to Price Homogeneous Data","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.LG","authors_text":"Joon Suk Huh, Keran Chen, Kirthevasan Kandasamy","submitted_at":"2024-07-07T20:02:52Z","abstract_excerpt":"We study a data pricing problem, where a seller has access to $N$ homogeneous data points (e.g. drawn i.i.d. from some distribution). There are $m$ types of buyers in the market, where buyers of the same type $i$ have the same valuation curve $v_i:[N]\\rightarrow [0,1]$, where $v_i(n)$ is the value for having $n$ data points. A priori, the seller is unaware of the distribution of buyers, but can repeat the market for $T$ rounds so as to learn the revenue-optimal pricing curve $p:[N] \\rightarrow [0, 1]$. To solve this online learning problem, we first develop novel discretization schemes to appr"},"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":"2407.05484","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-07-07T20:02:52Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"6297b6c67d1b9e19d8f4edfc2fc8ce59ed00f3f610570f617904bc78bc1d4a16","abstract_canon_sha256":"5e162e42e2594c98d451fb2810a6e52f847a9e4157ef7ee9c193e884b5389987"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:30:49.286456Z","signature_b64":"4dhNwnLDDVGua8YdOuMMG/Wi1DTnN/Br5+y0tvqvgv5/4DYguue3go8d4jYOhBy25/W3M1czyaaNmuSwxpdQDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8e12e3ca4a8185294d6d5f9d9eb22bd9c67dc517758ea56f0790d755ababab6","last_reissued_at":"2026-07-05T09:30:49.285914Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:30:49.285914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning to Price Homogeneous Data","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.LG","authors_text":"Joon Suk Huh, Keran Chen, Kirthevasan Kandasamy","submitted_at":"2024-07-07T20:02:52Z","abstract_excerpt":"We study a data pricing problem, where a seller has access to $N$ homogeneous data points (e.g. drawn i.i.d. from some distribution). There are $m$ types of buyers in the market, where buyers of the same type $i$ have the same valuation curve $v_i:[N]\\rightarrow [0,1]$, where $v_i(n)$ is the value for having $n$ data points. A priori, the seller is unaware of the distribution of buyers, but can repeat the market for $T$ rounds so as to learn the revenue-optimal pricing curve $p:[N] \\rightarrow [0, 1]$. To solve this online learning problem, we first develop novel discretization schemes to appr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.05484","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2407.05484/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":"2407.05484","created_at":"2026-07-05T09:30:49.285974+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.05484v2","created_at":"2026-07-05T09:30:49.285974+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.05484","created_at":"2026-07-05T09:30:49.285974+00:00"},{"alias_kind":"pith_short_12","alias_value":"3DQS4PFEVAMF","created_at":"2026-07-05T09:30:49.285974+00:00"},{"alias_kind":"pith_short_16","alias_value":"3DQS4PFEVAMFFFGW","created_at":"2026-07-05T09:30:49.285974+00:00"},{"alias_kind":"pith_short_8","alias_value":"3DQS4PFE","created_at":"2026-07-05T09:30:49.285974+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.23124","citing_title":"Learning to Incentivize in Repeated Principal-Agent Problems with Adversarial Agent Arrivals","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3DQS4PFEVAMFFFGW2X45T2ZCXW","json":"https://pith.science/pith/3DQS4PFEVAMFFFGW2X45T2ZCXW.json","graph_json":"https://pith.science/api/pith-number/3DQS4PFEVAMFFFGW2X45T2ZCXW/graph.json","events_json":"https://pith.science/api/pith-number/3DQS4PFEVAMFFFGW2X45T2ZCXW/events.json","paper":"https://pith.science/paper/3DQS4PFE"},"agent_actions":{"view_html":"https://pith.science/pith/3DQS4PFEVAMFFFGW2X45T2ZCXW","download_json":"https://pith.science/pith/3DQS4PFEVAMFFFGW2X45T2ZCXW.json","view_paper":"https://pith.science/paper/3DQS4PFE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.05484&json=true","fetch_graph":"https://pith.science/api/pith-number/3DQS4PFEVAMFFFGW2X45T2ZCXW/graph.json","fetch_events":"https://pith.science/api/pith-number/3DQS4PFEVAMFFFGW2X45T2ZCXW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3DQS4PFEVAMFFFGW2X45T2ZCXW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3DQS4PFEVAMFFFGW2X45T2ZCXW/action/storage_attestation","attest_author":"https://pith.science/pith/3DQS4PFEVAMFFFGW2X45T2ZCXW/action/author_attestation","sign_citation":"https://pith.science/pith/3DQS4PFEVAMFFFGW2X45T2ZCXW/action/citation_signature","submit_replication":"https://pith.science/pith/3DQS4PFEVAMFFFGW2X45T2ZCXW/action/replication_record"}},"created_at":"2026-07-05T09:30:49.285974+00:00","updated_at":"2026-07-05T09:30:49.285974+00:00"}