{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:BEGGINGT24OQD646WLYAFLAJCX","short_pith_number":"pith:BEGGINGT","schema_version":"1.0","canonical_sha256":"090c6434d3d71d01fb9eb2f002ac0915e2ff8c7a7335cf94e0e31d14c8a3e72c","source":{"kind":"arxiv","id":"2301.12630","version":1},"attestation_state":"computed","paper":{"title":"Maximal co-occurrence nonoverlapping sequential rule mining","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Chang Zhang, Jie Li, Wei Song, Xindong Wu, Yan Li, Youxi Wu, Zhenlian Qi","submitted_at":"2023-01-30T03:13:43Z","abstract_excerpt":"The aim of sequential pattern mining (SPM) is to discover potentially useful information from a given se-quence. Although various SPM methods have been investigated, most of these focus on mining all of the patterns. However, users sometimes want to mine patterns with the same specific prefix pattern, called co-occurrence pattern. Since sequential rule mining can make better use of the results of SPM, and obtain better recommendation performance, this paper addresses the issue of maximal co-occurrence nonoverlapping sequential rule (MCoR) mining and proposes the MCoR-Miner algo-rithm. To impro"},"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":"2301.12630","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2023-01-30T03:13:43Z","cross_cats_sorted":[],"title_canon_sha256":"807e763a6c26aefcadda6d05a55929049c8c2e03ea55c06b3cb4c22fe7aea491","abstract_canon_sha256":"1d5c857afd3ae57b0a83b3aac0577b4381a87a056df0cbe3f1fdecc0f29c88ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:36:55.953374Z","signature_b64":"M0rJLLHbEMYcyvASTatxImKN3350wmot4G2DCn+eU8NqZlmTeG6iJuBX6jeyMpv1hpDX5C0b3iI73G4M9RMsCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"090c6434d3d71d01fb9eb2f002ac0915e2ff8c7a7335cf94e0e31d14c8a3e72c","last_reissued_at":"2026-07-05T05:36:55.952891Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:36:55.952891Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximal co-occurrence nonoverlapping sequential rule mining","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Chang Zhang, Jie Li, Wei Song, Xindong Wu, Yan Li, Youxi Wu, Zhenlian Qi","submitted_at":"2023-01-30T03:13:43Z","abstract_excerpt":"The aim of sequential pattern mining (SPM) is to discover potentially useful information from a given se-quence. Although various SPM methods have been investigated, most of these focus on mining all of the patterns. However, users sometimes want to mine patterns with the same specific prefix pattern, called co-occurrence pattern. Since sequential rule mining can make better use of the results of SPM, and obtain better recommendation performance, this paper addresses the issue of maximal co-occurrence nonoverlapping sequential rule (MCoR) mining and proposes the MCoR-Miner algo-rithm. To impro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.12630","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/2301.12630/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":"2301.12630","created_at":"2026-07-05T05:36:55.952945+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.12630v1","created_at":"2026-07-05T05:36:55.952945+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.12630","created_at":"2026-07-05T05:36:55.952945+00:00"},{"alias_kind":"pith_short_12","alias_value":"BEGGINGT24OQ","created_at":"2026-07-05T05:36:55.952945+00:00"},{"alias_kind":"pith_short_16","alias_value":"BEGGINGT24OQD646","created_at":"2026-07-05T05:36:55.952945+00:00"},{"alias_kind":"pith_short_8","alias_value":"BEGGINGT","created_at":"2026-07-05T05:36:55.952945+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/BEGGINGT24OQD646WLYAFLAJCX","json":"https://pith.science/pith/BEGGINGT24OQD646WLYAFLAJCX.json","graph_json":"https://pith.science/api/pith-number/BEGGINGT24OQD646WLYAFLAJCX/graph.json","events_json":"https://pith.science/api/pith-number/BEGGINGT24OQD646WLYAFLAJCX/events.json","paper":"https://pith.science/paper/BEGGINGT"},"agent_actions":{"view_html":"https://pith.science/pith/BEGGINGT24OQD646WLYAFLAJCX","download_json":"https://pith.science/pith/BEGGINGT24OQD646WLYAFLAJCX.json","view_paper":"https://pith.science/paper/BEGGINGT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.12630&json=true","fetch_graph":"https://pith.science/api/pith-number/BEGGINGT24OQD646WLYAFLAJCX/graph.json","fetch_events":"https://pith.science/api/pith-number/BEGGINGT24OQD646WLYAFLAJCX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BEGGINGT24OQD646WLYAFLAJCX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BEGGINGT24OQD646WLYAFLAJCX/action/storage_attestation","attest_author":"https://pith.science/pith/BEGGINGT24OQD646WLYAFLAJCX/action/author_attestation","sign_citation":"https://pith.science/pith/BEGGINGT24OQD646WLYAFLAJCX/action/citation_signature","submit_replication":"https://pith.science/pith/BEGGINGT24OQD646WLYAFLAJCX/action/replication_record"}},"created_at":"2026-07-05T05:36:55.952945+00:00","updated_at":"2026-07-05T05:36:55.952945+00:00"}