{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:2FG6UGCSZY7MLPJPKFAL6A4GLW","short_pith_number":"pith:2FG6UGCS","canonical_record":{"source":{"id":"1409.7777","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-09-27T07:27:17Z","cross_cats_sorted":["cs.DB","cs.LO"],"title_canon_sha256":"ea0258af0069ae9c1dae379d77dcd6cdc0ae5da7a0306e8bc78b3c9c57f2dae7","abstract_canon_sha256":"f0e21d2f8e3ddcc53966858f47819e16508d93007d5327ff8ceb1fda96f6391d"},"schema_version":"1.0"},"canonical_sha256":"d14dea1852ce3ec5bd2f5140bf03865d952570bea112f7a40d74c0c44c163a80","source":{"kind":"arxiv","id":"1409.7777","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.7777","created_at":"2026-05-18T02:41:40Z"},{"alias_kind":"arxiv_version","alias_value":"1409.7777v1","created_at":"2026-05-18T02:41:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7777","created_at":"2026-05-18T02:41:40Z"},{"alias_kind":"pith_short_12","alias_value":"2FG6UGCSZY7M","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"2FG6UGCSZY7MLPJP","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"2FG6UGCS","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:2FG6UGCSZY7MLPJPKFAL6A4GLW","target":"record","payload":{"canonical_record":{"source":{"id":"1409.7777","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-09-27T07:27:17Z","cross_cats_sorted":["cs.DB","cs.LO"],"title_canon_sha256":"ea0258af0069ae9c1dae379d77dcd6cdc0ae5da7a0306e8bc78b3c9c57f2dae7","abstract_canon_sha256":"f0e21d2f8e3ddcc53966858f47819e16508d93007d5327ff8ceb1fda96f6391d"},"schema_version":"1.0"},"canonical_sha256":"d14dea1852ce3ec5bd2f5140bf03865d952570bea112f7a40d74c0c44c163a80","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:40.641019Z","signature_b64":"8xHo2uHLV3XP6wNcFUeVdVXNY/uAgjCxl93a8st3QVU6GWsxZAS8wd0WC84JHfqqQamyVHWWsWq2tlymUb03AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d14dea1852ce3ec5bd2f5140bf03865d952570bea112f7a40d74c0c44c163a80","last_reissued_at":"2026-05-18T02:41:40.640487Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:40.640487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.7777","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-05-18T02:41:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3MX8pvDR3NQk40TlTQvFyj7BtD+90roCOi/ahk0W1PXVlPbSFVcHW1nmCAI1mL7vJTlPk/rGMtePhqca84jvBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T22:44:07.767991Z"},"content_sha256":"680ee441c9b91fac980cf2de06792d52ddfceaf932f1533cfe0b88f5361e1889","schema_version":"1.0","event_id":"sha256:680ee441c9b91fac980cf2de06792d52ddfceaf932f1533cfe0b88f5361e1889"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:2FG6UGCSZY7MLPJPKFAL6A4GLW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Using Answer Set Programming for pattern mining","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.LO"],"primary_cat":"cs.AI","authors_text":"Ren\\'e Quiniou (INRIA - Irisa), Thomas Guyet (INRIA - IRISA), Yves Moinard (INRIA - IRISA)","submitted_at":"2014-09-27T07:27:17Z","abstract_excerpt":"Serial pattern mining consists in extracting the frequent sequential patterns from a unique sequence of itemsets. This paper explores the ability of a declarative language, such as Answer Set Programming (ASP), to solve this issue efficiently. We propose several ASP implementations of the frequent sequential pattern mining task: a non-incremental and an incremental resolution. The results show that the incremental resolution is more efficient than the non-incremental one, but both ASP programs are less efficient than dedicated algorithms. Nonetheless, this approach can be seen as a first step "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.7777","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":""},"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-18T02:41:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sXqR2f0QgBBl7D0kYHxcb0hQFyMFWDgXj+7IFtVsddzlUjZiMNosZFiEfZAB+E4h34em6QXSPAK3OOUg0+IQAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T22:44:07.768670Z"},"content_sha256":"84812400ceb34faedad5132a3ec87eeb591dabb1879e6b8b34a4c01fb01f932a","schema_version":"1.0","event_id":"sha256:84812400ceb34faedad5132a3ec87eeb591dabb1879e6b8b34a4c01fb01f932a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2FG6UGCSZY7MLPJPKFAL6A4GLW/bundle.json","state_url":"https://pith.science/pith/2FG6UGCSZY7MLPJPKFAL6A4GLW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2FG6UGCSZY7MLPJPKFAL6A4GLW/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-06-06T22:44:07Z","links":{"resolver":"https://pith.science/pith/2FG6UGCSZY7MLPJPKFAL6A4GLW","bundle":"https://pith.science/pith/2FG6UGCSZY7MLPJPKFAL6A4GLW/bundle.json","state":"https://pith.science/pith/2FG6UGCSZY7MLPJPKFAL6A4GLW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2FG6UGCSZY7MLPJPKFAL6A4GLW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:2FG6UGCSZY7MLPJPKFAL6A4GLW","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":"f0e21d2f8e3ddcc53966858f47819e16508d93007d5327ff8ceb1fda96f6391d","cross_cats_sorted":["cs.DB","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-09-27T07:27:17Z","title_canon_sha256":"ea0258af0069ae9c1dae379d77dcd6cdc0ae5da7a0306e8bc78b3c9c57f2dae7"},"schema_version":"1.0","source":{"id":"1409.7777","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.7777","created_at":"2026-05-18T02:41:40Z"},{"alias_kind":"arxiv_version","alias_value":"1409.7777v1","created_at":"2026-05-18T02:41:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7777","created_at":"2026-05-18T02:41:40Z"},{"alias_kind":"pith_short_12","alias_value":"2FG6UGCSZY7M","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"2FG6UGCSZY7MLPJP","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"2FG6UGCS","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:84812400ceb34faedad5132a3ec87eeb591dabb1879e6b8b34a4c01fb01f932a","target":"graph","created_at":"2026-05-18T02:41:40Z","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":"Serial pattern mining consists in extracting the frequent sequential patterns from a unique sequence of itemsets. This paper explores the ability of a declarative language, such as Answer Set Programming (ASP), to solve this issue efficiently. We propose several ASP implementations of the frequent sequential pattern mining task: a non-incremental and an incremental resolution. The results show that the incremental resolution is more efficient than the non-incremental one, but both ASP programs are less efficient than dedicated algorithms. Nonetheless, this approach can be seen as a first step ","authors_text":"Ren\\'e Quiniou (INRIA - Irisa), Thomas Guyet (INRIA - IRISA), Yves Moinard (INRIA - IRISA)","cross_cats":["cs.DB","cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-09-27T07:27:17Z","title":"Using Answer Set Programming for pattern mining"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.7777","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:680ee441c9b91fac980cf2de06792d52ddfceaf932f1533cfe0b88f5361e1889","target":"record","created_at":"2026-05-18T02:41:40Z","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":"f0e21d2f8e3ddcc53966858f47819e16508d93007d5327ff8ceb1fda96f6391d","cross_cats_sorted":["cs.DB","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-09-27T07:27:17Z","title_canon_sha256":"ea0258af0069ae9c1dae379d77dcd6cdc0ae5da7a0306e8bc78b3c9c57f2dae7"},"schema_version":"1.0","source":{"id":"1409.7777","kind":"arxiv","version":1}},"canonical_sha256":"d14dea1852ce3ec5bd2f5140bf03865d952570bea112f7a40d74c0c44c163a80","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d14dea1852ce3ec5bd2f5140bf03865d952570bea112f7a40d74c0c44c163a80","first_computed_at":"2026-05-18T02:41:40.640487Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:41:40.640487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8xHo2uHLV3XP6wNcFUeVdVXNY/uAgjCxl93a8st3QVU6GWsxZAS8wd0WC84JHfqqQamyVHWWsWq2tlymUb03AA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:41:40.641019Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.7777","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:680ee441c9b91fac980cf2de06792d52ddfceaf932f1533cfe0b88f5361e1889","sha256:84812400ceb34faedad5132a3ec87eeb591dabb1879e6b8b34a4c01fb01f932a"],"state_sha256":"e49b0f69f68e32449afa202fb53e0acff9b48ea62409f7712eb67c91acf5a49e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"He1eolW/pz3Dv0Mlq15BOVmwJqJYnBwEzMthcf4nI/lTy0grVgGCGTYreV4ZaExze+mi9LQvywwF2yZAHkXbDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T22:44:07.771978Z","bundle_sha256":"d994371e6bcf11906e03ecf59363dc0e03a48332b1ddcfda2c0db58249a1a783"}}