{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:T32VI3DTXTGCCJQBA65HF66DP4","short_pith_number":"pith:T32VI3DT","schema_version":"1.0","canonical_sha256":"9ef5546c73bccc21260107ba72fbc37f20bd64b49c3fadcdaf762dd0dbd08180","source":{"kind":"arxiv","id":"1709.09117","version":1},"attestation_state":"computed","paper":{"title":"Discrete Choice and Rational Inattention: a General Equivalence Result","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.AP"],"primary_cat":"econ.EM","authors_text":"Andre de Palma, Emerson Melo, Matthew Shum, Mogens Fosgerau","submitted_at":"2017-09-26T16:31:59Z","abstract_excerpt":"This paper establishes a general equivalence between discrete choice and rational inattention models. Matejka and McKay (2015, AER) showed that when information costs are modelled using the Shannon entropy function, the resulting choice probabilities in the rational inattention model take the multinomial logit form. By exploiting convex-analytic properties of the discrete choice model, we show that when information costs are modelled using a class of generalized entropy functions, the choice probabilities in any rational inattention model are observationally equivalent to some additive random "},"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":"1709.09117","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"econ.EM","submitted_at":"2017-09-26T16:31:59Z","cross_cats_sorted":["cs.IT","math.IT","stat.AP"],"title_canon_sha256":"dbb4446d330c8df1b6ddbba6cfb42d3dd92d8796c689935239286144427bf0c0","abstract_canon_sha256":"4e0b455e2d265f8451c42a6522743ab49d220f0bf90e70ee441cc83679fca902"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:21.118446Z","signature_b64":"ytFDK9ZMHwCnn4iZ8smwC6QZEtfXy3e2x7xc4sdRh7HVxurb2lUvQIYoBaVu+xl45CRscmgEYNAJOKzI7yyvBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ef5546c73bccc21260107ba72fbc37f20bd64b49c3fadcdaf762dd0dbd08180","last_reissued_at":"2026-05-18T00:34:21.117976Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:21.117976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Discrete Choice and Rational Inattention: a General Equivalence Result","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.AP"],"primary_cat":"econ.EM","authors_text":"Andre de Palma, Emerson Melo, Matthew Shum, Mogens Fosgerau","submitted_at":"2017-09-26T16:31:59Z","abstract_excerpt":"This paper establishes a general equivalence between discrete choice and rational inattention models. Matejka and McKay (2015, AER) showed that when information costs are modelled using the Shannon entropy function, the resulting choice probabilities in the rational inattention model take the multinomial logit form. By exploiting convex-analytic properties of the discrete choice model, we show that when information costs are modelled using a class of generalized entropy functions, the choice probabilities in any rational inattention model are observationally equivalent to some additive random "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.09117","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":"1709.09117","created_at":"2026-05-18T00:34:21.118048+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.09117v1","created_at":"2026-05-18T00:34:21.118048+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.09117","created_at":"2026-05-18T00:34:21.118048+00:00"},{"alias_kind":"pith_short_12","alias_value":"T32VI3DTXTGC","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"T32VI3DTXTGCCJQB","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"T32VI3DT","created_at":"2026-05-18T12:31:43.269735+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.07036","citing_title":"Information processing constraints in travel behaviour modelling: A generative learning approach","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/T32VI3DTXTGCCJQBA65HF66DP4","json":"https://pith.science/pith/T32VI3DTXTGCCJQBA65HF66DP4.json","graph_json":"https://pith.science/api/pith-number/T32VI3DTXTGCCJQBA65HF66DP4/graph.json","events_json":"https://pith.science/api/pith-number/T32VI3DTXTGCCJQBA65HF66DP4/events.json","paper":"https://pith.science/paper/T32VI3DT"},"agent_actions":{"view_html":"https://pith.science/pith/T32VI3DTXTGCCJQBA65HF66DP4","download_json":"https://pith.science/pith/T32VI3DTXTGCCJQBA65HF66DP4.json","view_paper":"https://pith.science/paper/T32VI3DT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.09117&json=true","fetch_graph":"https://pith.science/api/pith-number/T32VI3DTXTGCCJQBA65HF66DP4/graph.json","fetch_events":"https://pith.science/api/pith-number/T32VI3DTXTGCCJQBA65HF66DP4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T32VI3DTXTGCCJQBA65HF66DP4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T32VI3DTXTGCCJQBA65HF66DP4/action/storage_attestation","attest_author":"https://pith.science/pith/T32VI3DTXTGCCJQBA65HF66DP4/action/author_attestation","sign_citation":"https://pith.science/pith/T32VI3DTXTGCCJQBA65HF66DP4/action/citation_signature","submit_replication":"https://pith.science/pith/T32VI3DTXTGCCJQBA65HF66DP4/action/replication_record"}},"created_at":"2026-05-18T00:34:21.118048+00:00","updated_at":"2026-05-18T00:34:21.118048+00:00"}