{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DWF3QTNAYLDFLLRC6RAQJI4OY3","short_pith_number":"pith:DWF3QTNA","schema_version":"1.0","canonical_sha256":"1d8bb84da0c2c655ae22f44104a38ec6e716cb205715341c29055990250f48ae","source":{"kind":"arxiv","id":"1506.08009","version":4},"attestation_state":"computed","paper":{"title":"Skopus: Mining top-k sequential patterns under leverage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.AI","authors_text":"Francois Petitjean, Geoffrey I. Webb, Nikolaj Tatti, Tao Li","submitted_at":"2015-06-26T09:36:10Z","abstract_excerpt":"This paper presents a framework for exact discovery of the top-k sequential patterns under Leverage. It combines (1) a novel definition of the expected support for a sequential pattern - a concept on which most interestingness measures directly rely - with (2) SkOPUS: a new branch-and-bound algorithm for the exact discovery of top-k sequential patterns under a given measure of interest. Our interestingness measure employs the partition approach. A pattern is interesting to the extent that it is more frequent than can be explained by assuming independence between any of the pairs of patterns fr"},"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":"1506.08009","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-06-26T09:36:10Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"1c4df8d38c0841c9fb4284bca162158bdc4ad4fb061e875bd1a4669a24a134fb","abstract_canon_sha256":"c98af8182a8daef4f6921b4b61d563a84f4ab5c13f48f82e25edc13171b55741"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:32.027253Z","signature_b64":"1dO7RW/zWoHihWF/FwMgDmjfeBTQ68meBCYt1zI1bl4lWXP/3YAWQlUZh0MU+anqmbm2kx2mXLnE4a/VotcSCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d8bb84da0c2c655ae22f44104a38ec6e716cb205715341c29055990250f48ae","last_reissued_at":"2026-05-18T00:24:32.026733Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:32.026733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Skopus: Mining top-k sequential patterns under leverage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.AI","authors_text":"Francois Petitjean, Geoffrey I. Webb, Nikolaj Tatti, Tao Li","submitted_at":"2015-06-26T09:36:10Z","abstract_excerpt":"This paper presents a framework for exact discovery of the top-k sequential patterns under Leverage. It combines (1) a novel definition of the expected support for a sequential pattern - a concept on which most interestingness measures directly rely - with (2) SkOPUS: a new branch-and-bound algorithm for the exact discovery of top-k sequential patterns under a given measure of interest. Our interestingness measure employs the partition approach. A pattern is interesting to the extent that it is more frequent than can be explained by assuming independence between any of the pairs of patterns fr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.08009","kind":"arxiv","version":4},"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":"1506.08009","created_at":"2026-05-18T00:24:32.026812+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.08009v4","created_at":"2026-05-18T00:24:32.026812+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.08009","created_at":"2026-05-18T00:24:32.026812+00:00"},{"alias_kind":"pith_short_12","alias_value":"DWF3QTNAYLDF","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DWF3QTNAYLDFLLRC","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DWF3QTNA","created_at":"2026-05-18T12:29:17.054201+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/DWF3QTNAYLDFLLRC6RAQJI4OY3","json":"https://pith.science/pith/DWF3QTNAYLDFLLRC6RAQJI4OY3.json","graph_json":"https://pith.science/api/pith-number/DWF3QTNAYLDFLLRC6RAQJI4OY3/graph.json","events_json":"https://pith.science/api/pith-number/DWF3QTNAYLDFLLRC6RAQJI4OY3/events.json","paper":"https://pith.science/paper/DWF3QTNA"},"agent_actions":{"view_html":"https://pith.science/pith/DWF3QTNAYLDFLLRC6RAQJI4OY3","download_json":"https://pith.science/pith/DWF3QTNAYLDFLLRC6RAQJI4OY3.json","view_paper":"https://pith.science/paper/DWF3QTNA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.08009&json=true","fetch_graph":"https://pith.science/api/pith-number/DWF3QTNAYLDFLLRC6RAQJI4OY3/graph.json","fetch_events":"https://pith.science/api/pith-number/DWF3QTNAYLDFLLRC6RAQJI4OY3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DWF3QTNAYLDFLLRC6RAQJI4OY3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DWF3QTNAYLDFLLRC6RAQJI4OY3/action/storage_attestation","attest_author":"https://pith.science/pith/DWF3QTNAYLDFLLRC6RAQJI4OY3/action/author_attestation","sign_citation":"https://pith.science/pith/DWF3QTNAYLDFLLRC6RAQJI4OY3/action/citation_signature","submit_replication":"https://pith.science/pith/DWF3QTNAYLDFLLRC6RAQJI4OY3/action/replication_record"}},"created_at":"2026-05-18T00:24:32.026812+00:00","updated_at":"2026-05-18T00:24:32.026812+00:00"}