{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:4HZSZLN7YSLNFJWY7NHMRF2IIQ","short_pith_number":"pith:4HZSZLN7","schema_version":"1.0","canonical_sha256":"e1f32cadbfc496d2a6d8fb4ec89748442ade1b12f32b7393d50cb3eba12359fe","source":{"kind":"arxiv","id":"1009.1690","version":2},"attestation_state":"computed","paper":{"title":"Probabilistic Models over Ordered Partitions with Application in Learning to Rank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.IR","authors_text":"Dinh Q. Phung, Svetha Venkatesh, Tran The Truyen","submitted_at":"2010-09-09T06:15:39Z","abstract_excerpt":"This paper addresses the general problem of modelling and learning rank data with ties. We propose a probabilistic generative model, that models the process as permutations over partitions. This results in super-exponential combinatorial state space with unknown numbers of partitions and unknown ordering among them. We approach the problem from the discrete choice theory, where subsets are chosen in a stagewise manner, reducing the state space per each stage significantly. Further, we show that with suitable parameterisation, we can still learn the models in linear time. We evaluate the propos"},"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":"1009.1690","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2010-09-09T06:15:39Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"10742b1fc9f619a4060875b66104baf9dfebbd458443c343293812a9ce70f555","abstract_canon_sha256":"0f620e4a0b9fff226385e6fe1dcc1752227f8464b72741951e55c453a2169c45"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:39:58.949703Z","signature_b64":"fe0rb0hEpMssXrdNxVwOTAW9jAmQJoxsOPfDssUuYNwMXw579cwn6S0dmMPbmVunCrGnqcxA84cW9f7DisobDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1f32cadbfc496d2a6d8fb4ec89748442ade1b12f32b7393d50cb3eba12359fe","last_reissued_at":"2026-05-18T04:39:58.949231Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:39:58.949231Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Probabilistic Models over Ordered Partitions with Application in Learning to Rank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.IR","authors_text":"Dinh Q. Phung, Svetha Venkatesh, Tran The Truyen","submitted_at":"2010-09-09T06:15:39Z","abstract_excerpt":"This paper addresses the general problem of modelling and learning rank data with ties. We propose a probabilistic generative model, that models the process as permutations over partitions. This results in super-exponential combinatorial state space with unknown numbers of partitions and unknown ordering among them. We approach the problem from the discrete choice theory, where subsets are chosen in a stagewise manner, reducing the state space per each stage significantly. Further, we show that with suitable parameterisation, we can still learn the models in linear time. We evaluate the propos"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.1690","kind":"arxiv","version":2},"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":"1009.1690","created_at":"2026-05-18T04:39:58.949301+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.1690v2","created_at":"2026-05-18T04:39:58.949301+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.1690","created_at":"2026-05-18T04:39:58.949301+00:00"},{"alias_kind":"pith_short_12","alias_value":"4HZSZLN7YSLN","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_16","alias_value":"4HZSZLN7YSLNFJWY","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_8","alias_value":"4HZSZLN7","created_at":"2026-05-18T12:26:03.138858+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/4HZSZLN7YSLNFJWY7NHMRF2IIQ","json":"https://pith.science/pith/4HZSZLN7YSLNFJWY7NHMRF2IIQ.json","graph_json":"https://pith.science/api/pith-number/4HZSZLN7YSLNFJWY7NHMRF2IIQ/graph.json","events_json":"https://pith.science/api/pith-number/4HZSZLN7YSLNFJWY7NHMRF2IIQ/events.json","paper":"https://pith.science/paper/4HZSZLN7"},"agent_actions":{"view_html":"https://pith.science/pith/4HZSZLN7YSLNFJWY7NHMRF2IIQ","download_json":"https://pith.science/pith/4HZSZLN7YSLNFJWY7NHMRF2IIQ.json","view_paper":"https://pith.science/paper/4HZSZLN7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.1690&json=true","fetch_graph":"https://pith.science/api/pith-number/4HZSZLN7YSLNFJWY7NHMRF2IIQ/graph.json","fetch_events":"https://pith.science/api/pith-number/4HZSZLN7YSLNFJWY7NHMRF2IIQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4HZSZLN7YSLNFJWY7NHMRF2IIQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4HZSZLN7YSLNFJWY7NHMRF2IIQ/action/storage_attestation","attest_author":"https://pith.science/pith/4HZSZLN7YSLNFJWY7NHMRF2IIQ/action/author_attestation","sign_citation":"https://pith.science/pith/4HZSZLN7YSLNFJWY7NHMRF2IIQ/action/citation_signature","submit_replication":"https://pith.science/pith/4HZSZLN7YSLNFJWY7NHMRF2IIQ/action/replication_record"}},"created_at":"2026-05-18T04:39:58.949301+00:00","updated_at":"2026-05-18T04:39:58.949301+00:00"}