{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:54SXJHCMNNASHBSENJBAIER3DT","short_pith_number":"pith:54SXJHCM","canonical_record":{"source":{"id":"1408.0043","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-07-31T23:30:37Z","cross_cats_sorted":["cs.IR","stat.ML"],"title_canon_sha256":"6783ee864af8d10caf9be2115f062fbc3dc27a03edbf56f7b9d3a3b62a56466a","abstract_canon_sha256":"b00086e5dd6a3c7c133296067b539961b5d57c8624d5de80d398a33388522430"},"schema_version":"1.0"},"canonical_sha256":"ef25749c4c6b412386446a4204123b1cc699a3d994a16d8309a37c3bdc28ea08","source":{"kind":"arxiv","id":"1408.0043","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.0043","created_at":"2026-05-18T02:46:04Z"},{"alias_kind":"arxiv_version","alias_value":"1408.0043v1","created_at":"2026-05-18T02:46:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.0043","created_at":"2026-05-18T02:46:04Z"},{"alias_kind":"pith_short_12","alias_value":"54SXJHCMNNAS","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"54SXJHCMNNASHBSE","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"54SXJHCM","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:54SXJHCMNNASHBSENJBAIER3DT","target":"record","payload":{"canonical_record":{"source":{"id":"1408.0043","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-07-31T23:30:37Z","cross_cats_sorted":["cs.IR","stat.ML"],"title_canon_sha256":"6783ee864af8d10caf9be2115f062fbc3dc27a03edbf56f7b9d3a3b62a56466a","abstract_canon_sha256":"b00086e5dd6a3c7c133296067b539961b5d57c8624d5de80d398a33388522430"},"schema_version":"1.0"},"canonical_sha256":"ef25749c4c6b412386446a4204123b1cc699a3d994a16d8309a37c3bdc28ea08","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:04.024714Z","signature_b64":"ae4Xm2AX/nwuM+jfN/y8up0KgUC1fxC5ZE79Z4C92RWzxOBn6FIga06lkKBif3S6YjXBrDgPV37cBAKFihXnAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef25749c4c6b412386446a4204123b1cc699a3d994a16d8309a37c3bdc28ea08","last_reissued_at":"2026-05-18T02:46:04.024108Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:04.024108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.0043","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-05-18T02:46:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PVb93Ruv3dOoVUzyhaH6MEmTxMFscBQ7hA7a5pX4GrGq/uSpeUM69m3j7azeataRs+pM3aLDbx6QO7ymY28DAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T19:20:07.328413Z"},"content_sha256":"31aa435a135ab5a4158213159a8c7d5f261a44ace67c24aa702ef7b371988933","schema_version":"1.0","event_id":"sha256:31aa435a135ab5a4158213159a8c7d5f261a44ace67c24aa702ef7b371988933"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:54SXJHCMNNASHBSENJBAIER3DT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning From Ordered Sets and Applications in Collaborative Ranking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Dinh Phung, Svetha Venkatesh, Truyen Tran","submitted_at":"2014-07-31T23:30:37Z","abstract_excerpt":"Ranking over sets arise when users choose between groups of items. For example, a group may be of those movies deemed $5$ stars to them, or a customized tour package. It turns out, to model this data type properly, we need to investigate the general combinatorics problem of partitioning a set and ordering the subsets. Here we construct a probabilistic log-linear model over a set of ordered subsets. Inference in this combinatorial space is highly challenging: The space size approaches $(N!/2)6.93145^{N+1}$ as $N$ approaches infinity. We propose a \\texttt{split-and-merge} Metropolis-Hastings pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.0043","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":""},"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-18T02:46:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"csCT+/QhFZGIjHa30C0njmP8Wrl/J0naYEH8yuZjZibI6JsJtTZFCFVWZSZWRGAkCkbwZKfKeJf+aM9MX1slAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T19:20:07.329279Z"},"content_sha256":"4b566c6fd97f19dd7ae0fc6685ddb242b2a3c81f62966e2b09261347d3043427","schema_version":"1.0","event_id":"sha256:4b566c6fd97f19dd7ae0fc6685ddb242b2a3c81f62966e2b09261347d3043427"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/54SXJHCMNNASHBSENJBAIER3DT/bundle.json","state_url":"https://pith.science/pith/54SXJHCMNNASHBSENJBAIER3DT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/54SXJHCMNNASHBSENJBAIER3DT/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-19T19:20:07Z","links":{"resolver":"https://pith.science/pith/54SXJHCMNNASHBSENJBAIER3DT","bundle":"https://pith.science/pith/54SXJHCMNNASHBSENJBAIER3DT/bundle.json","state":"https://pith.science/pith/54SXJHCMNNASHBSENJBAIER3DT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/54SXJHCMNNASHBSENJBAIER3DT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:54SXJHCMNNASHBSENJBAIER3DT","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":"b00086e5dd6a3c7c133296067b539961b5d57c8624d5de80d398a33388522430","cross_cats_sorted":["cs.IR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-07-31T23:30:37Z","title_canon_sha256":"6783ee864af8d10caf9be2115f062fbc3dc27a03edbf56f7b9d3a3b62a56466a"},"schema_version":"1.0","source":{"id":"1408.0043","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.0043","created_at":"2026-05-18T02:46:04Z"},{"alias_kind":"arxiv_version","alias_value":"1408.0043v1","created_at":"2026-05-18T02:46:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.0043","created_at":"2026-05-18T02:46:04Z"},{"alias_kind":"pith_short_12","alias_value":"54SXJHCMNNAS","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"54SXJHCMNNASHBSE","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"54SXJHCM","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:4b566c6fd97f19dd7ae0fc6685ddb242b2a3c81f62966e2b09261347d3043427","target":"graph","created_at":"2026-05-18T02:46:04Z","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":"Ranking over sets arise when users choose between groups of items. For example, a group may be of those movies deemed $5$ stars to them, or a customized tour package. It turns out, to model this data type properly, we need to investigate the general combinatorics problem of partitioning a set and ordering the subsets. Here we construct a probabilistic log-linear model over a set of ordered subsets. Inference in this combinatorial space is highly challenging: The space size approaches $(N!/2)6.93145^{N+1}$ as $N$ approaches infinity. We propose a \\texttt{split-and-merge} Metropolis-Hastings pro","authors_text":"Dinh Phung, Svetha Venkatesh, Truyen Tran","cross_cats":["cs.IR","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-07-31T23:30:37Z","title":"Learning From Ordered Sets and Applications in Collaborative Ranking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.0043","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:31aa435a135ab5a4158213159a8c7d5f261a44ace67c24aa702ef7b371988933","target":"record","created_at":"2026-05-18T02:46:04Z","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":"b00086e5dd6a3c7c133296067b539961b5d57c8624d5de80d398a33388522430","cross_cats_sorted":["cs.IR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-07-31T23:30:37Z","title_canon_sha256":"6783ee864af8d10caf9be2115f062fbc3dc27a03edbf56f7b9d3a3b62a56466a"},"schema_version":"1.0","source":{"id":"1408.0043","kind":"arxiv","version":1}},"canonical_sha256":"ef25749c4c6b412386446a4204123b1cc699a3d994a16d8309a37c3bdc28ea08","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ef25749c4c6b412386446a4204123b1cc699a3d994a16d8309a37c3bdc28ea08","first_computed_at":"2026-05-18T02:46:04.024108Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:46:04.024108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ae4Xm2AX/nwuM+jfN/y8up0KgUC1fxC5ZE79Z4C92RWzxOBn6FIga06lkKBif3S6YjXBrDgPV37cBAKFihXnAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:46:04.024714Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.0043","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:31aa435a135ab5a4158213159a8c7d5f261a44ace67c24aa702ef7b371988933","sha256:4b566c6fd97f19dd7ae0fc6685ddb242b2a3c81f62966e2b09261347d3043427"],"state_sha256":"32a1a0a368ef84ce09a6b6f2a7fa72364a4e2a8735df5f7ad6947f1913ebd786"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fWj0PKpL8zsp41VL4N/fv5Sy+i269elPjo78Am+9ILxZI8rH1Sk2CdCYrVPB4qM1BVRiHDoWRvxZ2LIePcf0Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T19:20:07.332310Z","bundle_sha256":"2f2d1c5653da6604d7440d4bb568ac4185b922ee79904a6b05676b651813c27b"}}