{"as_of":"2026-08-08T05:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:512c32fa6df828538b18522879f0b850299b527337875af18d976abf8f38dc31","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-08T23:03:48.556087Z","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.190206Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1711.03860","last_updated":"2017-11-10T15:16:52Z","snapshot_observed_at":"2026-08-07T19:49:43.722169Z","submitted_at":"2017-11-10T15:16:52Z","title":"Size bounds and query plans for relational joins","version":1},"cited_work":{"arxiv_id":"1711.03860","doi":null,"metadata_source":"pith","pith_arxiv_id":"1711.03860","snapshot_observed_at":"2026-07-08T23:05:44.190206Z","title":"Size bounds and query plans for relational joins","venue":"cs.DB","work_id":"1baf61aa-904a-4544-958a-93403567d207","year":2017},"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":6,"source":"pdf_text","source_observed_at":"2026-07-08T23:03:48.556087Z"},"links":{"cited_paper":"/paper/1711.03860","citing_paper":"/paper/2607.05832"},"observation_digest":"sha256:5b3d560bbd7abde30d250b86a797247953112c8458a96c756679cf8be7b98584","observation_id":"5e87c9cc-0f0d-469d-8492-3f7a76c5dc77","resolution":{"observed_at":"2026-07-08T23:05:44.191912Z","resolver_source":"local_arxiv","status":"verified_exact"},"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/1711.03860/citation-record","integrity":"/paper/1711.03860/integrity","json":"/paper/1711.03860/citation-record.json","paper":"/paper/1711.03860"},"outbound":[],"paper":{"arxiv_id":"1711.03860","last_updated":"2017-11-10T15:16:52Z","latest_version":1,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-07T19:49:43.722169Z","submitted_at":"2017-11-10T15:16:52Z","title":"Size bounds and query plans for relational joins"},"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 1 inbound Pith citation observation for arXiv:1711.03860."}