{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:6RZEWHX2Z7VIGZYV2DFWXJZCIJ","short_pith_number":"pith:6RZEWHX2","canonical_record":{"source":{"id":"1606.07081","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2016-06-22T20:06:10Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8d34050160c7f796a7475c05de2c2f2bd90d93d33667903d2b3b842a5866bb07","abstract_canon_sha256":"f5c353550cc824750214c2574ea66d8fdfaca839c289b7dcd83b172cc0f0a86a"},"schema_version":"1.0"},"canonical_sha256":"f4724b1efacfea836715d0cb6ba722426d617824b2e5bd0f33d179310e0b3c03","source":{"kind":"arxiv","id":"1606.07081","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.07081","created_at":"2026-05-18T01:11:58Z"},{"alias_kind":"arxiv_version","alias_value":"1606.07081v1","created_at":"2026-05-18T01:11:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.07081","created_at":"2026-05-18T01:11:58Z"},{"alias_kind":"pith_short_12","alias_value":"6RZEWHX2Z7VI","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6RZEWHX2Z7VIGZYV","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6RZEWHX2","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:6RZEWHX2Z7VIGZYV2DFWXJZCIJ","target":"record","payload":{"canonical_record":{"source":{"id":"1606.07081","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2016-06-22T20:06:10Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8d34050160c7f796a7475c05de2c2f2bd90d93d33667903d2b3b842a5866bb07","abstract_canon_sha256":"f5c353550cc824750214c2574ea66d8fdfaca839c289b7dcd83b172cc0f0a86a"},"schema_version":"1.0"},"canonical_sha256":"f4724b1efacfea836715d0cb6ba722426d617824b2e5bd0f33d179310e0b3c03","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:58.716833Z","signature_b64":"ZX5azFlnV2W+H3Tb//wTiSNM/eph9WP/3iqBukQ/p9QloCOorZlkBpvSCuXGiELodQV/dYN1M4go1K4Gv6tYAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4724b1efacfea836715d0cb6ba722426d617824b2e5bd0f33d179310e0b3c03","last_reissued_at":"2026-05-18T01:11:58.716476Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:58.716476Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.07081","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:11:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O14KYJDzswHx2iVHNudjC+038goGvCerdVF7kCPatQIlSaK1jwWxVJk5HeW+3CX8IGIPWkxWUBjB8hUjh5f9AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T07:32:32.478937Z"},"content_sha256":"471f4a3f19a7896ec2856f5396657e46d3bbd417ae5928e70b8bb5838e740d8b","schema_version":"1.0","event_id":"sha256:471f4a3f19a7896ec2856f5396657e46d3bbd417ae5928e70b8bb5838e740d8b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:6RZEWHX2Z7VIGZYV2DFWXJZCIJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finite Sample Prediction and Recovery Bounds for Ordinal Embedding","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Kevin Jamieson, Lalit Jain, Robert Nowak","submitted_at":"2016-06-22T20:06:10Z","abstract_excerpt":"The goal of ordinal embedding is to represent items as points in a low-dimensional Euclidean space given a set of constraints in the form of distance comparisons like \"item $i$ is closer to item $j$ than item $k$\". Ordinal constraints like this often come from human judgments. To account for errors and variation in judgments, we consider the noisy situation in which the given constraints are independently corrupted by reversing the correct constraint with some probability. This paper makes several new contributions to this problem. First, we derive prediction error bounds for ordinal embedding"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.07081","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:11:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s+GADYFmmW4vfb+YvAWs8ZSpSFl/IV6Bcu+wnOeVjrUlmPGONhsRk4+g3kyxu05b3+I1upQlzxvUDqKAWpirBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T07:32:32.479635Z"},"content_sha256":"1bfee6e2b183ea688b1eeb82da1d381d3aebf74d1b84be6efcc6ab7a2b24ea7a","schema_version":"1.0","event_id":"sha256:1bfee6e2b183ea688b1eeb82da1d381d3aebf74d1b84be6efcc6ab7a2b24ea7a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6RZEWHX2Z7VIGZYV2DFWXJZCIJ/bundle.json","state_url":"https://pith.science/pith/6RZEWHX2Z7VIGZYV2DFWXJZCIJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6RZEWHX2Z7VIGZYV2DFWXJZCIJ/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-01T07:32:32Z","links":{"resolver":"https://pith.science/pith/6RZEWHX2Z7VIGZYV2DFWXJZCIJ","bundle":"https://pith.science/pith/6RZEWHX2Z7VIGZYV2DFWXJZCIJ/bundle.json","state":"https://pith.science/pith/6RZEWHX2Z7VIGZYV2DFWXJZCIJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6RZEWHX2Z7VIGZYV2DFWXJZCIJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:6RZEWHX2Z7VIGZYV2DFWXJZCIJ","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":"f5c353550cc824750214c2574ea66d8fdfaca839c289b7dcd83b172cc0f0a86a","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2016-06-22T20:06:10Z","title_canon_sha256":"8d34050160c7f796a7475c05de2c2f2bd90d93d33667903d2b3b842a5866bb07"},"schema_version":"1.0","source":{"id":"1606.07081","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.07081","created_at":"2026-05-18T01:11:58Z"},{"alias_kind":"arxiv_version","alias_value":"1606.07081v1","created_at":"2026-05-18T01:11:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.07081","created_at":"2026-05-18T01:11:58Z"},{"alias_kind":"pith_short_12","alias_value":"6RZEWHX2Z7VI","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6RZEWHX2Z7VIGZYV","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6RZEWHX2","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:1bfee6e2b183ea688b1eeb82da1d381d3aebf74d1b84be6efcc6ab7a2b24ea7a","target":"graph","created_at":"2026-05-18T01:11:58Z","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":"The goal of ordinal embedding is to represent items as points in a low-dimensional Euclidean space given a set of constraints in the form of distance comparisons like \"item $i$ is closer to item $j$ than item $k$\". Ordinal constraints like this often come from human judgments. To account for errors and variation in judgments, we consider the noisy situation in which the given constraints are independently corrupted by reversing the correct constraint with some probability. This paper makes several new contributions to this problem. First, we derive prediction error bounds for ordinal embedding","authors_text":"Kevin Jamieson, Lalit Jain, Robert Nowak","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2016-06-22T20:06:10Z","title":"Finite Sample Prediction and Recovery Bounds for Ordinal Embedding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.07081","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:471f4a3f19a7896ec2856f5396657e46d3bbd417ae5928e70b8bb5838e740d8b","target":"record","created_at":"2026-05-18T01:11:58Z","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":"f5c353550cc824750214c2574ea66d8fdfaca839c289b7dcd83b172cc0f0a86a","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2016-06-22T20:06:10Z","title_canon_sha256":"8d34050160c7f796a7475c05de2c2f2bd90d93d33667903d2b3b842a5866bb07"},"schema_version":"1.0","source":{"id":"1606.07081","kind":"arxiv","version":1}},"canonical_sha256":"f4724b1efacfea836715d0cb6ba722426d617824b2e5bd0f33d179310e0b3c03","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f4724b1efacfea836715d0cb6ba722426d617824b2e5bd0f33d179310e0b3c03","first_computed_at":"2026-05-18T01:11:58.716476Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:58.716476Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZX5azFlnV2W+H3Tb//wTiSNM/eph9WP/3iqBukQ/p9QloCOorZlkBpvSCuXGiELodQV/dYN1M4go1K4Gv6tYAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:58.716833Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.07081","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:471f4a3f19a7896ec2856f5396657e46d3bbd417ae5928e70b8bb5838e740d8b","sha256:1bfee6e2b183ea688b1eeb82da1d381d3aebf74d1b84be6efcc6ab7a2b24ea7a"],"state_sha256":"4b22ff52dda3056040ea0da571a0855410113817b6f7e300b3098c8ed280c343"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BZrEdgW1+8+iJsesqZc8tHAZiasyXQl03OcUhAWxQH6Zk+2XTalQxFp1FdUZZxs4Wx8odt9JJbmjy6PHUm/yBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T07:32:32.482690Z","bundle_sha256":"f27f723ebbfd9b8e0de700a3f5e1495bf8ab54351c6a9ac80e7b7c0d1206fe11"}}