{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:N5DSBUBVAQYQF7YP3S5MIVT7HJ","short_pith_number":"pith:N5DSBUBV","canonical_record":{"source":{"id":"1606.08842","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-06-28T19:59:52Z","cross_cats_sorted":["cs.AI","cs.IT","math.IT","stat.ML"],"title_canon_sha256":"c31a15dad3cb8ad0188b0be871ce2d30a1a50d064deba8a88b6e5643a49518c6","abstract_canon_sha256":"55db4469ff8c92f863ddef526993ad5fff6747c6b27db59c0417a9f4ccdbf063"},"schema_version":"1.0"},"canonical_sha256":"6f4720d035043102ff0fdcbac4567f3a668c3b4d1b026962413b57777044b99e","source":{"kind":"arxiv","id":"1606.08842","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.08842","created_at":"2026-05-18T01:04:01Z"},{"alias_kind":"arxiv_version","alias_value":"1606.08842v2","created_at":"2026-05-18T01:04:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.08842","created_at":"2026-05-18T01:04:01Z"},{"alias_kind":"pith_short_12","alias_value":"N5DSBUBVAQYQ","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"N5DSBUBVAQYQF7YP","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"N5DSBUBV","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:N5DSBUBVAQYQF7YP3S5MIVT7HJ","target":"record","payload":{"canonical_record":{"source":{"id":"1606.08842","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-06-28T19:59:52Z","cross_cats_sorted":["cs.AI","cs.IT","math.IT","stat.ML"],"title_canon_sha256":"c31a15dad3cb8ad0188b0be871ce2d30a1a50d064deba8a88b6e5643a49518c6","abstract_canon_sha256":"55db4469ff8c92f863ddef526993ad5fff6747c6b27db59c0417a9f4ccdbf063"},"schema_version":"1.0"},"canonical_sha256":"6f4720d035043102ff0fdcbac4567f3a668c3b4d1b026962413b57777044b99e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:01.097948Z","signature_b64":"cSRkKGCe93uER3dlmK6pe0BAoLWykyLuDE7rTiZulXc/ahJ3AIaO665Twe6eGxLjh1S3ZRdhNbr6GJTrIkHjBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f4720d035043102ff0fdcbac4567f3a668c3b4d1b026962413b57777044b99e","last_reissued_at":"2026-05-18T01:04:01.097263Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:01.097263Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.08842","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-18T01:04:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"82mzZIcL00jaWcj0eJgXT9dBoe9UC1kRjZ++/p8kJgIy8cztEo1GN2jTFZb6UTTHHivAtxlrSntde4Tg80emAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T08:09:28.540588Z"},"content_sha256":"1f789d9fa1610530938cbad94f86a06fa10bf82c4c62eb591d3eb7d128b86703","schema_version":"1.0","event_id":"sha256:1f789d9fa1610530938cbad94f86a06fa10bf82c4c62eb591d3eb7d128b86703"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:N5DSBUBVAQYQF7YP3S5MIVT7HJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Active Ranking from Pairwise Comparisons and when Parametric Assumptions Don't Help","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Kannan Ramchandran, Martin J. Wainwright, Nihar B. Shah, Reinhard Heckel","submitted_at":"2016-06-28T19:59:52Z","abstract_excerpt":"We consider sequential or active ranking of a set of n items based on noisy pairwise comparisons. Items are ranked according to the probability that a given item beats a randomly chosen item, and ranking refers to partitioning the items into sets of pre-specified sizes according to their scores. This notion of ranking includes as special cases the identification of the top-k items and the total ordering of the items. We first analyze a sequential ranking algorithm that counts the number of comparisons won, and uses these counts to decide whether to stop, or to compare another pair of items, ch"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.08842","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-18T01:04:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fj+Tvg8G27B4eBG/Jt9OQ4sdrfpC8rcV8b6IOb4M09MNxyq2x2TL4tDJW2/FvIJioXbdpCBIljpw+oAZomJXAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T08:09:28.540927Z"},"content_sha256":"0f024f45f54068a352ca9809234d1d91e202a9d405a1c2052df15bcc47a495a1","schema_version":"1.0","event_id":"sha256:0f024f45f54068a352ca9809234d1d91e202a9d405a1c2052df15bcc47a495a1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N5DSBUBVAQYQF7YP3S5MIVT7HJ/bundle.json","state_url":"https://pith.science/pith/N5DSBUBVAQYQF7YP3S5MIVT7HJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N5DSBUBVAQYQF7YP3S5MIVT7HJ/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-02T08:09:28Z","links":{"resolver":"https://pith.science/pith/N5DSBUBVAQYQF7YP3S5MIVT7HJ","bundle":"https://pith.science/pith/N5DSBUBVAQYQF7YP3S5MIVT7HJ/bundle.json","state":"https://pith.science/pith/N5DSBUBVAQYQF7YP3S5MIVT7HJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N5DSBUBVAQYQF7YP3S5MIVT7HJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:N5DSBUBVAQYQF7YP3S5MIVT7HJ","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":"55db4469ff8c92f863ddef526993ad5fff6747c6b27db59c0417a9f4ccdbf063","cross_cats_sorted":["cs.AI","cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-06-28T19:59:52Z","title_canon_sha256":"c31a15dad3cb8ad0188b0be871ce2d30a1a50d064deba8a88b6e5643a49518c6"},"schema_version":"1.0","source":{"id":"1606.08842","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.08842","created_at":"2026-05-18T01:04:01Z"},{"alias_kind":"arxiv_version","alias_value":"1606.08842v2","created_at":"2026-05-18T01:04:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.08842","created_at":"2026-05-18T01:04:01Z"},{"alias_kind":"pith_short_12","alias_value":"N5DSBUBVAQYQ","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"N5DSBUBVAQYQF7YP","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"N5DSBUBV","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:0f024f45f54068a352ca9809234d1d91e202a9d405a1c2052df15bcc47a495a1","target":"graph","created_at":"2026-05-18T01:04:01Z","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 consider sequential or active ranking of a set of n items based on noisy pairwise comparisons. Items are ranked according to the probability that a given item beats a randomly chosen item, and ranking refers to partitioning the items into sets of pre-specified sizes according to their scores. This notion of ranking includes as special cases the identification of the top-k items and the total ordering of the items. We first analyze a sequential ranking algorithm that counts the number of comparisons won, and uses these counts to decide whether to stop, or to compare another pair of items, ch","authors_text":"Kannan Ramchandran, Martin J. Wainwright, Nihar B. Shah, Reinhard Heckel","cross_cats":["cs.AI","cs.IT","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-06-28T19:59:52Z","title":"Active Ranking from Pairwise Comparisons and when Parametric Assumptions Don't Help"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.08842","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:1f789d9fa1610530938cbad94f86a06fa10bf82c4c62eb591d3eb7d128b86703","target":"record","created_at":"2026-05-18T01:04:01Z","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":"55db4469ff8c92f863ddef526993ad5fff6747c6b27db59c0417a9f4ccdbf063","cross_cats_sorted":["cs.AI","cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-06-28T19:59:52Z","title_canon_sha256":"c31a15dad3cb8ad0188b0be871ce2d30a1a50d064deba8a88b6e5643a49518c6"},"schema_version":"1.0","source":{"id":"1606.08842","kind":"arxiv","version":2}},"canonical_sha256":"6f4720d035043102ff0fdcbac4567f3a668c3b4d1b026962413b57777044b99e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f4720d035043102ff0fdcbac4567f3a668c3b4d1b026962413b57777044b99e","first_computed_at":"2026-05-18T01:04:01.097263Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:01.097263Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cSRkKGCe93uER3dlmK6pe0BAoLWykyLuDE7rTiZulXc/ahJ3AIaO665Twe6eGxLjh1S3ZRdhNbr6GJTrIkHjBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:01.097948Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.08842","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1f789d9fa1610530938cbad94f86a06fa10bf82c4c62eb591d3eb7d128b86703","sha256:0f024f45f54068a352ca9809234d1d91e202a9d405a1c2052df15bcc47a495a1"],"state_sha256":"a02c79b2561626a7e83998bf0826e69d13675e842ade69e9116d418d3ce0c33d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W/9owjZPtI+MFFnWW2ZrMwNIgDK3jUIu3InAEboeH7F7XZ95p2ClUFCrzj/HkpFLkRh1n1hL916gxVPfDFBtAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T08:09:28.542726Z","bundle_sha256":"b01443eabd3cf4a8f2b7de4c8d942f2a4a63b305e2cd8416720ad0aa19248008"}}