{"as_of":"2026-08-23T19:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d509b74202b476ea2e186569c0e958db4a030e9a9dcf8c11299bba5c25e60664","coverage":[{"denominator":17,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":17,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-12T04:15:22.153536Z","state":"measured"},{"denominator":17,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":17,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+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/2607.03188/citation-record","integrity":"/paper/2607.03188/integrity","json":"/paper/2607.03188/citation-record.json","paper":"/paper/2607.03188"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T04:15:22.153536Z","title":"Abedjan, L","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.03188","last_updated":"2026-07-03T10:47:11Z","snapshot_observed_at":"2026-08-13T05:20:50.880277Z","submitted_at":"2026-07-03T10:47:11Z","title":"Scalable Maximal Frequent Episode Mining with Desbordante","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-12T04:15:22.153536Z"},"links":{"citing_paper":"/paper/2607.03188"},"observation_digest":"sha256:5827b77acbdfdf5f551cf1ff8f531d72e6f3a4d2d4d61cfc97ecc58c1bec3f0a","observation_id":"765f5089-eb65-447c-b0f7-636f801dff31","resolution":{"observed_at":"2026-07-12T04:15:22.153536Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T04:15:22.153536Z","title":"Desbordante: from benchmarking suite to high- performance science-intensive data profiler,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.03188","last_updated":"2026-07-03T10:47:11Z","snapshot_observed_at":"2026-08-13T05:20:50.880277Z","submitted_at":"2026-07-03T10:47:11Z","title":"Scalable Maximal Frequent Episode Mining with Desbordante","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-12T04:15:22.153536Z"},"links":{"citing_paper":"/paper/2607.03188"},"observation_digest":"sha256:a1faeb735489bc3e2b1d3db0acad62977b333157cf1a071c0214078c8f72399f","observation_id":"88e32025-3b53-439a-8ead-d2bcc509a020","resolution":{"observed_at":"2026-07-12T04:15:22.153536Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1002/widm.1524","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A survey of episode mining,","venue":"Wiley Interdisciplinary Reviews Data Mining and Knowledge Discovery","work_id":"d64722bf-1944-49d7-8fe8-57494ebc364f","year":2024},"citing_paper":{"arxiv_id":"2607.03188","last_updated":"2026-07-03T10:47:11Z","snapshot_observed_at":"2026-08-13T05:20:50.880277Z","submitted_at":"2026-07-03T10:47:11Z","title":"Scalable Maximal Frequent Episode Mining with Desbordante","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-12T04:15:22.153536Z"},"links":{"citing_paper":"/paper/2607.03188"},"observation_digest":"sha256:1241faf1323b9ad4bba020ca8e3840e61ffe1a82e1e8863c55c1955521acbff0","observation_id":"a25b9fa1-d768-4ca7-8e97-5a0668cd869d","resolution":{"observed_at":"2026-07-12T04:18:28.946021Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-07-13T20:19:57.956282+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T20:19:57.956282+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1023/a:1009748302351","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Discovery of frequent episodes in event sequences,","venue":"Data Mining and Knowledge Discovery","work_id":"e45c047e-d92e-4dcc-bce5-5d96e7a77269","year":1997},"citing_paper":{"arxiv_id":"2607.03188","last_updated":"2026-07-03T10:47:11Z","snapshot_observed_at":"2026-08-13T05:20:50.880277Z","submitted_at":"2026-07-03T10:47:11Z","title":"Scalable Maximal Frequent Episode Mining with Desbordante","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-12T04:15:22.153536Z"},"links":{"citing_paper":"/paper/2607.03188"},"observation_digest":"sha256:983a90e3aa295877834dbe2275efce47c22ee07ad1941900293bc8f873f527e6","observation_id":"176f9de9-6f55-45a1-a1cf-2553108b369b","resolution":{"observed_at":"2026-07-12T04:18:28.950151Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-07-13T20:19:58.20187+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T20:19:58.20187+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T04:15:22.153536Z","title":"Discovering generalized episodes using minimal occurrences,","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2607.03188","last_updated":"2026-07-03T10:47:11Z","snapshot_observed_at":"2026-08-13T05:20:50.880277Z","submitted_at":"2026-07-03T10:47:11Z","title":"Scalable Maximal Frequent Episode Mining with Desbordante","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-12T04:15:22.153536Z"},"links":{"citing_paper":"/paper/2607.03188"},"observation_digest":"sha256:3d7ed1171ef1cbb967c3e40b143cebc357d1c91e8b24b6c8c4d528d97a64c6e4","observation_id":"c3269ace-b87d-4c68-9466-ccded33f67ac","resolution":{"observed_at":"2026-07-12T04:15:22.153536Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T04:15:22.153536Z","title":"Maxfem: Mining maximal frequent episodes in complex event sequences,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.03188","last_updated":"2026-07-03T10:47:11Z","snapshot_observed_at":"2026-08-13T05:20:50.880277Z","submitted_at":"2026-07-03T10:47:11Z","title":"Scalable Maximal Frequent Episode Mining with Desbordante","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-12T04:15:22.153536Z"},"links":{"citing_paper":"/paper/2607.03188"},"observation_digest":"sha256:3f4ee124eb3677b85826ac855491480e3fb9fdb4a9bdab933306e241874ce102","observation_id":"f41b1c05-d93d-4ac5-8e1c-709cd0dc92a9","resolution":{"observed_at":"2026-07-12T04:15:22.153536Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T04:15:22.153536Z","title":"The spmf open-source data mining library ver- sion 2,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.03188","last_updated":"2026-07-03T10:47:11Z","snapshot_observed_at":"2026-08-13T05:20:50.880277Z","submitted_at":"2026-07-03T10:47:11Z","title":"Scalable Maximal Frequent Episode Mining with Desbordante","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-12T04:15:22.153536Z"},"links":{"citing_paper":"/paper/2607.03188"},"observation_digest":"sha256:d25dc9a6865c1833b3fdfb18f29735a00fd3e95a0386263e830a8a75d16b80f4","observation_id":"07f8ff12-b98e-4429-9de7-11ae2c1706ee","resolution":{"observed_at":"2026-07-12T04:15:22.153536Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T04:15:22.153536Z","title":"Lightning fast matching dependency discovery with desbordante,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.03188","last_updated":"2026-07-03T10:47:11Z","snapshot_observed_at":"2026-08-13T05:20:50.880277Z","submitted_at":"2026-07-03T10:47:11Z","title":"Scalable Maximal Frequent Episode Mining with Desbordante","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-12T04:15:22.153536Z"},"links":{"citing_paper":"/paper/2607.03188"},"observation_digest":"sha256:7f183b56d576a344bedb6f504e0109ac807163920f4dbb0b5626164c940999ea","observation_id":"fa4a790b-7e47-4b1b-9286-97b2244d48d3","resolution":{"observed_at":"2026-07-12T04:15:22.153536Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T04:15:22.153536Z","title":"Fast discovery of inclusion dependencies with desbordante,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.03188","last_updated":"2026-07-03T10:47:11Z","snapshot_observed_at":"2026-08-13T05:20:50.880277Z","submitted_at":"2026-07-03T10:47:11Z","title":"Scalable Maximal Frequent Episode Mining with Desbordante","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-12T04:15:22.153536Z"},"links":{"citing_paper":"/paper/2607.03188"},"observation_digest":"sha256:f8889317c3bc5d50b9d48ce1b5671cd8e9145aa415e977c24e29cdace69091ea","observation_id":"a72bb538-1322-443b-af30-012fd2c9fbf7","resolution":{"observed_at":"2026-07-12T04:15:22.153536Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T04:15:22.153536Z","title":"Order in desbordante: Techniques for efficient imple- mentation of order dependency discovery algorithms,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.03188","last_updated":"2026-07-03T10:47:11Z","snapshot_observed_at":"2026-08-13T05:20:50.880277Z","submitted_at":"2026-07-03T10:47:11Z","title":"Scalable Maximal Frequent Episode Mining with Desbordante","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-12T04:15:22.153536Z"},"links":{"citing_paper":"/paper/2607.03188"},"observation_digest":"sha256:7c786111620b03379eed930dc4043f1ca3ca94e5f1c1b27f4a529a4e1331cbeb","observation_id":"cc78f462-ea98-4f36-b228-255ad8786fbe","resolution":{"observed_at":"2026-07-12T04:15:22.153536Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T04:15:22.153536Z","title":"Des- bordante: a framework for exploring limits of dependency discovery algorithms,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.03188","last_updated":"2026-07-03T10:47:11Z","snapshot_observed_at":"2026-08-13T05:20:50.880277Z","submitted_at":"2026-07-03T10:47:11Z","title":"Scalable Maximal Frequent Episode Mining with Desbordante","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-12T04:15:22.153536Z"},"links":{"citing_paper":"/paper/2607.03188"},"observation_digest":"sha256:f26ab7a745fd23b6567266d4c4a3c5120d236d89264a99de5320dc111044cb2b","observation_id":"1bc7568f-0662-4ae5-8af0-5e171a884a12","resolution":{"observed_at":"2026-07-12T04:15:22.153536Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T04:15:22.153536Z","title":"Efficient mining of frequent episodes from complex sequences,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03188","last_updated":"2026-07-03T10:47:11Z","snapshot_observed_at":"2026-08-13T05:20:50.880277Z","submitted_at":"2026-07-03T10:47:11Z","title":"Scalable Maximal Frequent Episode Mining with Desbordante","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-12T04:15:22.153536Z"},"links":{"citing_paper":"/paper/2607.03188"},"observation_digest":"sha256:ea6b0dddc9c7cc54a9a063c1179a8b6cc1853247d9479218136ce5427ea73746","observation_id":"9f6f4487-1578-4923-b668-13a74c4ea1a5","resolution":{"observed_at":"2026-07-12T04:15:22.153536Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.is.2007.07.003","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Available: https://doi.org/10.1016/j.is.2007.07.003","venue":"Information Systems","work_id":"f85495e8-43ca-479f-90bb-db83636236bf","year":2007},"citing_paper":{"arxiv_id":"2607.03188","last_updated":"2026-07-03T10:47:11Z","snapshot_observed_at":"2026-08-13T05:20:50.880277Z","submitted_at":"2026-07-03T10:47:11Z","title":"Scalable Maximal Frequent Episode Mining with Desbordante","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-12T04:15:22.153536Z"},"links":{"citing_paper":"/paper/2607.03188"},"observation_digest":"sha256:67cad029f7797e67496e49efea7ab2124c8beaa70ab016cfd77547102fd5e994","observation_id":"0fe17f98-14a5-498c-be3f-faeca9691dcc","resolution":{"observed_at":"2026-07-12T04:18:28.934033Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-07-13T20:19:58.46186+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T20:19:58.46186+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3326163","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Large-scale frequent episode mining from complex event sequences with hierarchies,","venue":"ACM Transactions on Intelligent Systems and Technology","work_id":"cb0d39d1-deae-4e58-9f1c-732a937c467d","year":2019},"citing_paper":{"arxiv_id":"2607.03188","last_updated":"2026-07-03T10:47:11Z","snapshot_observed_at":"2026-08-13T05:20:50.880277Z","submitted_at":"2026-07-03T10:47:11Z","title":"Scalable Maximal Frequent Episode Mining with Desbordante","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-12T04:15:22.153536Z"},"links":{"citing_paper":"/paper/2607.03188"},"observation_digest":"sha256:f2a07ca4b87d7a94373179d8b3d88b5efd2413f86e4b7dda4e67c0f696a6c458","observation_id":"e95c7af4-8a6c-4aca-b386-73781bfcacd7","resolution":{"observed_at":"2026-07-12T04:18:28.929388Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-07-13T20:19:58.761946+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T20:19:58.761946+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T04:15:22.153536Z","title":"Mcor-miner: Maximal co-occurrence nonoverlapping sequential rule mining,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03188","last_updated":"2026-07-03T10:47:11Z","snapshot_observed_at":"2026-08-13T05:20:50.880277Z","submitted_at":"2026-07-03T10:47:11Z","title":"Scalable Maximal Frequent Episode Mining with Desbordante","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-12T04:15:22.153536Z"},"links":{"citing_paper":"/paper/2607.03188"},"observation_digest":"sha256:83321f38f274e130f1cd29290bba59bd36954f0e44f10e7afa49eaeb64a78ed9","observation_id":"b917082a-4944-4cb7-b8c1-24a30fedc41b","resolution":{"observed_at":"2026-07-12T04:15:22.153536Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2023.324121","doi":"10.1109/tkde.2023.3241213","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Available: https://doi.org/10.1109/TKDE.2023.3241213","venue":"IEEE Transactions on Knowledge and Data Engineering","work_id":"c127ccc9-3912-4b5f-9858-b8200e79503c","year":2023},"citing_paper":{"arxiv_id":"2607.03188","last_updated":"2026-07-03T10:47:11Z","snapshot_observed_at":"2026-08-13T05:20:50.880277Z","submitted_at":"2026-07-03T10:47:11Z","title":"Scalable Maximal Frequent Episode Mining with Desbordante","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-12T04:15:22.153536Z"},"links":{"citing_paper":"/paper/2607.03188"},"observation_digest":"sha256:7f748b0b50d8411518b92f269af46ed3c8f635a52b911630342781ab7e860366","observation_id":"096b19f1-7b2e-4da7-8576-fe03af7959b1","resolution":{"observed_at":"2026-07-12T04:18:28.941254Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-07-13T20:19:59.008021+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T20:19:59.008021+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T04:15:22.153536Z","title":"Mining high average utility itemsets using artificial fish swarm algorithm with computed multiple minimum average utility thresholds,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.03188","last_updated":"2026-07-03T10:47:11Z","snapshot_observed_at":"2026-08-13T05:20:50.880277Z","submitted_at":"2026-07-03T10:47:11Z","title":"Scalable Maximal Frequent Episode Mining with Desbordante","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-12T04:15:22.153536Z"},"links":{"citing_paper":"/paper/2607.03188"},"observation_digest":"sha256:ef2010c30c7ba51ae300ccc26eb091504abcfc09f1eafb61763efe7967280ed9","observation_id":"31190807-c10c-4325-b3cf-95716d84e118","resolution":{"observed_at":"2026-07-12T04:15:22.153536Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.03188","last_updated":"2026-07-03T10:47:11Z","latest_version":1,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-13T05:20:50.880277Z","submitted_at":"2026-07-03T10:47:11Z","title":"Scalable Maximal Frequent Episode Mining with Desbordante"},"reference_resolution":{"displayed":17,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":11,"verified_exact":5,"verified_fuzzy":0},"total_outbound_references":17},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 17 of 17 outbound references and 0 inbound Pith citation observations for arXiv:2607.03188."}