{"as_of":"2026-08-17T01:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4607e5aba9f53402d8b28d4b8711b5bca1bd487174396a9797f762c0d721c952","coverage":[{"denominator":23,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":23,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T15:21:07.871390Z","state":"measured"},{"denominator":23,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":23,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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.01812/citation-record","integrity":"/paper/1908.01812/integrity","json":"/paper/1908.01812/citation-record.json","paper":"/paper/1908.01812"},"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-14T15:21:08.169619Z","title":"\\'A lvarez-Garc \\' a, N","venue":null,"work_id":"ff883ebc-319c-4ffb-937d-bd38d213b2b7","year":2015},"citing_paper":{"arxiv_id":"1908.01812","last_updated":"2020-01-09T15:28:33Z","snapshot_observed_at":"2026-08-16T04:42:24.345792Z","submitted_at":"2019-08-05T19:25:57Z","title":"Optimal Joins using Compact Data Structures","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-14T15:21:07.788020Z"},"links":{"citing_paper":"/paper/1908.01812"},"observation_digest":"sha256:c6f5fef3bc8a30f80f25a314bb1e19fb5ee3ab97bd930ffc71ee4ec9ac4dc931","observation_id":"1c25d41a-f515-41f2-b347-fa0f1e3fa965","resolution":{"observed_at":"2026-08-14T15:21:08.173611Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:21:08.157489Z","title":"Atserias, M","venue":null,"work_id":"9a0bdfe5-5e74-4de5-a637-d26cdac346f6","year":2013},"citing_paper":{"arxiv_id":"1908.01812","last_updated":"2020-01-09T15:28:33Z","snapshot_observed_at":"2026-08-16T04:42:24.345792Z","submitted_at":"2019-08-05T19:25:57Z","title":"Optimal Joins using Compact Data Structures","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-14T15:21:07.792303Z"},"links":{"citing_paper":"/paper/1908.01812"},"observation_digest":"sha256:6769f5787218efa38a81f45b405ff083fd2ce1598651cba3795901e73074fc0f","observation_id":"42c58461-7f37-431c-a43b-fea793820f9b","resolution":{"observed_at":"2026-08-14T15:21:08.162299Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:21:08.146704Z","title":"Benoit, E","venue":null,"work_id":"6f33acb2-5ee8-4118-bc18-6cbf03de460d","year":2005},"citing_paper":{"arxiv_id":"1908.01812","last_updated":"2020-01-09T15:28:33Z","snapshot_observed_at":"2026-08-16T04:42:24.345792Z","submitted_at":"2019-08-05T19:25:57Z","title":"Optimal Joins using Compact Data Structures","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-14T15:21:07.795805Z"},"links":{"citing_paper":"/paper/1908.01812"},"observation_digest":"sha256:a19122cc6c8f442274734d6af8a489bb4329cc99aa1330f3d855754e9282a81a","observation_id":"3c1469b8-5d47-47f2-83b3-0ad0025c37f0","resolution":{"observed_at":"2026-08-14T15:21:08.150430Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:21:08.136727Z","title":null,"venue":null,"work_id":"e060a18f-ff48-42fe-8f31-2cd7b9558209","year":2014},"citing_paper":{"arxiv_id":"1908.01812","last_updated":"2020-01-09T15:28:33Z","snapshot_observed_at":"2026-08-16T04:42:24.345792Z","submitted_at":"2019-08-05T19:25:57Z","title":"Optimal Joins using Compact Data Structures","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-14T15:21:07.799030Z"},"links":{"citing_paper":"/paper/1908.01812"},"observation_digest":"sha256:811497be559ad7d4e828278c21a393fe13f087087e118e0db4e820cd3f6e98b2","observation_id":"6cf8659d-338c-4938-b277-01c9e1abc780","resolution":{"observed_at":"2026-08-14T15:21:08.139983Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:21:08.123349Z","title":"de Bernardo, S","venue":null,"work_id":"b92031e2-3338-4c9f-a506-b2a8e64cc21e","year":2013},"citing_paper":{"arxiv_id":"1908.01812","last_updated":"2020-01-09T15:28:33Z","snapshot_observed_at":"2026-08-16T04:42:24.345792Z","submitted_at":"2019-08-05T19:25:57Z","title":"Optimal Joins using Compact Data Structures","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-14T15:21:07.802450Z"},"links":{"citing_paper":"/paper/1908.01812"},"observation_digest":"sha256:fad598d059591d352eacad66a895e25d9f1bf4b77bfcdc9838a43add48b542a0","observation_id":"5a8e2904-59cf-45fd-8748-4e3bf50d90ff","resolution":{"observed_at":"2026-08-14T15:21:08.128118Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:21:08.109562Z","title":null,"venue":null,"work_id":"c701323d-2dda-4a1d-bad3-7b86fb7a89a8","year":1974},"citing_paper":{"arxiv_id":"1908.01812","last_updated":"2020-01-09T15:28:33Z","snapshot_observed_at":"2026-08-16T04:42:24.345792Z","submitted_at":"2019-08-05T19:25:57Z","title":"Optimal Joins using Compact Data Structures","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-14T15:21:07.805691Z"},"links":{"citing_paper":"/paper/1908.01812"},"observation_digest":"sha256:401f659e2bf4ccfb166c71478523c9be81eb5cc7bcccd6850f1849144a065e1b","observation_id":"2892e716-59d3-448a-9ab2-b3201a72516a","resolution":{"observed_at":"2026-08-14T15:21:08.113652Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:21:08.097639Z","title":"Gagie, J","venue":null,"work_id":"9e0643e7-cb8c-412a-abee-21df363d3156","year":2015},"citing_paper":{"arxiv_id":"1908.01812","last_updated":"2020-01-09T15:28:33Z","snapshot_observed_at":"2026-08-16T04:42:24.345792Z","submitted_at":"2019-08-05T19:25:57Z","title":"Optimal Joins using Compact Data Structures","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-14T15:21:07.809079Z"},"links":{"citing_paper":"/paper/1908.01812"},"observation_digest":"sha256:c6fde73b6b03543b35fb3969dad3beb2feed2edccb9068507ad8fd37c2737769","observation_id":"67f1114f-0e8a-4078-8fcd-3f8883e8001c","resolution":{"observed_at":"2026-08-14T15:21:08.101533Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:21:08.084980Z","title":"Hogan, C","venue":null,"work_id":"d3596a72-d359-440b-b53e-b8707661e23f","year":2019},"citing_paper":{"arxiv_id":"1908.01812","last_updated":"2020-01-09T15:28:33Z","snapshot_observed_at":"2026-08-16T04:42:24.345792Z","submitted_at":"2019-08-05T19:25:57Z","title":"Optimal Joins using Compact Data Structures","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-14T15:21:07.812992Z"},"links":{"citing_paper":"/paper/1908.01812"},"observation_digest":"sha256:6eee354d096d622cd1d5078b1bc1fca22dfa79c037cee348e4ee422d74fad793","observation_id":"637da080-f75b-49d3-a456-81b9edd7794d","resolution":{"observed_at":"2026-08-14T15:21:08.088808Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:21:08.072922Z","title":null,"venue":null,"work_id":"00dc37fe-a4ea-4bde-b902-98660594b519","year":2016},"citing_paper":{"arxiv_id":"1908.01812","last_updated":"2020-01-09T15:28:33Z","snapshot_observed_at":"2026-08-16T04:42:24.345792Z","submitted_at":"2019-08-05T19:25:57Z","title":"Optimal Joins using Compact Data Structures","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-14T15:21:07.817420Z"},"links":{"citing_paper":"/paper/1908.01812"},"observation_digest":"sha256:61352fdc27cf859d4699a49137b26940be03df4758031057d3f8513801445ec2","observation_id":"00361a1c-7763-493c-a102-301fdde80621","resolution":{"observed_at":"2026-08-14T15:21:08.076452Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:21:08.062289Z","title":null,"venue":null,"work_id":"e5290d84-86fd-47fa-989e-cf252bcc6425","year":2016},"citing_paper":{"arxiv_id":"1908.01812","last_updated":"2020-01-09T15:28:33Z","snapshot_observed_at":"2026-08-16T04:42:24.345792Z","submitted_at":"2019-08-05T19:25:57Z","title":"Optimal Joins using Compact Data Structures","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-14T15:21:07.821146Z"},"links":{"citing_paper":"/paper/1908.01812"},"observation_digest":"sha256:ca84188dc2ed1887e28f9af01083736b5a5a7decbedb0250da611ee2bdfbcfd9","observation_id":"b7c27b91-cb6f-417a-b781-4983e67e5b51","resolution":{"observed_at":"2026-08-14T15:21:08.066146Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:21:08.049607Z","title":null,"venue":null,"work_id":"a37f8a3c-cd65-4180-af99-01db7379dfda","year":2017},"citing_paper":{"arxiv_id":"1908.01812","last_updated":"2020-01-09T15:28:33Z","snapshot_observed_at":"2026-08-16T04:42:24.345792Z","submitted_at":"2019-08-05T19:25:57Z","title":"Optimal Joins using Compact Data Structures","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-14T15:21:07.825829Z"},"links":{"citing_paper":"/paper/1908.01812"},"observation_digest":"sha256:1b46ac22d569419db6142469fab43dabc8aa09b572399fb89fc0cfa230aed989","observation_id":"6778f9eb-148c-4f27-af10-a7fccff9b57a","resolution":{"observed_at":"2026-08-14T15:21:08.053859Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:21:08.037640Z","title":null,"venue":null,"work_id":"763724fb-6276-4437-9aa2-88963e0f0244","year":1966},"citing_paper":{"arxiv_id":"1908.01812","last_updated":"2020-01-09T15:28:33Z","snapshot_observed_at":"2026-08-16T04:42:24.345792Z","submitted_at":"2019-08-05T19:25:57Z","title":"Optimal Joins using Compact Data Structures","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-14T15:21:07.830212Z"},"links":{"citing_paper":"/paper/1908.01812"},"observation_digest":"sha256:7047c6dcd89430199c344d60495623b7243fb5f3d1e74fb31ba2002298af4db9","observation_id":"b5e52de3-3158-452b-aec1-2d6736690d72","resolution":{"observed_at":"2026-08-14T15:21:08.041570Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:21:08.025084Z","title":null,"venue":null,"work_id":"eb0f2f82-7ff2-491c-b82c-452161806afd","year":2016},"citing_paper":{"arxiv_id":"1908.01812","last_updated":"2020-01-09T15:28:33Z","snapshot_observed_at":"2026-08-16T04:42:24.345792Z","submitted_at":"2019-08-05T19:25:57Z","title":"Optimal Joins using Compact Data Structures","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-14T15:21:07.833998Z"},"links":{"citing_paper":"/paper/1908.01812"},"observation_digest":"sha256:4350da9c00538460c2d3505f7b8b010fab153d1427106d397acee84550640fc3","observation_id":"6eb82476-c5ab-46a8-8194-95864e56587b","resolution":{"observed_at":"2026-08-14T15:21:08.029399Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:21:08.010937Z","title":null,"venue":null,"work_id":"ffdfec74-0944-4944-a016-7111a0714090","year":2018},"citing_paper":{"arxiv_id":"1908.01812","last_updated":"2020-01-09T15:28:33Z","snapshot_observed_at":"2026-08-16T04:42:24.345792Z","submitted_at":"2019-08-05T19:25:57Z","title":"Optimal Joins using Compact Data Structures","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-14T15:21:07.838152Z"},"links":{"citing_paper":"/paper/1908.01812"},"observation_digest":"sha256:48d19d7862d8691639215d33326764e4038cf9126fd39403881bd5cef1ab8ecb","observation_id":"207d6e27-e490-4ba3-b9c4-09e0c5220b55","resolution":{"observed_at":"2026-08-14T15:21:08.015482Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:21:07.998910Z","title":null,"venue":null,"work_id":"34a3320f-0d58-42b7-9aac-eeba8501037d","year":2014},"citing_paper":{"arxiv_id":"1908.01812","last_updated":"2020-01-09T15:28:33Z","snapshot_observed_at":"2026-08-16T04:42:24.345792Z","submitted_at":"2019-08-05T19:25:57Z","title":"Optimal Joins using Compact Data Structures","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-14T15:21:07.841889Z"},"links":{"citing_paper":"/paper/1908.01812"},"observation_digest":"sha256:ca24cd7a54c754bba1ac460498d836d07ccaca29be627f6768765346d1799ae3","observation_id":"75efd7e7-cd94-40cb-8f5a-ff6e94ac1f4b","resolution":{"observed_at":"2026-08-14T15:21:08.002288Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:21:07.986561Z","title":null,"venue":null,"work_id":"523f9afb-fb43-4caf-874c-4159c436cb4b","year":2014},"citing_paper":{"arxiv_id":"1908.01812","last_updated":"2020-01-09T15:28:33Z","snapshot_observed_at":"2026-08-16T04:42:24.345792Z","submitted_at":"2019-08-05T19:25:57Z","title":"Optimal Joins using Compact Data Structures","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-14T15:21:07.845614Z"},"links":{"citing_paper":"/paper/1908.01812"},"observation_digest":"sha256:46cb328125f536edb0e674737adf34af250f824a9514b6413d7faf7af2b77f97","observation_id":"b01688d1-0cf4-498f-bf04-707acb70e77a","resolution":{"observed_at":"2026-08-14T15:21:07.990525Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:21:07.972696Z","title":"Worst-case optimal join algorithms","venue":null,"work_id":"80fbd25c-440c-48df-b8c9-07aea34d9864","year":2012},"citing_paper":{"arxiv_id":"1908.01812","last_updated":"2020-01-09T15:28:33Z","snapshot_observed_at":"2026-08-16T04:42:24.345792Z","submitted_at":"2019-08-05T19:25:57Z","title":"Optimal Joins using Compact Data Structures","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-14T15:21:07.849144Z"},"links":{"citing_paper":"/paper/1908.01812"},"observation_digest":"sha256:33c14a627bb13754990675a24e35a176ad457bd2e9090af4931fc9dd82dc2bc0","observation_id":"295f3806-0909-4061-8c7f-62f340d39ef0","resolution":{"observed_at":"2026-08-14T15:21:07.977472Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:21:07.956472Z","title":"Nguyen, M","venue":null,"work_id":"1ed519e4-b6ba-4367-87d1-8b318e2a3f1d","year":2015},"citing_paper":{"arxiv_id":"1908.01812","last_updated":"2020-01-09T15:28:33Z","snapshot_observed_at":"2026-08-16T04:42:24.345792Z","submitted_at":"2019-08-05T19:25:57Z","title":"Optimal Joins using Compact Data Structures","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-14T15:21:07.852918Z"},"links":{"citing_paper":"/paper/1908.01812"},"observation_digest":"sha256:7fcb645f626a9002714c770374cede8485418681d7709969e6690054eff3aadf","observation_id":"f2595465-110f-48f1-997b-186f395c5e4f","resolution":{"observed_at":"2026-08-14T15:21:07.961910Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:21:07.943502Z","title":null,"venue":null,"work_id":"b6fbcf29-88d1-45be-ba56-2eb4aa7c6271","year":2006},"citing_paper":{"arxiv_id":"1908.01812","last_updated":"2020-01-09T15:28:33Z","snapshot_observed_at":"2026-08-16T04:42:24.345792Z","submitted_at":"2019-08-05T19:25:57Z","title":"Optimal Joins using Compact Data Structures","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-14T15:21:07.856726Z"},"links":{"citing_paper":"/paper/1908.01812"},"observation_digest":"sha256:3a0a105d3596fc923a10cf8f7b20a328447a1437f1e638722be757155b877604","observation_id":"6540b70c-4fbd-434c-aa8f-b4febf332cdf","resolution":{"observed_at":"2026-08-14T15:21:07.947532Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:21:07.932740Z","title":null,"venue":null,"work_id":"ee6b0159-6824-44f7-a3d9-1a83176dedf3","year":2017},"citing_paper":{"arxiv_id":"1908.01812","last_updated":"2020-01-09T15:28:33Z","snapshot_observed_at":"2026-08-16T04:42:24.345792Z","submitted_at":"2019-08-05T19:25:57Z","title":"Optimal Joins using Compact Data Structures","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-14T15:21:07.860801Z"},"links":{"citing_paper":"/paper/1908.01812"},"observation_digest":"sha256:9957c87c87625f8a625585c23dcc36d51ac9a1e3ac1847d1b7a57af13b4f9c3f","observation_id":"9de96613-8a22-493d-8209-b71b2324a695","resolution":{"observed_at":"2026-08-14T15:21:07.935915Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:21:07.922530Z","title":null,"venue":null,"work_id":"be1cbe1a-1b3d-4ffc-9738-ee217e5043f1","year":2014},"citing_paper":{"arxiv_id":"1908.01812","last_updated":"2020-01-09T15:28:33Z","snapshot_observed_at":"2026-08-16T04:42:24.345792Z","submitted_at":"2019-08-05T19:25:57Z","title":"Optimal Joins using Compact Data Structures","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-14T15:21:07.864365Z"},"links":{"citing_paper":"/paper/1908.01812"},"observation_digest":"sha256:a558b0c1b678bb13e71974b283e71f9ecbdb0c8b6f365a1187ddedc5791babb5","observation_id":"63f9d9f3-5674-4eaf-8dad-862ffc1079ff","resolution":{"observed_at":"2026-08-14T15:21:07.925631Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:21:07.912603Z","title":null,"venue":null,"work_id":"1678408b-d760-4a09-ba6b-fdc4d70dd24e","year":1990},"citing_paper":{"arxiv_id":"1908.01812","last_updated":"2020-01-09T15:28:33Z","snapshot_observed_at":"2026-08-16T04:42:24.345792Z","submitted_at":"2019-08-05T19:25:57Z","title":"Optimal Joins using Compact Data Structures","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-14T15:21:07.867892Z"},"links":{"citing_paper":"/paper/1908.01812"},"observation_digest":"sha256:6c8a598e7c54644cbd4023f7a06d2f1ec41df93db647c8c0ceaf2f3281355e40","observation_id":"39dc8224-a24f-4777-a285-bedd060e2b63","resolution":{"observed_at":"2026-08-14T15:21:07.915618Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:21:07.898467Z","title":"Yannakakis","venue":null,"work_id":"2afb893b-370c-4f82-9a1b-9c736206aa63","year":1981},"citing_paper":{"arxiv_id":"1908.01812","last_updated":"2020-01-09T15:28:33Z","snapshot_observed_at":"2026-08-16T04:42:24.345792Z","submitted_at":"2019-08-05T19:25:57Z","title":"Optimal Joins using Compact Data Structures","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-14T15:21:07.871390Z"},"links":{"citing_paper":"/paper/1908.01812"},"observation_digest":"sha256:91052b5ca3e995f71ad0c4c3ebc1098e10a7ef2150ddd30bf352c06ce1f5c38b","observation_id":"66466d73-942a-49e9-a9ad-5c1f09cbf5e9","resolution":{"observed_at":"2026-08-14T15:21:07.903561Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.01812","last_updated":"2020-01-09T15:28:33Z","latest_version":2,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-16T04:42:24.345792Z","submitted_at":"2019-08-05T19:25:57Z","title":"Optimal Joins using Compact Data Structures"},"reference_resolution":{"displayed":23,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":14,"verified_exact":0,"verified_fuzzy":9},"total_outbound_references":23},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 23 of 23 outbound references and 0 inbound Pith citation observations for arXiv:1908.01812."}