{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:NX6G2JWLRBCZUQ7HQFW5DAKX2V","short_pith_number":"pith:NX6G2JWL","schema_version":"1.0","canonical_sha256":"6dfc6d26cb88459a43e7816dd18157d543e204fc42b4b5ea1a07031b8de5d21b","source":{"kind":"arxiv","id":"1806.05897","version":1},"attestation_state":"computed","paper":{"title":"Mining Rank Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Eyke H\\\"ullermeier, Sascha Henzgen","submitted_at":"2018-06-15T10:36:40Z","abstract_excerpt":"The problem of frequent pattern mining has been studied quite extensively for various types of data, including sets, sequences, and graphs. Somewhat surprisingly, another important type of data, namely rank data, has received very little attention in data mining so far. In this paper, we therefore addresses the problem of mining rank data, that is, data in the form of rankings (total orders) of an underlying set of items. More specifically, two types of patterns are considered, namely frequent rankings and dependencies between such rankings in the form of association rules. Algorithms for mini"},"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":"1806.05897","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-15T10:36:40Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a89c34960c5022c19ab5e0ea707113757a06307086a8fc57d15c1b01fbdf30a2","abstract_canon_sha256":"a05525b6fca4749fddcf508786decaba0115856687a6c79d4535ff74ed62e2a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:09.127072Z","signature_b64":"WP6JH95Wc+fxlJu30QdLFJja37HgZJexSBpCWnwr6Sr4p+rYfSuTsTxtVTKBBEqiJAqUnDaQ1MxVZdm2vc2KBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6dfc6d26cb88459a43e7816dd18157d543e204fc42b4b5ea1a07031b8de5d21b","last_reissued_at":"2026-05-18T00:13:09.126436Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:09.126436Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mining Rank Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Eyke H\\\"ullermeier, Sascha Henzgen","submitted_at":"2018-06-15T10:36:40Z","abstract_excerpt":"The problem of frequent pattern mining has been studied quite extensively for various types of data, including sets, sequences, and graphs. Somewhat surprisingly, another important type of data, namely rank data, has received very little attention in data mining so far. In this paper, we therefore addresses the problem of mining rank data, that is, data in the form of rankings (total orders) of an underlying set of items. More specifically, two types of patterns are considered, namely frequent rankings and dependencies between such rankings in the form of association rules. Algorithms for mini"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.05897","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1806.05897","created_at":"2026-05-18T00:13:09.126540+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.05897v1","created_at":"2026-05-18T00:13:09.126540+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.05897","created_at":"2026-05-18T00:13:09.126540+00:00"},{"alias_kind":"pith_short_12","alias_value":"NX6G2JWLRBCZ","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"NX6G2JWLRBCZUQ7H","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"NX6G2JWL","created_at":"2026-05-18T12:32:40.477152+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/NX6G2JWLRBCZUQ7HQFW5DAKX2V","json":"https://pith.science/pith/NX6G2JWLRBCZUQ7HQFW5DAKX2V.json","graph_json":"https://pith.science/api/pith-number/NX6G2JWLRBCZUQ7HQFW5DAKX2V/graph.json","events_json":"https://pith.science/api/pith-number/NX6G2JWLRBCZUQ7HQFW5DAKX2V/events.json","paper":"https://pith.science/paper/NX6G2JWL"},"agent_actions":{"view_html":"https://pith.science/pith/NX6G2JWLRBCZUQ7HQFW5DAKX2V","download_json":"https://pith.science/pith/NX6G2JWLRBCZUQ7HQFW5DAKX2V.json","view_paper":"https://pith.science/paper/NX6G2JWL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.05897&json=true","fetch_graph":"https://pith.science/api/pith-number/NX6G2JWLRBCZUQ7HQFW5DAKX2V/graph.json","fetch_events":"https://pith.science/api/pith-number/NX6G2JWLRBCZUQ7HQFW5DAKX2V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NX6G2JWLRBCZUQ7HQFW5DAKX2V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NX6G2JWLRBCZUQ7HQFW5DAKX2V/action/storage_attestation","attest_author":"https://pith.science/pith/NX6G2JWLRBCZUQ7HQFW5DAKX2V/action/author_attestation","sign_citation":"https://pith.science/pith/NX6G2JWLRBCZUQ7HQFW5DAKX2V/action/citation_signature","submit_replication":"https://pith.science/pith/NX6G2JWLRBCZUQ7HQFW5DAKX2V/action/replication_record"}},"created_at":"2026-05-18T00:13:09.126540+00:00","updated_at":"2026-05-18T00:13:09.126540+00:00"}