{"as_of":"2026-08-20T23:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:513a49c3eab549e0eb8f7946bb6a9dcebb7f37f7b274df87de9973befe779e4b","coverage":[{"denominator":43,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":43,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T11:39:59.918615Z","state":"measured"},{"denominator":43,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":43,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+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/1908.08654/citation-record","integrity":"/paper/1908.08654/integrity","json":"/paper/1908.08654/citation-record.json","paper":"/paper/1908.08654"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:00.527173Z","title":"An inte- gration framework for sensor networks and data stream management systems","venue":null,"work_id":"e86cf77c-55db-4c85-a1e4-dfe2b653d41f","year":2004},"citing_paper":{"arxiv_id":"1908.08654","last_updated":"2019-08-23T03:39:14Z","snapshot_observed_at":"2026-08-18T03:06:11.011643Z","submitted_at":"2019-08-23T03:39:14Z","title":"Efficient Join Processing Over Incomplete Data Streams (Technical Report)","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T11:39:59.731556Z"},"links":{"citing_paper":"/paper/1908.08654"},"observation_digest":"sha256:396607a63011d178e86ad19674bd5b7763048f1d2bbd42202fa4b278af151563","observation_id":"07da21a7-43f9-40b4-adde-bf80a64a1d1d","resolution":{"observed_at":"2026-08-14T11:40:00.531662Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T11:40:00.514215Z","title":"Efficient approximation of correlated sums on data streams","venue":null,"work_id":"65f2d13f-ccde-4624-8955-31832416741f","year":2003},"citing_paper":{"arxiv_id":"1908.08654","last_updated":"2019-08-23T03:39:14Z","snapshot_observed_at":"2026-08-18T03:06:11.011643Z","submitted_at":"2019-08-23T03:39:14Z","title":"Efficient Join Processing Over Incomplete Data Streams (Technical Report)","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T11:39:59.737040Z"},"links":{"citing_paper":"/paper/1908.08654"},"observation_digest":"sha256:3b9fa7782022bd2f24c40f23a3c91ce8c95463e93293c204000674f2dbad1c21","observation_id":"397b7f57-689d-4b10-800e-ddd4457f43b2","resolution":{"observed_at":"2026-08-14T11:40:00.518295Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T11:40:00.502216Z","title":"The r*-tree: an efficient and robust access method for points and rectangles","venue":null,"work_id":"dfd94c54-b20a-4fbf-b349-7b6746fc4681","year":1990},"citing_paper":{"arxiv_id":"1908.08654","last_updated":"2019-08-23T03:39:14Z","snapshot_observed_at":"2026-08-18T03:06:11.011643Z","submitted_at":"2019-08-23T03:39:14Z","title":"Efficient Join Processing Over Incomplete Data Streams (Technical Report)","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T11:39:59.742285Z"},"links":{"citing_paper":"/paper/1908.08654"},"observation_digest":"sha256:86b2940bc03a1e7bb32bc25d04d8215bd92fa77e64e4b217a5af33fedd0057e0","observation_id":"28f3147a-b614-4d79-936d-0ed6a1204dec","resolution":{"observed_at":"2026-08-14T11:40:00.506184Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T11:40:00.489455Z","title":"Self-spacial join selectivity estimation using fractal concepts","venue":null,"work_id":"6fd231a8-7dea-489c-a266-fcfb082c881e","year":1998},"citing_paper":{"arxiv_id":"1908.08654","last_updated":"2019-08-23T03:39:14Z","snapshot_observed_at":"2026-08-18T03:06:11.011643Z","submitted_at":"2019-08-23T03:39:14Z","title":"Efficient Join Processing Over Incomplete Data Streams (Technical Report)","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T11:39:59.746504Z"},"links":{"citing_paper":"/paper/1908.08654"},"observation_digest":"sha256:8b47f5a5f39dc9fe2429013e0e6696bb4b46e736ac790d28d574e5c2fdb4374c","observation_id":"a67a08d8-0b55-493b-b54b-fa7bce4b69cf","resolution":{"observed_at":"2026-08-14T11:40:00.494278Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T11:40:00.477330Z","title":"Epsilon grid order: An algorithm for the similarity join on massive high- dimensional data","venue":null,"work_id":"bc347c28-5678-4434-9c0c-4be08689ca95","year":2001},"citing_paper":{"arxiv_id":"1908.08654","last_updated":"2019-08-23T03:39:14Z","snapshot_observed_at":"2026-08-18T03:06:11.011643Z","submitted_at":"2019-08-23T03:39:14Z","title":"Efficient Join Processing Over Incomplete Data Streams (Technical Report)","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T11:39:59.751155Z"},"links":{"citing_paper":"/paper/1908.08654"},"observation_digest":"sha256:7a51e9fd9d1bf15a40caaf391938ae828888746971e70c2cffd95504389fa494","observation_id":"78dc6c6f-010c-40df-82c0-98bd220f8a31","resolution":{"observed_at":"2026-08-14T11:40:00.481253Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T11:40:00.464025Z","title":"Efficiently process- ing continuous k-nn queries on data streams","venue":null,"work_id":"78b0b6d2-d95f-43cf-9dbd-6c022212ff27","year":2007},"citing_paper":{"arxiv_id":"1908.08654","last_updated":"2019-08-23T03:39:14Z","snapshot_observed_at":"2026-08-18T03:06:11.011643Z","submitted_at":"2019-08-23T03:39:14Z","title":"Efficient Join Processing Over Incomplete Data Streams (Technical Report)","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T11:39:59.756003Z"},"links":{"citing_paper":"/paper/1908.08654"},"observation_digest":"sha256:3ede6fd6e60dc1dc009f10e30dde563332a85f2d12e4f319aa7f25d924d0fa1f","observation_id":"6ab3bdc5-7a77-409d-9d7c-5b1c7bf7f1e4","resolution":{"observed_at":"2026-08-14T11:40:00.468070Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T11:40:00.451971Z","title":"The skyline operator","venue":null,"work_id":"2578c687-fc03-46c6-bba2-6868f419dac3","year":2001},"citing_paper":{"arxiv_id":"1908.08654","last_updated":"2019-08-23T03:39:14Z","snapshot_observed_at":"2026-08-18T03:06:11.011643Z","submitted_at":"2019-08-23T03:39:14Z","title":"Efficient Join Processing Over Incomplete Data Streams (Technical Report)","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T11:39:59.760996Z"},"links":{"citing_paper":"/paper/1908.08654"},"observation_digest":"sha256:4874948aa631a13909132dd9746e1de5ac8e64ca3d9b17d27d3a2f7041bcf1c1","observation_id":"bff62ae1-064f-4f04-81c1-26f44428a0d6","resolution":{"observed_at":"2026-08-14T11:40:00.456015Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T11:40:00.439394Z","title":"Apache flink: Stream and batch processing in a single engine","venue":null,"work_id":"737ad969-6301-4bcc-9b69-c77d35023db1","year":2015},"citing_paper":{"arxiv_id":"1908.08654","last_updated":"2019-08-23T03:39:14Z","snapshot_observed_at":"2026-08-18T03:06:11.011643Z","submitted_at":"2019-08-23T03:39:14Z","title":"Efficient Join Processing Over Incomplete Data Streams (Technical Report)","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T11:39:59.765395Z"},"links":{"citing_paper":"/paper/1908.08654"},"observation_digest":"sha256:2824c76cb5b0e2663b8db8a924b34d097ed9c43c0c31408df6198b6f8e42b226","observation_id":"e88d5226-c806-4aae-a710-8ccffea53944","resolution":{"observed_at":"2026-08-14T11:40:00.443455Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T11:40:00.426096Z","title":"Efficient query evaluation on probabilistic databases","venue":null,"work_id":"5d036b1d-6261-4002-a404-fefd3a2374d8","year":2007},"citing_paper":{"arxiv_id":"1908.08654","last_updated":"2019-08-23T03:39:14Z","snapshot_observed_at":"2026-08-18T03:06:11.011643Z","submitted_at":"2019-08-23T03:39:14Z","title":"Efficient Join Processing Over Incomplete Data Streams (Technical Report)","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T11:39:59.770095Z"},"links":{"citing_paper":"/paper/1908.08654"},"observation_digest":"sha256:a508bf9811c06616fe7e333489b05440cc98d95193525ca59ce74c7f876ef535","observation_id":"3ec28c24-a690-489e-b3ea-980201640adc","resolution":{"observed_at":"2026-08-14T11:40:00.430412Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T11:40:00.414621Z","title":"Approximate join pro- cessing over data streams","venue":null,"work_id":"4e88d064-ce88-4ffb-bef9-7562ea58f58b","year":2003},"citing_paper":{"arxiv_id":"1908.08654","last_updated":"2019-08-23T03:39:14Z","snapshot_observed_at":"2026-08-18T03:06:11.011643Z","submitted_at":"2019-08-23T03:39:14Z","title":"Efficient Join Processing Over Incomplete Data Streams (Technical Report)","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T11:39:59.773894Z"},"links":{"citing_paper":"/paper/1908.08654"},"observation_digest":"sha256:24a2ce19cd55b5e89ae0313d1a028a332ac26d0fb1198ab1bfbcfe749ec4fe40","observation_id":"8d36d814-aebe-4277-9894-49c0dbe2fd0b","resolution":{"observed_at":"2026-08-14T11:40:00.418528Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T11:40:00.402294Z","title":"A study on nsl-kdd dataset for intrusion detection system based on classification algorithms","venue":null,"work_id":"f48946dd-676e-4dd8-90ba-ab6fd997329a","year":2015},"citing_paper":{"arxiv_id":"1908.08654","last_updated":"2019-08-23T03:39:14Z","snapshot_observed_at":"2026-08-18T03:06:11.011643Z","submitted_at":"2019-08-23T03:39:14Z","title":"Efficient Join Processing Over Incomplete Data Streams (Technical Report)","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T11:39:59.777654Z"},"links":{"citing_paper":"/paper/1908.08654"},"observation_digest":"sha256:7834fb543264a4ca16c19611319468d40c42437682cac81c6a18726325815a38","observation_id":"f665aa0f-9cfa-4b8d-b50e-bb35017ad00a","resolution":{"observed_at":"2026-08-14T11:40:00.406773Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T11:40:00.388001Z","title":"The X-tree: An index structure for high-dimensional data","venue":null,"work_id":"3b6d5885-13d9-4607-af2e-ad204899e1fc","year":1996},"citing_paper":{"arxiv_id":"1908.08654","last_updated":"2019-08-23T03:39:14Z","snapshot_observed_at":"2026-08-18T03:06:11.011643Z","submitted_at":"2019-08-23T03:39:14Z","title":"Efficient Join Processing Over Incomplete Data Streams (Technical Report)","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T11:39:59.781424Z"},"links":{"citing_paper":"/paper/1908.08654"},"observation_digest":"sha256:a507168a87607e4a13ca388820427c2d63378b720c75e019a0909e0f821c3703","observation_id":"a3fa5c18-b441-4d21-bf0f-eed8e182f021","resolution":{"observed_at":"2026-08-14T11:40:00.393465Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T11:40:00.375720Z","title":"Towards certain fixes with editing rules and master data","venue":null,"work_id":"ea235def-a27c-45e5-b36e-3f0706359d75","year":2010},"citing_paper":{"arxiv_id":"1908.08654","last_updated":"2019-08-23T03:39:14Z","snapshot_observed_at":"2026-08-18T03:06:11.011643Z","submitted_at":"2019-08-23T03:39:14Z","title":"Efficient Join Processing Over Incomplete Data Streams (Technical Report)","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T11:39:59.785325Z"},"links":{"citing_paper":"/paper/1908.08654"},"observation_digest":"sha256:7ba5a65525235aa5207d99386e340f9c9efa40e59a411a745d2483168e683ac1","observation_id":"e2d88005-8333-4690-ac9e-23a0ed25cc69","resolution":{"observed_at":"2026-08-14T11:40:00.379971Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T11:40:00.363495Z","title":"Net-fli: on-the-fly compression, archiving and indexing of streaming network traffic","venue":null,"work_id":"c805bd68-516f-463a-91c0-c7bcbc8bbf5e","year":2010},"citing_paper":{"arxiv_id":"1908.08654","last_updated":"2019-08-23T03:39:14Z","snapshot_observed_at":"2026-08-18T03:06:11.011643Z","submitted_at":"2019-08-23T03:39:14Z","title":"Efficient Join Processing Over Incomplete Data Streams (Technical Report)","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T11:39:59.789403Z"},"links":{"citing_paper":"/paper/1908.08654"},"observation_digest":"sha256:2278220aab00c5b46244fa3317b74a839ea5a67e7d03b6d20f477a04870327da","observation_id":"5bb48376-6287-47bb-a343-a95c2547ff09","resolution":{"observed_at":"2026-08-14T11:40:00.367590Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T11:40:00.351406Z","title":"Sjoin: A semantic join operator to integrate heterogeneous rdf graphs","venue":null,"work_id":"88c30cb8-292f-4491-8dea-03798f0ce177","year":2017},"citing_paper":{"arxiv_id":"1908.08654","last_updated":"2019-08-23T03:39:14Z","snapshot_observed_at":"2026-08-18T03:06:11.011643Z","submitted_at":"2019-08-23T03:39:14Z","title":"Efficient Join Processing Over Incomplete Data Streams (Technical Report)","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T11:39:59.793630Z"},"links":{"citing_paper":"/paper/1908.08654"},"observation_digest":"sha256:8266c2ed359d0f59fa09e475b49fcf44b8ffe92e214203bd363fa8e8ed863956","observation_id":"b65e0823-733e-4e1d-bd2a-7e5083b878e9","resolution":{"observed_at":"2026-08-14T11:40:00.355600Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T11:40:00.338642Z","title":"Explicit information for category-orthogonal object properties increases along the ventral stream","venue":null,"work_id":"29e5b833-31f1-437b-9d4a-8a28cd6f75b2","year":2016},"citing_paper":{"arxiv_id":"1908.08654","last_updated":"2019-08-23T03:39:14Z","snapshot_observed_at":"2026-08-18T03:06:11.011643Z","submitted_at":"2019-08-23T03:39:14Z","title":"Efficient Join Processing Over Incomplete Data Streams (Technical Report)","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T11:39:59.797894Z"},"links":{"citing_paper":"/paper/1908.08654"},"observation_digest":"sha256:83552f77a88c9c9f9baf4f1dca601fbe0aa42fb5cfe5b6443ec8b25bee5f276a","observation_id":"ec13a5be-0cc2-4000-9798-184f268ffaa6","resolution":{"observed_at":"2026-08-14T11:40:00.343183Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T11:40:00.324526Z","title":"Discovering geographical topics in the twitter stream","venue":null,"work_id":"393415c0-b085-4c13-843e-1c02e646d6b9","year":2012},"citing_paper":{"arxiv_id":"1908.08654","last_updated":"2019-08-23T03:39:14Z","snapshot_observed_at":"2026-08-18T03:06:11.011643Z","submitted_at":"2019-08-23T03:39:14Z","title":"Efficient Join Processing Over Incomplete Data Streams (Technical Report)","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T11:39:59.802225Z"},"links":{"citing_paper":"/paper/1908.08654"},"observation_digest":"sha256:8d9406e74c070a1173e830355131c706d63b8f2c6baa49ec6f4cffbec4449bab","observation_id":"cb39993f-acbc-4d53-af64-2c41ee74083b","resolution":{"observed_at":"2026-08-14T11:40:00.330135Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T11:40:00.311996Z","title":"Fully online clustering of evolving data streams into arbitrarily shaped clusters","venue":null,"work_id":"371b2847-cc01-485e-8583-8c6e689dfa29","year":2017},"citing_paper":{"arxiv_id":"1908.08654","last_updated":"2019-08-23T03:39:14Z","snapshot_observed_at":"2026-08-18T03:06:11.011643Z","submitted_at":"2019-08-23T03:39:14Z","title":"Efficient Join Processing Over Incomplete Data Streams (Technical Report)","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T11:39:59.805903Z"},"links":{"citing_paper":"/paper/1908.08654"},"observation_digest":"sha256:1d8ae81df32ce3676b4e8149876675b7ecc2af4f3a76950dbac484639034dca1","observation_id":"edf1d67c-4f6f-4513-9fa0-ece475f59195","resolution":{"observed_at":"2026-08-14T11:40:00.316229Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T11:40:00.299270Z","title":"Efficient similarity join and search on multi-attribute data","venue":null,"work_id":"dcbcd368-a87e-4ca0-8eaf-d02e53b2789c","year":2015},"citing_paper":{"arxiv_id":"1908.08654","last_updated":"2019-08-23T03:39:14Z","snapshot_observed_at":"2026-08-18T03:06:11.011643Z","submitted_at":"2019-08-23T03:39:14Z","title":"Efficient Join Processing Over Incomplete Data Streams (Technical Report)","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T11:39:59.809621Z"},"links":{"citing_paper":"/paper/1908.08654"},"observation_digest":"sha256:f561482a8613f3d3525cb41d86eeb0cc22ced2e2e5fcd83f2388b72f6f949ccd","observation_id":"9e5e1f19-a9dd-42ff-95ef-12493f104287","resolution":{"observed_at":"2026-08-14T11:40:00.303592Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T11:40:00.286334Z","title":"Efficient similarity join over multiple stream time series","venue":null,"work_id":"26decc1f-8bc2-4171-8059-a0740e82b65c","year":2009},"citing_paper":{"arxiv_id":"1908.08654","last_updated":"2019-08-23T03:39:14Z","snapshot_observed_at":"2026-08-18T03:06:11.011643Z","submitted_at":"2019-08-23T03:39:14Z","title":"Efficient Join Processing Over Incomplete Data Streams (Technical Report)","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T11:39:59.813910Z"},"links":{"citing_paper":"/paper/1908.08654"},"observation_digest":"sha256:44b063a81870e62aa06ad0160d8c754c40903dde574e8cddda8fecdff229372b","observation_id":"14455443-7fcd-4992-a254-7fa0e2edc39a","resolution":{"observed_at":"2026-08-14T11:40:00.290554Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T11:40:00.274390Z","title":"Similarity join processing on uncertain data streams","venue":null,"work_id":"6085058e-7e64-41b2-adc3-7bc86319b63d","year":2010},"citing_paper":{"arxiv_id":"1908.08654","last_updated":"2019-08-23T03:39:14Z","snapshot_observed_at":"2026-08-18T03:06:11.011643Z","submitted_at":"2019-08-23T03:39:14Z","title":"Efficient Join Processing Over Incomplete Data Streams (Technical Report)","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T11:39:59.817789Z"},"links":{"citing_paper":"/paper/1908.08654"},"observation_digest":"sha256:876bedb44fc3f2661f10c8867cf3b722012e3641739244f5e5e3e3dba7e2d251","observation_id":"3d7e25c0-deae-4e14-8869-342752ce0d55","resolution":{"observed_at":"2026-08-14T11:40:00.278464Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T11:40:00.262758Z","title":"Scalable distributed stream join processing","venue":null,"work_id":"fb3d0292-2b08-436c-b681-c91b71de76e8","year":2015},"citing_paper":{"arxiv_id":"1908.08654","last_updated":"2019-08-23T03:39:14Z","snapshot_observed_at":"2026-08-18T03:06:11.011643Z","submitted_at":"2019-08-23T03:39:14Z","title":"Efficient Join Processing Over Incomplete Data Streams (Technical Report)","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T11:39:59.821906Z"},"links":{"citing_paper":"/paper/1908.08654"},"observation_digest":"sha256:5807aac4807745cc07de92420b3c4259b2554ceceba5523468fddc58e0c82b54","observation_id":"77640c59-b39b-4067-9a92-68f3cfdea68a","resolution":{"observed_at":"2026-08-14T11:40:00.266757Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T11:40:00.251221Z","title":"A novel approach for high- dimensional vector similarity join query","venue":null,"work_id":"1deba0e6-a936-46d6-a8df-73d4c6682693","year":2017},"citing_paper":{"arxiv_id":"1908.08654","last_updated":"2019-08-23T03:39:14Z","snapshot_observed_at":"2026-08-18T03:06:11.011643Z","submitted_at":"2019-08-23T03:39:14Z","title":"Efficient Join Processing Over Incomplete Data Streams (Technical Report)","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T11:39:59.826397Z"},"links":{"citing_paper":"/paper/1908.08654"},"observation_digest":"sha256:a992f47986c1dc3586c0164e54b4311ec6e83c93588fa3ab6b4a84f5ebb14a8e","observation_id":"81a1c183-dc0f-4501-ac24-621c47edd02b","resolution":{"observed_at":"2026-08-14T11:40:00.255183Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T11:40:00.239153Z","title":"Eracer: a database approach for statistical inference and data cleaning","venue":null,"work_id":"d9c06e68-162d-42c6-ac8c-ca991c27e10e","year":2010},"citing_paper":{"arxiv_id":"1908.08654","last_updated":"2019-08-23T03:39:14Z","snapshot_observed_at":"2026-08-18T03:06:11.011643Z","submitted_at":"2019-08-23T03:39:14Z","title":"Efficient Join Processing Over Incomplete Data Streams (Technical Report)","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T11:39:59.831246Z"},"links":{"citing_paper":"/paper/1908.08654"},"observation_digest":"sha256:f349b418dc3cf0bd314a2a486bbda272808b7792cff21d4e0f1dd6c194fcc418","observation_id":"80db3384-8839-445e-a71f-c198c7afb8e7","resolution":{"observed_at":"2026-08-14T11:40:00.243058Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T11:40:00.226755Z","title":"Join processing in relational databases","venue":null,"work_id":"40476416-69eb-4a2e-8c28-36dfc837f200","year":1992},"citing_paper":{"arxiv_id":"1908.08654","last_updated":"2019-08-23T03:39:14Z","snapshot_observed_at":"2026-08-18T03:06:11.011643Z","submitted_at":"2019-08-23T03:39:14Z","title":"Efficient Join Processing Over Incomplete Data Streams (Technical Report)","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T11:39:59.835343Z"},"links":{"citing_paper":"/paper/1908.08654"},"observation_digest":"sha256:26cd2ca60a71402e3a43e2e7aac839ac73c2978ae10673fe0f311f553a989107","observation_id":"5aebc221-845a-4f85-8f89-bdb30b3dca6c","resolution":{"observed_at":"2026-08-14T11:40:00.231223Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T11:40:00.214160Z","title":"Continuous moni- toring of top-k queries over sliding windows","venue":null,"work_id":"0b1244c2-5454-4cae-80de-a8fe656639ac","year":2006},"citing_paper":{"arxiv_id":"1908.08654","last_updated":"2019-08-23T03:39:14Z","snapshot_observed_at":"2026-08-18T03:06:11.011643Z","submitted_at":"2019-08-23T03:39:14Z","title":"Efficient Join Processing Over Incomplete Data Streams (Technical Report)","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T11:39:59.840654Z"},"links":{"citing_paper":"/paper/1908.08654"},"observation_digest":"sha256:286d01d7f68737de734038f30f446b230ca169c4c3f07cef9ab8d74370d34d4a","observation_id":"43bcf8b4-bece-47df-961b-2d26070cbbbd","resolution":{"observed_at":"2026-08-14T11:40:00.218435Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T11:40:00.201422Z","title":"Complete event trend detection in high-rate event streams","venue":null,"work_id":"a08afeee-d2c7-48f1-a19d-35173a8e6135","year":2017},"citing_paper":{"arxiv_id":"1908.08654","last_updated":"2019-08-23T03:39:14Z","snapshot_observed_at":"2026-08-18T03:06:11.011643Z","submitted_at":"2019-08-23T03:39:14Z","title":"Efficient Join Processing Over Incomplete Data Streams (Technical Report)","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T11:39:59.845058Z"},"links":{"citing_paper":"/paper/1908.08654"},"observation_digest":"sha256:75a2cc407ee3aa01c0c34ae428df206b006b8f7228383960a811fc402e531ef2","observation_id":"37ab8b6a-0354-4e94-9706-0b27fdde12ae","resolution":{"observed_at":"2026-08-14T11:40:00.205776Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T11:40:00.188583Z","title":"Combining quantitative and logical data cleaning","venue":null,"work_id":"19acb1ea-4850-43aa-9d94-3158dc48cb59","year":2015},"citing_paper":{"arxiv_id":"1908.08654","last_updated":"2019-08-23T03:39:14Z","snapshot_observed_at":"2026-08-18T03:06:11.011643Z","submitted_at":"2019-08-23T03:39:14Z","title":"Efficient Join Processing Over Incomplete Data Streams (Technical Report)","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T11:39:59.849643Z"},"links":{"citing_paper":"/paper/1908.08654"},"observation_digest":"sha256:49d9184c9edb7d0914b646cab90c683d0a76453dd0b26cf95e05b10a52ddbd15","observation_id":"6f41bdc5-a456-4633-b481-dee5e2943bf6","resolution":{"observed_at":"2026-08-14T11:40:00.192960Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T11:40:00.176099Z","title":"Multiple imputation of missing values","venue":null,"work_id":"bb342ce0-b302-49af-999f-707a8d05fd20","year":2004},"citing_paper":{"arxiv_id":"1908.08654","last_updated":"2019-08-23T03:39:14Z","snapshot_observed_at":"2026-08-18T03:06:11.011643Z","submitted_at":"2019-08-23T03:39:14Z","title":"Efficient Join Processing Over Incomplete Data Streams (Technical Report)","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T11:39:59.854799Z"},"links":{"citing_paper":"/paper/1908.08654"},"observation_digest":"sha256:63a27dfb3d509921e699f1238c954d4d28edf4d13edbc5904c4ead4c85aaa66f","observation_id":"980ea9eb-6226-4c1a-9516-93f2b54f7e44","resolution":{"observed_at":"2026-08-14T11:40:00.180242Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T11:40:00.164611Z","title":"Wadjet: Finding outliers in multiple multi-dimensional heterogeneous data streams","venue":null,"work_id":"a2066ed3-dd4e-49cf-80b4-3f2fc4b9ca0e","year":2018},"citing_paper":{"arxiv_id":"1908.08654","last_updated":"2019-08-23T03:39:14Z","snapshot_observed_at":"2026-08-18T03:06:11.011643Z","submitted_at":"2019-08-23T03:39:14Z","title":"Efficient Join Processing Over Incomplete Data Streams (Technical Report)","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T11:39:59.860287Z"},"links":{"citing_paper":"/paper/1908.08654"},"observation_digest":"sha256:d5ad5a049f49a4e92f51b20ddd774a1723ab9cce548e3e69483b50a5f3ee3f19","observation_id":"9ca51cde-8885-4165-a083-f7e5c6a3184d","resolution":{"observed_at":"2026-08-14T11:40:00.168616Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T11:40:00.152374Z","title":"Trajectory similarity join in spatial networks","venue":null,"work_id":"eb331f09-bca3-4434-9e14-27f6ed829978","year":2017},"citing_paper":{"arxiv_id":"1908.08654","last_updated":"2019-08-23T03:39:14Z","snapshot_observed_at":"2026-08-18T03:06:11.011643Z","submitted_at":"2019-08-23T03:39:14Z","title":"Efficient Join Processing Over Incomplete Data Streams (Technical Report)","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T11:39:59.864527Z"},"links":{"citing_paper":"/paper/1908.08654"},"observation_digest":"sha256:0b01fe9250a67f4d19b0a62d2b45f18e9355f6e6aaa309ee545ff38536c9fa21","observation_id":"84cec69b-ea64-40f6-9f32-2b0f231027a6","resolution":{"observed_at":"2026-08-14T11:40:00.156514Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T11:40:00.138871Z","title":"Differential dependencies: Reasoning and discovery","venue":null,"work_id":"928e8200-c22a-40f1-aa0f-ef256e96d906","year":2011},"citing_paper":{"arxiv_id":"1908.08654","last_updated":"2019-08-23T03:39:14Z","snapshot_observed_at":"2026-08-18T03:06:11.011643Z","submitted_at":"2019-08-23T03:39:14Z","title":"Efficient Join Processing Over Incomplete Data Streams (Technical Report)","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T11:39:59.868555Z"},"links":{"citing_paper":"/paper/1908.08654"},"observation_digest":"sha256:a90b5608f539e188c729bcc59c585280df096fd870c541c17596ef3e5c8d6aa8","observation_id":"92bc2696-e629-4246-8bda-4648eb73e450","resolution":{"observed_at":"2026-08-14T11:40:00.144660Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T11:40:00.125147Z","title":"Repairing vertex labels under neighborhood constraints","venue":null,"work_id":"2771bed8-fca0-49f6-9fc0-6e9fdefd639d","year":2014},"citing_paper":{"arxiv_id":"1908.08654","last_updated":"2019-08-23T03:39:14Z","snapshot_observed_at":"2026-08-18T03:06:11.011643Z","submitted_at":"2019-08-23T03:39:14Z","title":"Efficient Join Processing Over Incomplete Data Streams (Technical Report)","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T11:39:59.873180Z"},"links":{"citing_paper":"/paper/1908.08654"},"observation_digest":"sha256:6fec15c06000af30e65b2130544354f2c0fb9048cea424dd3652349f1cd74b6a","observation_id":"c7f5a38a-170b-4ee9-8f95-7386d53320fc","resolution":{"observed_at":"2026-08-14T11:40:00.129909Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T11:40:00.111104Z","title":"Enriching data impu- tation with extensive similarity neighbors","venue":null,"work_id":"862d1922-a1ab-46cb-987f-e9bb1e1a0b35","year":2015},"citing_paper":{"arxiv_id":"1908.08654","last_updated":"2019-08-23T03:39:14Z","snapshot_observed_at":"2026-08-18T03:06:11.011643Z","submitted_at":"2019-08-23T03:39:14Z","title":"Efficient Join Processing Over Incomplete Data Streams (Technical Report)","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T11:39:59.877136Z"},"links":{"citing_paper":"/paper/1908.08654"},"observation_digest":"sha256:0f7c2cd9b068bc6adfc7497c5d1a1ae41b172f0bde33b0ce99ae0ef97bc623d2","observation_id":"f07fb3c0-4d44-446b-a278-6ac02920dc73","resolution":{"observed_at":"2026-08-14T11:40:00.115411Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T11:40:00.097127Z","title":"Matching heterogeneous events with patterns","venue":null,"work_id":"6fd978e2-0be7-41d8-a510-bcc5a9bd8355","year":2017},"citing_paper":{"arxiv_id":"1908.08654","last_updated":"2019-08-23T03:39:14Z","snapshot_observed_at":"2026-08-18T03:06:11.011643Z","submitted_at":"2019-08-23T03:39:14Z","title":"Efficient Join Processing Over Incomplete Data Streams (Technical Report)","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T11:39:59.882745Z"},"links":{"citing_paper":"/paper/1908.08654"},"observation_digest":"sha256:e46c9c1b7747fd8402d4b18a64085c2dc6f7b003f696424aae250eb4cf46b661","observation_id":"0ba4596f-bfed-4a5f-a82d-6cf1d818080f","resolution":{"observed_at":"2026-08-14T11:40:00.101715Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T11:40:00.083272Z","title":"Graph re- pairing under neighborhood constraints","venue":null,"work_id":"e8f0d0d9-0afb-4ba4-87b2-ae50511169ee","year":2017},"citing_paper":{"arxiv_id":"1908.08654","last_updated":"2019-08-23T03:39:14Z","snapshot_observed_at":"2026-08-18T03:06:11.011643Z","submitted_at":"2019-08-23T03:39:14Z","title":"Efficient Join Processing Over Incomplete Data Streams (Technical Report)","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T11:39:59.887537Z"},"links":{"citing_paper":"/paper/1908.08654"},"observation_digest":"sha256:e7c9b0d03eea888e7b35a2b778a0dc2872a31ff70a7c1e4e2d5eba084f2cec7e","observation_id":"68cc6192-9651-41b3-82eb-18cb30233505","resolution":{"observed_at":"2026-08-14T11:40:00.087744Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T11:40:00.068764Z","title":"Maintaining sliding window skylines on data streams","venue":null,"work_id":"0a4223d8-4270-4e93-860a-22ab77a338a6","year":2006},"citing_paper":{"arxiv_id":"1908.08654","last_updated":"2019-08-23T03:39:14Z","snapshot_observed_at":"2026-08-18T03:06:11.011643Z","submitted_at":"2019-08-23T03:39:14Z","title":"Efficient Join Processing Over Incomplete Data Streams (Technical Report)","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-14T11:39:59.892077Z"},"links":{"citing_paper":"/paper/1908.08654"},"observation_digest":"sha256:7522225abcd98b25f345ffc90a9f677ce6f056bd44514776e5d95db5e9673a87","observation_id":"f39b1b03-f4f5-4a84-9e15-2781b51ef7f4","resolution":{"observed_at":"2026-08-14T11:40:00.073830Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T11:40:00.050775Z","title":"Window-aware load shedding for aggregation queries over data streams","venue":null,"work_id":"2c2c1271-ccdc-4a8f-b3bc-5a4c215801e0","year":2006},"citing_paper":{"arxiv_id":"1908.08654","last_updated":"2019-08-23T03:39:14Z","snapshot_observed_at":"2026-08-18T03:06:11.011643Z","submitted_at":"2019-08-23T03:39:14Z","title":"Efficient Join Processing Over Incomplete Data Streams (Technical Report)","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-14T11:39:59.896999Z"},"links":{"citing_paper":"/paper/1908.08654"},"observation_digest":"sha256:4cf20c9d3d7eb8bbdc6163275477355832a1a1275d4598946b27bb771141df9c","observation_id":"abc796d1-9d74-4875-a3e7-438fc8e3542b","resolution":{"observed_at":"2026-08-14T11:40:00.057047Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T11:40:00.028801Z","title":"Leveraging set relations in exact set similarity join","venue":null,"work_id":"95dcf374-f44a-429e-939b-1d777002f1ef","year":2017},"citing_paper":{"arxiv_id":"1908.08654","last_updated":"2019-08-23T03:39:14Z","snapshot_observed_at":"2026-08-18T03:06:11.011643Z","submitted_at":"2019-08-23T03:39:14Z","title":"Efficient Join Processing Over Incomplete Data Streams (Technical Report)","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-14T11:39:59.901244Z"},"links":{"citing_paper":"/paper/1908.08654"},"observation_digest":"sha256:a2c952f5fc6a4677d6b9e53182de60804da168726d382aed9895f172eeea7774","observation_id":"7ad5291e-fd82-4f97-b7a5-ad7bda4f4cd5","resolution":{"observed_at":"2026-08-14T11:40:00.034622Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T11:39:59.996039Z","title":"Continuous imputation of missing values in streams of pattern-determining time series","venue":null,"work_id":"cd7ca8d8-2997-4413-aafd-523d7ae487eb","year":2017},"citing_paper":{"arxiv_id":"1908.08654","last_updated":"2019-08-23T03:39:14Z","snapshot_observed_at":"2026-08-18T03:06:11.011643Z","submitted_at":"2019-08-23T03:39:14Z","title":"Efficient Join Processing Over Incomplete Data Streams (Technical Report)","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-14T11:39:59.905346Z"},"links":{"citing_paper":"/paper/1908.08654"},"observation_digest":"sha256:1a429db56f8eaf7a354b6d6c18139658798c2f3486a85f86ac5123a81840d5c8","observation_id":"0021fce1-af28-4051-9375-8ec1d90f06d4","resolution":{"observed_at":"2026-08-14T11:40:00.008380Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T11:39:59.980317Z","title":"Online clustering for trajectory data stream of moving objects","venue":null,"work_id":"dcd925d2-94d8-4da9-a7c2-bb978dcc4dcd","year":2013},"citing_paper":{"arxiv_id":"1908.08654","last_updated":"2019-08-23T03:39:14Z","snapshot_observed_at":"2026-08-18T03:06:11.011643Z","submitted_at":"2019-08-23T03:39:14Z","title":"Efficient Join Processing Over Incomplete Data Streams (Technical Report)","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-14T11:39:59.910232Z"},"links":{"citing_paper":"/paper/1908.08654"},"observation_digest":"sha256:ed825a0ef13135a2a3c903484c103579073e25ba0f71f2276592f7665c39cd4d","observation_id":"a5ed3a34-9f2d-4415-a0f9-674b8d7a4504","resolution":{"observed_at":"2026-08-14T11:39:59.985521Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T11:39:59.966274Z","title":"Zhang, S","venue":null,"work_id":"7b940189-d113-46f9-83be-fb92672bc500","year":2019},"citing_paper":{"arxiv_id":"1908.08654","last_updated":"2019-08-23T03:39:14Z","snapshot_observed_at":"2026-08-18T03:06:11.011643Z","submitted_at":"2019-08-23T03:39:14Z","title":"Efficient Join Processing Over Incomplete Data Streams (Technical Report)","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-14T11:39:59.914585Z"},"links":{"citing_paper":"/paper/1908.08654"},"observation_digest":"sha256:f9e6e505500ab60527b9a9a61ef122ea54882882fe335d262fd9f8518c0fb136","observation_id":"dfc92261-953d-48de-84e2-e412285fd11c","resolution":{"observed_at":"2026-08-14T11:39:59.970799Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-14T11:39:59.950260Z","title":"Time series data cleaning: From anomaly detection to anomaly repairing","venue":null,"work_id":"5a59ebdd-bafe-4617-97e2-b17327be4126","year":2017},"citing_paper":{"arxiv_id":"1908.08654","last_updated":"2019-08-23T03:39:14Z","snapshot_observed_at":"2026-08-18T03:06:11.011643Z","submitted_at":"2019-08-23T03:39:14Z","title":"Efficient Join Processing Over Incomplete Data Streams (Technical Report)","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-14T11:39:59.918615Z"},"links":{"citing_paper":"/paper/1908.08654"},"observation_digest":"sha256:349f084ad415446cd0ca683e1697fc9b6cc481224778fe67319582f86c3803cd","observation_id":"a2d954aa-2253-4b2b-8b83-9f125ee460d7","resolution":{"observed_at":"2026-08-14T11:39:59.957241Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.08654","last_updated":"2019-08-23T03:39:14Z","latest_version":1,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-18T03:06:11.011643Z","submitted_at":"2019-08-23T03:39:14Z","title":"Efficient Join Processing Over Incomplete Data Streams (Technical Report)"},"reference_resolution":{"displayed":43,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":43},"total_outbound_references":43},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 43 of 43 outbound references and 0 inbound Pith citation observations for arXiv:1908.08654."}