{"as_of":"2026-08-11T13:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4ebadf1fb22fdde5d0f5111c46986f8966b7b1489a8f6991c8ebcfdce607aa89","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T10:46:01.502252Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-08T23:05:44.183922Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"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":{"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-08T14:14:53.761849Z","title":"arXiv:1210.0481 [cs.DB] A Compiler for Operations on Relations with Bag Semantics 1:23 A PROOFS Lemma 5.1 (Floor function)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.06988","last_updated":"2025-02-10T19:29:15Z","snapshot_observed_at":"2026-08-09T21:27:15.370181Z","submitted_at":"2025-02-10T19:29:15Z","title":"A Compiler for Operations on Relations with Bag Semantics","version":1},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-08T14:14:53.761849Z"},"links":{"cited_paper":"/paper/1210.0481","citing_paper":"/paper/2502.06988"},"observation_digest":"sha256:0f2fc7cb76f4a494da9907597d5ee2b38a2fbb515d0eb465ac4dfee0926164ce","observation_id":"8a1e5d90-90d0-423c-b086-91dd6d3c5147","resolution":{"observed_at":"2026-08-08T14:14:53.761849Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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":{"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":"1210.0481","doi":null,"metadata_source":"pith","pith_arxiv_id":"1210.0481","snapshot_observed_at":"2026-07-08T23:05:44.183922Z","title":"Leapfrog Triejoin: a worst-case optimal join algorithm","venue":"cs.DB","work_id":"4d4f4c07-0ed9-4683-b485-b7ccb5aabe12","year":2012},"citing_paper":{"arxiv_id":"2607.05832","last_updated":"2026-07-07T04:48:06Z","snapshot_observed_at":"2026-08-06T20:28:14.825239Z","submitted_at":"2026-07-07T04:48:06Z","title":"BaCon: Efficient Batch Processing of Counting Queries [Full Version]","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-07-08T23:03:48.556087Z"},"links":{"cited_paper":"/paper/1210.0481","citing_paper":"/paper/2607.05832"},"observation_digest":"sha256:298adb4a1462f7501fcac8159c5d6d8269b789ad21b98ceb252a94c8e5916970","observation_id":"0944245e-1b9f-48bc-b205-d7ab602a1153","resolution":{"observed_at":"2026-07-08T23:05:44.185815Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/1210.0481/citation-record","integrity":"/paper/1210.0481/integrity","json":"/paper/1210.0481/citation-record.json","paper":"/paper/1210.0481"},"outbound":[],"paper":{"arxiv_id":"1210.0481","last_updated":"2013-12-20T20:21:03Z","latest_version":5,"primary_category":"cs.DB","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"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:1210.0481."}