{"as_of":"2026-08-11T13:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:31f1739e6f7b41553224e851990098ed05b7b419fc68944f3c8a9f67bb1722f3","coverage":[{"denominator":20,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":20,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:07:27.527540Z","state":"measured"},{"denominator":20,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":20,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+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/2505.19918/citation-record","integrity":"/paper/2505.19918/integrity","json":"/paper/2505.19918/citation-record.json","paper":"/paper/2505.19918"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:07:25.890550Z","title":"Aberger, Andrew Lamb, Susan Tu, Andres Nötzli, Kunle Oluko- tun, and Christopher Ré","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.19918","last_updated":"2025-05-26T12:44:53Z","snapshot_observed_at":"2026-08-07T14:01:33.079450Z","submitted_at":"2025-05-26T12:44:53Z","title":"A Unified Architecture for Efficient Binary and Worst-Case Optimal Join Processing","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T14:07:25.890550Z"},"links":{"citing_paper":"/paper/2505.19918"},"observation_digest":"sha256:92c5dfa6ebf56c7185ef0a32e7195b384e49a15c336116eb096b034f053f0929","observation_id":"30164345-6d4f-45ca-b4f8-05d7d052aeec","resolution":{"observed_at":"2026-08-07T14:07:25.890550Z","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-08-07T14:07:25.935661Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2505.19918","last_updated":"2025-05-26T12:44:53Z","snapshot_observed_at":"2026-08-07T14:01:33.079450Z","submitted_at":"2025-05-26T12:44:53Z","title":"A Unified Architecture for Efficient Binary and Worst-Case Optimal Join Processing","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T14:07:25.935661Z"},"links":{"citing_paper":"/paper/2505.19918"},"observation_digest":"sha256:e750765a1bd375238a422dd2e3cb41e9a058d36694e1c0d381ace5f09d1d2e98","observation_id":"674dd048-2ae3-45fe-a54c-1388ec7389d1","resolution":{"observed_at":"2026-08-07T14:07:25.935661Z","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-08-07T14:07:26.064362Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.19918","last_updated":"2025-05-26T12:44:53Z","snapshot_observed_at":"2026-08-07T14:01:33.079450Z","submitted_at":"2025-05-26T12:44:53Z","title":"A Unified Architecture for Efficient Binary and Worst-Case Optimal Join Processing","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T14:07:26.064362Z"},"links":{"citing_paper":"/paper/2505.19918"},"observation_digest":"sha256:4eff4e9d396a8f55042381654fb9acf5adf4f65df23c3303e215d6fe5b5f672e","observation_id":"59fa97f7-eef5-4758-a6e1-922403764079","resolution":{"observed_at":"2026-08-07T14:07:26.064362Z","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-08-07T14:07:26.145626Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2505.19918","last_updated":"2025-05-26T12:44:53Z","snapshot_observed_at":"2026-08-07T14:01:33.079450Z","submitted_at":"2025-05-26T12:44:53Z","title":"A Unified Architecture for Efficient Binary and Worst-Case Optimal Join Processing","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T14:07:26.145626Z"},"links":{"citing_paper":"/paper/2505.19918"},"observation_digest":"sha256:ee2adcc9f15b5200404a086852946aad457b5adddc87db480115602413dcfe79","observation_id":"ab356202-7f80-4204-b856-14f8c24d232e","resolution":{"observed_at":"2026-08-07T14:07:26.145626Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:07:30.623647Z","title":null,"venue":null,"work_id":"f19bcd66-4c14-4655-91f2-f8800cacc5ec","year":2024},"citing_paper":{"arxiv_id":"2505.19918","last_updated":"2025-05-26T12:44:53Z","snapshot_observed_at":"2026-08-07T14:01:33.079450Z","submitted_at":"2025-05-26T12:44:53Z","title":"A Unified Architecture for Efficient Binary and Worst-Case Optimal Join Processing","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T14:07:26.238508Z"},"links":{"citing_paper":"/paper/2505.19918"},"observation_digest":"sha256:ffd7724768df6341451b220d2914c3f66503597b476706d80bf7ab51fc13a8ed","observation_id":"f47c9bc2-590c-42a8-8774-2eb3d336ce76","resolution":{"observed_at":"2026-08-07T14:07:30.695685Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1837.34645","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:07:29.326955Z","title":null,"venue":null,"work_id":"04a8be35-d948-49cd-879a-abf0c05ad848","year":2021},"citing_paper":{"arxiv_id":"2505.19918","last_updated":"2025-05-26T12:44:53Z","snapshot_observed_at":"2026-08-07T14:01:33.079450Z","submitted_at":"2025-05-26T12:44:53Z","title":"A Unified Architecture for Efficient Binary and Worst-Case Optimal Join Processing","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T14:07:26.340022Z"},"links":{"citing_paper":"/paper/2505.19918"},"observation_digest":"sha256:2e21ddc5fd707869813797594d34c6b677c2cae5172b89da991fbdeec19cb600","observation_id":"dabf20a5-8d78-4a36-86e8-0da4c3696011","resolution":{"observed_at":"2026-08-07T14:07:29.407980Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-08-07T14:07:26.407269Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.19918","last_updated":"2025-05-26T12:44:53Z","snapshot_observed_at":"2026-08-07T14:01:33.079450Z","submitted_at":"2025-05-26T12:44:53Z","title":"A Unified Architecture for Efficient Binary and Worst-Case Optimal Join Processing","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T14:07:26.407269Z"},"links":{"citing_paper":"/paper/2505.19918"},"observation_digest":"sha256:15d9810ef2bfbb20016a2a39a0dc00539a238e538d623cbdddffe2d761c05d6f","observation_id":"2807d727-cb4c-4283-a175-9c81fd7dc39f","resolution":{"observed_at":"2026-08-07T14:07:26.407269Z","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-08-07T14:07:26.492410Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.19918","last_updated":"2025-05-26T12:44:53Z","snapshot_observed_at":"2026-08-07T14:01:33.079450Z","submitted_at":"2025-05-26T12:44:53Z","title":"A Unified Architecture for Efficient Binary and Worst-Case Optimal Join Processing","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T14:07:26.492410Z"},"links":{"citing_paper":"/paper/2505.19918"},"observation_digest":"sha256:c57a98ef29c76d2472fc7594ed7f6541f3855ee1f66dfc3cae740717f19054d0","observation_id":"a6620d35-d1ae-4e4e-a8e6-b931d66c8673","resolution":{"observed_at":"2026-08-07T14:07:26.492410Z","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-08-07T14:07:26.565733Z","title":"Ngo, Ely Porat, Christopher Ré, and Atri Rudra","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2505.19918","last_updated":"2025-05-26T12:44:53Z","snapshot_observed_at":"2026-08-07T14:01:33.079450Z","submitted_at":"2025-05-26T12:44:53Z","title":"A Unified Architecture for Efficient Binary and Worst-Case Optimal Join Processing","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T14:07:26.565733Z"},"links":{"citing_paper":"/paper/2505.19918"},"observation_digest":"sha256:db777b4aa414705da28358027c2498a70a6bea76d543d3b11e40aa06fbfbf342","observation_id":"1770260a-6c9c-4001-8721-475614fd18bb","resolution":{"observed_at":"2026-08-07T14:07:26.565733Z","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-08-07T14:07:26.626777Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2505.19918","last_updated":"2025-05-26T12:44:53Z","snapshot_observed_at":"2026-08-07T14:01:33.079450Z","submitted_at":"2025-05-26T12:44:53Z","title":"A Unified Architecture for Efficient Binary and Worst-Case Optimal Join Processing","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T14:07:26.626777Z"},"links":{"citing_paper":"/paper/2505.19918"},"observation_digest":"sha256:f410283647b09dc6639adbb1fee1c99b35daa5f01ab5b8a01512bb7d9fd4c5be","observation_id":"b6b40792-79fc-49b4-a7cb-fa16153fc5cc","resolution":{"observed_at":"2026-08-07T14:07:26.626777Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:07:30.439794Z","title":null,"venue":null,"work_id":"d8cdaa4d-201e-49e2-babb-6460ea5fcfbd","year":2024},"citing_paper":{"arxiv_id":"2505.19918","last_updated":"2025-05-26T12:44:53Z","snapshot_observed_at":"2026-08-07T14:01:33.079450Z","submitted_at":"2025-05-26T12:44:53Z","title":"A Unified Architecture for Efficient Binary and Worst-Case Optimal Join Processing","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T14:07:26.809995Z"},"links":{"citing_paper":"/paper/2505.19918"},"observation_digest":"sha256:ddfcc8472b16beb70f2d595a18f852464b49c7e2f8f24b89c59347a2b9dcedf5","observation_id":"ab9cf979-881a-461a-9b57-aadfdbdb20d6","resolution":{"observed_at":"2026-08-07T14:07:30.526723Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T14:07:30.135573Z","title":null,"venue":null,"work_id":"5d1dfd85-6c4e-4ef8-80c9-6cabcdd37665","year":2022},"citing_paper":{"arxiv_id":"2505.19918","last_updated":"2025-05-26T12:44:53Z","snapshot_observed_at":"2026-08-07T14:01:33.079450Z","submitted_at":"2025-05-26T12:44:53Z","title":"A Unified Architecture for Efficient Binary and Worst-Case Optimal Join Processing","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T14:07:26.881829Z"},"links":{"citing_paper":"/paper/2505.19918"},"observation_digest":"sha256:1fbf3579997af03f3d90c2e96a3c42738088cba0553021888c30e9a74607acc7","observation_id":"2db620f1-5709-4f13-acaf-887bc3eff10c","resolution":{"observed_at":"2026-08-07T14:07:30.255503Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-08-07T14:07:26.956280Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.19918","last_updated":"2025-05-26T12:44:53Z","snapshot_observed_at":"2026-08-07T14:01:33.079450Z","submitted_at":"2025-05-26T12:44:53Z","title":"A Unified Architecture for Efficient Binary and Worst-Case Optimal Join Processing","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T14:07:26.956280Z"},"links":{"citing_paper":"/paper/2505.19918"},"observation_digest":"sha256:c622cef61c17db1f2ea4303953f7d7fc5711315892e242ab29cf787018eb58c9","observation_id":"6cf411cb-8cbd-4093-ab75-0d4cdc85642a","resolution":{"observed_at":"2026-08-07T14:07:26.956280Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:07:29.961816Z","title":null,"venue":null,"work_id":"7dac8a3e-9531-448d-bbf4-4ecfe9fe498f","year":2020},"citing_paper":{"arxiv_id":"2505.19918","last_updated":"2025-05-26T12:44:53Z","snapshot_observed_at":"2026-08-07T14:01:33.079450Z","submitted_at":"2025-05-26T12:44:53Z","title":"A Unified Architecture for Efficient Binary and Worst-Case Optimal Join Processing","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T14:07:27.009846Z"},"links":{"citing_paper":"/paper/2505.19918"},"observation_digest":"sha256:25c8679f50a656e31c3d44896586c2872c722379b2b0d928551d0f90ce9d47c1","observation_id":"8e87e6f6-5358-44cc-8760-92d77ff9f28a","resolution":{"observed_at":"2026-08-07T14:07:30.020747Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T14:07:29.771533Z","title":null,"venue":null,"work_id":"d833593a-9ac8-497a-b749-1ff99db2193b","year":2024},"citing_paper":{"arxiv_id":"2505.19918","last_updated":"2025-05-26T12:44:53Z","snapshot_observed_at":"2026-08-07T14:01:33.079450Z","submitted_at":"2025-05-26T12:44:53Z","title":"A Unified Architecture for Efficient Binary and Worst-Case Optimal Join Processing","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T14:07:27.066736Z"},"links":{"citing_paper":"/paper/2505.19918"},"observation_digest":"sha256:80096a4b8632164f1f5071591b9c3c12ba6933ae93cd5e0f44ddfc0d7d882ca6","observation_id":"2f7d71bf-4a71-417e-8ebb-d245ed208b52","resolution":{"observed_at":"2026-08-07T14:07:29.859705Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-08-07T14:07:27.143675Z","title":"Ngo, and XuanLong Nguyen","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.19918","last_updated":"2025-05-26T12:44:53Z","snapshot_observed_at":"2026-08-07T14:01:33.079450Z","submitted_at":"2025-05-26T12:44:53Z","title":"A Unified Architecture for Efficient Binary and Worst-Case Optimal Join Processing","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T14:07:27.143675Z"},"links":{"citing_paper":"/paper/2505.19918"},"observation_digest":"sha256:6acb5d774b639a44ae7efa521beafb2d0e0efb9d425f701e59d959a2601550d0","observation_id":"08211238-7208-43a0-bfd4-8b81962854be","resolution":{"observed_at":"2026-08-07T14:07:27.143675Z","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.4230/lipics.ecoop.2023.28","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":null,"venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"d7257550-2c49-4b8c-81e6-beac2911cacd","year":2023},"citing_paper":{"arxiv_id":"2505.19918","last_updated":"2025-05-26T12:44:53Z","snapshot_observed_at":"2026-08-07T14:01:33.079450Z","submitted_at":"2025-05-26T12:44:53Z","title":"A Unified Architecture for Efficient Binary and Worst-Case Optimal Join Processing","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T14:07:27.205976Z"},"links":{"citing_paper":"/paper/2505.19918"},"observation_digest":"sha256:ea5ac68f00275abc3a852b3d1e6d44a1a5489f71db3d61e691493f1a494ba709","observation_id":"0046bd77-bb25-43c3-98c9-a5db2a416afe","resolution":{"observed_at":"2026-08-07T14:07:27.834469Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T14:07:29.596059Z","title":null,"venue":null,"work_id":"4db0e494-ff5b-410f-822e-f55186ad45ce","year":2022},"citing_paper":{"arxiv_id":"2505.19918","last_updated":"2025-05-26T12:44:53Z","snapshot_observed_at":"2026-08-07T14:01:33.079450Z","submitted_at":"2025-05-26T12:44:53Z","title":"A Unified Architecture for Efficient Binary and Worst-Case Optimal Join Processing","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T14:07:27.338498Z"},"links":{"citing_paper":"/paper/2505.19918"},"observation_digest":"sha256:d180643088201722cc1e2a021740398ca15330b224b552b7543a75c18fd5ca82","observation_id":"9a0f18fd-b139-4297-8915-489085b108ce","resolution":{"observed_at":"2026-08-07T14:07:29.689028Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1210.0481","last_updated":"2013-12-20T20:21:03Z","snapshot_observed_at":"2026-08-09T13:13:27.333124Z","submitted_at":"2012-10-01T17:54:13Z","title":"Leapfrog Triejoin: a worst-case optimal join algorithm","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1210.0481","snapshot_observed_at":"2026-08-07T14:07:27.415009Z","title":"Veldhuizen","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2505.19918","last_updated":"2025-05-26T12:44:53Z","snapshot_observed_at":"2026-08-07T14:01:33.079450Z","submitted_at":"2025-05-26T12:44:53Z","title":"A Unified Architecture for Efficient Binary and Worst-Case Optimal Join Processing","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T14:07:27.415009Z"},"links":{"cited_paper":"/paper/1210.0481","citing_paper":"/paper/2505.19918"},"observation_digest":"sha256:8f9a0e64e3ff191142d858c61624ed41295e8da0c479417aea1c669ed42fdd2f","observation_id":"9d3742ba-f200-421c-959c-ec62668bf3ec","resolution":{"observed_at":"2026-08-07T14:07:27.415009Z","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-08-07T14:07:27.527540Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.19918","last_updated":"2025-05-26T12:44:53Z","snapshot_observed_at":"2026-08-07T14:01:33.079450Z","submitted_at":"2025-05-26T12:44:53Z","title":"A Unified Architecture for Efficient Binary and Worst-Case Optimal Join Processing","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T14:07:27.527540Z"},"links":{"citing_paper":"/paper/2505.19918"},"observation_digest":"sha256:28f42408dde851a0936302f7d3d901d58f235e4353f2ab09a263cae9a9ade77c","observation_id":"2e248a35-609d-4a72-b95b-4d963574fb9b","resolution":{"observed_at":"2026-08-07T14:07:27.527540Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.19918","last_updated":"2025-05-26T12:44:53Z","latest_version":1,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-07T14:01:33.079450Z","submitted_at":"2025-05-26T12:44:53Z","title":"A Unified Architecture for Efficient Binary and Worst-Case Optimal Join Processing"},"reference_resolution":{"displayed":20,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":18,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":20},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 20 of 20 outbound references and 0 inbound Pith citation observations for arXiv:2505.19918."}