{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:XZZWIXUXE7YVFWQXYGXHHJKPWX","short_pith_number":"pith:XZZWIXUX","canonical_record":{"source":{"id":"1502.05556","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2015-02-19T12:50:13Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d841eef3c266f1e391f8fd644164613fe9d6b0a74a61377032348c46e89d926b","abstract_canon_sha256":"984066de1776e3e5c2c245d2371826eec65eaa7694f60a4d8f83bc515b642aaf"},"schema_version":"1.0"},"canonical_sha256":"be73645e9727f152da17c1ae73a54fb5dab68e3aea20006b3fa99ae9ed903dcc","source":{"kind":"arxiv","id":"1502.05556","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.05556","created_at":"2026-05-18T00:42:18Z"},{"alias_kind":"arxiv_version","alias_value":"1502.05556v2","created_at":"2026-05-18T00:42:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.05556","created_at":"2026-05-18T00:42:18Z"},{"alias_kind":"pith_short_12","alias_value":"XZZWIXUXE7YV","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XZZWIXUXE7YVFWQX","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XZZWIXUX","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:XZZWIXUXE7YVFWQXYGXHHJKPWX","target":"record","payload":{"canonical_record":{"source":{"id":"1502.05556","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2015-02-19T12:50:13Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d841eef3c266f1e391f8fd644164613fe9d6b0a74a61377032348c46e89d926b","abstract_canon_sha256":"984066de1776e3e5c2c245d2371826eec65eaa7694f60a4d8f83bc515b642aaf"},"schema_version":"1.0"},"canonical_sha256":"be73645e9727f152da17c1ae73a54fb5dab68e3aea20006b3fa99ae9ed903dcc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:18.989758Z","signature_b64":"UchMBzCzQcoOGVAJKyWf2jL2D7U8K0sPQ6LYSNVZSsd7Myb8p6FjxA4bSVlpv27b02PT6BmfJdrCaWPn+vbVCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be73645e9727f152da17c1ae73a54fb5dab68e3aea20006b3fa99ae9ed903dcc","last_reissued_at":"2026-05-18T00:42:18.989225Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:18.989225Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.05556","source_version":2,"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:42:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B6+X8DlD9Yb0xi5/mmTBebqpbodw9M3u5Icw8+kWke5Z8o3ou+eRAokP6Hn3hnfz1PcfZFmy2xO8wL1ABbonCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:40:01.392379Z"},"content_sha256":"71f5e4e60d4cf57b1804858fd5c2a454c0f648194de972221165e0d9030acf39","schema_version":"1.0","event_id":"sha256:71f5e4e60d4cf57b1804858fd5c2a454c0f648194de972221165e0d9030acf39"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:XZZWIXUXE7YVFWQXYGXHHJKPWX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Just Sort It! A Simple and Effective Approach to Active Preference Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Lucas Maystre, Matthias Grossglauser","submitted_at":"2015-02-19T12:50:13Z","abstract_excerpt":"We address the problem of learning a ranking by using adaptively chosen pairwise comparisons. Our goal is to recover the ranking accurately but to sample the comparisons sparingly. If all comparison outcomes are consistent with the ranking, the optimal solution is to use an efficient sorting algorithm, such as Quicksort. But how do sorting algorithms behave if some comparison outcomes are inconsistent with the ranking? We give favorable guarantees for Quicksort for the popular Bradley-Terry model, under natural assumptions on the parameters. Furthermore, we empirically demonstrate that sorting"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.05556","kind":"arxiv","version":2},"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:42:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bbe5nDGGqDykYkVhCMzpglSW8zvjnxr/atKoaMzGWY/WxETvPep8ljYnbC/kqXMowip0MfL+l1+/61zQvALnAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:40:01.393050Z"},"content_sha256":"bb6270980988d674eb2f5b089273aa9bee221fd60179878809a267c8dfa6f4e0","schema_version":"1.0","event_id":"sha256:bb6270980988d674eb2f5b089273aa9bee221fd60179878809a267c8dfa6f4e0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XZZWIXUXE7YVFWQXYGXHHJKPWX/bundle.json","state_url":"https://pith.science/pith/XZZWIXUXE7YVFWQXYGXHHJKPWX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XZZWIXUXE7YVFWQXYGXHHJKPWX/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-06-09T07:40:01Z","links":{"resolver":"https://pith.science/pith/XZZWIXUXE7YVFWQXYGXHHJKPWX","bundle":"https://pith.science/pith/XZZWIXUXE7YVFWQXYGXHHJKPWX/bundle.json","state":"https://pith.science/pith/XZZWIXUXE7YVFWQXYGXHHJKPWX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XZZWIXUXE7YVFWQXYGXHHJKPWX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:XZZWIXUXE7YVFWQXYGXHHJKPWX","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":"984066de1776e3e5c2c245d2371826eec65eaa7694f60a4d8f83bc515b642aaf","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2015-02-19T12:50:13Z","title_canon_sha256":"d841eef3c266f1e391f8fd644164613fe9d6b0a74a61377032348c46e89d926b"},"schema_version":"1.0","source":{"id":"1502.05556","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.05556","created_at":"2026-05-18T00:42:18Z"},{"alias_kind":"arxiv_version","alias_value":"1502.05556v2","created_at":"2026-05-18T00:42:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.05556","created_at":"2026-05-18T00:42:18Z"},{"alias_kind":"pith_short_12","alias_value":"XZZWIXUXE7YV","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XZZWIXUXE7YVFWQX","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XZZWIXUX","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:bb6270980988d674eb2f5b089273aa9bee221fd60179878809a267c8dfa6f4e0","target":"graph","created_at":"2026-05-18T00:42:18Z","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 address the problem of learning a ranking by using adaptively chosen pairwise comparisons. Our goal is to recover the ranking accurately but to sample the comparisons sparingly. If all comparison outcomes are consistent with the ranking, the optimal solution is to use an efficient sorting algorithm, such as Quicksort. But how do sorting algorithms behave if some comparison outcomes are inconsistent with the ranking? We give favorable guarantees for Quicksort for the popular Bradley-Terry model, under natural assumptions on the parameters. Furthermore, we empirically demonstrate that sorting","authors_text":"Lucas Maystre, Matthias Grossglauser","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2015-02-19T12:50:13Z","title":"Just Sort It! A Simple and Effective Approach to Active Preference Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.05556","kind":"arxiv","version":2},"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:71f5e4e60d4cf57b1804858fd5c2a454c0f648194de972221165e0d9030acf39","target":"record","created_at":"2026-05-18T00:42:18Z","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":"984066de1776e3e5c2c245d2371826eec65eaa7694f60a4d8f83bc515b642aaf","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2015-02-19T12:50:13Z","title_canon_sha256":"d841eef3c266f1e391f8fd644164613fe9d6b0a74a61377032348c46e89d926b"},"schema_version":"1.0","source":{"id":"1502.05556","kind":"arxiv","version":2}},"canonical_sha256":"be73645e9727f152da17c1ae73a54fb5dab68e3aea20006b3fa99ae9ed903dcc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"be73645e9727f152da17c1ae73a54fb5dab68e3aea20006b3fa99ae9ed903dcc","first_computed_at":"2026-05-18T00:42:18.989225Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:18.989225Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UchMBzCzQcoOGVAJKyWf2jL2D7U8K0sPQ6LYSNVZSsd7Myb8p6FjxA4bSVlpv27b02PT6BmfJdrCaWPn+vbVCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:18.989758Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.05556","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:71f5e4e60d4cf57b1804858fd5c2a454c0f648194de972221165e0d9030acf39","sha256:bb6270980988d674eb2f5b089273aa9bee221fd60179878809a267c8dfa6f4e0"],"state_sha256":"7cf7e08d96885f14ccee7f90f87b294c09165c0faa91ade274abcccb10445b9e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W6SSupsoOmPaWFSuRSZZEqih90QjNpJabJFs/EW2lvSxliJC5oRTIi2CJ72LQZIMjrkgiGnnkI5RSfb43K/ZDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T07:40:01.396890Z","bundle_sha256":"d186989eeddb1175ce9b679e6457acc6e0e0e5cd761fad5aa0aa6bd624b609af"}}