{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:AAZX24ZTNVGH74TGFDM7UA6VB6","short_pith_number":"pith:AAZX24ZT","canonical_record":{"source":{"id":"1707.09971","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-07-31T17:33:15Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"title_canon_sha256":"a79e19f77670d86cb4b1bf8b740e24ee18eea87da8ae3b1cedddbf401874492d","abstract_canon_sha256":"f7dfb988660929bc52aceb2afede2c09b22a52ac871217cd9c1ac73e29a2328d"},"schema_version":"1.0"},"canonical_sha256":"00337d73336d4c7ff26628d9fa03d50fb6cd1dc171cf27b184b45d8b16ceac2f","source":{"kind":"arxiv","id":"1707.09971","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.09971","created_at":"2026-05-17T23:43:33Z"},{"alias_kind":"arxiv_version","alias_value":"1707.09971v3","created_at":"2026-05-17T23:43:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.09971","created_at":"2026-05-17T23:43:33Z"},{"alias_kind":"pith_short_12","alias_value":"AAZX24ZTNVGH","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AAZX24ZTNVGH74TG","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AAZX24ZT","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:AAZX24ZTNVGH74TGFDM7UA6VB6","target":"record","payload":{"canonical_record":{"source":{"id":"1707.09971","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-07-31T17:33:15Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"title_canon_sha256":"a79e19f77670d86cb4b1bf8b740e24ee18eea87da8ae3b1cedddbf401874492d","abstract_canon_sha256":"f7dfb988660929bc52aceb2afede2c09b22a52ac871217cd9c1ac73e29a2328d"},"schema_version":"1.0"},"canonical_sha256":"00337d73336d4c7ff26628d9fa03d50fb6cd1dc171cf27b184b45d8b16ceac2f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:33.480763Z","signature_b64":"BjET+vCsAG6cRTznaMwUvGVJ8uoaq80Nooqf2AspotPGF4Nb9WMX8E1zejIOslcDa2Ly4GGTJR87jJGOBOO+DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00337d73336d4c7ff26628d9fa03d50fb6cd1dc171cf27b184b45d8b16ceac2f","last_reissued_at":"2026-05-17T23:43:33.480381Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:33.480381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.09971","source_version":3,"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-17T23:43:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"voifoXMsSSwHstS4ZOEO5DRLq4/2RrNWTshqHBc0v71TSBuDEO3oMnpAnAal/7f+prphCIyFZu20Ja5PGt1nCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:35:23.926794Z"},"content_sha256":"12f3bdeb73559eeefe53b7d1dbfd7f5fbe26d63562592908da1fe6ba5e34f6e5","schema_version":"1.0","event_id":"sha256:12f3bdeb73559eeefe53b7d1dbfd7f5fbe26d63562592908da1fe6ba5e34f6e5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:AAZX24ZTNVGH74TGFDM7UA6VB6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Spectral Method and Regularized MLE Are Both Optimal for Top-$K$ Ranking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Cong Ma, Jianqing Fan, Kaizheng Wang, Yuxin Chen","submitted_at":"2017-07-31T17:33:15Z","abstract_excerpt":"This paper is concerned with the problem of top-$K$ ranking from pairwise comparisons. Given a collection of $n$ items and a few pairwise comparisons across them, one wishes to identify the set of $K$ items that receive the highest ranks. To tackle this problem, we adopt the logistic parametric model --- the Bradley-Terry-Luce model, where each item is assigned a latent preference score, and where the outcome of each pairwise comparison depends solely on the relative scores of the two items involved. Recent works have made significant progress towards characterizing the performance (e.g. the m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.09971","kind":"arxiv","version":3},"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-17T23:43:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E+Y3O8iJKVd3+rmexfBwslWz2uwtqMEZkY0lKqX2D/PYvqbYc2158K+aQy3+rLxbaQM5PyxtfD9FRJDWwnsVCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:35:23.927597Z"},"content_sha256":"e30c8ed84aaa5a50521a4c24666ddf9e2006d06d110ae6e6537c005b4f614a1e","schema_version":"1.0","event_id":"sha256:e30c8ed84aaa5a50521a4c24666ddf9e2006d06d110ae6e6537c005b4f614a1e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AAZX24ZTNVGH74TGFDM7UA6VB6/bundle.json","state_url":"https://pith.science/pith/AAZX24ZTNVGH74TGFDM7UA6VB6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AAZX24ZTNVGH74TGFDM7UA6VB6/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-05-30T16:35:23Z","links":{"resolver":"https://pith.science/pith/AAZX24ZTNVGH74TGFDM7UA6VB6","bundle":"https://pith.science/pith/AAZX24ZTNVGH74TGFDM7UA6VB6/bundle.json","state":"https://pith.science/pith/AAZX24ZTNVGH74TGFDM7UA6VB6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AAZX24ZTNVGH74TGFDM7UA6VB6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:AAZX24ZTNVGH74TGFDM7UA6VB6","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":"f7dfb988660929bc52aceb2afede2c09b22a52ac871217cd9c1ac73e29a2328d","cross_cats_sorted":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-07-31T17:33:15Z","title_canon_sha256":"a79e19f77670d86cb4b1bf8b740e24ee18eea87da8ae3b1cedddbf401874492d"},"schema_version":"1.0","source":{"id":"1707.09971","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.09971","created_at":"2026-05-17T23:43:33Z"},{"alias_kind":"arxiv_version","alias_value":"1707.09971v3","created_at":"2026-05-17T23:43:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.09971","created_at":"2026-05-17T23:43:33Z"},{"alias_kind":"pith_short_12","alias_value":"AAZX24ZTNVGH","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AAZX24ZTNVGH74TG","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AAZX24ZT","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:e30c8ed84aaa5a50521a4c24666ddf9e2006d06d110ae6e6537c005b4f614a1e","target":"graph","created_at":"2026-05-17T23:43:33Z","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":"This paper is concerned with the problem of top-$K$ ranking from pairwise comparisons. Given a collection of $n$ items and a few pairwise comparisons across them, one wishes to identify the set of $K$ items that receive the highest ranks. To tackle this problem, we adopt the logistic parametric model --- the Bradley-Terry-Luce model, where each item is assigned a latent preference score, and where the outcome of each pairwise comparison depends solely on the relative scores of the two items involved. Recent works have made significant progress towards characterizing the performance (e.g. the m","authors_text":"Cong Ma, Jianqing Fan, Kaizheng Wang, Yuxin Chen","cross_cats":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-07-31T17:33:15Z","title":"Spectral Method and Regularized MLE Are Both Optimal for Top-$K$ Ranking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.09971","kind":"arxiv","version":3},"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:12f3bdeb73559eeefe53b7d1dbfd7f5fbe26d63562592908da1fe6ba5e34f6e5","target":"record","created_at":"2026-05-17T23:43:33Z","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":"f7dfb988660929bc52aceb2afede2c09b22a52ac871217cd9c1ac73e29a2328d","cross_cats_sorted":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-07-31T17:33:15Z","title_canon_sha256":"a79e19f77670d86cb4b1bf8b740e24ee18eea87da8ae3b1cedddbf401874492d"},"schema_version":"1.0","source":{"id":"1707.09971","kind":"arxiv","version":3}},"canonical_sha256":"00337d73336d4c7ff26628d9fa03d50fb6cd1dc171cf27b184b45d8b16ceac2f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"00337d73336d4c7ff26628d9fa03d50fb6cd1dc171cf27b184b45d8b16ceac2f","first_computed_at":"2026-05-17T23:43:33.480381Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:33.480381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BjET+vCsAG6cRTznaMwUvGVJ8uoaq80Nooqf2AspotPGF4Nb9WMX8E1zejIOslcDa2Ly4GGTJR87jJGOBOO+DQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:33.480763Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.09971","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:12f3bdeb73559eeefe53b7d1dbfd7f5fbe26d63562592908da1fe6ba5e34f6e5","sha256:e30c8ed84aaa5a50521a4c24666ddf9e2006d06d110ae6e6537c005b4f614a1e"],"state_sha256":"8bdf49d94848542c7637cfea505bbde23289aca43facfada44357f266637b7b4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Cj9ODcFsK6KKDuOsUMPQYn81xhsneN7FkwwmW7dGZKK31uCR9u49BmDGwyBXnBCd25Osi0XeQe3HSyuFM+fAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T16:35:23.932329Z","bundle_sha256":"b8d50a58aeef6740fdc638085cf65e611509382b53b51cf340d5ffbdffe8b6bc"}}