{"as_of":"2026-08-20T02:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a295cacf80f54bd067b9aadc05ee2da8c5b546d858b96782ca30143c5152107f","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T23:23:48.567948Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-02T04:06:34.632759Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2109.02115","last_updated":"2021-09-05T16:22:55Z","snapshot_observed_at":"2026-08-16T17:58:44.818131Z","submitted_at":"2021-09-05T16:22:55Z","title":"On the query complexity of connectivity with global queries","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2109.02115","snapshot_observed_at":"2026-08-15T23:23:48.567948Z","title":"On the query complexity of connectivity with global queries","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.05009","last_updated":"2025-05-08T07:27:29Z","snapshot_observed_at":"2026-08-18T16:32:28.030296Z","submitted_at":"2025-05-08T07:27:29Z","title":"Learning Partitions with Optimal Query and Round Complexities","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-15T23:23:48.567948Z"},"links":{"cited_paper":"/paper/2109.02115","citing_paper":"/paper/2505.05009"},"observation_digest":"sha256:93d66d48a501863a0019e39d00fd79a1a46bb0cc944cea56ae65115ce42b0a9c","observation_id":"8459ad07-2c91-41aa-bee4-3d25b9e21270","resolution":{"observed_at":"2026-08-15T23:23:48.567948Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2109.02115","last_updated":"2021-09-05T16:22:55Z","snapshot_observed_at":"2026-08-16T17:58:44.818131Z","submitted_at":"2021-09-05T16:22:55Z","title":"On the query complexity of connectivity with global queries","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2109.02115","snapshot_observed_at":"2026-08-07T05:29:34.608425Z","title":"On the query complexity of connectivity with global queries","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.08405","last_updated":"2025-06-10T03:22:49Z","snapshot_observed_at":"2026-08-14T22:03:14.235477Z","submitted_at":"2025-06-10T03:22:49Z","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T05:29:34.608425Z"},"links":{"cited_paper":"/paper/2109.02115","citing_paper":"/paper/2506.08405"},"observation_digest":"sha256:d697eacb0d21988032382c03fc54bba75ddf2c1ebfd9200bea1d9cea0d4335a9","observation_id":"b12858ba-b8b0-43c9-af63-fc054416dbdc","resolution":{"observed_at":"2026-08-07T05:29:34.608425Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2109.02115","last_updated":"2021-09-05T16:22:55Z","snapshot_observed_at":"2026-08-16T17:58:44.818131Z","submitted_at":"2021-09-05T16:22:55Z","title":"On the query complexity of connectivity with global queries","version":1},"cited_work":{"arxiv_id":"2109.02115","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2109.02115","snapshot_observed_at":"2026-07-02T04:06:34.632759Z","title":"On the query complexity of connectivity with global queries.arXiv preprint arXiv:2109.02115, 2021","venue":null,"work_id":"a2110e42-f3f7-44bc-9769-f6046343bd71","year":2021},"citing_paper":{"arxiv_id":"2607.01216","last_updated":"2026-07-01T17:54:03Z","snapshot_observed_at":"2026-08-14T10:13:56.606954Z","submitted_at":"2026-07-01T17:54:03Z","title":"Query Complexity of Hypergraph Connectivity and Learnability using CUT Oracles","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-02T04:00:51.707120Z"},"links":{"cited_paper":"/paper/2109.02115","citing_paper":"/paper/2607.01216"},"observation_digest":"sha256:fc8d85d5617fb52519379b26dbbac5853371a7acbca0930ddfc6ee45f622cc13","observation_id":"50ca7307-287e-4379-addf-40dbf8908582","resolution":{"observed_at":"2026-07-02T04:06:34.634273Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2109.02115/citation-record","integrity":"/paper/2109.02115/integrity","json":"/paper/2109.02115/citation-record.json","paper":"/paper/2109.02115"},"outbound":[],"paper":{"arxiv_id":"2109.02115","last_updated":"2021-09-05T16:22:55Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-16T17:58:44.818131Z","submitted_at":"2021-09-05T16:22:55Z","title":"On the query complexity of connectivity with global queries"},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2109.02115."}