{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:J2JCEOK4IB6UPCBSSSCZVAQIBJ","short_pith_number":"pith:J2JCEOK4","schema_version":"1.0","canonical_sha256":"4e9222395c407d47883294859a82080a6a95f4b58b23e1e6ae1af567378ec401","source":{"kind":"arxiv","id":"1510.05610","version":4},"attestation_state":"computed","paper":{"title":"Stochastically Transitive Models for Pairwise Comparisons: Statistical and Computational Issues","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ML","authors_text":"Adityanand Guntuboyina, Martin J. Wainwright, Nihar B. Shah, Sivaraman Balakrishnan","submitted_at":"2015-10-19T18:19:16Z","abstract_excerpt":"There are various parametric models for analyzing pairwise comparison data, including the Bradley-Terry-Luce (BTL) and Thurstone models, but their reliance on strong parametric assumptions is limiting. In this work, we study a flexible model for pairwise comparisons, under which the probabilities of outcomes are required only to satisfy a natural form of stochastic transitivity. This class includes parametric models including the BTL and Thurstone models as special cases, but is considerably more general. We provide various examples of models in this broader stochastically transitive class for"},"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":"1510.05610","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-10-19T18:19:16Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"62429e328782a5195ed956d012738fa20e25c715672a017450e02aebe242b7be","abstract_canon_sha256":"264066fce65057918fcb1148294b0315bef0860c512329c9db8a041af1c94918"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:44.313892Z","signature_b64":"cT6vIkyhpTGZ5e/qiyRnXizcLSDKXaQfKlGcR1TVGzI+0J+LibZuPyKFgLReQWmUGpNOff8+Kc0PvUwzpIjsAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e9222395c407d47883294859a82080a6a95f4b58b23e1e6ae1af567378ec401","last_reissued_at":"2026-05-18T01:03:44.313505Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:44.313505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stochastically Transitive Models for Pairwise Comparisons: Statistical and Computational Issues","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ML","authors_text":"Adityanand Guntuboyina, Martin J. Wainwright, Nihar B. Shah, Sivaraman Balakrishnan","submitted_at":"2015-10-19T18:19:16Z","abstract_excerpt":"There are various parametric models for analyzing pairwise comparison data, including the Bradley-Terry-Luce (BTL) and Thurstone models, but their reliance on strong parametric assumptions is limiting. In this work, we study a flexible model for pairwise comparisons, under which the probabilities of outcomes are required only to satisfy a natural form of stochastic transitivity. This class includes parametric models including the BTL and Thurstone models as special cases, but is considerably more general. We provide various examples of models in this broader stochastically transitive class for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.05610","kind":"arxiv","version":4},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1510.05610","created_at":"2026-05-18T01:03:44.313564+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.05610v4","created_at":"2026-05-18T01:03:44.313564+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.05610","created_at":"2026-05-18T01:03:44.313564+00:00"},{"alias_kind":"pith_short_12","alias_value":"J2JCEOK4IB6U","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"J2JCEOK4IB6UPCBS","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"J2JCEOK4","created_at":"2026-05-18T12:29:27.538025+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2605.16615","citing_title":"Learning What Evaluators Value: A Reliable Approach to Modeling Evaluator Preferences","ref_index":119,"is_internal_anchor":true},{"citing_arxiv_id":"2605.16615","citing_title":"Learning What Evaluators Value: A Reliable Approach to Modeling Evaluator Preferences","ref_index":76,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/J2JCEOK4IB6UPCBSSSCZVAQIBJ","json":"https://pith.science/pith/J2JCEOK4IB6UPCBSSSCZVAQIBJ.json","graph_json":"https://pith.science/api/pith-number/J2JCEOK4IB6UPCBSSSCZVAQIBJ/graph.json","events_json":"https://pith.science/api/pith-number/J2JCEOK4IB6UPCBSSSCZVAQIBJ/events.json","paper":"https://pith.science/paper/J2JCEOK4"},"agent_actions":{"view_html":"https://pith.science/pith/J2JCEOK4IB6UPCBSSSCZVAQIBJ","download_json":"https://pith.science/pith/J2JCEOK4IB6UPCBSSSCZVAQIBJ.json","view_paper":"https://pith.science/paper/J2JCEOK4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.05610&json=true","fetch_graph":"https://pith.science/api/pith-number/J2JCEOK4IB6UPCBSSSCZVAQIBJ/graph.json","fetch_events":"https://pith.science/api/pith-number/J2JCEOK4IB6UPCBSSSCZVAQIBJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J2JCEOK4IB6UPCBSSSCZVAQIBJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J2JCEOK4IB6UPCBSSSCZVAQIBJ/action/storage_attestation","attest_author":"https://pith.science/pith/J2JCEOK4IB6UPCBSSSCZVAQIBJ/action/author_attestation","sign_citation":"https://pith.science/pith/J2JCEOK4IB6UPCBSSSCZVAQIBJ/action/citation_signature","submit_replication":"https://pith.science/pith/J2JCEOK4IB6UPCBSSSCZVAQIBJ/action/replication_record"}},"created_at":"2026-05-18T01:03:44.313564+00:00","updated_at":"2026-05-18T01:03:44.313564+00:00"}