{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:UKRQPOSYDJIQQ5OPMAFGXZZ2BM","short_pith_number":"pith:UKRQPOSY","canonical_record":{"source":{"id":"1601.05495","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-01-21T02:39:39Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"4342e7ac82e7e1f4ce92fe5812605231c6f0eebba27cf2f877db7688c90b254c","abstract_canon_sha256":"4059328934c85104dc30041a1e936563288c0b19bcba5db898644ae5a91bcf56"},"schema_version":"1.0"},"canonical_sha256":"a2a307ba581a510875cf600a6be73a0b3bb3db7f7b5ad4b8d9357a12bde9ac49","source":{"kind":"arxiv","id":"1601.05495","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.05495","created_at":"2026-05-18T01:02:59Z"},{"alias_kind":"arxiv_version","alias_value":"1601.05495v2","created_at":"2026-05-18T01:02:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.05495","created_at":"2026-05-18T01:02:59Z"},{"alias_kind":"pith_short_12","alias_value":"UKRQPOSYDJIQ","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UKRQPOSYDJIQQ5OP","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UKRQPOSY","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:UKRQPOSYDJIQQ5OPMAFGXZZ2BM","target":"record","payload":{"canonical_record":{"source":{"id":"1601.05495","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-01-21T02:39:39Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"4342e7ac82e7e1f4ce92fe5812605231c6f0eebba27cf2f877db7688c90b254c","abstract_canon_sha256":"4059328934c85104dc30041a1e936563288c0b19bcba5db898644ae5a91bcf56"},"schema_version":"1.0"},"canonical_sha256":"a2a307ba581a510875cf600a6be73a0b3bb3db7f7b5ad4b8d9357a12bde9ac49","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:59.228161Z","signature_b64":"Wo04nvlG9zWqScgLnbzkLiTB2bNSpAKQUfHrOiQR7rHoU5lqx8VSdATQEOix5Ygilyvlg8hPAG9daWwfm2+xDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2a307ba581a510875cf600a6be73a0b3bb3db7f7b5ad4b8d9357a12bde9ac49","last_reissued_at":"2026-05-18T01:02:59.227510Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:59.227510Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.05495","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:02:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fbwNuJ5RsWcAuJWH8im7QpNSjoVGTo8VWa6NiYQM4Dj8EIFG7Os8q/Jz/CJgHowsOEyyixTmWK6BZOG9OCuvCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T12:05:09.320645Z"},"content_sha256":"8b88db4ac7afd56151c1f5b952dd4c40885107296282230a3e5da79bc46ce2e3","schema_version":"1.0","event_id":"sha256:8b88db4ac7afd56151c1f5b952dd4c40885107296282230a3e5da79bc46ce2e3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:UKRQPOSYDJIQQ5OPMAFGXZZ2BM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Data-driven Rank Breaking for Efficient Rank Aggregation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ashish Khetan, Sewoong Oh","submitted_at":"2016-01-21T02:39:39Z","abstract_excerpt":"Rank aggregation systems collect ordinal preferences from individuals to produce a global ranking that represents the social preference. Rank-breaking is a common practice to reduce the computational complexity of learning the global ranking. The individual preferences are broken into pairwise comparisons and applied to efficient algorithms tailored for independent paired comparisons. However, due to the ignored dependencies in the data, naive rank-breaking approaches can result in inconsistent estimates. The key idea to produce accurate and consistent estimates is to treat the pairwise compar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.05495","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:02:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sEu8yZEjb+vUxXXyxuKQqrjEgp9LbZpnyHdmqk5OF77Hccc1Z/E53Zx+jdUWU/1UUkAWijVz0qUMZzVFtmMZBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T12:05:09.321410Z"},"content_sha256":"f566b14cbba88fa817201d0c327aa3270d2f113460e2d8ff33bd65940c2be445","schema_version":"1.0","event_id":"sha256:f566b14cbba88fa817201d0c327aa3270d2f113460e2d8ff33bd65940c2be445"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UKRQPOSYDJIQQ5OPMAFGXZZ2BM/bundle.json","state_url":"https://pith.science/pith/UKRQPOSYDJIQQ5OPMAFGXZZ2BM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UKRQPOSYDJIQQ5OPMAFGXZZ2BM/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-10T12:05:09Z","links":{"resolver":"https://pith.science/pith/UKRQPOSYDJIQQ5OPMAFGXZZ2BM","bundle":"https://pith.science/pith/UKRQPOSYDJIQQ5OPMAFGXZZ2BM/bundle.json","state":"https://pith.science/pith/UKRQPOSYDJIQQ5OPMAFGXZZ2BM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UKRQPOSYDJIQQ5OPMAFGXZZ2BM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:UKRQPOSYDJIQQ5OPMAFGXZZ2BM","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":"4059328934c85104dc30041a1e936563288c0b19bcba5db898644ae5a91bcf56","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-01-21T02:39:39Z","title_canon_sha256":"4342e7ac82e7e1f4ce92fe5812605231c6f0eebba27cf2f877db7688c90b254c"},"schema_version":"1.0","source":{"id":"1601.05495","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.05495","created_at":"2026-05-18T01:02:59Z"},{"alias_kind":"arxiv_version","alias_value":"1601.05495v2","created_at":"2026-05-18T01:02:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.05495","created_at":"2026-05-18T01:02:59Z"},{"alias_kind":"pith_short_12","alias_value":"UKRQPOSYDJIQ","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UKRQPOSYDJIQQ5OP","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UKRQPOSY","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:f566b14cbba88fa817201d0c327aa3270d2f113460e2d8ff33bd65940c2be445","target":"graph","created_at":"2026-05-18T01:02:59Z","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":"Rank aggregation systems collect ordinal preferences from individuals to produce a global ranking that represents the social preference. Rank-breaking is a common practice to reduce the computational complexity of learning the global ranking. The individual preferences are broken into pairwise comparisons and applied to efficient algorithms tailored for independent paired comparisons. However, due to the ignored dependencies in the data, naive rank-breaking approaches can result in inconsistent estimates. The key idea to produce accurate and consistent estimates is to treat the pairwise compar","authors_text":"Ashish Khetan, Sewoong Oh","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-01-21T02:39:39Z","title":"Data-driven Rank Breaking for Efficient Rank Aggregation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.05495","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:8b88db4ac7afd56151c1f5b952dd4c40885107296282230a3e5da79bc46ce2e3","target":"record","created_at":"2026-05-18T01:02:59Z","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":"4059328934c85104dc30041a1e936563288c0b19bcba5db898644ae5a91bcf56","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-01-21T02:39:39Z","title_canon_sha256":"4342e7ac82e7e1f4ce92fe5812605231c6f0eebba27cf2f877db7688c90b254c"},"schema_version":"1.0","source":{"id":"1601.05495","kind":"arxiv","version":2}},"canonical_sha256":"a2a307ba581a510875cf600a6be73a0b3bb3db7f7b5ad4b8d9357a12bde9ac49","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a2a307ba581a510875cf600a6be73a0b3bb3db7f7b5ad4b8d9357a12bde9ac49","first_computed_at":"2026-05-18T01:02:59.227510Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:59.227510Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Wo04nvlG9zWqScgLnbzkLiTB2bNSpAKQUfHrOiQR7rHoU5lqx8VSdATQEOix5Ygilyvlg8hPAG9daWwfm2+xDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:59.228161Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.05495","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8b88db4ac7afd56151c1f5b952dd4c40885107296282230a3e5da79bc46ce2e3","sha256:f566b14cbba88fa817201d0c327aa3270d2f113460e2d8ff33bd65940c2be445"],"state_sha256":"dd3334f9f5b41787f7a86e8a9b5bd3085bec255870900143723ec652e5f18b8b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ALm2tUt1QQhbJMbfVaaHKgKjKgv7RvPjjq/qrPrEgKjqH8Kzcikbw6pRgQLF4hNPHJxsYfDUjFAXVNYR3hHjCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T12:05:09.325754Z","bundle_sha256":"be95a3ed36d5c07695e5f4296c266368ceada46b8136935105257330b2878eed"}}