{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FD3QPNUDGIQQXXSGQHYLIP72ZS","short_pith_number":"pith:FD3QPNUD","canonical_record":{"source":{"id":"1811.01216","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-03T13:36:12Z","cross_cats_sorted":["cs.CC","cs.DS","stat.ML"],"title_canon_sha256":"e95ea3b2f68dec8a733d9489c8f0d78470c9b858cb919745340cd4ab4e5bcc3c","abstract_canon_sha256":"c44e2c90a97294ec86f20ecbdaac408810326f5086e70de0fd5a3722d590d0c3"},"schema_version":"1.0"},"canonical_sha256":"28f707b68332210bde4681f0b43ffacc942a28e3dd9fde74b4213aa2c92b48ea","source":{"kind":"arxiv","id":"1811.01216","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.01216","created_at":"2026-05-18T00:01:34Z"},{"alias_kind":"arxiv_version","alias_value":"1811.01216v1","created_at":"2026-05-18T00:01:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01216","created_at":"2026-05-18T00:01:34Z"},{"alias_kind":"pith_short_12","alias_value":"FD3QPNUDGIQQ","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FD3QPNUDGIQQXXSG","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FD3QPNUD","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FD3QPNUDGIQQXXSGQHYLIP72ZS","target":"record","payload":{"canonical_record":{"source":{"id":"1811.01216","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-03T13:36:12Z","cross_cats_sorted":["cs.CC","cs.DS","stat.ML"],"title_canon_sha256":"e95ea3b2f68dec8a733d9489c8f0d78470c9b858cb919745340cd4ab4e5bcc3c","abstract_canon_sha256":"c44e2c90a97294ec86f20ecbdaac408810326f5086e70de0fd5a3722d590d0c3"},"schema_version":"1.0"},"canonical_sha256":"28f707b68332210bde4681f0b43ffacc942a28e3dd9fde74b4213aa2c92b48ea","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:34.986401Z","signature_b64":"ZcydN0m0o5qN7OjqC61xw3xuxKpfzxzlPj33N0WU7Kf4D21cJQvItehNnujBPtpgVYa0QL1kTeGY+ylFyU4oBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28f707b68332210bde4681f0b43ffacc942a28e3dd9fde74b4213aa2c92b48ea","last_reissued_at":"2026-05-18T00:01:34.985664Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:34.985664Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.01216","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-05-18T00:01:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7vixxDDy8rDaE8b5gzHWoKlMQeRyA7MUY+6SfhgebavLwKGYaDMusxR/DkzC3Gtg7e5EccDq0XfssW2x0qYLCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:25:37.743847Z"},"content_sha256":"8085c85e6bd303c55beac85aaa59b6fae3633429b8c2c98a099be525698e5730","schema_version":"1.0","event_id":"sha256:8085c85e6bd303c55beac85aaa59b6fae3633429b8c2c98a099be525698e5730"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FD3QPNUDGIQQXXSGQHYLIP72ZS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning sparse mixtures of rankings from noisy information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Anindya De, Rocco Servedio, Ryan O'Donnell","submitted_at":"2018-11-03T13:36:12Z","abstract_excerpt":"We study the problem of learning an unknown mixture of $k$ rankings over $n$ elements, given access to noisy samples drawn from the unknown mixture. We consider a range of different noise models, including natural variants of the \"heat kernel\" noise framework and the Mallows model. For each of these noise models we give an algorithm which, under mild assumptions, learns the unknown mixture to high accuracy and runs in $n^{O(\\log k)}$ time. The best previous algorithms for closely related problems have running times which are exponential in $k$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01216","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"},"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-05-18T00:01:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZO8LszEmdvETgXvT8Wsz9rAn/6a21yEDtNqgaxLwzvl5I9Fasp37BWpvZKdMdKxJ5lMNrJqqxBwl7V6vkSE+Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:25:37.744548Z"},"content_sha256":"15f13990fb3ff9c1b215ecb899c91993b6e4fcf17d85fd43e01e1e6a2dbdc331","schema_version":"1.0","event_id":"sha256:15f13990fb3ff9c1b215ecb899c91993b6e4fcf17d85fd43e01e1e6a2dbdc331"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FD3QPNUDGIQQXXSGQHYLIP72ZS/bundle.json","state_url":"https://pith.science/pith/FD3QPNUDGIQQXXSGQHYLIP72ZS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FD3QPNUDGIQQXXSGQHYLIP72ZS/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-05-27T12:25:37Z","links":{"resolver":"https://pith.science/pith/FD3QPNUDGIQQXXSGQHYLIP72ZS","bundle":"https://pith.science/pith/FD3QPNUDGIQQXXSGQHYLIP72ZS/bundle.json","state":"https://pith.science/pith/FD3QPNUDGIQQXXSGQHYLIP72ZS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FD3QPNUDGIQQXXSGQHYLIP72ZS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FD3QPNUDGIQQXXSGQHYLIP72ZS","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":"c44e2c90a97294ec86f20ecbdaac408810326f5086e70de0fd5a3722d590d0c3","cross_cats_sorted":["cs.CC","cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-03T13:36:12Z","title_canon_sha256":"e95ea3b2f68dec8a733d9489c8f0d78470c9b858cb919745340cd4ab4e5bcc3c"},"schema_version":"1.0","source":{"id":"1811.01216","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.01216","created_at":"2026-05-18T00:01:34Z"},{"alias_kind":"arxiv_version","alias_value":"1811.01216v1","created_at":"2026-05-18T00:01:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01216","created_at":"2026-05-18T00:01:34Z"},{"alias_kind":"pith_short_12","alias_value":"FD3QPNUDGIQQ","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FD3QPNUDGIQQXXSG","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FD3QPNUD","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:15f13990fb3ff9c1b215ecb899c91993b6e4fcf17d85fd43e01e1e6a2dbdc331","target":"graph","created_at":"2026-05-18T00:01:34Z","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"},"paper":{"abstract_excerpt":"We study the problem of learning an unknown mixture of $k$ rankings over $n$ elements, given access to noisy samples drawn from the unknown mixture. We consider a range of different noise models, including natural variants of the \"heat kernel\" noise framework and the Mallows model. For each of these noise models we give an algorithm which, under mild assumptions, learns the unknown mixture to high accuracy and runs in $n^{O(\\log k)}$ time. The best previous algorithms for closely related problems have running times which are exponential in $k$.","authors_text":"Anindya De, Rocco Servedio, Ryan O'Donnell","cross_cats":["cs.CC","cs.DS","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-03T13:36:12Z","title":"Learning sparse mixtures of rankings from noisy information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01216","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:8085c85e6bd303c55beac85aaa59b6fae3633429b8c2c98a099be525698e5730","target":"record","created_at":"2026-05-18T00:01:34Z","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":"c44e2c90a97294ec86f20ecbdaac408810326f5086e70de0fd5a3722d590d0c3","cross_cats_sorted":["cs.CC","cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-03T13:36:12Z","title_canon_sha256":"e95ea3b2f68dec8a733d9489c8f0d78470c9b858cb919745340cd4ab4e5bcc3c"},"schema_version":"1.0","source":{"id":"1811.01216","kind":"arxiv","version":1}},"canonical_sha256":"28f707b68332210bde4681f0b43ffacc942a28e3dd9fde74b4213aa2c92b48ea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"28f707b68332210bde4681f0b43ffacc942a28e3dd9fde74b4213aa2c92b48ea","first_computed_at":"2026-05-18T00:01:34.985664Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:34.985664Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZcydN0m0o5qN7OjqC61xw3xuxKpfzxzlPj33N0WU7Kf4D21cJQvItehNnujBPtpgVYa0QL1kTeGY+ylFyU4oBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:34.986401Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.01216","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8085c85e6bd303c55beac85aaa59b6fae3633429b8c2c98a099be525698e5730","sha256:15f13990fb3ff9c1b215ecb899c91993b6e4fcf17d85fd43e01e1e6a2dbdc331"],"state_sha256":"7fa93db95dd852f2ecaa41280cc4ab9b2591cbe1cd4292117e0ff0866fd5d10f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c0Ze7dinlGX+LUF17TG3iNT30IKITNwO4+6AiguvXYfpB4LrufNvTHrW/lQtUyR7P11PTePcR/lA0WVuqqwhDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T12:25:37.748162Z","bundle_sha256":"9a5603ed377ca75f0f7fb8839d52cb25563c8099ce1bd8dadd6af94dcc3ee2be"}}