{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:DWF3QTNAYLDFLLRC6RAQJI4OY3","short_pith_number":"pith:DWF3QTNA","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"},"canonical_sha256":"1d8bb84da0c2c655ae22f44104a38ec6e716cb205715341c29055990250f48ae","source":{"kind":"arxiv","id":"1506.08009","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.08009","created_at":"2026-05-18T00:24:32Z"},{"alias_kind":"arxiv_version","alias_value":"1506.08009v4","created_at":"2026-05-18T00:24:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.08009","created_at":"2026-05-18T00:24:32Z"},{"alias_kind":"pith_short_12","alias_value":"DWF3QTNAYLDF","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DWF3QTNAYLDFLLRC","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DWF3QTNA","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:DWF3QTNAYLDFLLRC6RAQJI4OY3","target":"record","payload":{"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"},"canonical_sha256":"1d8bb84da0c2c655ae22f44104a38ec6e716cb205715341c29055990250f48ae","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"},"source_kind":"arxiv","source_id":"1506.08009","source_version":4,"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-18T00:24:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mdcTlkJ5w/MN0eyAZfh0BqCiqlKTaYs2XkHb45I5v1Zq2dIYjw27vRr0kr2lLGRooNDcQB92ihVKPGJXkgVTAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:45:46.509471Z"},"content_sha256":"55afb0d535d85db1dbc65f5300c18d02a8a4a4c36f3cd402c7bd548c456d6f5a","schema_version":"1.0","event_id":"sha256:55afb0d535d85db1dbc65f5300c18d02a8a4a4c36f3cd402c7bd548c456d6f5a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:DWF3QTNAYLDFLLRC6RAQJI4OY3","target":"graph","payload":{"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"},"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-18T00:24:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1vMMD6QMtpu6a8Xc4C2Hl8bt9hrGiKt1wvFe1m3zO/T3MWnF8526Zs2v9mgNQqmkUMVzfs+sMr1DZug7P3vRDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:45:46.510148Z"},"content_sha256":"64146c9ae602c8e873062e7baa4ea2374452d2bc9c2d50053b406745b174d8d2","schema_version":"1.0","event_id":"sha256:64146c9ae602c8e873062e7baa4ea2374452d2bc9c2d50053b406745b174d8d2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DWF3QTNAYLDFLLRC6RAQJI4OY3/bundle.json","state_url":"https://pith.science/pith/DWF3QTNAYLDFLLRC6RAQJI4OY3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DWF3QTNAYLDFLLRC6RAQJI4OY3/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-25T15:45:46Z","links":{"resolver":"https://pith.science/pith/DWF3QTNAYLDFLLRC6RAQJI4OY3","bundle":"https://pith.science/pith/DWF3QTNAYLDFLLRC6RAQJI4OY3/bundle.json","state":"https://pith.science/pith/DWF3QTNAYLDFLLRC6RAQJI4OY3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DWF3QTNAYLDFLLRC6RAQJI4OY3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:DWF3QTNAYLDFLLRC6RAQJI4OY3","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":"c98af8182a8daef4f6921b4b61d563a84f4ab5c13f48f82e25edc13171b55741","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-06-26T09:36:10Z","title_canon_sha256":"1c4df8d38c0841c9fb4284bca162158bdc4ad4fb061e875bd1a4669a24a134fb"},"schema_version":"1.0","source":{"id":"1506.08009","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.08009","created_at":"2026-05-18T00:24:32Z"},{"alias_kind":"arxiv_version","alias_value":"1506.08009v4","created_at":"2026-05-18T00:24:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.08009","created_at":"2026-05-18T00:24:32Z"},{"alias_kind":"pith_short_12","alias_value":"DWF3QTNAYLDF","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DWF3QTNAYLDFLLRC","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DWF3QTNA","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:64146c9ae602c8e873062e7baa4ea2374452d2bc9c2d50053b406745b174d8d2","target":"graph","created_at":"2026-05-18T00:24:32Z","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 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","authors_text":"Francois Petitjean, Geoffrey I. Webb, Nikolaj Tatti, Tao Li","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-06-26T09:36:10Z","title":"Skopus: Mining top-k sequential patterns under leverage"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.08009","kind":"arxiv","version":4},"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:55afb0d535d85db1dbc65f5300c18d02a8a4a4c36f3cd402c7bd548c456d6f5a","target":"record","created_at":"2026-05-18T00:24:32Z","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":"c98af8182a8daef4f6921b4b61d563a84f4ab5c13f48f82e25edc13171b55741","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-06-26T09:36:10Z","title_canon_sha256":"1c4df8d38c0841c9fb4284bca162158bdc4ad4fb061e875bd1a4669a24a134fb"},"schema_version":"1.0","source":{"id":"1506.08009","kind":"arxiv","version":4}},"canonical_sha256":"1d8bb84da0c2c655ae22f44104a38ec6e716cb205715341c29055990250f48ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d8bb84da0c2c655ae22f44104a38ec6e716cb205715341c29055990250f48ae","first_computed_at":"2026-05-18T00:24:32.026733Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:32.026733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1dO7RW/zWoHihWF/FwMgDmjfeBTQ68meBCYt1zI1bl4lWXP/3YAWQlUZh0MU+anqmbm2kx2mXLnE4a/VotcSCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:32.027253Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.08009","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:55afb0d535d85db1dbc65f5300c18d02a8a4a4c36f3cd402c7bd548c456d6f5a","sha256:64146c9ae602c8e873062e7baa4ea2374452d2bc9c2d50053b406745b174d8d2"],"state_sha256":"6e5a77d727a40f77e1822c85bdce8c42978144d685f0f0bd56c08138ad33bed2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"842zVc5BeFiD7V5nrpxe1GwTH54ENszfs6KwDFE/lPzq7K2aTSnWC6ceHkb7VqgZY0ddvhDSJvycV6iTG7bfDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T15:45:46.518470Z","bundle_sha256":"f87e4f512f22a462bcdd7d27e1650d694ed70b372e8b41d7377d972e488f6190"}}