{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:PQINVXY677BA3ASFSIKMZGFIUD","short_pith_number":"pith:PQINVXY6","schema_version":"1.0","canonical_sha256":"7c10dadf1effc20d82459214cc98a8a0c38ceb658598dc737f3cd0e78ca9d0ff","source":{"kind":"arxiv","id":"2304.11947","version":1},"attestation_state":"computed","paper":{"title":"Towards Top-$K$ Non-Overlapping Sequential Patterns","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Gengsen Huang, Wensheng Gan, Yan Li, Zefeng Chen, Zhenlian Qi","submitted_at":"2023-04-24T09:32:09Z","abstract_excerpt":"Sequential pattern mining (SPM) has excellent prospects and application spaces and has been widely used in different fields. The non-overlapping SPM, as one of the data mining techniques, has been used to discover patterns that have requirements for gap constraints in some specific mining tasks, such as bio-data mining. And for the non-overlapping sequential patterns with gap constraints, the Nettree structure has been proposed to efficiently compute the support of the patterns. For pattern mining, users usually need to consider the threshold of minimum support (\\textit{minsup}). This is espec"},"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":"2304.11947","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2023-04-24T09:32:09Z","cross_cats_sorted":[],"title_canon_sha256":"835eddc179773dc2bb73cc34a7fdff0e05ecf4c06cca158c305965c57a1656ba","abstract_canon_sha256":"125c5bf110990d6d518e8f1bc6116bf3c6ba862b7e53b0a4c067c9805fb38e17"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:03:38.892340Z","signature_b64":"afIIa0uurC7VZPcokE0zZoLrI7oGUZ+OjNSl3b6ZTeUoUbfpooDk5hkoH7nJsjOQvvSaku3l53aHWcceiGj1BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c10dadf1effc20d82459214cc98a8a0c38ceb658598dc737f3cd0e78ca9d0ff","last_reissued_at":"2026-07-05T06:03:38.891963Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:03:38.891963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Top-$K$ Non-Overlapping Sequential Patterns","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Gengsen Huang, Wensheng Gan, Yan Li, Zefeng Chen, Zhenlian Qi","submitted_at":"2023-04-24T09:32:09Z","abstract_excerpt":"Sequential pattern mining (SPM) has excellent prospects and application spaces and has been widely used in different fields. The non-overlapping SPM, as one of the data mining techniques, has been used to discover patterns that have requirements for gap constraints in some specific mining tasks, such as bio-data mining. And for the non-overlapping sequential patterns with gap constraints, the Nettree structure has been proposed to efficiently compute the support of the patterns. For pattern mining, users usually need to consider the threshold of minimum support (\\textit{minsup}). This is espec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.11947","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/2304.11947/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":"2304.11947","created_at":"2026-07-05T06:03:38.892025+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.11947v1","created_at":"2026-07-05T06:03:38.892025+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.11947","created_at":"2026-07-05T06:03:38.892025+00:00"},{"alias_kind":"pith_short_12","alias_value":"PQINVXY677BA","created_at":"2026-07-05T06:03:38.892025+00:00"},{"alias_kind":"pith_short_16","alias_value":"PQINVXY677BA3ASF","created_at":"2026-07-05T06:03:38.892025+00:00"},{"alias_kind":"pith_short_8","alias_value":"PQINVXY6","created_at":"2026-07-05T06:03:38.892025+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/PQINVXY677BA3ASFSIKMZGFIUD","json":"https://pith.science/pith/PQINVXY677BA3ASFSIKMZGFIUD.json","graph_json":"https://pith.science/api/pith-number/PQINVXY677BA3ASFSIKMZGFIUD/graph.json","events_json":"https://pith.science/api/pith-number/PQINVXY677BA3ASFSIKMZGFIUD/events.json","paper":"https://pith.science/paper/PQINVXY6"},"agent_actions":{"view_html":"https://pith.science/pith/PQINVXY677BA3ASFSIKMZGFIUD","download_json":"https://pith.science/pith/PQINVXY677BA3ASFSIKMZGFIUD.json","view_paper":"https://pith.science/paper/PQINVXY6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.11947&json=true","fetch_graph":"https://pith.science/api/pith-number/PQINVXY677BA3ASFSIKMZGFIUD/graph.json","fetch_events":"https://pith.science/api/pith-number/PQINVXY677BA3ASFSIKMZGFIUD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PQINVXY677BA3ASFSIKMZGFIUD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PQINVXY677BA3ASFSIKMZGFIUD/action/storage_attestation","attest_author":"https://pith.science/pith/PQINVXY677BA3ASFSIKMZGFIUD/action/author_attestation","sign_citation":"https://pith.science/pith/PQINVXY677BA3ASFSIKMZGFIUD/action/citation_signature","submit_replication":"https://pith.science/pith/PQINVXY677BA3ASFSIKMZGFIUD/action/replication_record"}},"created_at":"2026-07-05T06:03:38.892025+00:00","updated_at":"2026-07-05T06:03:38.892025+00:00"}