{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:OQMG6OYLLW2SUTCI6WWO7MYKBG","short_pith_number":"pith:OQMG6OYL","canonical_record":{"source":{"id":"2502.05854","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2025-02-09T11:25:37Z","cross_cats_sorted":[],"title_canon_sha256":"460ba3e1b6a73436271899e192acc41726b06f82153f4cea3f410c422e3eff0e","abstract_canon_sha256":"01a3a4351a8f1a35dd7ec144ba494b6b466c1bec3712649e1edcc8a5fd1c50fa"},"schema_version":"1.0"},"canonical_sha256":"74186f3b0b5db52a4c48f5acefb30a09a8e06b699e96777e2142ed6b38e20087","source":{"kind":"arxiv","id":"2502.05854","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.05854","created_at":"2026-07-05T10:11:44Z"},{"alias_kind":"arxiv_version","alias_value":"2502.05854v1","created_at":"2026-07-05T10:11:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.05854","created_at":"2026-07-05T10:11:44Z"},{"alias_kind":"pith_short_12","alias_value":"OQMG6OYLLW2S","created_at":"2026-07-05T10:11:44Z"},{"alias_kind":"pith_short_16","alias_value":"OQMG6OYLLW2SUTCI","created_at":"2026-07-05T10:11:44Z"},{"alias_kind":"pith_short_8","alias_value":"OQMG6OYL","created_at":"2026-07-05T10:11:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:OQMG6OYLLW2SUTCI6WWO7MYKBG","target":"record","payload":{"canonical_record":{"source":{"id":"2502.05854","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2025-02-09T11:25:37Z","cross_cats_sorted":[],"title_canon_sha256":"460ba3e1b6a73436271899e192acc41726b06f82153f4cea3f410c422e3eff0e","abstract_canon_sha256":"01a3a4351a8f1a35dd7ec144ba494b6b466c1bec3712649e1edcc8a5fd1c50fa"},"schema_version":"1.0"},"canonical_sha256":"74186f3b0b5db52a4c48f5acefb30a09a8e06b699e96777e2142ed6b38e20087","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:11:44.247942Z","signature_b64":"NSsWxZmuterpy445N73TMFtZ+bkHQC1Kr5oZTLvG7smcpGHwWiY74kBoo/23ISsag2h+atdmeO/Z2ERG4dlABw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74186f3b0b5db52a4c48f5acefb30a09a8e06b699e96777e2142ed6b38e20087","last_reissued_at":"2026-07-05T10:11:44.247465Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:11:44.247465Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.05854","source_version":1,"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-07-05T10:11:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5CqAwPBq8DWQJQk/X4rg4cIBv5hf8OLQDJPPR4Ipiq/PU1p2xv+eU+qs1ghWxb6ddJaZIC/mikUL+VI3HnlsBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T09:07:14.159334Z"},"content_sha256":"13e3dba6a5c802c4e4944066a0bef0021c217f06f11e98e9d70fdfad32bddb3b","schema_version":"1.0","event_id":"sha256:13e3dba6a5c802c4e4944066a0bef0021c217f06f11e98e9d70fdfad32bddb3b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:OQMG6OYLLW2SUTCI6WWO7MYKBG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"NSPG-Miner: Mining Repetitive Negative Sequential Patterns","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Jing Liu, Lei Guo, Philippe Fournier-Viger, Xindong Wu, Yan Li, Youxi Wu, Zhulin Wang","submitted_at":"2025-02-09T11:25:37Z","abstract_excerpt":"Sequential pattern mining (SPM) with gap constraints (or repetitive SPM or tandem repeat discovery in bioinformatics) can find frequent repetitive subsequences satisfying gap constraints, which are called positive sequential patterns with gap constraints (PSPGs). However, classical SPM with gap constraints cannot find the frequent missing items in the PSPGs. To tackle this issue, this paper explores negative sequential patterns with gap constraints (NSPGs). We propose an efficient NSPG-Miner algorithm that can mine both frequent PSPGs and NSPGs simultaneously. To effectively reduce candidate p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.05854","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/2502.05854/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"},"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-07-05T10:11:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rSWNbUwgQyVqChqj+yS6HlEEXqqAcgBAzUfB0S+9ggVG0vmdmwZzmaqTdllCGh1H+hPPIpcaQmcbiQgCoYrSDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T09:07:14.159718Z"},"content_sha256":"9b7a3e9eae5cc449d9151d6fc8139d9dc4c2454e4e1d37d18a02a0e1814d93c1","schema_version":"1.0","event_id":"sha256:9b7a3e9eae5cc449d9151d6fc8139d9dc4c2454e4e1d37d18a02a0e1814d93c1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OQMG6OYLLW2SUTCI6WWO7MYKBG/bundle.json","state_url":"https://pith.science/pith/OQMG6OYLLW2SUTCI6WWO7MYKBG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OQMG6OYLLW2SUTCI6WWO7MYKBG/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-07-09T09:07:14Z","links":{"resolver":"https://pith.science/pith/OQMG6OYLLW2SUTCI6WWO7MYKBG","bundle":"https://pith.science/pith/OQMG6OYLLW2SUTCI6WWO7MYKBG/bundle.json","state":"https://pith.science/pith/OQMG6OYLLW2SUTCI6WWO7MYKBG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OQMG6OYLLW2SUTCI6WWO7MYKBG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:OQMG6OYLLW2SUTCI6WWO7MYKBG","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":"01a3a4351a8f1a35dd7ec144ba494b6b466c1bec3712649e1edcc8a5fd1c50fa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2025-02-09T11:25:37Z","title_canon_sha256":"460ba3e1b6a73436271899e192acc41726b06f82153f4cea3f410c422e3eff0e"},"schema_version":"1.0","source":{"id":"2502.05854","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.05854","created_at":"2026-07-05T10:11:44Z"},{"alias_kind":"arxiv_version","alias_value":"2502.05854v1","created_at":"2026-07-05T10:11:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.05854","created_at":"2026-07-05T10:11:44Z"},{"alias_kind":"pith_short_12","alias_value":"OQMG6OYLLW2S","created_at":"2026-07-05T10:11:44Z"},{"alias_kind":"pith_short_16","alias_value":"OQMG6OYLLW2SUTCI","created_at":"2026-07-05T10:11:44Z"},{"alias_kind":"pith_short_8","alias_value":"OQMG6OYL","created_at":"2026-07-05T10:11:44Z"}],"graph_snapshots":[{"event_id":"sha256:9b7a3e9eae5cc449d9151d6fc8139d9dc4c2454e4e1d37d18a02a0e1814d93c1","target":"graph","created_at":"2026-07-05T10:11:44Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2502.05854/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Sequential pattern mining (SPM) with gap constraints (or repetitive SPM or tandem repeat discovery in bioinformatics) can find frequent repetitive subsequences satisfying gap constraints, which are called positive sequential patterns with gap constraints (PSPGs). However, classical SPM with gap constraints cannot find the frequent missing items in the PSPGs. To tackle this issue, this paper explores negative sequential patterns with gap constraints (NSPGs). We propose an efficient NSPG-Miner algorithm that can mine both frequent PSPGs and NSPGs simultaneously. To effectively reduce candidate p","authors_text":"Jing Liu, Lei Guo, Philippe Fournier-Viger, Xindong Wu, Yan Li, Youxi Wu, Zhulin Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2025-02-09T11:25:37Z","title":"NSPG-Miner: Mining Repetitive Negative Sequential Patterns"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.05854","kind":"arxiv","version":1},"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:13e3dba6a5c802c4e4944066a0bef0021c217f06f11e98e9d70fdfad32bddb3b","target":"record","created_at":"2026-07-05T10:11:44Z","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":"01a3a4351a8f1a35dd7ec144ba494b6b466c1bec3712649e1edcc8a5fd1c50fa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2025-02-09T11:25:37Z","title_canon_sha256":"460ba3e1b6a73436271899e192acc41726b06f82153f4cea3f410c422e3eff0e"},"schema_version":"1.0","source":{"id":"2502.05854","kind":"arxiv","version":1}},"canonical_sha256":"74186f3b0b5db52a4c48f5acefb30a09a8e06b699e96777e2142ed6b38e20087","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"74186f3b0b5db52a4c48f5acefb30a09a8e06b699e96777e2142ed6b38e20087","first_computed_at":"2026-07-05T10:11:44.247465Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:11:44.247465Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NSsWxZmuterpy445N73TMFtZ+bkHQC1Kr5oZTLvG7smcpGHwWiY74kBoo/23ISsag2h+atdmeO/Z2ERG4dlABw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:11:44.247942Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.05854","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:13e3dba6a5c802c4e4944066a0bef0021c217f06f11e98e9d70fdfad32bddb3b","sha256:9b7a3e9eae5cc449d9151d6fc8139d9dc4c2454e4e1d37d18a02a0e1814d93c1"],"state_sha256":"52a5d203dcd9ba21c2ab3984586e47ec5ac553d7b68d36dbf9e5ba8ba95ebf32"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GWLMd5sDrg3K9TFYG9nq/RKrISl9iE7UKE2Gsz9Sln5mtyXtdZInJywaDlS18If/iVc/mc8GtKAEvJI90jndBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-09T09:07:14.161761Z","bundle_sha256":"6450340a2cd57eaada46a71f659a8c6552c3cbfbd22d23e7685a77de25a2700f"}}