{"as_of":"2026-08-08T02:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:dfc4e197544405cda326be762604be803b6e061af0eec60ebca176576a173714","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-10T06:05:38.945129Z","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-10T06:06:50.403957Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1203.1952","last_updated":"2012-03-08T22:35:29Z","snapshot_observed_at":"2026-08-02T20:05:43.935458Z","submitted_at":"2012-03-08T22:35:29Z","title":"Worst-case Optimal Join Algorithms","version":1},"cited_work":{"arxiv_id":"1203.1952","doi":null,"metadata_source":"pith","pith_arxiv_id":"1203.1952","snapshot_observed_at":"2026-07-10T06:06:50.403957Z","title":"Worst-case Optimal Join Algorithms","venue":"cs.DB","work_id":"01a5e290-ef04-43af-98ec-92e5caed0a12","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":56,"source":"pdf_text","source_observed_at":"2026-07-08T23:03:48.556087Z"},"links":{"cited_paper":"/paper/1203.1952","citing_paper":"/paper/2607.05832"},"observation_digest":"sha256:0a1ce0dc36fc084d578d5a6f42f4915607b14c00efd9e54f9add39e7eee2c776","observation_id":"04b8d886-d7b1-46be-9e90-f583f85f89e4","resolution":{"observed_at":"2026-07-08T23:05:44.194556Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1203.1952","last_updated":"2012-03-08T22:35:29Z","snapshot_observed_at":"2026-08-02T20:05:43.935458Z","submitted_at":"2012-03-08T22:35:29Z","title":"Worst-case Optimal Join Algorithms","version":1},"cited_work":{"arxiv_id":"1203.1952","doi":null,"metadata_source":"pith","pith_arxiv_id":"1203.1952","snapshot_observed_at":"2026-07-10T06:06:50.403957Z","title":"Worst-case Optimal Join Algorithms","venue":"cs.DB","work_id":"01a5e290-ef04-43af-98ec-92e5caed0a12","year":2012},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"cited_paper":"/paper/1203.1952","citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:f14522ab541c084811fef0105f6ba53e5f93aec15b08e95acd2ea5a9ed3e3f8f","observation_id":"96e8ff36-a9c0-4fdd-b018-73de5675dce7","resolution":{"observed_at":"2026-07-10T06:06:50.408367Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1203.1952/citation-record","integrity":"/paper/1203.1952/integrity","json":"/paper/1203.1952/citation-record.json","paper":"/paper/1203.1952"},"outbound":[],"paper":{"arxiv_id":"1203.1952","last_updated":"2012-03-08T22:35:29Z","latest_version":1,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-02T20:05:43.935458Z","submitted_at":"2012-03-08T22:35:29Z","title":"Worst-case Optimal Join Algorithms"},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1203.1952."}