{"as_of":"2026-08-11T21:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e1256956f769b9b0cefd313b3e5e2e6253085c0cb23e37e2d768e7da4ec15ef5","coverage":[{"denominator":57,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":57,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T10:46:01.538587Z","state":"measured"},{"denominator":57,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":57,"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/2412.16323/citation-record","integrity":"/paper/2412.16323/integrity","json":"/paper/2412.16323/citation-record.json","paper":"/paper/2412.16323"},"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-11T10:46:03.650133Z","title":"Chignell","venue":null,"work_id":"31404b21-8e3b-4845-9088-79f347e648ce","year":2020},"citing_paper":{"arxiv_id":"2412.16323","last_updated":"2025-05-19T02:27:58Z","snapshot_observed_at":"2026-08-11T10:39:21.964412Z","submitted_at":"2024-12-20T20:22:11Z","title":"Optimizing Queries with Many-to-Many Joins","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T10:46:01.293657Z"},"links":{"citing_paper":"/paper/2412.16323"},"observation_digest":"sha256:6b728e037070f4c46244c7f05ef5fde2d337b6b80957e335ac786a8391a25905","observation_id":"96a0642f-9b91-45c5-96b2-04bfc9c678f5","resolution":{"observed_at":"2026-08-11T10:46:03.654669Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-11T10:46:03.634907Z","title":null,"venue":null,"work_id":"b89acda0-ca38-476c-b947-67c824ed51e9","year":null},"citing_paper":{"arxiv_id":"2412.16323","last_updated":"2025-05-19T02:27:58Z","snapshot_observed_at":"2026-08-11T10:39:21.964412Z","submitted_at":"2024-12-20T20:22:11Z","title":"Optimizing Queries with Many-to-Many Joins","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T10:46:01.298513Z"},"links":{"citing_paper":"/paper/2412.16323"},"observation_digest":"sha256:d7212f46a80e646bc3340bce70bb3fb4dde8bf2f6c84f92b36784be3f13bc86f","observation_id":"14913585-074c-4710-89fc-b71b28d007d8","resolution":{"observed_at":"2026-08-11T10:46:03.639397Z","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-11T10:46:01.307873Z","title":"Hellerstein","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2412.16323","last_updated":"2025-05-19T02:27:58Z","snapshot_observed_at":"2026-08-11T10:39:21.964412Z","submitted_at":"2024-12-20T20:22:11Z","title":"Optimizing Queries with Many-to-Many Joins","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T10:46:01.307873Z"},"links":{"citing_paper":"/paper/2412.16323"},"observation_digest":"sha256:0fec9bac1b854182fb228c28a86dee62606cc1f38efadc77e93d205b96c98602","observation_id":"e71ee12b-c130-4090-9aaa-f723e462e7c6","resolution":{"observed_at":"2026-08-11T10:46:01.307873Z","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":"7568.10076","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:46:03.209076Z","title":null,"venue":null,"work_id":"5fdf04aa-e028-45df-b691-dae995ddf284","year":2004},"citing_paper":{"arxiv_id":"2412.16323","last_updated":"2025-05-19T02:27:58Z","snapshot_observed_at":"2026-08-11T10:39:21.964412Z","submitted_at":"2024-12-20T20:22:11Z","title":"Optimizing Queries with Many-to-Many Joins","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T10:46:01.312572Z"},"links":{"citing_paper":"/paper/2412.16323"},"observation_digest":"sha256:226e2f7b4c3bbdae142af766d39db4758b7fe9e0a67cd86d812a5fbc86473d3e","observation_id":"d6425ba3-730e-4564-a417-3cb89027758f","resolution":{"observed_at":"2026-08-11T10:46:03.216541Z","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":"10.1109/icde.2005.15","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:46:01.647248Z","title":null,"venue":null,"work_id":"86abc278-2afa-4533-8135-ab3b0dc8deaa","year":2005},"citing_paper":{"arxiv_id":"2412.16323","last_updated":"2025-05-19T02:27:58Z","snapshot_observed_at":"2026-08-11T10:39:21.964412Z","submitted_at":"2024-12-20T20:22:11Z","title":"Optimizing Queries with Many-to-Many Joins","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T10:46:01.317112Z"},"links":{"citing_paper":"/paper/2412.16323"},"observation_digest":"sha256:1986d55a8ce2ccb13b18602bf7feceb39f1aede569c42b5e6f47b2d747f9cc80","observation_id":"21e2cd42-f2d8-475f-bd2e-9490ce8fb8ff","resolution":{"observed_at":"2026-08-11T10:46:01.652218Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:46:01.321808Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2412.16323","last_updated":"2025-05-19T02:27:58Z","snapshot_observed_at":"2026-08-11T10:39:21.964412Z","submitted_at":"2024-12-20T20:22:11Z","title":"Optimizing Queries with Many-to-Many Joins","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T10:46:01.321808Z"},"links":{"citing_paper":"/paper/2412.16323"},"observation_digest":"sha256:aaf81f0c1903afb1d2c9afbc0235f4793aa3e48cb21cab2e17853e82afd05851","observation_id":"c7ec408f-331a-45a7-8e3b-b7bc045df1d1","resolution":{"observed_at":"2026-08-11T10:46:01.321808Z","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-11T10:46:01.326715Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.16323","last_updated":"2025-05-19T02:27:58Z","snapshot_observed_at":"2026-08-11T10:39:21.964412Z","submitted_at":"2024-12-20T20:22:11Z","title":"Optimizing Queries with Many-to-Many Joins","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T10:46:01.326715Z"},"links":{"citing_paper":"/paper/2412.16323"},"observation_digest":"sha256:65d0d038b9cd2044a84b7e76de04b38be35560b726580e3d42378f5b90669dc1","observation_id":"d1f8ddc7-30a2-485c-9082-79020be464f5","resolution":{"observed_at":"2026-08-11T10:46:01.326715Z","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-11T10:46:03.605683Z","title":null,"venue":null,"work_id":"79ed45ef-cb26-40b8-81f5-bee4c49ec67d","year":2022},"citing_paper":{"arxiv_id":"2412.16323","last_updated":"2025-05-19T02:27:58Z","snapshot_observed_at":"2026-08-11T10:39:21.964412Z","submitted_at":"2024-12-20T20:22:11Z","title":"Optimizing Queries with Many-to-Many Joins","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T10:46:01.331006Z"},"links":{"citing_paper":"/paper/2412.16323"},"observation_digest":"sha256:8e7fbd7d63dd7ec599aead38bb33887372ae97983d592a2af58f4361b45ff262","observation_id":"5270cd0d-6b16-419b-b06e-ae76e3db129f","resolution":{"observed_at":"2026-08-11T10:46:03.610403Z","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-11T10:46:03.591723Z","title":null,"venue":null,"work_id":"3d27bc5a-19a1-4e1f-baf5-97df35dfcd92","year":2017},"citing_paper":{"arxiv_id":"2412.16323","last_updated":"2025-05-19T02:27:58Z","snapshot_observed_at":"2026-08-11T10:39:21.964412Z","submitted_at":"2024-12-20T20:22:11Z","title":"Optimizing Queries with Many-to-Many Joins","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T10:46:01.335285Z"},"links":{"citing_paper":"/paper/2412.16323"},"observation_digest":"sha256:e05def349f4711d0d2154ed58c466fae7b4e8e963b621ef328b2808b3caa8a45","observation_id":"6556e921-9222-489a-a179-f130ff5c2779","resolution":{"observed_at":"2026-08-11T10:46:03.596157Z","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-11T10:46:01.339519Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2412.16323","last_updated":"2025-05-19T02:27:58Z","snapshot_observed_at":"2026-08-11T10:39:21.964412Z","submitted_at":"2024-12-20T20:22:11Z","title":"Optimizing Queries with Many-to-Many Joins","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T10:46:01.339519Z"},"links":{"citing_paper":"/paper/2412.16323"},"observation_digest":"sha256:fd9f75e20239900194c308925701cbbeb8c9f963eaca3cea685564e222bd656a","observation_id":"e295e3b6-6999-47e3-9516-b37a26b3b223","resolution":{"observed_at":"2026-08-11T10:46:01.339519Z","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-11T10:46:03.577801Z","title":"Ives, and Vijayshankar Raman","venue":null,"work_id":"70fa0777-8ae3-4905-84df-46d0ba3a662c","year":2007},"citing_paper":{"arxiv_id":"2412.16323","last_updated":"2025-05-19T02:27:58Z","snapshot_observed_at":"2026-08-11T10:39:21.964412Z","submitted_at":"2024-12-20T20:22:11Z","title":"Optimizing Queries with Many-to-Many Joins","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T10:46:01.343994Z"},"links":{"citing_paper":"/paper/2412.16323"},"observation_digest":"sha256:fd5f96d8bac62bb44977a401c2572c92438b0cfb1315aaf40c0a16aabe8e0295","observation_id":"39f4e95f-643f-474c-96e5-4d5f836f6712","resolution":{"observed_at":"2026-08-11T10:46:03.582176Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-11T10:46:01.348270Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.16323","last_updated":"2025-05-19T02:27:58Z","snapshot_observed_at":"2026-08-11T10:39:21.964412Z","submitted_at":"2024-12-20T20:22:11Z","title":"Optimizing Queries with Many-to-Many Joins","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T10:46:01.348270Z"},"links":{"citing_paper":"/paper/2412.16323"},"observation_digest":"sha256:6f5501be6e31349a12621c3ff5938fa35633c2d5a3a071b5ddba7a81a899317f","observation_id":"8c23ea2d-0118-4812-a09f-63ae89d57775","resolution":{"observed_at":"2026-08-11T10:46:01.348270Z","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-11T10:46:01.352405Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.16323","last_updated":"2025-05-19T02:27:58Z","snapshot_observed_at":"2026-08-11T10:39:21.964412Z","submitted_at":"2024-12-20T20:22:11Z","title":"Optimizing Queries with Many-to-Many Joins","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T10:46:01.352405Z"},"links":{"citing_paper":"/paper/2412.16323"},"observation_digest":"sha256:3d4405e56759a1e53682ab97c2f3de9623caf94d9ee45c7c9ff2e79d13f88619","observation_id":"d5631a1e-8517-4410-8526-3af5d62a2dd3","resolution":{"observed_at":"2026-08-11T10:46:01.352405Z","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-11T10:46:01.356783Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.16323","last_updated":"2025-05-19T02:27:58Z","snapshot_observed_at":"2026-08-11T10:39:21.964412Z","submitted_at":"2024-12-20T20:22:11Z","title":"Optimizing Queries with Many-to-Many Joins","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T10:46:01.356783Z"},"links":{"citing_paper":"/paper/2412.16323"},"observation_digest":"sha256:ca92379d9ab1369cd6031c9da980fe0ecab21631794ead132fc5e10084285277","observation_id":"fb1be5f1-ffb7-492a-93d9-3688c8c8e41e","resolution":{"observed_at":"2026-08-11T10:46:01.356783Z","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-11T10:46:03.554298Z","title":"Freitag, Maximilian Bandle, Tobias Schmidt, Alfons Kemper, and Thomas Neumann","venue":null,"work_id":"5c5c85c1-1657-4ad4-b9b0-6cc9585a4330","year":2020},"citing_paper":{"arxiv_id":"2412.16323","last_updated":"2025-05-19T02:27:58Z","snapshot_observed_at":"2026-08-11T10:39:21.964412Z","submitted_at":"2024-12-20T20:22:11Z","title":"Optimizing Queries with Many-to-Many Joins","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T10:46:01.361156Z"},"links":{"citing_paper":"/paper/2412.16323"},"observation_digest":"sha256:23bd9a8b39f5355f21e44478413ef486b8f6a684a9710dfe6b2e1527ef1962a5","observation_id":"feabee3a-046e-453f-ae0b-f741ee84b445","resolution":{"observed_at":"2026-08-11T10:46:03.558732Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-11T10:46:03.540892Z","title":null,"venue":null,"work_id":"64ff8051-ca7d-4960-aeba-623f8ed88559","year":1998},"citing_paper":{"arxiv_id":"2412.16323","last_updated":"2025-05-19T02:27:58Z","snapshot_observed_at":"2026-08-11T10:39:21.964412Z","submitted_at":"2024-12-20T20:22:11Z","title":"Optimizing Queries with Many-to-Many Joins","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T10:46:01.365412Z"},"links":{"citing_paper":"/paper/2412.16323"},"observation_digest":"sha256:619005b69b9d93346f06bb4f92bf74bd7ce61219fda48da7ac7a94de28204ddd","observation_id":"378c4d56-0c48-410f-ad0b-98013f6fee91","resolution":{"observed_at":"2026-08-11T10:46:03.545129Z","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-11T10:46:03.526848Z","title":null,"venue":null,"work_id":"529d4070-3834-4b31-9877-da3122f99507","year":2024},"citing_paper":{"arxiv_id":"2412.16323","last_updated":"2025-05-19T02:27:58Z","snapshot_observed_at":"2026-08-11T10:39:21.964412Z","submitted_at":"2024-12-20T20:22:11Z","title":"Optimizing Queries with Many-to-Many Joins","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T10:46:01.369747Z"},"links":{"citing_paper":"/paper/2412.16323"},"observation_digest":"sha256:0387d7a420f14e8ef36cbd733ae445f9c6d119d08025143458635e9d5c808116","observation_id":"983061a4-d4cf-4aa1-be0b-39ac8b3a8da5","resolution":{"observed_at":"2026-08-11T10:46:03.531193Z","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-11T10:46:01.373910Z","title":"Hellerstein and Michael Stonebraker","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2412.16323","last_updated":"2025-05-19T02:27:58Z","snapshot_observed_at":"2026-08-11T10:39:21.964412Z","submitted_at":"2024-12-20T20:22:11Z","title":"Optimizing Queries with Many-to-Many Joins","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T10:46:01.373910Z"},"links":{"citing_paper":"/paper/2412.16323"},"observation_digest":"sha256:7045ca069474e2ef6a6fa3b5be528903ab4b59f5c566f8e81206afb472f581c2","observation_id":"89e0be38-46ee-4c2f-938d-354d03ce5b3f","resolution":{"observed_at":"2026-08-11T10:46:01.373910Z","resolver_source":null,"status":"malformed_identifier"},"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-11T10:46:01.377864Z","title":null,"venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2412.16323","last_updated":"2025-05-19T02:27:58Z","snapshot_observed_at":"2026-08-11T10:39:21.964412Z","submitted_at":"2024-12-20T20:22:11Z","title":"Optimizing Queries with Many-to-Many Joins","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T10:46:01.377864Z"},"links":{"citing_paper":"/paper/2412.16323"},"observation_digest":"sha256:09cb48afb4e8d91efe401bc190c8f9247ff6245a8f1d905769578da2f8eb1d38","observation_id":"3fea5d9d-9fc0-4180-85d2-9d24055897f0","resolution":{"observed_at":"2026-08-11T10:46:01.377864Z","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-11T10:46:01.381949Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.16323","last_updated":"2025-05-19T02:27:58Z","snapshot_observed_at":"2026-08-11T10:39:21.964412Z","submitted_at":"2024-12-20T20:22:11Z","title":"Optimizing Queries with Many-to-Many Joins","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T10:46:01.381949Z"},"links":{"citing_paper":"/paper/2412.16323"},"observation_digest":"sha256:8bef3396cb9df9c99a7a598bacc16a940ad17ecc8541d11125aff904793721ee","observation_id":"ba50b995-1dbf-4091-b671-dbc97d4d6805","resolution":{"observed_at":"2026-08-11T10:46:01.381949Z","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-11T10:46:03.513622Z","title":null,"venue":null,"work_id":"22f34d71-a174-44d7-bf88-1357fd0535f6","year":2025},"citing_paper":{"arxiv_id":"2412.16323","last_updated":"2025-05-19T02:27:58Z","snapshot_observed_at":"2026-08-11T10:39:21.964412Z","submitted_at":"2024-12-20T20:22:11Z","title":"Optimizing Queries with Many-to-Many Joins","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T10:46:01.385937Z"},"links":{"citing_paper":"/paper/2412.16323"},"observation_digest":"sha256:5bc1bf104afe58ab9c172084fdca36564e2bfbc35ec9d7050142ab93d86ecdbf","observation_id":"44f54e5e-e844-4049-ab76-d4479d058cd4","resolution":{"observed_at":"2026-08-11T10:46:03.517963Z","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-11T10:46:01.390035Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.16323","last_updated":"2025-05-19T02:27:58Z","snapshot_observed_at":"2026-08-11T10:39:21.964412Z","submitted_at":"2024-12-20T20:22:11Z","title":"Optimizing Queries with Many-to-Many Joins","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T10:46:01.390035Z"},"links":{"citing_paper":"/paper/2412.16323"},"observation_digest":"sha256:0c9dde5bfa995fb0b63810cbb72802afa774b0a393e39669fd8ecf53518981ea","observation_id":"769c42d4-bba8-40c7-837b-860e3e039511","resolution":{"observed_at":"2026-08-11T10:46:01.390035Z","resolver_source":null,"status":"malformed_identifier"},"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-11T10:46:03.499944Z","title":null,"venue":null,"work_id":"79dabf7c-a2e3-42e3-885b-0bb8b9bff8fc","year":1999},"citing_paper":{"arxiv_id":"2412.16323","last_updated":"2025-05-19T02:27:58Z","snapshot_observed_at":"2026-08-11T10:39:21.964412Z","submitted_at":"2024-12-20T20:22:11Z","title":"Optimizing Queries with Many-to-Many Joins","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T10:46:01.394024Z"},"links":{"citing_paper":"/paper/2412.16323"},"observation_digest":"sha256:eb171f85d2d0c0159ad5514fb50ecc7d056e8623acc137c50c9626e6872f0693","observation_id":"d7df480e-7857-4297-ba89-9bb25b31199f","resolution":{"observed_at":"2026-08-11T10:46:03.504648Z","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-11T10:46:03.486207Z","title":null,"venue":null,"work_id":"68b2823a-2476-4411-9fab-3ebcad4f6ba0","year":1986},"citing_paper":{"arxiv_id":"2412.16323","last_updated":"2025-05-19T02:27:58Z","snapshot_observed_at":"2026-08-11T10:39:21.964412Z","submitted_at":"2024-12-20T20:22:11Z","title":"Optimizing Queries with Many-to-Many Joins","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T10:46:01.398164Z"},"links":{"citing_paper":"/paper/2412.16323"},"observation_digest":"sha256:994bc98238fc99aeeaf4d031787a1272bb9ddf9b4a425c25060a3bc001cef7e9","observation_id":"47427975-6921-4315-8f2a-c628c5710471","resolution":{"observed_at":"2026-08-11T10:46:03.490598Z","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":"10.1145/3446980","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:46:01.623562Z","title":null,"venue":null,"work_id":"80ffd681-44c0-424a-9cc5-509b2e47dbfe","year":2021},"citing_paper":{"arxiv_id":"2412.16323","last_updated":"2025-05-19T02:27:58Z","snapshot_observed_at":"2026-08-11T10:39:21.964412Z","submitted_at":"2024-12-20T20:22:11Z","title":"Optimizing Queries with Many-to-Many Joins","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T10:46:01.402380Z"},"links":{"citing_paper":"/paper/2412.16323"},"observation_digest":"sha256:fc3b0be476d10b6a514917c68f3f76727963bdc8457126c22befa5e1cd9a3a04","observation_id":"2fad1f41-889d-4617-85a7-ff6269892cd5","resolution":{"observed_at":"2026-08-11T10:46:01.628415Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:46:01.406625Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.16323","last_updated":"2025-05-19T02:27:58Z","snapshot_observed_at":"2026-08-11T10:39:21.964412Z","submitted_at":"2024-12-20T20:22:11Z","title":"Optimizing Queries with Many-to-Many Joins","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T10:46:01.406625Z"},"links":{"citing_paper":"/paper/2412.16323"},"observation_digest":"sha256:aba777290335c7daf80b029355c3a1c1953053ab9ac88ca1c965a6107011c86b","observation_id":"c61f4ca0-e43e-4d82-8ce5-668ae6e3c7fd","resolution":{"observed_at":"2026-08-11T10:46:01.406625Z","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-11T10:46:03.472905Z","title":null,"venue":null,"work_id":"e1a5a1c7-b333-430a-9ec8-e829e6d62232","year":2009},"citing_paper":{"arxiv_id":"2412.16323","last_updated":"2025-05-19T02:27:58Z","snapshot_observed_at":"2026-08-11T10:39:21.964412Z","submitted_at":"2024-12-20T20:22:11Z","title":"Optimizing Queries with Many-to-Many Joins","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T10:46:01.410952Z"},"links":{"citing_paper":"/paper/2412.16323"},"observation_digest":"sha256:165ede9127edb3e2390eaf2907bc9e530f737e3df574bda73ee7a01fc8873055","observation_id":"95bdff31-9f79-4e37-b437-2c3b641b7d03","resolution":{"observed_at":"2026-08-11T10:46:03.477238Z","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-11T10:46:03.459212Z","title":null,"venue":null,"work_id":"103f7a2e-7f3d-494d-b6f5-400d48fb99b9","year":2018},"citing_paper":{"arxiv_id":"2412.16323","last_updated":"2025-05-19T02:27:58Z","snapshot_observed_at":"2026-08-11T10:39:21.964412Z","submitted_at":"2024-12-20T20:22:11Z","title":"Optimizing Queries with Many-to-Many Joins","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-11T10:46:01.414970Z"},"links":{"citing_paper":"/paper/2412.16323"},"observation_digest":"sha256:a1c129f9bc90e2714d9160f352793623220dbefe3be9c68d5d8e7c98f96634f5","observation_id":"c62723ef-1c23-4573-8cca-614aca7b84f6","resolution":{"observed_at":"2026-08-11T10:46:03.463680Z","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-11T10:46:01.419276Z","title":"Ngo, Ely Porat, Christopher Ré, and Atri Rudra","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.16323","last_updated":"2025-05-19T02:27:58Z","snapshot_observed_at":"2026-08-11T10:39:21.964412Z","submitted_at":"2024-12-20T20:22:11Z","title":"Optimizing Queries with Many-to-Many Joins","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-11T10:46:01.419276Z"},"links":{"citing_paper":"/paper/2412.16323"},"observation_digest":"sha256:4eb6f0ae04ad1cc603a5f82aa3a64644b546df23938e609d86ade7538d3e0ff1","observation_id":"98281a57-ecc4-46ca-9cb9-3abed4f465fc","resolution":{"observed_at":"2026-08-11T10:46:01.419276Z","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-11T10:46:01.423587Z","title":"Ngo, Christopher Ré, and Atri Rudra","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2412.16323","last_updated":"2025-05-19T02:27:58Z","snapshot_observed_at":"2026-08-11T10:39:21.964412Z","submitted_at":"2024-12-20T20:22:11Z","title":"Optimizing Queries with Many-to-Many Joins","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-11T10:46:01.423587Z"},"links":{"citing_paper":"/paper/2412.16323"},"observation_digest":"sha256:bcc7646cca86ef2615ec1342759bb24391010d5dd0118a0f107233e3f4774ba6","observation_id":"43ebc790-9c04-4607-9ad3-e9643b45e8b1","resolution":{"observed_at":"2026-08-11T10:46:01.423587Z","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-11T10:46:01.427665Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2412.16323","last_updated":"2025-05-19T02:27:58Z","snapshot_observed_at":"2026-08-11T10:39:21.964412Z","submitted_at":"2024-12-20T20:22:11Z","title":"Optimizing Queries with Many-to-Many Joins","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-11T10:46:01.427665Z"},"links":{"citing_paper":"/paper/2412.16323"},"observation_digest":"sha256:2c8c106a1fa054e27b3147fc1085729917b92238ca3197aef1d84a9039249324","observation_id":"a560e3d0-44ac-4fe6-9717-28d273f07a39","resolution":{"observed_at":"2026-08-11T10:46:01.427665Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1104.0867","last_updated":"2011-04-05T15:09:09Z","snapshot_observed_at":"2026-07-06T02:25:53.517518Z","submitted_at":"2011-04-05T15:09:09Z","title":"Factorised Representations of Query Results","version":1},"cited_work":{"arxiv_id":"1104.0867","doi":null,"metadata_source":"pith","pith_arxiv_id":"1104.0867","snapshot_observed_at":"2026-08-11T10:46:02.326192Z","title":"Factorised Representations of Query Results","venue":"cs.DB","work_id":"9fbb6736-5020-42e4-bb5a-07a88caedb6c","year":2011},"citing_paper":{"arxiv_id":"2412.16323","last_updated":"2025-05-19T02:27:58Z","snapshot_observed_at":"2026-08-11T10:39:21.964412Z","submitted_at":"2024-12-20T20:22:11Z","title":"Optimizing Queries with Many-to-Many Joins","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-11T10:46:01.431888Z"},"links":{"cited_paper":"/paper/1104.0867","citing_paper":"/paper/2412.16323"},"observation_digest":"sha256:c24b3fc14923c1eb980e293edfd109ccac34c80ea51dc3d48dfdca744114be58","observation_id":"1c31b1fa-e7d1-416d-a4ac-cce0101eff33","resolution":{"observed_at":"2026-08-11T10:46:02.331304Z","resolver_source":"local_arxiv","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:46:01.436473Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2412.16323","last_updated":"2025-05-19T02:27:58Z","snapshot_observed_at":"2026-08-11T10:39:21.964412Z","submitted_at":"2024-12-20T20:22:11Z","title":"Optimizing Queries with Many-to-Many Joins","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-11T10:46:01.436473Z"},"links":{"citing_paper":"/paper/2412.16323"},"observation_digest":"sha256:a7c3c81fe44f6ba151d2943e76847f59d31054d527de7d50d97c52671f3683ec","observation_id":"112095a7-0859-43e1-9472-6478c13cab2d","resolution":{"observed_at":"2026-08-11T10:46:01.436473Z","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-11T10:46:03.445413Z","title":null,"venue":null,"work_id":"5b2fee2d-70dc-4c7c-8b69-81b8e0221a95","year":2015},"citing_paper":{"arxiv_id":"2412.16323","last_updated":"2025-05-19T02:27:58Z","snapshot_observed_at":"2026-08-11T10:39:21.964412Z","submitted_at":"2024-12-20T20:22:11Z","title":"Optimizing Queries with Many-to-Many Joins","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-11T10:46:01.440614Z"},"links":{"citing_paper":"/paper/2412.16323"},"observation_digest":"sha256:aec2e5a5661aeaebb87a6225a6bb0a72081a6b5c4c73031d12bbba57d81ff279","observation_id":"d580894f-50ea-462d-9641-3d97f8489330","resolution":{"observed_at":"2026-08-11T10:46:03.449970Z","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-11T10:46:01.444930Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2412.16323","last_updated":"2025-05-19T02:27:58Z","snapshot_observed_at":"2026-08-11T10:39:21.964412Z","submitted_at":"2024-12-20T20:22:11Z","title":"Optimizing Queries with Many-to-Many Joins","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-11T10:46:01.444930Z"},"links":{"citing_paper":"/paper/2412.16323"},"observation_digest":"sha256:a4c7f211c9258a6c345b6f85b3ef220503ab0fd24e9f63f16cbb9b08b53a03cf","observation_id":"4c7ecac9-587b-4834-8188-c706afa157d3","resolution":{"observed_at":"2026-08-11T10:46:01.444930Z","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-11T10:46:01.449210Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.16323","last_updated":"2025-05-19T02:27:58Z","snapshot_observed_at":"2026-08-11T10:39:21.964412Z","submitted_at":"2024-12-20T20:22:11Z","title":"Optimizing Queries with Many-to-Many Joins","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-11T10:46:01.449210Z"},"links":{"citing_paper":"/paper/2412.16323"},"observation_digest":"sha256:95e15d025ea95e6f3dffd97a9d8a50b5991b6578ef6900eba9d2b9227ba8db50","observation_id":"586815fc-89b6-4fe5-9de2-3613de014e4d","resolution":{"observed_at":"2026-08-11T10:46:01.449210Z","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-11T10:46:03.431172Z","title":null,"venue":null,"work_id":"fa01f96a-df0e-4748-890c-3c5904fead96","year":2003},"citing_paper":{"arxiv_id":"2412.16323","last_updated":"2025-05-19T02:27:58Z","snapshot_observed_at":"2026-08-11T10:39:21.964412Z","submitted_at":"2024-12-20T20:22:11Z","title":"Optimizing Queries with Many-to-Many Joins","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-11T10:46:01.453378Z"},"links":{"citing_paper":"/paper/2412.16323"},"observation_digest":"sha256:a48a03f7b65539c4aac9890c02bea6375a6c3774e7cd20a555cb6dd93f355e5a","observation_id":"c529590d-b2e4-47ba-8520-5faf52af322b","resolution":{"observed_at":"2026-08-11T10:46:03.436027Z","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-11T10:46:03.416858Z","title":null,"venue":null,"work_id":"4c5de61f-6ee6-4262-b10c-579d1a35714c","year":null},"citing_paper":{"arxiv_id":"2412.16323","last_updated":"2025-05-19T02:27:58Z","snapshot_observed_at":"2026-08-11T10:39:21.964412Z","submitted_at":"2024-12-20T20:22:11Z","title":"Optimizing Queries with Many-to-Many Joins","version":3},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-11T10:46:01.457490Z"},"links":{"citing_paper":"/paper/2412.16323"},"observation_digest":"sha256:8d04ab4ecfd2d189737a819e6166803a071e3a93160ae9392ef5b421cc6024bf","observation_id":"6185dcc1-574a-4767-96f7-bea3e4326086","resolution":{"observed_at":"2026-08-11T10:46:03.421347Z","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-11T10:46:03.402654Z","title":"Tamer Özsu","venue":null,"work_id":"5fda57e8-da79-457e-b79c-958bd9737c2a","year":2020},"citing_paper":{"arxiv_id":"2412.16323","last_updated":"2025-05-19T02:27:58Z","snapshot_observed_at":"2026-08-11T10:39:21.964412Z","submitted_at":"2024-12-20T20:22:11Z","title":"Optimizing Queries with Many-to-Many Joins","version":3},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-11T10:46:01.465954Z"},"links":{"citing_paper":"/paper/2412.16323"},"observation_digest":"sha256:5cdabd0e40652c4d742230829b2b5fdfe447be968350005263c900a1585d83e5","observation_id":"75d68585-76c7-407b-a0df-99a4dece7f79","resolution":{"observed_at":"2026-08-11T10:46:03.407348Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-11T10:46:03.387642Z","title":null,"venue":null,"work_id":"b71eb840-0a95-42e3-bdc3-51a4296f9124","year":null},"citing_paper":{"arxiv_id":"2412.16323","last_updated":"2025-05-19T02:27:58Z","snapshot_observed_at":"2026-08-11T10:39:21.964412Z","submitted_at":"2024-12-20T20:22:11Z","title":"Optimizing Queries with Many-to-Many Joins","version":3},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-11T10:46:01.470084Z"},"links":{"citing_paper":"/paper/2412.16323"},"observation_digest":"sha256:404c00a2ad26b40cdb311c4e2f50b43ff490b38a317e622025401a1da3d0dc65","observation_id":"b8a03d18-ee0a-4969-a27b-9e4689590f82","resolution":{"observed_at":"2026-08-11T10:46:03.392532Z","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-11T10:46:01.479051Z","title":"Steer, Dávid Szakállas, Altan Birler, Mingxi Wu, Yuchen Zhang, and Peter Boncz","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.16323","last_updated":"2025-05-19T02:27:58Z","snapshot_observed_at":"2026-08-11T10:39:21.964412Z","submitted_at":"2024-12-20T20:22:11Z","title":"Optimizing Queries with Many-to-Many Joins","version":3},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-11T10:46:01.479051Z"},"links":{"citing_paper":"/paper/2412.16323"},"observation_digest":"sha256:90f4713da31a6fdca14f13d05d59ca1ee1d9b8e38fa16eacc74cabae16e770d5","observation_id":"06763fd7-23b3-4858-aadc-5da283ce607c","resolution":{"observed_at":"2026-08-11T10:46:01.479051Z","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-11T10:46:01.483536Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.16323","last_updated":"2025-05-19T02:27:58Z","snapshot_observed_at":"2026-08-11T10:39:21.964412Z","submitted_at":"2024-12-20T20:22:11Z","title":"Optimizing Queries with Many-to-Many Joins","version":3},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-11T10:46:01.483536Z"},"links":{"citing_paper":"/paper/2412.16323"},"observation_digest":"sha256:b7df5506e1d4708c92e7d18cad3d558e16a217b7c5fdfd51e21666d079c04712","observation_id":"70215c85-c3de-479a-a5ad-b4a7c199700c","resolution":{"observed_at":"2026-08-11T10:46:01.483536Z","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-11T10:46:03.372410Z","title":"In Very Large Data Bases Conference","venue":null,"work_id":"09d78141-4783-4555-a9b6-3bc0c83bd12d","year":null},"citing_paper":{"arxiv_id":"2412.16323","last_updated":"2025-05-19T02:27:58Z","snapshot_observed_at":"2026-08-11T10:39:21.964412Z","submitted_at":"2024-12-20T20:22:11Z","title":"Optimizing Queries with Many-to-Many Joins","version":3},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-11T10:46:01.474277Z"},"links":{"citing_paper":"/paper/2412.16323"},"observation_digest":"sha256:580d1b1087d5732f5332b76e2c4819cc2d4722e2aa8bb5e47855bca58fbd18cf","observation_id":"fb6f706b-5bfd-4cb1-97a2-2fe3137383f6","resolution":{"observed_at":"2026-08-11T10:46:03.376988Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-11T10:46:01.493155Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.16323","last_updated":"2025-05-19T02:27:58Z","snapshot_observed_at":"2026-08-11T10:39:21.964412Z","submitted_at":"2024-12-20T20:22:11Z","title":"Optimizing Queries with Many-to-Many Joins","version":3},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-11T10:46:01.493155Z"},"links":{"citing_paper":"/paper/2412.16323"},"observation_digest":"sha256:a08a62b77bfb9565b2c302fd27960b136bc4cbec2a5d2217b19ed5053c77f0ac","observation_id":"d990cc2a-8f71-4116-a4a4-b3953f5cc8ab","resolution":{"observed_at":"2026-08-11T10:46:01.493155Z","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-11T10:46:01.497942Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2412.16323","last_updated":"2025-05-19T02:27:58Z","snapshot_observed_at":"2026-08-11T10:39:21.964412Z","submitted_at":"2024-12-20T20:22:11Z","title":"Optimizing Queries with Many-to-Many Joins","version":3},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-11T10:46:01.497942Z"},"links":{"citing_paper":"/paper/2412.16323"},"observation_digest":"sha256:9b64ab27dc12b8decdcb55e5a93ca82f0ccc9280d60a515575a887a82d5e2209","observation_id":"1efdbacb-f5aa-4f15-ac30-fad3cc19efe1","resolution":{"observed_at":"2026-08-11T10:46:01.497942Z","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-11T10:46:03.358332Z","title":null,"venue":null,"work_id":"0105de42-0da5-4169-9969-047243931a30","year":2019},"citing_paper":{"arxiv_id":"2412.16323","last_updated":"2025-05-19T02:27:58Z","snapshot_observed_at":"2026-08-11T10:39:21.964412Z","submitted_at":"2024-12-20T20:22:11Z","title":"Optimizing Queries with Many-to-Many Joins","version":3},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-11T10:46:01.488398Z"},"links":{"citing_paper":"/paper/2412.16323"},"observation_digest":"sha256:9e6f3d92cf3424392cb01c8fed37497172f7a53d614df511d480ddc64d9fa318","observation_id":"1bb4bd30-3795-4828-85ce-23e9db32a624","resolution":{"observed_at":"2026-08-11T10:46:03.362865Z","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-11T10:46:01.507092Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.16323","last_updated":"2025-05-19T02:27:58Z","snapshot_observed_at":"2026-08-11T10:39:21.964412Z","submitted_at":"2024-12-20T20:22:11Z","title":"Optimizing Queries with Many-to-Many Joins","version":3},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-11T10:46:01.507092Z"},"links":{"citing_paper":"/paper/2412.16323"},"observation_digest":"sha256:d2c717e4d0fba6e5a08e632429142b6dd831387e101000c08c84181d710cfec0","observation_id":"80f6d751-486a-443b-b6b1-9beea0f7e402","resolution":{"observed_at":"2026-08-11T10:46:01.507092Z","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-11T10:46:03.343969Z","title":null,"venue":null,"work_id":"f8aa7b9d-4b88-4eab-954a-983c71dec189","year":2012},"citing_paper":{"arxiv_id":"2412.16323","last_updated":"2025-05-19T02:27:58Z","snapshot_observed_at":"2026-08-11T10:39:21.964412Z","submitted_at":"2024-12-20T20:22:11Z","title":"Optimizing Queries with Many-to-Many Joins","version":3},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-11T10:46:01.511598Z"},"links":{"citing_paper":"/paper/2412.16323"},"observation_digest":"sha256:0172e815fa7fb701e11a54339010229a2d892be27729a7001aa8b5cd2e03cb95","observation_id":"577b6ffd-14be-43f6-94d3-fa8220ca2c80","resolution":{"observed_at":"2026-08-11T10:46:03.348521Z","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-11T10:46:01.502252Z","title":"Veldhuizen","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2412.16323","last_updated":"2025-05-19T02:27:58Z","snapshot_observed_at":"2026-08-11T10:39:21.964412Z","submitted_at":"2024-12-20T20:22:11Z","title":"Optimizing Queries with Many-to-Many Joins","version":3},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-11T10:46:01.502252Z"},"links":{"cited_paper":"/paper/1210.0481","citing_paper":"/paper/2412.16323"},"observation_digest":"sha256:ad05a83b3a0598a2a4a3f5dc2c4aeeb1432bf5644c8c1d1aa55427d7c43e0bf0","observation_id":"e762b962-a21f-4265-8776-23dc44370704","resolution":{"observed_at":"2026-08-11T10:46:01.502252Z","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-11T10:46:01.520840Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.16323","last_updated":"2025-05-19T02:27:58Z","snapshot_observed_at":"2026-08-11T10:39:21.964412Z","submitted_at":"2024-12-20T20:22:11Z","title":"Optimizing Queries with Many-to-Many Joins","version":3},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-11T10:46:01.520840Z"},"links":{"citing_paper":"/paper/2412.16323"},"observation_digest":"sha256:d31c79b2c5fe69ec344108a7fd5e9e791f5243864af9ef3b61bd4a7ddac2702b","observation_id":"2a233742-2894-43f7-805d-396931af8d90","resolution":{"observed_at":"2026-08-11T10:46:01.520840Z","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-11T10:46:03.330095Z","title":null,"venue":null,"work_id":"1b4a9d84-27a6-4fe0-b17c-424c1c1b16c9","year":1981},"citing_paper":{"arxiv_id":"2412.16323","last_updated":"2025-05-19T02:27:58Z","snapshot_observed_at":"2026-08-11T10:39:21.964412Z","submitted_at":"2024-12-20T20:22:11Z","title":"Optimizing Queries with Many-to-Many Joins","version":3},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-11T10:46:01.525193Z"},"links":{"citing_paper":"/paper/2412.16323"},"observation_digest":"sha256:c149c8f7699fb4183f038443ba40d3bcb78d02aba0b3496ebd86ef66cb8a6990","observation_id":"39930aed-5c36-46b9-bec3-76768ff76c81","resolution":{"observed_at":"2026-08-11T10:46:03.334444Z","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-11T10:46:01.516298Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.16323","last_updated":"2025-05-19T02:27:58Z","snapshot_observed_at":"2026-08-11T10:39:21.964412Z","submitted_at":"2024-12-20T20:22:11Z","title":"Optimizing Queries with Many-to-Many Joins","version":3},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-11T10:46:01.516298Z"},"links":{"citing_paper":"/paper/2412.16323"},"observation_digest":"sha256:cdea303aec761f2a01e0f6e6df2e5d26c3d6384faa14a3a8ec43f18ea7de9b93","observation_id":"d8f24192-2e4a-4c83-9ad5-a85f2fb89555","resolution":{"observed_at":"2026-08-11T10:46:01.516298Z","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-11T10:46:01.534063Z","title":"Patel, and Theodoros Rekatsinas","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.16323","last_updated":"2025-05-19T02:27:58Z","snapshot_observed_at":"2026-08-11T10:39:21.964412Z","submitted_at":"2024-12-20T20:22:11Z","title":"Optimizing Queries with Many-to-Many Joins","version":3},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-11T10:46:01.534063Z"},"links":{"citing_paper":"/paper/2412.16323"},"observation_digest":"sha256:f18629c66d43b3817e7d5927a13085182448ec8855ad74bfedcd26142ac39998","observation_id":"bcdc21cb-2c53-45b7-a295-5af5322a026f","resolution":{"observed_at":"2026-08-11T10:46:01.534063Z","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-11T10:46:01.538587Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.16323","last_updated":"2025-05-19T02:27:58Z","snapshot_observed_at":"2026-08-11T10:39:21.964412Z","submitted_at":"2024-12-20T20:22:11Z","title":"Optimizing Queries with Many-to-Many Joins","version":3},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-11T10:46:01.538587Z"},"links":{"citing_paper":"/paper/2412.16323"},"observation_digest":"sha256:f4cc1612d31f31821fc117f2ff740fb9debce97482daa616582caed8a97d15a2","observation_id":"615518dd-5d65-48e3-be5a-46303a82598e","resolution":{"observed_at":"2026-08-11T10:46:01.538587Z","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-11T10:46:03.314842Z","title":null,"venue":null,"work_id":"2c93c184-b1b3-46b4-ab22-6db003e10b8f","year":2014},"citing_paper":{"arxiv_id":"2412.16323","last_updated":"2025-05-19T02:27:58Z","snapshot_observed_at":"2026-08-11T10:39:21.964412Z","submitted_at":"2024-12-20T20:22:11Z","title":"Optimizing Queries with Many-to-Many Joins","version":3},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-11T10:46:01.529685Z"},"links":{"citing_paper":"/paper/2412.16323"},"observation_digest":"sha256:ee08b14cd2d5ede1b801daffceab8919f5886fc918d39479515dfa47171a0fb5","observation_id":"28f0e3d3-600d-46f4-833c-6a79b0f7c158","resolution":{"observed_at":"2026-08-11T10:46:03.320128Z","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-11T10:46:03.620102Z","title":"In Proceedings of the 1999 ACM SIGMOD international conference on Management of data","venue":null,"work_id":"7a585d29-dc3e-4a64-823c-cf397e889ff3","year":1999},"citing_paper":{"arxiv_id":"2412.16323","last_updated":"2025-05-19T02:27:58Z","snapshot_observed_at":"2026-08-11T10:39:21.964412Z","submitted_at":"2024-12-20T20:22:11Z","title":"Optimizing Queries with Many-to-Many Joins","version":3},"reference_index":1999,"source":"pdf_text","source_observed_at":"2026-08-11T10:46:01.303152Z"},"links":{"citing_paper":"/paper/2412.16323"},"observation_digest":"sha256:37d2d6b7b7cb806a6ebd54f12881fe0d43ab107dafa2a75c8b70f6a356b2a002","observation_id":"0a3b554c-0aa3-40aa-8aa2-863154771ae8","resolution":{"observed_at":"2026-08-11T10:46:03.624986Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"10.1109/icpp.2006.74","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:46:01.587364Z","title":"In 2006 International Conference on Parallel Pro- cessing (ICPP’06)","venue":null,"work_id":"200f2856-7739-42c6-b20a-282553253df5","year":2006},"citing_paper":{"arxiv_id":"2412.16323","last_updated":"2025-05-19T02:27:58Z","snapshot_observed_at":"2026-08-11T10:39:21.964412Z","submitted_at":"2024-12-20T20:22:11Z","title":"Optimizing Queries with Many-to-Many Joins","version":3},"reference_index":2006,"source":"pdf_text","source_observed_at":"2026-08-11T10:46:01.461629Z"},"links":{"citing_paper":"/paper/2412.16323"},"observation_digest":"sha256:9305ff198a5244b2f71f7bb1c773968257054d6e0e88da8740b3249d8c149f43","observation_id":"76560d9a-add4-4b89-84d8-568d5f10360c","resolution":{"observed_at":"2026-08-11T10:46:01.594453Z","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"}}],"paper":{"arxiv_id":"2412.16323","last_updated":"2025-05-19T02:27:58Z","latest_version":3,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-11T10:39:21.964412Z","submitted_at":"2024-12-20T20:22:11Z","title":"Optimizing Queries with Many-to-Many Joins"},"reference_resolution":{"displayed":57,"state_counts":{"malformed_identifier":2,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":44,"verified_exact":4,"verified_fuzzy":6},"total_outbound_references":57},"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 57 of 57 outbound references and 0 inbound Pith citation observations for arXiv:2412.16323."}