{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:T2MN4RSD34APX3ZDOKKM5EB2X5","short_pith_number":"pith:T2MN4RSD","schema_version":"1.0","canonical_sha256":"9e98de4643df00fbef237294ce903abf6f187e9c511db59beacf7002ed1a1e84","source":{"kind":"arxiv","id":"2607.03188","version":1},"attestation_state":"computed","paper":{"title":"Scalable Maximal Frequent Episode Mining with Desbordante","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI","cs.DC","cs.LG","cs.PF"],"primary_cat":"cs.DB","authors_text":"Alisa Strazdina, George Chernishev, Matvei Smirnov, Maxim Ivanov","submitted_at":"2026-07-03T10:47:11Z","abstract_excerpt":"Episode mining aims to extract subsequences of events that possess certain distinctive properties and constitute facts valuable to the user. Maximal frequent episode mining concentrates on discovery of frequently-appearing subsequences, which are not included into any other larger frequent subsequence. The state-of-the-art for this problem is the MaxFEM algorithm which enumerates possible subsequences, while applying various pruning techniques to accelerate the search. However, this is a computationally-intensive problem: reducing the minimum number of required subsequence occurrences or incre"},"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":"2607.03188","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2026-07-03T10:47:11Z","cross_cats_sorted":["cs.AI","cs.DC","cs.LG","cs.PF"],"title_canon_sha256":"fcdaa0aacccd4fb959469d1f777faa53f4f6fdc39b53309cc353b2b398659ff7","abstract_canon_sha256":"a6b735b6ebee68df4dd70e656cb42ac1d476924a0a0d1b9a2b6008defd3994f8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-07T01:16:46.021986Z","signature_b64":"bN3gmbpmBmfZe1hKt/FiIXizDiGAqNXlY0/+Y2y2wWvhGxPkLbt4kSoV4wW3MRDVq2Hu3IuiJIZ7lBfjPkd3AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e98de4643df00fbef237294ce903abf6f187e9c511db59beacf7002ed1a1e84","last_reissued_at":"2026-07-07T01:16:46.021494Z","signature_status":"signed_v1","first_computed_at":"2026-07-07T01:16:46.021494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Maximal Frequent Episode Mining with Desbordante","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI","cs.DC","cs.LG","cs.PF"],"primary_cat":"cs.DB","authors_text":"Alisa Strazdina, George Chernishev, Matvei Smirnov, Maxim Ivanov","submitted_at":"2026-07-03T10:47:11Z","abstract_excerpt":"Episode mining aims to extract subsequences of events that possess certain distinctive properties and constitute facts valuable to the user. Maximal frequent episode mining concentrates on discovery of frequently-appearing subsequences, which are not included into any other larger frequent subsequence. The state-of-the-art for this problem is the MaxFEM algorithm which enumerates possible subsequences, while applying various pruning techniques to accelerate the search. However, this is a computationally-intensive problem: reducing the minimum number of required subsequence occurrences or incre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.03188","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.03188/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2607.03188","created_at":"2026-07-07T01:16:46.021566+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.03188v1","created_at":"2026-07-07T01:16:46.021566+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.03188","created_at":"2026-07-07T01:16:46.021566+00:00"},{"alias_kind":"pith_short_12","alias_value":"T2MN4RSD34AP","created_at":"2026-07-07T01:16:46.021566+00:00"},{"alias_kind":"pith_short_16","alias_value":"T2MN4RSD34APX3ZD","created_at":"2026-07-07T01:16:46.021566+00:00"},{"alias_kind":"pith_short_8","alias_value":"T2MN4RSD","created_at":"2026-07-07T01:16:46.021566+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/T2MN4RSD34APX3ZDOKKM5EB2X5","json":"https://pith.science/pith/T2MN4RSD34APX3ZDOKKM5EB2X5.json","graph_json":"https://pith.science/api/pith-number/T2MN4RSD34APX3ZDOKKM5EB2X5/graph.json","events_json":"https://pith.science/api/pith-number/T2MN4RSD34APX3ZDOKKM5EB2X5/events.json","paper":"https://pith.science/paper/T2MN4RSD"},"agent_actions":{"view_html":"https://pith.science/pith/T2MN4RSD34APX3ZDOKKM5EB2X5","download_json":"https://pith.science/pith/T2MN4RSD34APX3ZDOKKM5EB2X5.json","view_paper":"https://pith.science/paper/T2MN4RSD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.03188&json=true","fetch_graph":"https://pith.science/api/pith-number/T2MN4RSD34APX3ZDOKKM5EB2X5/graph.json","fetch_events":"https://pith.science/api/pith-number/T2MN4RSD34APX3ZDOKKM5EB2X5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T2MN4RSD34APX3ZDOKKM5EB2X5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T2MN4RSD34APX3ZDOKKM5EB2X5/action/storage_attestation","attest_author":"https://pith.science/pith/T2MN4RSD34APX3ZDOKKM5EB2X5/action/author_attestation","sign_citation":"https://pith.science/pith/T2MN4RSD34APX3ZDOKKM5EB2X5/action/citation_signature","submit_replication":"https://pith.science/pith/T2MN4RSD34APX3ZDOKKM5EB2X5/action/replication_record"}},"created_at":"2026-07-07T01:16:46.021566+00:00","updated_at":"2026-07-07T01:16:46.021566+00:00"}