{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:UAMJRHC6NLLPLMQWL3VC4YWB3I","short_pith_number":"pith:UAMJRHC6","schema_version":"1.0","canonical_sha256":"a018989c5e6ad6f5b2165eea2e62c1da1421138c18bc60ac243b0acafd690996","source":{"kind":"arxiv","id":"2105.01463","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2105.01463","created_at":"2026-07-05T02:37:17.752273+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.01463v1","created_at":"2026-07-05T02:37:17.752273+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.01463","created_at":"2026-07-05T02:37:17.752273+00:00"},{"alias_kind":"pith_short_12","alias_value":"UAMJRHC6NLLP","created_at":"2026-07-05T02:37:17.752273+00:00"},{"alias_kind":"pith_short_16","alias_value":"UAMJRHC6NLLPLMQW","created_at":"2026-07-05T02:37:17.752273+00:00"},{"alias_kind":"pith_short_8","alias_value":"UAMJRHC6","created_at":"2026-07-05T02:37:17.752273+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UAMJRHC6NLLPLMQWL3VC4YWB3I","json":"https://pith.science/pith/UAMJRHC6NLLPLMQWL3VC4YWB3I.json","graph_json":"https://pith.science/api/pith-number/UAMJRHC6NLLPLMQWL3VC4YWB3I/graph.json","events_json":"https://pith.science/api/pith-number/UAMJRHC6NLLPLMQWL3VC4YWB3I/events.json","paper":"https://pith.science/paper/UAMJRHC6"},"agent_actions":{"view_html":"https://pith.science/pith/UAMJRHC6NLLPLMQWL3VC4YWB3I","download_json":"https://pith.science/pith/UAMJRHC6NLLPLMQWL3VC4YWB3I.json","view_paper":"https://pith.science/paper/UAMJRHC6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.01463&json=true","fetch_graph":"https://pith.science/api/pith-number/UAMJRHC6NLLPLMQWL3VC4YWB3I/graph.json","fetch_events":"https://pith.science/api/pith-number/UAMJRHC6NLLPLMQWL3VC4YWB3I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UAMJRHC6NLLPLMQWL3VC4YWB3I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UAMJRHC6NLLPLMQWL3VC4YWB3I/action/storage_attestation","attest_author":"https://pith.science/pith/UAMJRHC6NLLPLMQWL3VC4YWB3I/action/author_attestation","sign_citation":"https://pith.science/pith/UAMJRHC6NLLPLMQWL3VC4YWB3I/action/citation_signature","submit_replication":"https://pith.science/pith/UAMJRHC6NLLPLMQWL3VC4YWB3I/action/replication_record"}},"created_at":"2026-07-05T02:37:17.752273+00:00","updated_at":"2026-07-05T02:37:17.752273+00:00"}