{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:3G6IXJXLUKXSRBIIHOIW54UIBW","short_pith_number":"pith:3G6IXJXL","canonical_record":{"source":{"id":"1011.0108","kind":"arxiv","version":11},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-10-30T21:47:19Z","cross_cats_sorted":[],"title_canon_sha256":"197529ff73d29b7218d9930f782470662a400d4445a5c5b340d76f58b2c864c3","abstract_canon_sha256":"647140eb232fa08db48c43dc0af0841133b0df573a8924f9441ef3e7190d9b11"},"schema_version":"1.0"},"canonical_sha256":"d9bc8ba6eba2af2885083b916ef2880d92579188431e644ab5ee53fc116ac724","source":{"kind":"arxiv","id":"1011.0108","version":11},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.0108","created_at":"2026-05-18T04:22:00Z"},{"alias_kind":"arxiv_version","alias_value":"1011.0108v11","created_at":"2026-05-18T04:22:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.0108","created_at":"2026-05-18T04:22:00Z"},{"alias_kind":"pith_short_12","alias_value":"3G6IXJXLUKXS","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"3G6IXJXLUKXSRBII","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"3G6IXJXL","created_at":"2026-05-18T12:26:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:3G6IXJXLUKXSRBIIHOIW54UIBW","target":"record","payload":{"canonical_record":{"source":{"id":"1011.0108","kind":"arxiv","version":11},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-10-30T21:47:19Z","cross_cats_sorted":[],"title_canon_sha256":"197529ff73d29b7218d9930f782470662a400d4445a5c5b340d76f58b2c864c3","abstract_canon_sha256":"647140eb232fa08db48c43dc0af0841133b0df573a8924f9441ef3e7190d9b11"},"schema_version":"1.0"},"canonical_sha256":"d9bc8ba6eba2af2885083b916ef2880d92579188431e644ab5ee53fc116ac724","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:22:00.781004Z","signature_b64":"1vqNOzhKlfwxNuSPH0yv24oxgzhMm1f7hic34FSSqbSaZTJ1lFJOsTKhrTjS8e/yZaVlZKpkRgUijXxc9cQlAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9bc8ba6eba2af2885083b916ef2880d92579188431e644ab5ee53fc116ac724","last_reissued_at":"2026-05-18T04:22:00.780597Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:22:00.780597Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.0108","source_version":11,"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-18T04:22:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6JSSszyziw4J3+gYaTcotsoL7Xi8euZHEl/bp0POxHGiBU1XIlZSESGp0niacIF2dfdbN2znMfltWzP9wS7SDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:18:12.380612Z"},"content_sha256":"aed093a6185eb17aae40f74c15cb544ebc14efada2f12cc8ee775e4b208cc69d","schema_version":"1.0","event_id":"sha256:aed093a6185eb17aae40f74c15cb544ebc14efada2f12cc8ee775e4b208cc69d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:3G6IXJXLUKXSRBIIHOIW54UIBW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Active Learning Algorithm for Ranking from Pairwise Preferences with an Almost Optimal Query Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Nir Ailon","submitted_at":"2010-10-30T21:47:19Z","abstract_excerpt":"We study the problem of learning to rank from pairwise preferences, and solve a long-standing open problem that has led to development of many heuristics but no provable results for our particular problem. Given a set $V$ of $n$ elements, we wish to linearly order them given pairwise preference labels. A pairwise preference label is obtained as a response, typically from a human, to the question \"which if preferred, u or v?$ for two elements $u,v\\in V$. We assume possible non-transitivity paradoxes which may arise naturally due to human mistakes or irrationality. The goal is to linearly order "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.0108","kind":"arxiv","version":11},"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-18T04:22:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D18eyJ0XauazbJeymle9zPO1nC8Lvwb4XTKvznNJXt5BCYvvPCnBYe6vZOR1XWwpzSuAXAsoAHdV1xNIuONRAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:18:12.380973Z"},"content_sha256":"e59c08c4196b117163172bd15a55925728794947fff401d6703e1c32cf18eee8","schema_version":"1.0","event_id":"sha256:e59c08c4196b117163172bd15a55925728794947fff401d6703e1c32cf18eee8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3G6IXJXLUKXSRBIIHOIW54UIBW/bundle.json","state_url":"https://pith.science/pith/3G6IXJXLUKXSRBIIHOIW54UIBW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3G6IXJXLUKXSRBIIHOIW54UIBW/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-02T07:18:12Z","links":{"resolver":"https://pith.science/pith/3G6IXJXLUKXSRBIIHOIW54UIBW","bundle":"https://pith.science/pith/3G6IXJXLUKXSRBIIHOIW54UIBW/bundle.json","state":"https://pith.science/pith/3G6IXJXLUKXSRBIIHOIW54UIBW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3G6IXJXLUKXSRBIIHOIW54UIBW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:3G6IXJXLUKXSRBIIHOIW54UIBW","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":"647140eb232fa08db48c43dc0af0841133b0df573a8924f9441ef3e7190d9b11","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-10-30T21:47:19Z","title_canon_sha256":"197529ff73d29b7218d9930f782470662a400d4445a5c5b340d76f58b2c864c3"},"schema_version":"1.0","source":{"id":"1011.0108","kind":"arxiv","version":11}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.0108","created_at":"2026-05-18T04:22:00Z"},{"alias_kind":"arxiv_version","alias_value":"1011.0108v11","created_at":"2026-05-18T04:22:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.0108","created_at":"2026-05-18T04:22:00Z"},{"alias_kind":"pith_short_12","alias_value":"3G6IXJXLUKXS","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"3G6IXJXLUKXSRBII","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"3G6IXJXL","created_at":"2026-05-18T12:26:03Z"}],"graph_snapshots":[{"event_id":"sha256:e59c08c4196b117163172bd15a55925728794947fff401d6703e1c32cf18eee8","target":"graph","created_at":"2026-05-18T04:22:00Z","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 to rank from pairwise preferences, and solve a long-standing open problem that has led to development of many heuristics but no provable results for our particular problem. Given a set $V$ of $n$ elements, we wish to linearly order them given pairwise preference labels. A pairwise preference label is obtained as a response, typically from a human, to the question \"which if preferred, u or v?$ for two elements $u,v\\in V$. We assume possible non-transitivity paradoxes which may arise naturally due to human mistakes or irrationality. The goal is to linearly order ","authors_text":"Nir Ailon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-10-30T21:47:19Z","title":"An Active Learning Algorithm for Ranking from Pairwise Preferences with an Almost Optimal Query Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.0108","kind":"arxiv","version":11},"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:aed093a6185eb17aae40f74c15cb544ebc14efada2f12cc8ee775e4b208cc69d","target":"record","created_at":"2026-05-18T04:22:00Z","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":"647140eb232fa08db48c43dc0af0841133b0df573a8924f9441ef3e7190d9b11","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-10-30T21:47:19Z","title_canon_sha256":"197529ff73d29b7218d9930f782470662a400d4445a5c5b340d76f58b2c864c3"},"schema_version":"1.0","source":{"id":"1011.0108","kind":"arxiv","version":11}},"canonical_sha256":"d9bc8ba6eba2af2885083b916ef2880d92579188431e644ab5ee53fc116ac724","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d9bc8ba6eba2af2885083b916ef2880d92579188431e644ab5ee53fc116ac724","first_computed_at":"2026-05-18T04:22:00.780597Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:22:00.780597Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1vqNOzhKlfwxNuSPH0yv24oxgzhMm1f7hic34FSSqbSaZTJ1lFJOsTKhrTjS8e/yZaVlZKpkRgUijXxc9cQlAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:22:00.781004Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.0108","source_kind":"arxiv","source_version":11}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aed093a6185eb17aae40f74c15cb544ebc14efada2f12cc8ee775e4b208cc69d","sha256:e59c08c4196b117163172bd15a55925728794947fff401d6703e1c32cf18eee8"],"state_sha256":"80234766420aedc0560155067018e6bcb46376fe08c7163307dce8abde34b3f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jkdOwP0cmjfx3OCmQbxYlv2bV4d3rlQ30BXPKp3HPohirqWLg5MfglucGN1RD3JHjRyd+zWSa9fN0pUc53xpDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T07:18:12.383323Z","bundle_sha256":"b44eaf6832e61e5640b41806af00706a5bec0c168a6163249d46c4abf2dbb3f1"}}