{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:Z6P72VZ4FJRE3MSO5YFOJOFZKX","short_pith_number":"pith:Z6P72VZ4","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"},"canonical_sha256":"cf9ffd573c2a624db24eee0ae4b8b955d6062b5ac3fe3119d57334dc057e79d3","source":{"kind":"arxiv","id":"2305.13283","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.13283","created_at":"2026-07-05T06:12:28Z"},{"alias_kind":"arxiv_version","alias_value":"2305.13283v1","created_at":"2026-07-05T06:12:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.13283","created_at":"2026-07-05T06:12:28Z"},{"alias_kind":"pith_short_12","alias_value":"Z6P72VZ4FJRE","created_at":"2026-07-05T06:12:28Z"},{"alias_kind":"pith_short_16","alias_value":"Z6P72VZ4FJRE3MSO","created_at":"2026-07-05T06:12:28Z"},{"alias_kind":"pith_short_8","alias_value":"Z6P72VZ4","created_at":"2026-07-05T06:12:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:Z6P72VZ4FJRE3MSO5YFOJOFZKX","target":"record","payload":{"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"},"canonical_sha256":"cf9ffd573c2a624db24eee0ae4b8b955d6062b5ac3fe3119d57334dc057e79d3","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"},"source_kind":"arxiv","source_id":"2305.13283","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T06:12:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sq08haU38Aj5zIbA1RtBPGyGfEF/As5jAnPvBIzJ8U/R+GALfkODJ47YKqTAi/iYJ5GuKj54Y7z375VTDlneDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T12:34:47.888753Z"},"content_sha256":"faf25ff67fcbf58e49053bdd81805cade63c4e6a74fa5cc40140d45caff0c387","schema_version":"1.0","event_id":"sha256:faf25ff67fcbf58e49053bdd81805cade63c4e6a74fa5cc40140d45caff0c387"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:Z6P72VZ4FJRE3MSO5YFOJOFZKX","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T06:12:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Sk4ECmxaw/cu24+qJTQnFq9wTR/o4Z7e8PHkeXbRNkGqd65JOzs28EPfilW7yM0CeVXhzKsrG1vNUlN4M4tBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T12:34:47.889646Z"},"content_sha256":"969dd7ae344308e050117904749daf611a6464a9bc19e4934301b417b68a2708","schema_version":"1.0","event_id":"sha256:969dd7ae344308e050117904749daf611a6464a9bc19e4934301b417b68a2708"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z6P72VZ4FJRE3MSO5YFOJOFZKX/bundle.json","state_url":"https://pith.science/pith/Z6P72VZ4FJRE3MSO5YFOJOFZKX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z6P72VZ4FJRE3MSO5YFOJOFZKX/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-04T12:34:47Z","links":{"resolver":"https://pith.science/pith/Z6P72VZ4FJRE3MSO5YFOJOFZKX","bundle":"https://pith.science/pith/Z6P72VZ4FJRE3MSO5YFOJOFZKX/bundle.json","state":"https://pith.science/pith/Z6P72VZ4FJRE3MSO5YFOJOFZKX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z6P72VZ4FJRE3MSO5YFOJOFZKX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:Z6P72VZ4FJRE3MSO5YFOJOFZKX","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3d9958ccf9f45d60748dacc0095037d4bff7882a572267f1730b9dceac3c8a21","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-05-22T17:43:34Z","title_canon_sha256":"0112d7faba15bec0ed93c8e4e1aee45ebdc6c9389a6bd0d6550de14a243af088"},"schema_version":"1.0","source":{"id":"2305.13283","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.13283","created_at":"2026-07-05T06:12:28Z"},{"alias_kind":"arxiv_version","alias_value":"2305.13283v1","created_at":"2026-07-05T06:12:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.13283","created_at":"2026-07-05T06:12:28Z"},{"alias_kind":"pith_short_12","alias_value":"Z6P72VZ4FJRE","created_at":"2026-07-05T06:12:28Z"},{"alias_kind":"pith_short_16","alias_value":"Z6P72VZ4FJRE3MSO","created_at":"2026-07-05T06:12:28Z"},{"alias_kind":"pith_short_8","alias_value":"Z6P72VZ4","created_at":"2026-07-05T06:12:28Z"}],"graph_snapshots":[{"event_id":"sha256:969dd7ae344308e050117904749daf611a6464a9bc19e4934301b417b68a2708","target":"graph","created_at":"2026-07-05T06:12:28Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2305.13283/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Alessandro Panconesi, Andrew Tomkins, Flavio Chierichetti, Mirko Giacchini, Ravi Kumar","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-05-22T17:43:34Z","title":"Approximating a RUM from Distributions on k-Slates"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.13283","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:faf25ff67fcbf58e49053bdd81805cade63c4e6a74fa5cc40140d45caff0c387","target":"record","created_at":"2026-07-05T06:12:28Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"3d9958ccf9f45d60748dacc0095037d4bff7882a572267f1730b9dceac3c8a21","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-05-22T17:43:34Z","title_canon_sha256":"0112d7faba15bec0ed93c8e4e1aee45ebdc6c9389a6bd0d6550de14a243af088"},"schema_version":"1.0","source":{"id":"2305.13283","kind":"arxiv","version":1}},"canonical_sha256":"cf9ffd573c2a624db24eee0ae4b8b955d6062b5ac3fe3119d57334dc057e79d3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cf9ffd573c2a624db24eee0ae4b8b955d6062b5ac3fe3119d57334dc057e79d3","first_computed_at":"2026-07-05T06:12:28.605354Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:12:28.605354Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/K5rx8ZDC6ueiRJG+74CY/7Dqy18170lAI9uRPqGGkyAuTG2n9JdNODv4OYgLRuRzBd9oME+BXbttivjTLO8Aw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:12:28.605801Z","signed_message":"canonical_sha256_bytes"},"source_id":"2305.13283","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:faf25ff67fcbf58e49053bdd81805cade63c4e6a74fa5cc40140d45caff0c387","sha256:969dd7ae344308e050117904749daf611a6464a9bc19e4934301b417b68a2708"],"state_sha256":"2c1a98ed4d46a2b697a2da0beba82c092be2c0a26fe80bad8ce50e188dbae11d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zVIrMrYweSjOIWwe+G8GoTXX8NWtJiuSl+JqhWu4urlxjIgFAjaYjBXGctfthQuZ7Tq3LQlclqJugpW6VaRGDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T12:34:47.899125Z","bundle_sha256":"03aa0827d5b79c64c74b346b73832187d46c1803b6907778ed946f78d48314a9"}}