{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:OMAI6RFIKAWPM3AA4J5BWVWWKV","short_pith_number":"pith:OMAI6RFI","canonical_record":{"source":{"id":"1603.04153","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-14T07:01:28Z","cross_cats_sorted":["cs.IT","cs.SI","math.IT","stat.ML"],"title_canon_sha256":"a61d6a5c43dfe7ffbfe659005d47088dbfeb639da498a3c71a5034f3ce21e7ad","abstract_canon_sha256":"8b295b1505cfe5d510f48d1c2c88c1c8b3ba0601582ef0c834bfb633c7d94fa1"},"schema_version":"1.0"},"canonical_sha256":"73008f44a8502cf66c00e27a1b56d6554763320c87a52b4c9085cbc21cac5e0a","source":{"kind":"arxiv","id":"1603.04153","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.04153","created_at":"2026-05-18T01:19:09Z"},{"alias_kind":"arxiv_version","alias_value":"1603.04153v1","created_at":"2026-05-18T01:19:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04153","created_at":"2026-05-18T01:19:09Z"},{"alias_kind":"pith_short_12","alias_value":"OMAI6RFIKAWP","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OMAI6RFIKAWPM3AA","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OMAI6RFI","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:OMAI6RFIKAWPM3AA4J5BWVWWKV","target":"record","payload":{"canonical_record":{"source":{"id":"1603.04153","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-14T07:01:28Z","cross_cats_sorted":["cs.IT","cs.SI","math.IT","stat.ML"],"title_canon_sha256":"a61d6a5c43dfe7ffbfe659005d47088dbfeb639da498a3c71a5034f3ce21e7ad","abstract_canon_sha256":"8b295b1505cfe5d510f48d1c2c88c1c8b3ba0601582ef0c834bfb633c7d94fa1"},"schema_version":"1.0"},"canonical_sha256":"73008f44a8502cf66c00e27a1b56d6554763320c87a52b4c9085cbc21cac5e0a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:09.274836Z","signature_b64":"jTNZkzc7qajl017bJzTzY0Es0ts0dPspnON7P78uLtsFUfkgPx/Cq51jzMCbC8smyz0u//faRoXBoi8RxQOtAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73008f44a8502cf66c00e27a1b56d6554763320c87a52b4c9085cbc21cac5e0a","last_reissued_at":"2026-05-18T01:19:09.274137Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:09.274137Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.04153","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-18T01:19:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L8ZYIR6baGHB/GddIpPPb3eQEntsP/WcT+X2VzLfOXPe6t2gS9P626+nwLGS6MhJqXHwEohuu9d9lyhBnAuAAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T04:50:25.542404Z"},"content_sha256":"75f5e86b7a24543d24ca8f39fc8b81aa514833b4c43fa4dfab15b6a05fe008b9","schema_version":"1.0","event_id":"sha256:75f5e86b7a24543d24ca8f39fc8b81aa514833b4c43fa4dfab15b6a05fe008b9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:OMAI6RFIKAWPM3AA4J5BWVWWKV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Top-$K$ Ranking from Pairwise Comparisons: When Spectral Ranking is Optimal","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.SI","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Changho Suh, Minje Jang, Sewoong Oh, Sunghyun Kim","submitted_at":"2016-03-14T07:01:28Z","abstract_excerpt":"We explore the top-$K$ rank aggregation problem. Suppose a collection of items is compared in pairs repeatedly, and we aim to recover a consistent ordering that focuses on the top-$K$ ranked items based on partially revealed preference information. We investigate the Bradley-Terry-Luce model in which one ranks items according to their perceived utilities modeled as noisy observations of their underlying true utilities. Our main contributions are two-fold. First, in a general comparison model where item pairs to compare are given a priori, we attain an upper and lower bound on the sample size f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04153","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-18T01:19:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lbcy+EeDpPqdNfDyfhb2OuhSua+raU1GWOxmxGBRBNy0UDxqBaS2JK22uSN+nJiihwETkBHQVYkLD+8hjlYkBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T04:50:25.543113Z"},"content_sha256":"131da18823ade16370035253afae8063d5a59f07f075fb7267423b1d03e269cd","schema_version":"1.0","event_id":"sha256:131da18823ade16370035253afae8063d5a59f07f075fb7267423b1d03e269cd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OMAI6RFIKAWPM3AA4J5BWVWWKV/bundle.json","state_url":"https://pith.science/pith/OMAI6RFIKAWPM3AA4J5BWVWWKV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OMAI6RFIKAWPM3AA4J5BWVWWKV/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-10T04:50:25Z","links":{"resolver":"https://pith.science/pith/OMAI6RFIKAWPM3AA4J5BWVWWKV","bundle":"https://pith.science/pith/OMAI6RFIKAWPM3AA4J5BWVWWKV/bundle.json","state":"https://pith.science/pith/OMAI6RFIKAWPM3AA4J5BWVWWKV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OMAI6RFIKAWPM3AA4J5BWVWWKV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:OMAI6RFIKAWPM3AA4J5BWVWWKV","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":"8b295b1505cfe5d510f48d1c2c88c1c8b3ba0601582ef0c834bfb633c7d94fa1","cross_cats_sorted":["cs.IT","cs.SI","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-14T07:01:28Z","title_canon_sha256":"a61d6a5c43dfe7ffbfe659005d47088dbfeb639da498a3c71a5034f3ce21e7ad"},"schema_version":"1.0","source":{"id":"1603.04153","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.04153","created_at":"2026-05-18T01:19:09Z"},{"alias_kind":"arxiv_version","alias_value":"1603.04153v1","created_at":"2026-05-18T01:19:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04153","created_at":"2026-05-18T01:19:09Z"},{"alias_kind":"pith_short_12","alias_value":"OMAI6RFIKAWP","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OMAI6RFIKAWPM3AA","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OMAI6RFI","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:131da18823ade16370035253afae8063d5a59f07f075fb7267423b1d03e269cd","target":"graph","created_at":"2026-05-18T01:19:09Z","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 explore the top-$K$ rank aggregation problem. Suppose a collection of items is compared in pairs repeatedly, and we aim to recover a consistent ordering that focuses on the top-$K$ ranked items based on partially revealed preference information. We investigate the Bradley-Terry-Luce model in which one ranks items according to their perceived utilities modeled as noisy observations of their underlying true utilities. Our main contributions are two-fold. First, in a general comparison model where item pairs to compare are given a priori, we attain an upper and lower bound on the sample size f","authors_text":"Changho Suh, Minje Jang, Sewoong Oh, Sunghyun Kim","cross_cats":["cs.IT","cs.SI","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-14T07:01:28Z","title":"Top-$K$ Ranking from Pairwise Comparisons: When Spectral Ranking is Optimal"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04153","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:75f5e86b7a24543d24ca8f39fc8b81aa514833b4c43fa4dfab15b6a05fe008b9","target":"record","created_at":"2026-05-18T01:19:09Z","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":"8b295b1505cfe5d510f48d1c2c88c1c8b3ba0601582ef0c834bfb633c7d94fa1","cross_cats_sorted":["cs.IT","cs.SI","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-14T07:01:28Z","title_canon_sha256":"a61d6a5c43dfe7ffbfe659005d47088dbfeb639da498a3c71a5034f3ce21e7ad"},"schema_version":"1.0","source":{"id":"1603.04153","kind":"arxiv","version":1}},"canonical_sha256":"73008f44a8502cf66c00e27a1b56d6554763320c87a52b4c9085cbc21cac5e0a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"73008f44a8502cf66c00e27a1b56d6554763320c87a52b4c9085cbc21cac5e0a","first_computed_at":"2026-05-18T01:19:09.274137Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:09.274137Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jTNZkzc7qajl017bJzTzY0Es0ts0dPspnON7P78uLtsFUfkgPx/Cq51jzMCbC8smyz0u//faRoXBoi8RxQOtAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:09.274836Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.04153","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:75f5e86b7a24543d24ca8f39fc8b81aa514833b4c43fa4dfab15b6a05fe008b9","sha256:131da18823ade16370035253afae8063d5a59f07f075fb7267423b1d03e269cd"],"state_sha256":"9a0497a48d9a7fd4a76eaa9a562d2c1f46f43c87bdc47abd629e03fc531cbcf4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CEdveIKPAVG8LzoVEQr3RE1Qem5RCDJBU7vd4H3QSLulXAFILf+0WwmLUmFrHvP5e0vTexw0JOhcUhoelxeDCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T04:50:25.547127Z","bundle_sha256":"df6f051adc4658522332757daa1749868f24afb212480f40d57ecbc4e29f7f6b"}}