{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:UAMJRHC6NLLPLMQWL3VC4YWB3I","short_pith_number":"pith:UAMJRHC6","canonical_record":{"source":{"id":"2105.01463","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2021-05-04T12:45:53Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d5248e42991be58bc4f4ced874f5f63db5c6e840f6bf1c72001f85e602c83712","abstract_canon_sha256":"46aec5333f8c741f600ad54fd80bf21028cf933909864a634a367b7cd3843bf9"},"schema_version":"1.0"},"canonical_sha256":"a018989c5e6ad6f5b2165eea2e62c1da1421138c18bc60ac243b0acafd690996","source":{"kind":"arxiv","id":"2105.01463","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2105.01463","created_at":"2026-07-05T02:37:17Z"},{"alias_kind":"arxiv_version","alias_value":"2105.01463v1","created_at":"2026-07-05T02:37:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.01463","created_at":"2026-07-05T02:37:17Z"},{"alias_kind":"pith_short_12","alias_value":"UAMJRHC6NLLP","created_at":"2026-07-05T02:37:17Z"},{"alias_kind":"pith_short_16","alias_value":"UAMJRHC6NLLPLMQW","created_at":"2026-07-05T02:37:17Z"},{"alias_kind":"pith_short_8","alias_value":"UAMJRHC6","created_at":"2026-07-05T02:37:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:UAMJRHC6NLLPLMQWL3VC4YWB3I","target":"record","payload":{"canonical_record":{"source":{"id":"2105.01463","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2021-05-04T12:45:53Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d5248e42991be58bc4f4ced874f5f63db5c6e840f6bf1c72001f85e602c83712","abstract_canon_sha256":"46aec5333f8c741f600ad54fd80bf21028cf933909864a634a367b7cd3843bf9"},"schema_version":"1.0"},"canonical_sha256":"a018989c5e6ad6f5b2165eea2e62c1da1421138c18bc60ac243b0acafd690996","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:37:17.752649Z","signature_b64":"1eQH78hh+F5to1ciq7ZYbQ28KL0uuCLV956BgEeI6eVV6INvWqAeLd1HoQCsk2rbCEFIPVf0NWNV1dU7VFHrDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a018989c5e6ad6f5b2165eea2e62c1da1421138c18bc60ac243b0acafd690996","last_reissued_at":"2026-07-05T02:37:17.752212Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:37:17.752212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2105.01463","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-07-05T02:37:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ovXB9IN1j71VNNwKWWBQf7PoZjZf2DtO9yBdvH7wq2/DhddEUSOXb61Ta2jiRKKY8J+rQ7qU9l/B5pmu4WalAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T01:42:45.335151Z"},"content_sha256":"03b5e15fb9642d5d434855b2ce95734b54745712a08ddbe95704bf5f8e8e4863","schema_version":"1.0","event_id":"sha256:03b5e15fb9642d5d434855b2ce95734b54745712a08ddbe95704bf5f8e8e4863"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:UAMJRHC6NLLPLMQWL3VC4YWB3I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Sample Complexity of Rank Regression from Pairwise Comparisons","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Berkan Kadioglu, Deniz Erdogmus, Jennifer Dy, Peng Tian, Stratis Ioannidis","submitted_at":"2021-05-04T12:45:53Z","abstract_excerpt":"We consider a rank regression setting, in which a dataset of $N$ samples with features in $\\mathbb{R}^d$ is ranked by an oracle via $M$ pairwise comparisons. Specifically, there exists a latent total ordering of the samples; when presented with a pair of samples, a noisy oracle identifies the one ranked higher with respect to the underlying total ordering. A learner observes a dataset of such comparisons and wishes to regress sample ranks from their features. We show that to learn the model parameters with $\\epsilon > 0$ accuracy, it suffices to conduct $M \\in \\Omega(dN\\log^3 N/\\epsilon^2)$ co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.01463","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2105.01463/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T02:37:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uraleokMOVDYuu20icOtYd59kIY0C6arDS4cVJteHtRtqC6OgoTBnDT3B+Uv/w1mARJJNG2QNwBxYjoi+HEMAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T01:42:45.335812Z"},"content_sha256":"db445a4ed8aba098f6b2e161ca98424631eb5a7f8f4f68ec4e0f1839c371c52b","schema_version":"1.0","event_id":"sha256:db445a4ed8aba098f6b2e161ca98424631eb5a7f8f4f68ec4e0f1839c371c52b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UAMJRHC6NLLPLMQWL3VC4YWB3I/bundle.json","state_url":"https://pith.science/pith/UAMJRHC6NLLPLMQWL3VC4YWB3I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UAMJRHC6NLLPLMQWL3VC4YWB3I/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-08-11T01:42:45Z","links":{"resolver":"https://pith.science/pith/UAMJRHC6NLLPLMQWL3VC4YWB3I","bundle":"https://pith.science/pith/UAMJRHC6NLLPLMQWL3VC4YWB3I/bundle.json","state":"https://pith.science/pith/UAMJRHC6NLLPLMQWL3VC4YWB3I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UAMJRHC6NLLPLMQWL3VC4YWB3I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:UAMJRHC6NLLPLMQWL3VC4YWB3I","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":"46aec5333f8c741f600ad54fd80bf21028cf933909864a634a367b7cd3843bf9","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2021-05-04T12:45:53Z","title_canon_sha256":"d5248e42991be58bc4f4ced874f5f63db5c6e840f6bf1c72001f85e602c83712"},"schema_version":"1.0","source":{"id":"2105.01463","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2105.01463","created_at":"2026-07-05T02:37:17Z"},{"alias_kind":"arxiv_version","alias_value":"2105.01463v1","created_at":"2026-07-05T02:37:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.01463","created_at":"2026-07-05T02:37:17Z"},{"alias_kind":"pith_short_12","alias_value":"UAMJRHC6NLLP","created_at":"2026-07-05T02:37:17Z"},{"alias_kind":"pith_short_16","alias_value":"UAMJRHC6NLLPLMQW","created_at":"2026-07-05T02:37:17Z"},{"alias_kind":"pith_short_8","alias_value":"UAMJRHC6","created_at":"2026-07-05T02:37:17Z"}],"graph_snapshots":[{"event_id":"sha256:db445a4ed8aba098f6b2e161ca98424631eb5a7f8f4f68ec4e0f1839c371c52b","target":"graph","created_at":"2026-07-05T02:37:17Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2105.01463/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider a rank regression setting, in which a dataset of $N$ samples with features in $\\mathbb{R}^d$ is ranked by an oracle via $M$ pairwise comparisons. Specifically, there exists a latent total ordering of the samples; when presented with a pair of samples, a noisy oracle identifies the one ranked higher with respect to the underlying total ordering. A learner observes a dataset of such comparisons and wishes to regress sample ranks from their features. We show that to learn the model parameters with $\\epsilon > 0$ accuracy, it suffices to conduct $M \\in \\Omega(dN\\log^3 N/\\epsilon^2)$ co","authors_text":"Berkan Kadioglu, Deniz Erdogmus, Jennifer Dy, Peng Tian, Stratis Ioannidis","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2021-05-04T12:45:53Z","title":"On the Sample Complexity of Rank Regression from Pairwise Comparisons"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.01463","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:03b5e15fb9642d5d434855b2ce95734b54745712a08ddbe95704bf5f8e8e4863","target":"record","created_at":"2026-07-05T02:37:17Z","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":"46aec5333f8c741f600ad54fd80bf21028cf933909864a634a367b7cd3843bf9","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2021-05-04T12:45:53Z","title_canon_sha256":"d5248e42991be58bc4f4ced874f5f63db5c6e840f6bf1c72001f85e602c83712"},"schema_version":"1.0","source":{"id":"2105.01463","kind":"arxiv","version":1}},"canonical_sha256":"a018989c5e6ad6f5b2165eea2e62c1da1421138c18bc60ac243b0acafd690996","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a018989c5e6ad6f5b2165eea2e62c1da1421138c18bc60ac243b0acafd690996","first_computed_at":"2026-07-05T02:37:17.752212Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:37:17.752212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1eQH78hh+F5to1ciq7ZYbQ28KL0uuCLV956BgEeI6eVV6INvWqAeLd1HoQCsk2rbCEFIPVf0NWNV1dU7VFHrDA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:37:17.752649Z","signed_message":"canonical_sha256_bytes"},"source_id":"2105.01463","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:03b5e15fb9642d5d434855b2ce95734b54745712a08ddbe95704bf5f8e8e4863","sha256:db445a4ed8aba098f6b2e161ca98424631eb5a7f8f4f68ec4e0f1839c371c52b"],"state_sha256":"96b1df652b32f25f6ad699f74612c9f69d416f0971103433556b3a4166872bc9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Km+eBHGUdC1PpLIBhNo4BL2ZgAgY7z3uD1k9XsRZUZ8wU8PDuZpdrWfZ2IlSgDE5F9XHiSVKH9TS7AeuE+gACw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T01:42:45.339930Z","bundle_sha256":"50f00cea3638fd0611ca5a8d0c5645a8cd2e9c3af11d66bc04931142aa1e58c5"}}