{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:5MLQBU7OYXQNHYGJWQF3ZTJZ6E","short_pith_number":"pith:5MLQBU7O","schema_version":"1.0","canonical_sha256":"eb1700d3eec5e0d3e0c9b40bbccd39f125016be4340886a77f78e9a31f02ba78","source":{"kind":"arxiv","id":"1211.4150","version":1},"attestation_state":"computed","paper":{"title":"Efficiently Learning from Revealed Preference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"cs.GT","authors_text":"Aaron Roth, Morteza Zadimoghaddam","submitted_at":"2012-11-17T19:30:52Z","abstract_excerpt":"In this paper, we consider the revealed preferences problem from a learning perspective. Every day, a price vector and a budget is drawn from an unknown distribution, and a rational agent buys his most preferred bundle according to some unknown utility function, subject to the given prices and budget constraint. We wish not only to find a utility function which rationalizes a finite set of observations, but to produce a hypothesis valuation function which accurately predicts the behavior of the agent in the future. We give efficient algorithms with polynomial sample-complexity for agents with "},"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":"1211.4150","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-11-17T19:30:52Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"972fbc4213bd3c6f13dc1e278283c665c7c7079ab5145a5528310c36886caa48","abstract_canon_sha256":"8187948e7ad1cd6ec2ecda1facb0864d739f62f44630c9a03a2fc3a0f1ad8e84"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:40:27.839163Z","signature_b64":"JKq1gSUnhOInBIiv2xQR+lqiRNG+Pyby3Ci0vQaOLz4U53tMJYJm5i3rttQg7oE05+HzEi8HGwEvVTcEsip7BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb1700d3eec5e0d3e0c9b40bbccd39f125016be4340886a77f78e9a31f02ba78","last_reissued_at":"2026-05-18T03:40:27.838560Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:40:27.838560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficiently Learning from Revealed Preference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"cs.GT","authors_text":"Aaron Roth, Morteza Zadimoghaddam","submitted_at":"2012-11-17T19:30:52Z","abstract_excerpt":"In this paper, we consider the revealed preferences problem from a learning perspective. Every day, a price vector and a budget is drawn from an unknown distribution, and a rational agent buys his most preferred bundle according to some unknown utility function, subject to the given prices and budget constraint. We wish not only to find a utility function which rationalizes a finite set of observations, but to produce a hypothesis valuation function which accurately predicts the behavior of the agent in the future. We give efficient algorithms with polynomial sample-complexity for agents with "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.4150","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":""},"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":"1211.4150","created_at":"2026-05-18T03:40:27.838648+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.4150v1","created_at":"2026-05-18T03:40:27.838648+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.4150","created_at":"2026-05-18T03:40:27.838648+00:00"},{"alias_kind":"pith_short_12","alias_value":"5MLQBU7OYXQN","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"5MLQBU7OYXQNHYGJ","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"5MLQBU7O","created_at":"2026-05-18T12:26:56.085431+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/5MLQBU7OYXQNHYGJWQF3ZTJZ6E","json":"https://pith.science/pith/5MLQBU7OYXQNHYGJWQF3ZTJZ6E.json","graph_json":"https://pith.science/api/pith-number/5MLQBU7OYXQNHYGJWQF3ZTJZ6E/graph.json","events_json":"https://pith.science/api/pith-number/5MLQBU7OYXQNHYGJWQF3ZTJZ6E/events.json","paper":"https://pith.science/paper/5MLQBU7O"},"agent_actions":{"view_html":"https://pith.science/pith/5MLQBU7OYXQNHYGJWQF3ZTJZ6E","download_json":"https://pith.science/pith/5MLQBU7OYXQNHYGJWQF3ZTJZ6E.json","view_paper":"https://pith.science/paper/5MLQBU7O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.4150&json=true","fetch_graph":"https://pith.science/api/pith-number/5MLQBU7OYXQNHYGJWQF3ZTJZ6E/graph.json","fetch_events":"https://pith.science/api/pith-number/5MLQBU7OYXQNHYGJWQF3ZTJZ6E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5MLQBU7OYXQNHYGJWQF3ZTJZ6E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5MLQBU7OYXQNHYGJWQF3ZTJZ6E/action/storage_attestation","attest_author":"https://pith.science/pith/5MLQBU7OYXQNHYGJWQF3ZTJZ6E/action/author_attestation","sign_citation":"https://pith.science/pith/5MLQBU7OYXQNHYGJWQF3ZTJZ6E/action/citation_signature","submit_replication":"https://pith.science/pith/5MLQBU7OYXQNHYGJWQF3ZTJZ6E/action/replication_record"}},"created_at":"2026-05-18T03:40:27.838648+00:00","updated_at":"2026-05-18T03:40:27.838648+00:00"}