{"as_of":"2026-08-04T09:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b4933acefc69500a74437672a659ef8cdd70d69a672091affa1b16e130da4408","coverage":[{"denominator":40,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":40,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-18T07:51:12.613329Z","state":"measured"},{"denominator":40,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":40,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-04T06:34:03.388597+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2510.10243/citation-record","integrity":"/paper/2510.10243/integrity","json":"/paper/2510.10243/citation-record.json","paper":"/paper/2510.10243"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Data mining: an overview from a database perspective","venue":null,"work_id":"895ee95b-2623-4a46-8bb3-c5d76b124b1e","year":2002},"citing_paper":{"arxiv_id":"2510.10243","last_updated":"2026-04-26T08:59:57Z","snapshot_observed_at":"2026-08-02T09:06:29.854795Z","submitted_at":"2025-10-11T14:52:04Z","title":"Efficient Mining of Low-Utility Sequential Patterns","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-18T07:51:12.613329Z"},"links":{"citing_paper":"/paper/2510.10243"},"observation_digest":"sha256:1fcad23b06e5b93075a618ca8b9f932dd2c181192b503140b53f4936f5283ca8","observation_id":"2ffa7fe6-9490-43a8-84ce-cdd81241bace","resolution":{"observed_at":"2026-05-18T07:52:30.233212Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"PrefixSpan: Mining sequential patterns efficiently by prefix- projected pattern growth","venue":null,"work_id":"abfd3361-009d-4033-961a-7a0692a953e5","year":2001},"citing_paper":{"arxiv_id":"2510.10243","last_updated":"2026-04-26T08:59:57Z","snapshot_observed_at":"2026-08-02T09:06:29.854795Z","submitted_at":"2025-10-11T14:52:04Z","title":"Efficient Mining of Low-Utility Sequential Patterns","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-18T07:51:12.613329Z"},"links":{"citing_paper":"/paper/2510.10243"},"observation_digest":"sha256:ce9a03d974aa2ccef8332c785ce8ac027238c17c8ddb16ed9947ce895dd28f9a","observation_id":"c4b624af-c78a-43b2-9eb1-f1fa219da14a","resolution":{"observed_at":"2026-05-18T07:52:30.242823Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Mining frequent patterns without candidate generation: A frequent-pattern tree approach","venue":null,"work_id":"4d77c6a7-46f2-4e87-8db4-657433a6cdcd","year":2004},"citing_paper":{"arxiv_id":"2510.10243","last_updated":"2026-04-26T08:59:57Z","snapshot_observed_at":"2026-08-02T09:06:29.854795Z","submitted_at":"2025-10-11T14:52:04Z","title":"Efficient Mining of Low-Utility Sequential Patterns","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-18T07:51:12.613329Z"},"links":{"citing_paper":"/paper/2510.10243"},"observation_digest":"sha256:5415314ade30882c421aa8e7b54080609b5317fd10e65c9d4fa53ef9e502689f","observation_id":"71c7595d-a30c-49e6-911f-c98bb1ac4920","resolution":{"observed_at":"2026-05-18T07:52:30.194660Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Mining association rules between sets of items in large databases","venue":null,"work_id":"6b5ba6c2-3ab8-4a8c-a0c6-e6432543e944","year":1993},"citing_paper":{"arxiv_id":"2510.10243","last_updated":"2026-04-26T08:59:57Z","snapshot_observed_at":"2026-08-02T09:06:29.854795Z","submitted_at":"2025-10-11T14:52:04Z","title":"Efficient Mining of Low-Utility Sequential Patterns","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-18T07:51:12.613329Z"},"links":{"citing_paper":"/paper/2510.10243"},"observation_digest":"sha256:a164d80775f53ae520852985eafd47b8cae769fe171b921ac54adc4c4b48d9b5","observation_id":"0e83e4ce-e6d0-4555-a852-c320dca56101","resolution":{"observed_at":"2026-05-18T07:52:30.258562Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Mining cross-level high utility itemsets in unstable and negative profit databases","venue":null,"work_id":"ee00ff44-5a4b-4b88-8354-8f7fcf8b3e00","year":2025},"citing_paper":{"arxiv_id":"2510.10243","last_updated":"2026-04-26T08:59:57Z","snapshot_observed_at":"2026-08-02T09:06:29.854795Z","submitted_at":"2025-10-11T14:52:04Z","title":"Efficient Mining of Low-Utility Sequential Patterns","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-18T07:51:12.613329Z"},"links":{"citing_paper":"/paper/2510.10243"},"observation_digest":"sha256:860633becbd1f49673faa3d6e2f922cdb1bec0b5b185f3bb9a99b143d060397f","observation_id":"eacdd001-b78b-4fde-8890-5064fe63e6d7","resolution":{"observed_at":"2026-05-18T07:52:30.291258Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Toward targeted mining of RFM patterns","venue":null,"work_id":"8d1c7524-019c-4318-88ff-82c3e4bc8ad1","year":2025},"citing_paper":{"arxiv_id":"2510.10243","last_updated":"2026-04-26T08:59:57Z","snapshot_observed_at":"2026-08-02T09:06:29.854795Z","submitted_at":"2025-10-11T14:52:04Z","title":"Efficient Mining of Low-Utility Sequential Patterns","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-18T07:51:12.613329Z"},"links":{"citing_paper":"/paper/2510.10243"},"observation_digest":"sha256:d515ed9fa22015f5a7dc149f772bcad23510639813b416677a3a22251a8133e6","observation_id":"b019285a-df72-43b1-a187-d74ba1cfd3fe","resolution":{"observed_at":"2026-05-18T07:52:30.264019Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Mining sequential patterns","venue":null,"work_id":"c567a74d-f36f-40dd-8b7a-d64510c36088","year":1995},"citing_paper":{"arxiv_id":"2510.10243","last_updated":"2026-04-26T08:59:57Z","snapshot_observed_at":"2026-08-02T09:06:29.854795Z","submitted_at":"2025-10-11T14:52:04Z","title":"Efficient Mining of Low-Utility Sequential Patterns","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-18T07:51:12.613329Z"},"links":{"citing_paper":"/paper/2510.10243"},"observation_digest":"sha256:75fc9a0c2d263f5f42b0736c936ee2d6d46645ee24d003ea4fb4d0a51264762b","observation_id":"987408fa-759f-4a17-8ead-64a23b78baff","resolution":{"observed_at":"2026-05-18T07:52:30.175890Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"An efficient method for modeling nonoccurring behaviors by negative sequential patterns with loose constraints","venue":null,"work_id":"b740dc20-c36c-4e78-8577-a5cb8bdcc749","year":2021},"citing_paper":{"arxiv_id":"2510.10243","last_updated":"2026-04-26T08:59:57Z","snapshot_observed_at":"2026-08-02T09:06:29.854795Z","submitted_at":"2025-10-11T14:52:04Z","title":"Efficient Mining of Low-Utility Sequential Patterns","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-18T07:51:12.613329Z"},"links":{"citing_paper":"/paper/2510.10243"},"observation_digest":"sha256:7ca51bdcee15eee7039dcc6599252f849c1e839d03fff4ce44f0703515b771ce","observation_id":"36621797-9ef4-4ea7-97e5-85433fbc4159","resolution":{"observed_at":"2026-05-18T07:52:30.185005Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"e-RNSP: An efficient method for mining repetition negative sequential patterns","venue":null,"work_id":"b055c55e-e5b0-4f46-a805-6c14496714b1","year":2084},"citing_paper":{"arxiv_id":"2510.10243","last_updated":"2026-04-26T08:59:57Z","snapshot_observed_at":"2026-08-02T09:06:29.854795Z","submitted_at":"2025-10-11T14:52:04Z","title":"Efficient Mining of Low-Utility Sequential Patterns","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-18T07:51:12.613329Z"},"links":{"citing_paper":"/paper/2510.10243"},"observation_digest":"sha256:f07918dc9abdb176021b88da100bd5d2e7659427d4df62dcdb4335c8f5def50b","observation_id":"5cea4035-2f8b-4a70-a002-dcdb4bf07ae2","resolution":{"observed_at":"2026-05-18T07:52:30.266711Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A survey of parallel sequential pattern mining","venue":null,"work_id":"1a879ba8-3f56-41db-b144-1003901f0db7","year":2019},"citing_paper":{"arxiv_id":"2510.10243","last_updated":"2026-04-26T08:59:57Z","snapshot_observed_at":"2026-08-02T09:06:29.854795Z","submitted_at":"2025-10-11T14:52:04Z","title":"Efficient Mining of Low-Utility Sequential Patterns","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-18T07:51:12.613329Z"},"links":{"citing_paper":"/paper/2510.10243"},"observation_digest":"sha256:e91f6480f8eac213cb555fc61801ed761b7e10da48f6711c3168786851cb91fc","observation_id":"96ecf189-5274-4dc0-bc47-ded8720634b9","resolution":{"observed_at":"2026-05-18T07:52:30.182056Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Anomaly rule detection in sequence data","venue":null,"work_id":"c469a03d-6c07-471e-83ef-72846ab8dc5e","year":2023},"citing_paper":{"arxiv_id":"2510.10243","last_updated":"2026-04-26T08:59:57Z","snapshot_observed_at":"2026-08-02T09:06:29.854795Z","submitted_at":"2025-10-11T14:52:04Z","title":"Efficient Mining of Low-Utility Sequential Patterns","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-18T07:51:12.613329Z"},"links":{"citing_paper":"/paper/2510.10243"},"observation_digest":"sha256:d28f1e10beb65b77e5db5d062ed73b162c20c5a124d14cea1cdb62f22321c099","observation_id":"c6120f71-d012-4a47-b134-2535eac1da12","resolution":{"observed_at":"2026-05-18T07:52:30.261384Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Targeted mining precise- positioning episode rules","venue":null,"work_id":"bbdddfef-ac28-4bd4-8652-b7f2f608b718","year":2025},"citing_paper":{"arxiv_id":"2510.10243","last_updated":"2026-04-26T08:59:57Z","snapshot_observed_at":"2026-08-02T09:06:29.854795Z","submitted_at":"2025-10-11T14:52:04Z","title":"Efficient Mining of Low-Utility Sequential Patterns","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-18T07:51:12.613329Z"},"links":{"citing_paper":"/paper/2510.10243"},"observation_digest":"sha256:c604355fb8d22db9c7c3a81d34559e2dd6bde6323636c806095658a4444788bb","observation_id":"a74aa721-9551-48d3-9b29-17b4c194004a","resolution":{"observed_at":"2026-05-18T07:52:30.245809Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"USpan: An efficient algorithm for mining high utility sequential patterns","venue":null,"work_id":"a5394ff4-4ff7-4b95-8c09-0439652ae349","year":2012},"citing_paper":{"arxiv_id":"2510.10243","last_updated":"2026-04-26T08:59:57Z","snapshot_observed_at":"2026-08-02T09:06:29.854795Z","submitted_at":"2025-10-11T14:52:04Z","title":"Efficient Mining of Low-Utility Sequential Patterns","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-18T07:51:12.613329Z"},"links":{"citing_paper":"/paper/2510.10243"},"observation_digest":"sha256:6506ad2139e68144b26685ff32fa288dce5b01619702f2479e0703b17adbf9ee","observation_id":"a99b6cd4-a0a3-4dc8-b24c-e5607e850d30","resolution":{"observed_at":"2026-05-18T07:52:30.236380Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"ProUM: Projection-based utility mining on sequence data","venue":null,"work_id":"b6a743bc-a446-4716-98c4-f759a1ad58bf","year":2020},"citing_paper":{"arxiv_id":"2510.10243","last_updated":"2026-04-26T08:59:57Z","snapshot_observed_at":"2026-08-02T09:06:29.854795Z","submitted_at":"2025-10-11T14:52:04Z","title":"Efficient Mining of Low-Utility Sequential Patterns","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-18T07:51:12.613329Z"},"links":{"citing_paper":"/paper/2510.10243"},"observation_digest":"sha256:53ec28818c3b264dede71fbade0c96614274c03edfd62d775c3b89d5376ed131","observation_id":"6f5d5c10-09d9-4a3e-b25a-707b99605355","resolution":{"observed_at":"2026-05-18T07:52:30.179103Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On incremental high utility sequential pattern mining","venue":null,"work_id":"d32029e7-763e-40da-998d-1b97a22e97da","year":2018},"citing_paper":{"arxiv_id":"2510.10243","last_updated":"2026-04-26T08:59:57Z","snapshot_observed_at":"2026-08-02T09:06:29.854795Z","submitted_at":"2025-10-11T14:52:04Z","title":"Efficient Mining of Low-Utility Sequential Patterns","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-18T07:51:12.613329Z"},"links":{"citing_paper":"/paper/2510.10243"},"observation_digest":"sha256:05a4481c2f693172452a1f16afd55a2f5ce3e55bac422712e5cda3b9d5bf25b1","observation_id":"85be1f66-2a0b-4d6b-b3ed-feaa25d3cf27","resolution":{"observed_at":"2026-05-18T07:52:30.281926Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Mining high utility mobile sequential patterns in mobile commerce environments","venue":null,"work_id":"bf099833-d96d-43d9-81ea-76e71299d1df","year":2011},"citing_paper":{"arxiv_id":"2510.10243","last_updated":"2026-04-26T08:59:57Z","snapshot_observed_at":"2026-08-02T09:06:29.854795Z","submitted_at":"2025-10-11T14:52:04Z","title":"Efficient Mining of Low-Utility Sequential Patterns","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-18T07:51:12.613329Z"},"links":{"citing_paper":"/paper/2510.10243"},"observation_digest":"sha256:674fb3f18a17c88bcf4c8f8b557c1a604fa17f00543f47947b5c411467bf7714","observation_id":"19eed234-cc1c-4a5d-9c4d-5993ccc086b5","resolution":{"observed_at":"2026-05-18T07:52:30.219912Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Applying the maximum utility measure in high utility sequential pattern mining","venue":null,"work_id":"c1bb300b-852a-467b-b6d3-ed823f86331f","year":2014},"citing_paper":{"arxiv_id":"2510.10243","last_updated":"2026-04-26T08:59:57Z","snapshot_observed_at":"2026-08-02T09:06:29.854795Z","submitted_at":"2025-10-11T14:52:04Z","title":"Efficient Mining of Low-Utility Sequential Patterns","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-18T07:51:12.613329Z"},"links":{"citing_paper":"/paper/2510.10243"},"observation_digest":"sha256:3561920c782827f3e5ac0e37b12511f3a14e5d8472c6a8609579cb71d5f47480","observation_id":"4012b1ba-1cc2-4fb7-b0e6-6d2135485428","resolution":{"observed_at":"2026-05-18T07:52:30.269313Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"CRoM and HuspExt: Improving efficiency of high utility sequential pattern extraction","venue":null,"work_id":"a0e12713-6a5b-47cd-bf2c-beee8866bace","year":2015},"citing_paper":{"arxiv_id":"2510.10243","last_updated":"2026-04-26T08:59:57Z","snapshot_observed_at":"2026-08-02T09:06:29.854795Z","submitted_at":"2025-10-11T14:52:04Z","title":"Efficient Mining of Low-Utility Sequential Patterns","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-18T07:51:12.613329Z"},"links":{"citing_paper":"/paper/2510.10243"},"observation_digest":"sha256:d65e06e5a6bf9ecbac6847e1c3026ff05c897675080daa28a87bd1428534d9da","observation_id":"f09f0b64-d66e-4b2a-8867-0aec432e8e0a","resolution":{"observed_at":"2026-05-18T07:52:30.285243Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"HUSP-SP: Faster utility mining on sequence data","venue":null,"work_id":"5c6b1dcb-274d-44fd-babb-427b8449bbb6","year":2023},"citing_paper":{"arxiv_id":"2510.10243","last_updated":"2026-04-26T08:59:57Z","snapshot_observed_at":"2026-08-02T09:06:29.854795Z","submitted_at":"2025-10-11T14:52:04Z","title":"Efficient Mining of Low-Utility Sequential Patterns","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-18T07:51:12.613329Z"},"links":{"citing_paper":"/paper/2510.10243"},"observation_digest":"sha256:77705fe5e2ee19d7a00e8bd4956761c7377e82cc584fffdc0e76d989a58bc3e6","observation_id":"8bea6282-18ac-4288-b7bf-29d572061b87","resolution":{"observed_at":"2026-05-18T07:52:30.188164Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"EHUSM: Mining high utility sequences with a pessimistic utility model","venue":null,"work_id":"8d7047a2-a182-491c-8344-d95bd902650f","year":2020},"citing_paper":{"arxiv_id":"2510.10243","last_updated":"2026-04-26T08:59:57Z","snapshot_observed_at":"2026-08-02T09:06:29.854795Z","submitted_at":"2025-10-11T14:52:04Z","title":"Efficient Mining of Low-Utility Sequential Patterns","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-18T07:51:12.613329Z"},"links":{"citing_paper":"/paper/2510.10243"},"observation_digest":"sha256:d4ddc0ad5536077f7be6c6860a1353a7aee2a41060905b18815b7bfc975f499e","observation_id":"01c5168f-2178-4a6e-8b7b-d62a6e8c397a","resolution":{"observed_at":"2026-05-18T07:52:30.216340Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"EHAUSM: An efficient algorithm for high average utility sequence mining","venue":null,"work_id":"fe36b280-161b-4a7a-93d6-af77eb7951f5","year":2020},"citing_paper":{"arxiv_id":"2510.10243","last_updated":"2026-04-26T08:59:57Z","snapshot_observed_at":"2026-08-02T09:06:29.854795Z","submitted_at":"2025-10-11T14:52:04Z","title":"Efficient Mining of Low-Utility Sequential Patterns","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-18T07:51:12.613329Z"},"links":{"citing_paper":"/paper/2510.10243"},"observation_digest":"sha256:2d68fc449afb964e5b490fb830383c7e7d26d85667723eb3b2ed0c4974295080","observation_id":"2fcba6be-6528-4d5b-a574-bbb59ba40d7b","resolution":{"observed_at":"2026-05-18T07:52:30.239841Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Pattern mining: Current challenges and opportunities","venue":null,"work_id":"e05a124d-13b6-41c4-9b5c-71bcc1a048d4","year":2022},"citing_paper":{"arxiv_id":"2510.10243","last_updated":"2026-04-26T08:59:57Z","snapshot_observed_at":"2026-08-02T09:06:29.854795Z","submitted_at":"2025-10-11T14:52:04Z","title":"Efficient Mining of Low-Utility Sequential Patterns","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-18T07:51:12.613329Z"},"links":{"citing_paper":"/paper/2510.10243"},"observation_digest":"sha256:a676bf443cb4784afb6afce23a704335308b1ea85547cbcdd7a9d074d57f5d08","observation_id":"dd48d3e7-d89e-4485-a050-5ebabdff3e09","resolution":{"observed_at":"2026-05-18T07:52:30.252902Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Mining sequential patterns: Generalizations and performance improvements","venue":null,"work_id":"09c9f210-1c66-46bc-b9cd-12ff31efbe16","year":1996},"citing_paper":{"arxiv_id":"2510.10243","last_updated":"2026-04-26T08:59:57Z","snapshot_observed_at":"2026-08-02T09:06:29.854795Z","submitted_at":"2025-10-11T14:52:04Z","title":"Efficient Mining of Low-Utility Sequential Patterns","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-18T07:51:12.613329Z"},"links":{"citing_paper":"/paper/2510.10243"},"observation_digest":"sha256:fd906491b56dc7e23303363d451a8548dba7d4dad630c1b170779a2828cccfae","observation_id":"4662a81b-b022-43a7-ace6-1ad12e5a5587","resolution":{"observed_at":"2026-05-18T07:52:30.272628Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"FreeSpan: Frequent pattern-projected sequential pattern mining","venue":null,"work_id":"c09f6168-2647-412d-a460-4a32abaa91a8","year":2000},"citing_paper":{"arxiv_id":"2510.10243","last_updated":"2026-04-26T08:59:57Z","snapshot_observed_at":"2026-08-02T09:06:29.854795Z","submitted_at":"2025-10-11T14:52:04Z","title":"Efficient Mining of Low-Utility Sequential Patterns","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-18T07:51:12.613329Z"},"links":{"citing_paper":"/paper/2510.10243"},"observation_digest":"sha256:1f8b4e351fc5d714ca34e2c40c62a4cd127c25ca77b5895421951dba6be90be5","observation_id":"72d9efef-f65f-4480-9cfc-7b4e2ca2f315","resolution":{"observed_at":"2026-05-18T07:52:30.255552Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Sequential pattern mining using a bitmap representation","venue":null,"work_id":"092a23e2-c7f7-4b4b-b22d-974556ae4da6","year":2002},"citing_paper":{"arxiv_id":"2510.10243","last_updated":"2026-04-26T08:59:57Z","snapshot_observed_at":"2026-08-02T09:06:29.854795Z","submitted_at":"2025-10-11T14:52:04Z","title":"Efficient Mining of Low-Utility Sequential Patterns","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-18T07:51:12.613329Z"},"links":{"citing_paper":"/paper/2510.10243"},"observation_digest":"sha256:43c5f26ef6a349681fed8edba6db43379884dd629359f1888bf2f6ad5e377a7b","observation_id":"bedd9cc3-1d91-48dd-b15d-1b2b5084e493","resolution":{"observed_at":"2026-05-18T07:52:30.275974Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fast vertical mining of sequential patterns using co-occurrence information","venue":null,"work_id":"cb4caae5-b062-449e-8358-f06d93fd5729","year":2014},"citing_paper":{"arxiv_id":"2510.10243","last_updated":"2026-04-26T08:59:57Z","snapshot_observed_at":"2026-08-02T09:06:29.854795Z","submitted_at":"2025-10-11T14:52:04Z","title":"Efficient Mining of Low-Utility Sequential Patterns","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-18T07:51:12.613329Z"},"links":{"citing_paper":"/paper/2510.10243"},"observation_digest":"sha256:6fd2c7a8f5d13ecd1a618395abad3a6faec384b7fcd3e7a60508279327126b6b","observation_id":"944c96d6-802a-4d47-855f-bf4bad874fe8","resolution":{"observed_at":"2026-05-18T07:52:30.191389Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"NetNCSP: Nonoverlapping closed sequential pattern mining","venue":null,"work_id":"da052c2b-009d-4da9-8e48-63f76b8f9ef4","year":2020},"citing_paper":{"arxiv_id":"2510.10243","last_updated":"2026-04-26T08:59:57Z","snapshot_observed_at":"2026-08-02T09:06:29.854795Z","submitted_at":"2025-10-11T14:52:04Z","title":"Efficient Mining of Low-Utility Sequential Patterns","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-18T07:51:12.613329Z"},"links":{"citing_paper":"/paper/2510.10243"},"observation_digest":"sha256:78dbc57ad21eca6f769f300613e92df661c4b2e70162f9ded4cccc70c8deec8d","observation_id":"bd15d915-c5ae-4aa0-82bc-c914e3ea44e9","resolution":{"observed_at":"2026-05-18T07:52:30.213042Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"CloFAST: Closed sequential pattern mining using sparse and vertical id-lists","venue":null,"work_id":"599bfa02-cf24-4832-a437-34ee06affad3","year":2016},"citing_paper":{"arxiv_id":"2510.10243","last_updated":"2026-04-26T08:59:57Z","snapshot_observed_at":"2026-08-02T09:06:29.854795Z","submitted_at":"2025-10-11T14:52:04Z","title":"Efficient Mining of Low-Utility Sequential Patterns","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-18T07:51:12.613329Z"},"links":{"citing_paper":"/paper/2510.10243"},"observation_digest":"sha256:75ea9c03781e604640841eb0ae38e01fe07ee9b52b32fdea8fa43e85dec3a57d","observation_id":"5e1d671a-c911-4bd0-bd59-fd92a3eeae0b","resolution":{"observed_at":"2026-05-18T07:52:30.198405Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"NetNMSP: Nonoverlapping maximal sequential pattern mining","venue":null,"work_id":"82421c68-4bd2-483f-80c0-5e043c3c7ed1","year":2022},"citing_paper":{"arxiv_id":"2510.10243","last_updated":"2026-04-26T08:59:57Z","snapshot_observed_at":"2026-08-02T09:06:29.854795Z","submitted_at":"2025-10-11T14:52:04Z","title":"Efficient Mining of Low-Utility Sequential Patterns","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-18T07:51:12.613329Z"},"links":{"citing_paper":"/paper/2510.10243"},"observation_digest":"sha256:c4a1b5792ab87f88a3e68e9bb6ce672b4da25f48d756d3ec07e918a44dca9d89","observation_id":"b44fc23d-200a-4ba4-a75d-bafbc970f3de","resolution":{"observed_at":"2026-05-18T07:52:30.279177Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Mining maximal sequential patterns without candidate maintenance","venue":null,"work_id":"3ee6e6c0-a03e-4d64-b5ef-f14a39760d62","year":2013},"citing_paper":{"arxiv_id":"2510.10243","last_updated":"2026-04-26T08:59:57Z","snapshot_observed_at":"2026-08-02T09:06:29.854795Z","submitted_at":"2025-10-11T14:52:04Z","title":"Efficient Mining of Low-Utility Sequential Patterns","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-18T07:51:12.613329Z"},"links":{"citing_paper":"/paper/2510.10243"},"observation_digest":"sha256:689b61cf2689cbb2c7cc4205931b7d7d4a9c6a1f4f03942ba1294265ecc56c09","observation_id":"da57fe64-bf90-40ef-b0cd-f4cd4964f813","resolution":{"observed_at":"2026-05-18T07:52:30.249788Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"SkOPUS: Mining top- k sequential patterns under leverage","venue":null,"work_id":"8a82d621-b1fa-48eb-8ab8-f3f835b34193","year":2016},"citing_paper":{"arxiv_id":"2510.10243","last_updated":"2026-04-26T08:59:57Z","snapshot_observed_at":"2026-08-02T09:06:29.854795Z","submitted_at":"2025-10-11T14:52:04Z","title":"Efficient Mining of Low-Utility Sequential Patterns","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-18T07:51:12.613329Z"},"links":{"citing_paper":"/paper/2510.10243"},"observation_digest":"sha256:a0d3a4b599ad9440a22054a857642e5f439ad87ae4473a01260456eef1ef7d83","observation_id":"28a3f8b5-f154-48ba-8276-1a5f4d461c05","resolution":{"observed_at":"2026-05-18T07:52:30.223555Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"TKS: efficient mining of top-k sequential patterns","venue":null,"work_id":"75b94fcd-7522-4323-afa1-ca0fa7a16ea2","year":2013},"citing_paper":{"arxiv_id":"2510.10243","last_updated":"2026-04-26T08:59:57Z","snapshot_observed_at":"2026-08-02T09:06:29.854795Z","submitted_at":"2025-10-11T14:52:04Z","title":"Efficient Mining of Low-Utility Sequential Patterns","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-18T07:51:12.613329Z"},"links":{"citing_paper":"/paper/2510.10243"},"observation_digest":"sha256:214d0c3c66528ff31462b8c0e4e70fb96e846774021eff67d4d2acb5b40709b3","observation_id":"1fe72984-395b-409d-b1c3-94970179dc4d","resolution":{"observed_at":"2026-05-18T07:52:30.202486Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Goal-oriented sequential pattern for network banking churn analysis","venue":null,"work_id":"55d047d6-3420-480b-8af1-e6aee2f46681","year":2003},"citing_paper":{"arxiv_id":"2510.10243","last_updated":"2026-04-26T08:59:57Z","snapshot_observed_at":"2026-08-02T09:06:29.854795Z","submitted_at":"2025-10-11T14:52:04Z","title":"Efficient Mining of Low-Utility Sequential Patterns","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-18T07:51:12.613329Z"},"links":{"citing_paper":"/paper/2510.10243"},"observation_digest":"sha256:09f3a0f0f446172f677e4f6889e5352e48ab923f89830df32adf0a68fe5055fc","observation_id":"ff20cd2d-810e-4658-b522-c46f119c6ba1","resolution":{"observed_at":"2026-05-18T07:52:30.206158Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Targeted mining of contiguous sequential patterns","venue":null,"work_id":"5a2a1d8a-9427-46f5-84de-5571555346a0","year":2024},"citing_paper":{"arxiv_id":"2510.10243","last_updated":"2026-04-26T08:59:57Z","snapshot_observed_at":"2026-08-02T09:06:29.854795Z","submitted_at":"2025-10-11T14:52:04Z","title":"Efficient Mining of Low-Utility Sequential Patterns","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-18T07:51:12.613329Z"},"links":{"citing_paper":"/paper/2510.10243"},"observation_digest":"sha256:9e91bb03f525d1ee9a68352dd7be531e5224c552f44f182dd03c5c64c79b08e7","observation_id":"0b054875-9790-4536-84f0-d869d1284696","resolution":{"observed_at":"2026-05-18T07:52:30.173206Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A survey of utility-oriented pattern mining","venue":null,"work_id":"896695b9-89d5-4842-94a6-b216c47ff07c","year":2021},"citing_paper":{"arxiv_id":"2510.10243","last_updated":"2026-04-26T08:59:57Z","snapshot_observed_at":"2026-08-02T09:06:29.854795Z","submitted_at":"2025-10-11T14:52:04Z","title":"Efficient Mining of Low-Utility Sequential Patterns","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-18T07:51:12.613329Z"},"links":{"citing_paper":"/paper/2510.10243"},"observation_digest":"sha256:d646bd4db627849a7166dba06481b43f13f5cc9ca706f7fda980b84d455db651","observation_id":"b6791823-d61f-4085-97aa-065048cc6f93","resolution":{"observed_at":"2026-05-18T07:52:30.169832Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On efficiently mining high utility sequential patterns","venue":null,"work_id":"a38267d7-1d62-4e1b-b947-0c70c2c488da","year":2016},"citing_paper":{"arxiv_id":"2510.10243","last_updated":"2026-04-26T08:59:57Z","snapshot_observed_at":"2026-08-02T09:06:29.854795Z","submitted_at":"2025-10-11T14:52:04Z","title":"Efficient Mining of Low-Utility Sequential Patterns","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-18T07:51:12.613329Z"},"links":{"citing_paper":"/paper/2510.10243"},"observation_digest":"sha256:4ba168760f7b4f877e077b27505a5c619df5f92dc671a22c3585eaa969ec6503","observation_id":"69190bf8-9bce-4093-96f0-e874a0334436","resolution":{"observed_at":"2026-05-18T07:52:30.288078Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fast utility mining on sequence data","venue":null,"work_id":"95ad4b69-e91c-45ed-a4ce-da346c59e7e1","year":2021},"citing_paper":{"arxiv_id":"2510.10243","last_updated":"2026-04-26T08:59:57Z","snapshot_observed_at":"2026-08-02T09:06:29.854795Z","submitted_at":"2025-10-11T14:52:04Z","title":"Efficient Mining of Low-Utility Sequential Patterns","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-18T07:51:12.613329Z"},"links":{"citing_paper":"/paper/2510.10243"},"observation_digest":"sha256:a63463d9a0ff8cab2d9ea4b9e5b6dc7849be499f95232908f1f61b17164d1b33","observation_id":"14f04d63-0c2c-47fe-bd1d-fee05724d668","resolution":{"observed_at":"2026-05-18T07:52:30.209622Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Efficiently mining top-k high utility sequential patterns","venue":null,"work_id":"91a0cc64-f83e-4fdb-a65a-dc3d2e014a4c","year":2013},"citing_paper":{"arxiv_id":"2510.10243","last_updated":"2026-04-26T08:59:57Z","snapshot_observed_at":"2026-08-02T09:06:29.854795Z","submitted_at":"2025-10-11T14:52:04Z","title":"Efficient Mining of Low-Utility Sequential Patterns","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-18T07:51:12.613329Z"},"links":{"citing_paper":"/paper/2510.10243"},"observation_digest":"sha256:2a53630dfe82cd62c7817bad49ce3098e30ea6c942c7b50ec1cddbd074a7ae9b","observation_id":"7dfcc395-74cb-43db-a732-46037224e350","resolution":{"observed_at":"2026-05-18T07:52:30.166441Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"LUIM: New low-utility itemset mining framework","venue":null,"work_id":"d60a1dd1-5171-4a01-b35f-ff4700de05de","year":2019},"citing_paper":{"arxiv_id":"2510.10243","last_updated":"2026-04-26T08:59:57Z","snapshot_observed_at":"2026-08-02T09:06:29.854795Z","submitted_at":"2025-10-11T14:52:04Z","title":"Efficient Mining of Low-Utility Sequential Patterns","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-18T07:51:12.613329Z"},"links":{"citing_paper":"/paper/2510.10243"},"observation_digest":"sha256:535f4359e43673e44506f88e27ced28f7fb60e31124e3606a6c30fb0f4597b46","observation_id":"49d9eb29-64f8-4eee-bd91-274989b74613","resolution":{"observed_at":"2026-05-18T07:52:30.229976Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Enabling knowledge discovery through low utility itemset mining","venue":null,"work_id":"f3bd0968-2079-44ab-bf60-7d817f7320de","year":2025},"citing_paper":{"arxiv_id":"2510.10243","last_updated":"2026-04-26T08:59:57Z","snapshot_observed_at":"2026-08-02T09:06:29.854795Z","submitted_at":"2025-10-11T14:52:04Z","title":"Efficient Mining of Low-Utility Sequential Patterns","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-18T07:51:12.613329Z"},"links":{"citing_paper":"/paper/2510.10243"},"observation_digest":"sha256:436a1e68937bccf3937cb3e71d1f575a85a26964d59c8939b9fd5766ff12e191","observation_id":"8db345df-a00a-4c57-acfd-1c7bec78fd16","resolution":{"observed_at":"2026-05-18T07:52:30.226672Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2510.10243","last_updated":"2026-04-26T08:59:57Z","latest_version":2,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-02T09:06:29.854795Z","submitted_at":"2025-10-11T14:52:04Z","title":"Efficient Mining of Low-Utility Sequential Patterns"},"reference_resolution":{"displayed":40,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":40},"total_outbound_references":40},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"thesis":"As of 4 August 2026, this Paper Citation Record lists 40 of 40 outbound references and 0 inbound Pith citation observations for arXiv:2510.10243."}