{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:4GGUYEGEOX5WBEYKCMJ2G4LLOG","short_pith_number":"pith:4GGUYEGE","canonical_record":{"source":{"id":"1204.1688","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-04-07T22:33:22Z","cross_cats_sorted":["cs.LG","stat.ML","stat.TH"],"title_canon_sha256":"c683c8e626f420a6744cd9e685ab76f7b8e2d836942b01254774aaf67424910a","abstract_canon_sha256":"a6543237fb2bb3cd63ab3ec7558303f24d82813e0fc60932337a1172be3f63a4"},"schema_version":"1.0"},"canonical_sha256":"e18d4c10c475fb60930a1313a3716b71b5527e8c6908d752c1e09e3d44a283b9","source":{"kind":"arxiv","id":"1204.1688","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.1688","created_at":"2026-05-18T03:06:13Z"},{"alias_kind":"arxiv_version","alias_value":"1204.1688v3","created_at":"2026-05-18T03:06:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.1688","created_at":"2026-05-18T03:06:13Z"},{"alias_kind":"pith_short_12","alias_value":"4GGUYEGEOX5W","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4GGUYEGEOX5WBEYK","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4GGUYEGE","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:4GGUYEGEOX5WBEYKCMJ2G4LLOG","target":"record","payload":{"canonical_record":{"source":{"id":"1204.1688","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-04-07T22:33:22Z","cross_cats_sorted":["cs.LG","stat.ML","stat.TH"],"title_canon_sha256":"c683c8e626f420a6744cd9e685ab76f7b8e2d836942b01254774aaf67424910a","abstract_canon_sha256":"a6543237fb2bb3cd63ab3ec7558303f24d82813e0fc60932337a1172be3f63a4"},"schema_version":"1.0"},"canonical_sha256":"e18d4c10c475fb60930a1313a3716b71b5527e8c6908d752c1e09e3d44a283b9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:13.788115Z","signature_b64":"K7z2mmXj9XSWMG+J8YfWA2Xul8buwrjfbW2HhhGusmQCTph5lgruSHWWS8qPp+t3qNMru63nXolh4PwB2mqDCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e18d4c10c475fb60930a1313a3716b71b5527e8c6908d752c1e09e3d44a283b9","last_reissued_at":"2026-05-18T03:06:13.787688Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:13.787688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.1688","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-18T03:06:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S/4emftrR0EwH5DvbfCyNVNmdY1X4B4jnio1OWTyTz9rPtQVmrUo1L6ZS3OYHWA7SrgBkBRz8NFY6xVGKjgrCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:44:16.591406Z"},"content_sha256":"80dbc8f22dcb2e1854635ddd71dda569a424a15928595d71f2a9ec042e8158f5","schema_version":"1.0","event_id":"sha256:80dbc8f22dcb2e1854635ddd71dda569a424a15928595d71f2a9ec042e8158f5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:4GGUYEGEOX5WBEYKCMJ2G4LLOG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The asymptotics of ranking algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"John C. Duchi, Lester Mackey, Michael I. Jordan","submitted_at":"2012-04-07T22:33:22Z","abstract_excerpt":"We consider the predictive problem of supervised ranking, where the task is to rank sets of candidate items returned in response to queries. Although there exist statistical procedures that come with guarantees of consistency in this setting, these procedures require that individuals provide a complete ranking of all items, which is rarely feasible in practice. Instead, individuals routinely provide partial preference information, such as pairwise comparisons of items, and more practical approaches to ranking have aimed at modeling this partial preference data directly. As we show, however, su"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.1688","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-18T03:06:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"90K0LGCBHk6fdKlxuzpbtvz9kLAUNfS7jRkImFdRkGZzQjYv3oV7g2eA/GSpv0vuYRX0C70Gr4nzlELQQe/PBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:44:16.591742Z"},"content_sha256":"a2c97d4600d46e92b9f8c784c6cc3d9b3c0019b84ebbeb87b271fbd794b33f22","schema_version":"1.0","event_id":"sha256:a2c97d4600d46e92b9f8c784c6cc3d9b3c0019b84ebbeb87b271fbd794b33f22"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4GGUYEGEOX5WBEYKCMJ2G4LLOG/bundle.json","state_url":"https://pith.science/pith/4GGUYEGEOX5WBEYKCMJ2G4LLOG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4GGUYEGEOX5WBEYKCMJ2G4LLOG/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-03T07:44:16Z","links":{"resolver":"https://pith.science/pith/4GGUYEGEOX5WBEYKCMJ2G4LLOG","bundle":"https://pith.science/pith/4GGUYEGEOX5WBEYKCMJ2G4LLOG/bundle.json","state":"https://pith.science/pith/4GGUYEGEOX5WBEYKCMJ2G4LLOG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4GGUYEGEOX5WBEYKCMJ2G4LLOG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:4GGUYEGEOX5WBEYKCMJ2G4LLOG","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":"a6543237fb2bb3cd63ab3ec7558303f24d82813e0fc60932337a1172be3f63a4","cross_cats_sorted":["cs.LG","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-04-07T22:33:22Z","title_canon_sha256":"c683c8e626f420a6744cd9e685ab76f7b8e2d836942b01254774aaf67424910a"},"schema_version":"1.0","source":{"id":"1204.1688","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.1688","created_at":"2026-05-18T03:06:13Z"},{"alias_kind":"arxiv_version","alias_value":"1204.1688v3","created_at":"2026-05-18T03:06:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.1688","created_at":"2026-05-18T03:06:13Z"},{"alias_kind":"pith_short_12","alias_value":"4GGUYEGEOX5W","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4GGUYEGEOX5WBEYK","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4GGUYEGE","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:a2c97d4600d46e92b9f8c784c6cc3d9b3c0019b84ebbeb87b271fbd794b33f22","target":"graph","created_at":"2026-05-18T03:06:13Z","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 the predictive problem of supervised ranking, where the task is to rank sets of candidate items returned in response to queries. Although there exist statistical procedures that come with guarantees of consistency in this setting, these procedures require that individuals provide a complete ranking of all items, which is rarely feasible in practice. Instead, individuals routinely provide partial preference information, such as pairwise comparisons of items, and more practical approaches to ranking have aimed at modeling this partial preference data directly. As we show, however, su","authors_text":"John C. Duchi, Lester Mackey, Michael I. Jordan","cross_cats":["cs.LG","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-04-07T22:33:22Z","title":"The asymptotics of ranking algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.1688","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:80dbc8f22dcb2e1854635ddd71dda569a424a15928595d71f2a9ec042e8158f5","target":"record","created_at":"2026-05-18T03:06:13Z","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":"a6543237fb2bb3cd63ab3ec7558303f24d82813e0fc60932337a1172be3f63a4","cross_cats_sorted":["cs.LG","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-04-07T22:33:22Z","title_canon_sha256":"c683c8e626f420a6744cd9e685ab76f7b8e2d836942b01254774aaf67424910a"},"schema_version":"1.0","source":{"id":"1204.1688","kind":"arxiv","version":3}},"canonical_sha256":"e18d4c10c475fb60930a1313a3716b71b5527e8c6908d752c1e09e3d44a283b9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e18d4c10c475fb60930a1313a3716b71b5527e8c6908d752c1e09e3d44a283b9","first_computed_at":"2026-05-18T03:06:13.787688Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:06:13.787688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K7z2mmXj9XSWMG+J8YfWA2Xul8buwrjfbW2HhhGusmQCTph5lgruSHWWS8qPp+t3qNMru63nXolh4PwB2mqDCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:06:13.788115Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.1688","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:80dbc8f22dcb2e1854635ddd71dda569a424a15928595d71f2a9ec042e8158f5","sha256:a2c97d4600d46e92b9f8c784c6cc3d9b3c0019b84ebbeb87b271fbd794b33f22"],"state_sha256":"d2375bdee785e1691f875b72d0c8676768084a7e77cf3ab496484a8d10f0afe2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x9/xrAwTb4q/FZ9GFTAgKlEopOX5EWXtlURXjMB0OH/wnVetYSDum90xmI7uNnKqZQWklefxiGq+BcgV7ElmCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T07:44:16.593627Z","bundle_sha256":"6f55a9eb571ee79b8b8da158b3935aa683badfb1089697c9e1fc3c74b0b654ca"}}