{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:2FG6UGCSZY7MLPJPKFAL6A4GLW","short_pith_number":"pith:2FG6UGCS","schema_version":"1.0","canonical_sha256":"d14dea1852ce3ec5bd2f5140bf03865d952570bea112f7a40d74c0c44c163a80","source":{"kind":"arxiv","id":"1409.7777","version":1},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1409.7777","created_at":"2026-05-18T02:41:40.640567+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.7777v1","created_at":"2026-05-18T02:41:40.640567+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7777","created_at":"2026-05-18T02:41:40.640567+00:00"},{"alias_kind":"pith_short_12","alias_value":"2FG6UGCSZY7M","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"2FG6UGCSZY7MLPJP","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"2FG6UGCS","created_at":"2026-05-18T12:28:09.283467+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/2FG6UGCSZY7MLPJPKFAL6A4GLW","json":"https://pith.science/pith/2FG6UGCSZY7MLPJPKFAL6A4GLW.json","graph_json":"https://pith.science/api/pith-number/2FG6UGCSZY7MLPJPKFAL6A4GLW/graph.json","events_json":"https://pith.science/api/pith-number/2FG6UGCSZY7MLPJPKFAL6A4GLW/events.json","paper":"https://pith.science/paper/2FG6UGCS"},"agent_actions":{"view_html":"https://pith.science/pith/2FG6UGCSZY7MLPJPKFAL6A4GLW","download_json":"https://pith.science/pith/2FG6UGCSZY7MLPJPKFAL6A4GLW.json","view_paper":"https://pith.science/paper/2FG6UGCS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.7777&json=true","fetch_graph":"https://pith.science/api/pith-number/2FG6UGCSZY7MLPJPKFAL6A4GLW/graph.json","fetch_events":"https://pith.science/api/pith-number/2FG6UGCSZY7MLPJPKFAL6A4GLW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2FG6UGCSZY7MLPJPKFAL6A4GLW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2FG6UGCSZY7MLPJPKFAL6A4GLW/action/storage_attestation","attest_author":"https://pith.science/pith/2FG6UGCSZY7MLPJPKFAL6A4GLW/action/author_attestation","sign_citation":"https://pith.science/pith/2FG6UGCSZY7MLPJPKFAL6A4GLW/action/citation_signature","submit_replication":"https://pith.science/pith/2FG6UGCSZY7MLPJPKFAL6A4GLW/action/replication_record"}},"created_at":"2026-05-18T02:41:40.640567+00:00","updated_at":"2026-05-18T02:41:40.640567+00:00"}