{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:XUZNS6HTP3U3N7TTKLHXZM53TH","short_pith_number":"pith:XUZNS6HT","canonical_record":{"source":{"id":"1602.04567","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2016-02-15T06:22:59Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT","stat.ML"],"title_canon_sha256":"21e38b99bb0a4cbafd427a2bb3c1f893e9601457b33fef8eccf755f0d30b6709","abstract_canon_sha256":"484f8c1909396137b484f868a5185f45adc8f3dcc144ff2df9f9cbcf39a3624d"},"schema_version":"1.0"},"canonical_sha256":"bd32d978f37ee9b6fe7352cf7cb3bb99ce83dab3b9414d7d3a95c16787c49ec7","source":{"kind":"arxiv","id":"1602.04567","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.04567","created_at":"2026-05-18T01:20:49Z"},{"alias_kind":"arxiv_version","alias_value":"1602.04567v1","created_at":"2026-05-18T01:20:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04567","created_at":"2026-05-18T01:20:49Z"},{"alias_kind":"pith_short_12","alias_value":"XUZNS6HTP3U3","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XUZNS6HTP3U3N7TT","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XUZNS6HT","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:XUZNS6HTP3U3N7TTKLHXZM53TH","target":"record","payload":{"canonical_record":{"source":{"id":"1602.04567","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2016-02-15T06:22:59Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT","stat.ML"],"title_canon_sha256":"21e38b99bb0a4cbafd427a2bb3c1f893e9601457b33fef8eccf755f0d30b6709","abstract_canon_sha256":"484f8c1909396137b484f868a5185f45adc8f3dcc144ff2df9f9cbcf39a3624d"},"schema_version":"1.0"},"canonical_sha256":"bd32d978f37ee9b6fe7352cf7cb3bb99ce83dab3b9414d7d3a95c16787c49ec7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:49.660428Z","signature_b64":"i7tvFSHVCjIxWPwh1aWch6IZ7Hctjq/dk8ygHfE6q6+9t2ll4N2aCaJ2pmWKRNTaopcTbQvUvCyZ+ABS34ilDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd32d978f37ee9b6fe7352cf7cb3bb99ce83dab3b9414d7d3a95c16787c49ec7","last_reissued_at":"2026-05-18T01:20:49.659992Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:49.659992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.04567","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:20:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xbvP+7dfNa1lVFC2nF3+BNLX1cMmqvxp8RS+AiUXgsOnFdI7MhZLo+O44MdD+JhumXL1kcxjUc5oUOwU9DrXAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:05:56.942524Z"},"content_sha256":"3f66024260572380633387b7aa2e6c734fdba4d4b61722e89834fefd87a6acb0","schema_version":"1.0","event_id":"sha256:3f66024260572380633387b7aa2e6c734fdba4d4b61722e89834fefd87a6acb0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:XUZNS6HTP3U3N7TTKLHXZM53TH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adversarial Top-$K$ Ranking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT","stat.ML"],"primary_cat":"cs.IR","authors_text":"Changho Suh, Renbo Zhao, Vincent Y. F. Tan","submitted_at":"2016-02-15T06:22:59Z","abstract_excerpt":"We study the top-$K$ ranking problem where the goal is to recover the set of top-$K$ ranked items out of a large collection of items based on partially revealed preferences. We consider an adversarial crowdsourced setting where there are two population sets, and pairwise comparison samples drawn from one of the populations follow the standard Bradley-Terry-Luce model (i.e., the chance of item $i$ beating item $j$ is proportional to the relative score of item $i$ to item $j$), while in the other population, the corresponding chance is inversely proportional to the relative score. When the relat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04567","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:20:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Xw6M6xtqsx1u7oMQqx9gS6YTKzXKESlrrXw1rPoJ0JJeFV1+k+JUJbSmtb1XyIubar0Wmu7YZn7qxcJeng3CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:05:56.942874Z"},"content_sha256":"06df3655b03c94a488634c2a935838d10976eb3287aedf0d98b8311944c7d85a","schema_version":"1.0","event_id":"sha256:06df3655b03c94a488634c2a935838d10976eb3287aedf0d98b8311944c7d85a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XUZNS6HTP3U3N7TTKLHXZM53TH/bundle.json","state_url":"https://pith.science/pith/XUZNS6HTP3U3N7TTKLHXZM53TH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XUZNS6HTP3U3N7TTKLHXZM53TH/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-02T05:05:56Z","links":{"resolver":"https://pith.science/pith/XUZNS6HTP3U3N7TTKLHXZM53TH","bundle":"https://pith.science/pith/XUZNS6HTP3U3N7TTKLHXZM53TH/bundle.json","state":"https://pith.science/pith/XUZNS6HTP3U3N7TTKLHXZM53TH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XUZNS6HTP3U3N7TTKLHXZM53TH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:XUZNS6HTP3U3N7TTKLHXZM53TH","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":"484f8c1909396137b484f868a5185f45adc8f3dcc144ff2df9f9cbcf39a3624d","cross_cats_sorted":["cs.IT","cs.LG","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2016-02-15T06:22:59Z","title_canon_sha256":"21e38b99bb0a4cbafd427a2bb3c1f893e9601457b33fef8eccf755f0d30b6709"},"schema_version":"1.0","source":{"id":"1602.04567","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.04567","created_at":"2026-05-18T01:20:49Z"},{"alias_kind":"arxiv_version","alias_value":"1602.04567v1","created_at":"2026-05-18T01:20:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04567","created_at":"2026-05-18T01:20:49Z"},{"alias_kind":"pith_short_12","alias_value":"XUZNS6HTP3U3","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XUZNS6HTP3U3N7TT","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XUZNS6HT","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:06df3655b03c94a488634c2a935838d10976eb3287aedf0d98b8311944c7d85a","target":"graph","created_at":"2026-05-18T01:20:49Z","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 top-$K$ ranking problem where the goal is to recover the set of top-$K$ ranked items out of a large collection of items based on partially revealed preferences. We consider an adversarial crowdsourced setting where there are two population sets, and pairwise comparison samples drawn from one of the populations follow the standard Bradley-Terry-Luce model (i.e., the chance of item $i$ beating item $j$ is proportional to the relative score of item $i$ to item $j$), while in the other population, the corresponding chance is inversely proportional to the relative score. When the relat","authors_text":"Changho Suh, Renbo Zhao, Vincent Y. F. Tan","cross_cats":["cs.IT","cs.LG","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2016-02-15T06:22:59Z","title":"Adversarial Top-$K$ Ranking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04567","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:3f66024260572380633387b7aa2e6c734fdba4d4b61722e89834fefd87a6acb0","target":"record","created_at":"2026-05-18T01:20:49Z","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":"484f8c1909396137b484f868a5185f45adc8f3dcc144ff2df9f9cbcf39a3624d","cross_cats_sorted":["cs.IT","cs.LG","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2016-02-15T06:22:59Z","title_canon_sha256":"21e38b99bb0a4cbafd427a2bb3c1f893e9601457b33fef8eccf755f0d30b6709"},"schema_version":"1.0","source":{"id":"1602.04567","kind":"arxiv","version":1}},"canonical_sha256":"bd32d978f37ee9b6fe7352cf7cb3bb99ce83dab3b9414d7d3a95c16787c49ec7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bd32d978f37ee9b6fe7352cf7cb3bb99ce83dab3b9414d7d3a95c16787c49ec7","first_computed_at":"2026-05-18T01:20:49.659992Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:49.659992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"i7tvFSHVCjIxWPwh1aWch6IZ7Hctjq/dk8ygHfE6q6+9t2ll4N2aCaJ2pmWKRNTaopcTbQvUvCyZ+ABS34ilDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:49.660428Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.04567","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f66024260572380633387b7aa2e6c734fdba4d4b61722e89834fefd87a6acb0","sha256:06df3655b03c94a488634c2a935838d10976eb3287aedf0d98b8311944c7d85a"],"state_sha256":"b78f18cf080d111c5931604f8bd83ded28ada14de494739c0034118750e0acad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nbEJkF4gwSfRDq9Dzvho86C8yVLkiHNRdWdY7dpMellyNC7K5kRmzMBmwU56Mi4rL2OPnEqvz7IHexz8NfzhCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T05:05:56.944917Z","bundle_sha256":"6e8f22083a0489594de89350e93b11591b5031bbd3eb71a34d0c177e19bfe5a0"}}