{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:4HZSZLN7YSLNFJWY7NHMRF2IIQ","short_pith_number":"pith:4HZSZLN7","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"},"canonical_sha256":"e1f32cadbfc496d2a6d8fb4ec89748442ade1b12f32b7393d50cb3eba12359fe","source":{"kind":"arxiv","id":"1009.1690","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.1690","created_at":"2026-05-18T04:39:58Z"},{"alias_kind":"arxiv_version","alias_value":"1009.1690v2","created_at":"2026-05-18T04:39:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.1690","created_at":"2026-05-18T04:39:58Z"},{"alias_kind":"pith_short_12","alias_value":"4HZSZLN7YSLN","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"4HZSZLN7YSLNFJWY","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"4HZSZLN7","created_at":"2026-05-18T12:26:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:4HZSZLN7YSLNFJWY7NHMRF2IIQ","target":"record","payload":{"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"},"canonical_sha256":"e1f32cadbfc496d2a6d8fb4ec89748442ade1b12f32b7393d50cb3eba12359fe","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"},"source_kind":"arxiv","source_id":"1009.1690","source_version":2,"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-18T04:39:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eWUHQquq5DMBgVe/BKfbw8H0PBVt6TJiUYCW2M0OOQroAKtBsrXAYGXG9rI6c8nJtVUMzPMtlzmnhtsKtSyqBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T16:37:19.173766Z"},"content_sha256":"66228994839c931ea21232e789529461988c5c0e035faf593dc859d668423d4e","schema_version":"1.0","event_id":"sha256:66228994839c931ea21232e789529461988c5c0e035faf593dc859d668423d4e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:4HZSZLN7YSLNFJWY7NHMRF2IIQ","target":"graph","payload":{"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"},"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-18T04:39:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BW2Hz+FzxeUlyCOaGXrpwPhnCNJjkrFThN5guzL4U/dnMUKAtTFJdYvsoWt1yq9pKOP0dZOOHd/6ZlDSLyC9DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T16:37:19.174164Z"},"content_sha256":"9ba50f187a7864571b148349d37ca5376b049b22bf5b4d9d6dc56782e6ae7a5c","schema_version":"1.0","event_id":"sha256:9ba50f187a7864571b148349d37ca5376b049b22bf5b4d9d6dc56782e6ae7a5c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4HZSZLN7YSLNFJWY7NHMRF2IIQ/bundle.json","state_url":"https://pith.science/pith/4HZSZLN7YSLNFJWY7NHMRF2IIQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4HZSZLN7YSLNFJWY7NHMRF2IIQ/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-05-19T16:37:19Z","links":{"resolver":"https://pith.science/pith/4HZSZLN7YSLNFJWY7NHMRF2IIQ","bundle":"https://pith.science/pith/4HZSZLN7YSLNFJWY7NHMRF2IIQ/bundle.json","state":"https://pith.science/pith/4HZSZLN7YSLNFJWY7NHMRF2IIQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4HZSZLN7YSLNFJWY7NHMRF2IIQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:4HZSZLN7YSLNFJWY7NHMRF2IIQ","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":"0f620e4a0b9fff226385e6fe1dcc1752227f8464b72741951e55c453a2169c45","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2010-09-09T06:15:39Z","title_canon_sha256":"10742b1fc9f619a4060875b66104baf9dfebbd458443c343293812a9ce70f555"},"schema_version":"1.0","source":{"id":"1009.1690","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.1690","created_at":"2026-05-18T04:39:58Z"},{"alias_kind":"arxiv_version","alias_value":"1009.1690v2","created_at":"2026-05-18T04:39:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.1690","created_at":"2026-05-18T04:39:58Z"},{"alias_kind":"pith_short_12","alias_value":"4HZSZLN7YSLN","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"4HZSZLN7YSLNFJWY","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"4HZSZLN7","created_at":"2026-05-18T12:26:03Z"}],"graph_snapshots":[{"event_id":"sha256:9ba50f187a7864571b148349d37ca5376b049b22bf5b4d9d6dc56782e6ae7a5c","target":"graph","created_at":"2026-05-18T04:39: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":"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","authors_text":"Dinh Q. Phung, Svetha Venkatesh, Tran The Truyen","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2010-09-09T06:15:39Z","title":"Probabilistic Models over Ordered Partitions with Application in Learning to Rank"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.1690","kind":"arxiv","version":2},"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:66228994839c931ea21232e789529461988c5c0e035faf593dc859d668423d4e","target":"record","created_at":"2026-05-18T04:39: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":"0f620e4a0b9fff226385e6fe1dcc1752227f8464b72741951e55c453a2169c45","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2010-09-09T06:15:39Z","title_canon_sha256":"10742b1fc9f619a4060875b66104baf9dfebbd458443c343293812a9ce70f555"},"schema_version":"1.0","source":{"id":"1009.1690","kind":"arxiv","version":2}},"canonical_sha256":"e1f32cadbfc496d2a6d8fb4ec89748442ade1b12f32b7393d50cb3eba12359fe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e1f32cadbfc496d2a6d8fb4ec89748442ade1b12f32b7393d50cb3eba12359fe","first_computed_at":"2026-05-18T04:39:58.949231Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:39:58.949231Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fe0rb0hEpMssXrdNxVwOTAW9jAmQJoxsOPfDssUuYNwMXw579cwn6S0dmMPbmVunCrGnqcxA84cW9f7DisobDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:39:58.949703Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.1690","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:66228994839c931ea21232e789529461988c5c0e035faf593dc859d668423d4e","sha256:9ba50f187a7864571b148349d37ca5376b049b22bf5b4d9d6dc56782e6ae7a5c"],"state_sha256":"5875f92f2fdbaf0c8f65e25d331f5393703c219b1eac14911c76d1ce8d79e2ce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4QzKpJpqoB9tfcT4bY7c7/apOSq+zZwAUV2mzNR01dxKxlHEJU3oduGVpaoKTwDotOyMjmUIUCd7XHFBeiC7Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T16:37:19.176146Z","bundle_sha256":"f249576e58da4b49f28e31749e2a86c28efb15fd4b8bb215b388c7072b24d801"}}