{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:Z6P72VZ4FJRE3MSO5YFOJOFZKX","short_pith_number":"pith:Z6P72VZ4","schema_version":"1.0","canonical_sha256":"cf9ffd573c2a624db24eee0ae4b8b955d6062b5ac3fe3119d57334dc057e79d3","source":{"kind":"arxiv","id":"2305.13283","version":1},"attestation_state":"computed","paper":{"title":"Approximating a RUM from Distributions on k-Slates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Alessandro Panconesi, Andrew Tomkins, Flavio Chierichetti, Mirko Giacchini, Ravi Kumar","submitted_at":"2023-05-22T17:43:34Z","abstract_excerpt":"In this work we consider the problem of fitting Random Utility Models (RUMs) to user choices. Given the winner distributions of the subsets of size $k$ of a universe, we obtain a polynomial-time algorithm that finds the RUM that best approximates the given distribution on average. Our algorithm is based on a linear program that we solve using the ellipsoid method. Given that its corresponding separation oracle problem is NP-hard, we devise an approximate separation oracle that can be viewed as a generalization of the weighted feedback arc set problem to hypergraphs. Our theoretical result can "},"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":"2305.13283","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-05-22T17:43:34Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"0112d7faba15bec0ed93c8e4e1aee45ebdc6c9389a6bd0d6550de14a243af088","abstract_canon_sha256":"3d9958ccf9f45d60748dacc0095037d4bff7882a572267f1730b9dceac3c8a21"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:12:28.605801Z","signature_b64":"/K5rx8ZDC6ueiRJG+74CY/7Dqy18170lAI9uRPqGGkyAuTG2n9JdNODv4OYgLRuRzBd9oME+BXbttivjTLO8Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf9ffd573c2a624db24eee0ae4b8b955d6062b5ac3fe3119d57334dc057e79d3","last_reissued_at":"2026-07-05T06:12:28.605354Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:12:28.605354Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximating a RUM from Distributions on k-Slates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Alessandro Panconesi, Andrew Tomkins, Flavio Chierichetti, Mirko Giacchini, Ravi Kumar","submitted_at":"2023-05-22T17:43:34Z","abstract_excerpt":"In this work we consider the problem of fitting Random Utility Models (RUMs) to user choices. Given the winner distributions of the subsets of size $k$ of a universe, we obtain a polynomial-time algorithm that finds the RUM that best approximates the given distribution on average. Our algorithm is based on a linear program that we solve using the ellipsoid method. Given that its corresponding separation oracle problem is NP-hard, we devise an approximate separation oracle that can be viewed as a generalization of the weighted feedback arc set problem to hypergraphs. Our theoretical result can "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.13283","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/2305.13283/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":"2305.13283","created_at":"2026-07-05T06:12:28.605411+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.13283v1","created_at":"2026-07-05T06:12:28.605411+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.13283","created_at":"2026-07-05T06:12:28.605411+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z6P72VZ4FJRE","created_at":"2026-07-05T06:12:28.605411+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z6P72VZ4FJRE3MSO","created_at":"2026-07-05T06:12:28.605411+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z6P72VZ4","created_at":"2026-07-05T06:12:28.605411+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/Z6P72VZ4FJRE3MSO5YFOJOFZKX","json":"https://pith.science/pith/Z6P72VZ4FJRE3MSO5YFOJOFZKX.json","graph_json":"https://pith.science/api/pith-number/Z6P72VZ4FJRE3MSO5YFOJOFZKX/graph.json","events_json":"https://pith.science/api/pith-number/Z6P72VZ4FJRE3MSO5YFOJOFZKX/events.json","paper":"https://pith.science/paper/Z6P72VZ4"},"agent_actions":{"view_html":"https://pith.science/pith/Z6P72VZ4FJRE3MSO5YFOJOFZKX","download_json":"https://pith.science/pith/Z6P72VZ4FJRE3MSO5YFOJOFZKX.json","view_paper":"https://pith.science/paper/Z6P72VZ4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.13283&json=true","fetch_graph":"https://pith.science/api/pith-number/Z6P72VZ4FJRE3MSO5YFOJOFZKX/graph.json","fetch_events":"https://pith.science/api/pith-number/Z6P72VZ4FJRE3MSO5YFOJOFZKX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z6P72VZ4FJRE3MSO5YFOJOFZKX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z6P72VZ4FJRE3MSO5YFOJOFZKX/action/storage_attestation","attest_author":"https://pith.science/pith/Z6P72VZ4FJRE3MSO5YFOJOFZKX/action/author_attestation","sign_citation":"https://pith.science/pith/Z6P72VZ4FJRE3MSO5YFOJOFZKX/action/citation_signature","submit_replication":"https://pith.science/pith/Z6P72VZ4FJRE3MSO5YFOJOFZKX/action/replication_record"}},"created_at":"2026-07-05T06:12:28.605411+00:00","updated_at":"2026-07-05T06:12:28.605411+00:00"}