{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:WP263HTIZDMIT33LS3QM4LC35A","short_pith_number":"pith:WP263HTI","schema_version":"1.0","canonical_sha256":"b3f5ed9e68c8d889ef6b96e0ce2c5be837654547013e25145067ca69ba242224","source":{"kind":"arxiv","id":"1902.01002","version":1},"attestation_state":"computed","paper":{"title":"Ranking Episodes using a Partition Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Nikolaj Tatti","submitted_at":"2019-02-04T01:30:44Z","abstract_excerpt":"One of the biggest setbacks in traditional frequent pattern mining is that overwhelmingly many of the discovered patterns are redundant. A prototypical example of such redundancy is a freerider pattern where the pattern contains a true pattern and some additional noise events. A technique for filtering freerider patterns that has proved to be efficient in ranking itemsets is to use a partition model where a pattern is divided into two subpatterns and the observed support is compared to the expected support under the assumption that these two subpatterns occur independently.\n  In this paper we "},"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":"1902.01002","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-04T01:30:44Z","cross_cats_sorted":[],"title_canon_sha256":"6974868f33789f2f1ba149bf544d232b6bd1ae6027191a20f63c19cdf73a9d68","abstract_canon_sha256":"6068ba24a03c2451e48de5d6b68b816ac3bbb9c768f81d0833b87056495ad21f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:49.960267Z","signature_b64":"c3/YMHexoOlS3zqJjZQesC13EFYk2QnFrPEtimWxqwCAwU0shOIH/jDPtHAUsPYtowFvW3XCHNu7FUJImpl1AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3f5ed9e68c8d889ef6b96e0ce2c5be837654547013e25145067ca69ba242224","last_reissued_at":"2026-05-17T23:54:49.959619Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:49.959619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ranking Episodes using a Partition Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Nikolaj Tatti","submitted_at":"2019-02-04T01:30:44Z","abstract_excerpt":"One of the biggest setbacks in traditional frequent pattern mining is that overwhelmingly many of the discovered patterns are redundant. A prototypical example of such redundancy is a freerider pattern where the pattern contains a true pattern and some additional noise events. A technique for filtering freerider patterns that has proved to be efficient in ranking itemsets is to use a partition model where a pattern is divided into two subpatterns and the observed support is compared to the expected support under the assumption that these two subpatterns occur independently.\n  In this paper we "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.01002","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":"1902.01002","created_at":"2026-05-17T23:54:49.959720+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.01002v1","created_at":"2026-05-17T23:54:49.959720+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01002","created_at":"2026-05-17T23:54:49.959720+00:00"},{"alias_kind":"pith_short_12","alias_value":"WP263HTIZDMI","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"WP263HTIZDMIT33L","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"WP263HTI","created_at":"2026-05-18T12:33:30.264802+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/WP263HTIZDMIT33LS3QM4LC35A","json":"https://pith.science/pith/WP263HTIZDMIT33LS3QM4LC35A.json","graph_json":"https://pith.science/api/pith-number/WP263HTIZDMIT33LS3QM4LC35A/graph.json","events_json":"https://pith.science/api/pith-number/WP263HTIZDMIT33LS3QM4LC35A/events.json","paper":"https://pith.science/paper/WP263HTI"},"agent_actions":{"view_html":"https://pith.science/pith/WP263HTIZDMIT33LS3QM4LC35A","download_json":"https://pith.science/pith/WP263HTIZDMIT33LS3QM4LC35A.json","view_paper":"https://pith.science/paper/WP263HTI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.01002&json=true","fetch_graph":"https://pith.science/api/pith-number/WP263HTIZDMIT33LS3QM4LC35A/graph.json","fetch_events":"https://pith.science/api/pith-number/WP263HTIZDMIT33LS3QM4LC35A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WP263HTIZDMIT33LS3QM4LC35A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WP263HTIZDMIT33LS3QM4LC35A/action/storage_attestation","attest_author":"https://pith.science/pith/WP263HTIZDMIT33LS3QM4LC35A/action/author_attestation","sign_citation":"https://pith.science/pith/WP263HTIZDMIT33LS3QM4LC35A/action/citation_signature","submit_replication":"https://pith.science/pith/WP263HTIZDMIT33LS3QM4LC35A/action/replication_record"}},"created_at":"2026-05-17T23:54:49.959720+00:00","updated_at":"2026-05-17T23:54:49.959720+00:00"}