{"as_of":"2026-08-21T17:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:961caf1cef0fa42bbae5b107b5d6dc960927e979e91f8c875c5193e351dfbab8","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-21T06:32:19.484+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-14T04:19:01.264746Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2503.23404","last_updated":"2025-09-04T21:08:42Z","snapshot_observed_at":"2026-08-16T12:45:37.370720Z","submitted_at":"2025-03-30T11:22:59Z","title":"Multi-Pass Streaming Lower Bounds for Approximating Max-Cut","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.23404","snapshot_observed_at":"2026-08-04T07:22:17.259101Z","title":"Multi-pass streaming lower bounds for approximating max-cut","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.27012","last_updated":"2026-06-25T17:06:00Z","snapshot_observed_at":"2026-08-17T11:26:00.394367Z","submitted_at":"2025-10-30T21:24:51Z","title":"Unbounded-width CSPs are Untestable in a Sublinear Number of Queries","version":3},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-04T07:22:17.259101Z"},"links":{"cited_paper":"/paper/2503.23404","citing_paper":"/paper/2510.27012"},"observation_digest":"sha256:b22a5d38dcb30dbbb30f9e1a07dd94ec08c9681e1be012d7042726a28598d87c","observation_id":"eac557c7-4ea9-409f-b7f3-f744f6242cf8","resolution":{"observed_at":"2026-08-04T07:22:17.259101Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.23404","last_updated":"2025-09-04T21:08:42Z","snapshot_observed_at":"2026-08-16T12:45:37.370720Z","submitted_at":"2025-03-30T11:22:59Z","title":"Multi-Pass Streaming Lower Bounds for Approximating Max-Cut","version":2},"cited_work":{"arxiv_id":"2503.23404","doi":"10.48550/arxiv.2503.23404","metadata_source":"arxiv_reference","pith_arxiv_id":"2503.23404","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Multi-Pass Streaming Lower Bounds for Approx- imating Max-Cut","venue":"ArXiv.org","work_id":"d37249d1-8515-449a-b7ee-5ec2c1baa4c1","year":2025},"citing_paper":{"arxiv_id":"2512.19521","last_updated":"2026-04-12T22:11:56Z","snapshot_observed_at":"2026-07-06T22:39:48.048525Z","submitted_at":"2025-12-22T16:14:22Z","title":"Near-optimal streaming approximation for Max-DICUT in sublinear space using two passes","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-16T20:20:07.261099Z"},"links":{"cited_paper":"/paper/2503.23404","citing_paper":"/paper/2512.19521"},"observation_digest":"sha256:d66fe51b14f1b842f6147c0c4257a87c2eef20096273c9f966d2410c901c3f2b","observation_id":"ce3a77b1-58b4-4c04-a121-6372442155bb","resolution":{"observed_at":"2026-05-16T20:21:13.229064Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.23404","last_updated":"2025-09-04T21:08:42Z","snapshot_observed_at":"2026-08-16T12:45:37.370720Z","submitted_at":"2025-03-30T11:22:59Z","title":"Multi-Pass Streaming Lower Bounds for Approximating Max-Cut","version":2},"cited_work":{"arxiv_id":"2503.23404","doi":"10.48550/arxiv.2503.23404","metadata_source":"arxiv_reference","pith_arxiv_id":"2503.23404","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Multi-Pass Streaming Lower Bounds for Approx- imating Max-Cut","venue":"ArXiv.org","work_id":"d37249d1-8515-449a-b7ee-5ec2c1baa4c1","year":2025},"citing_paper":{"arxiv_id":"2604.07639","last_updated":"2026-04-08T22:55:59Z","snapshot_observed_at":"2026-08-10T22:30:32.102573Z","submitted_at":"2026-04-08T22:55:59Z","title":"Exponential quantum advantage in processing massive classical data","version":1},"reference_index":94,"source":"arxiv_source","source_observed_at":"2026-05-10T17:11:43.184192Z"},"links":{"cited_paper":"/paper/2503.23404","citing_paper":"/paper/2604.07639"},"observation_digest":"sha256:e2e7f30b41259507baddc90a30a86bf42171ebe10fd337f542f07b72f7e1ebd8","observation_id":"7bd572ed-dcc4-4ab5-a8fe-9aa27b817a0a","resolution":{"observed_at":"2026-05-11T07:26:00.192496Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.23404","last_updated":"2025-09-04T21:08:42Z","snapshot_observed_at":"2026-08-16T12:45:37.370720Z","submitted_at":"2025-03-30T11:22:59Z","title":"Multi-Pass Streaming Lower Bounds for Approximating Max-Cut","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.23404","snapshot_observed_at":"2026-08-14T04:19:01.264746Z","title":"Yumou Fei, Dor Minzer, Shuo Wang.https://arxiv.org/abs/2503.23404","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09538","last_updated":"2026-08-13T16:11:12Z","snapshot_observed_at":"2026-08-19T01:22:14.174611Z","submitted_at":"2026-08-10T12:36:16Z","title":"TCS-BENCH: Benchmarking State-of-the-Art Generative AI Theoretical Computer Science Research Ability","version":2},"reference_index":169,"source":"pdf_text","source_observed_at":"2026-08-14T04:19:01.264746Z"},"links":{"cited_paper":"/paper/2503.23404","citing_paper":"/paper/2608.09538"},"observation_digest":"sha256:819b822f581e89cfdadb3e8c6a99a7b81436102b6fca7abd9fc6e55bb32dfcda","observation_id":"5b5ee658-5e7f-46e9-b491-4aa887b3a3a7","resolution":{"observed_at":"2026-08-14T04:19:01.264746Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2503.23404/citation-record","integrity":"/paper/2503.23404/integrity","json":"/paper/2503.23404/citation-record.json","paper":"/paper/2503.23404"},"outbound":[],"paper":{"arxiv_id":"2503.23404","last_updated":"2025-09-04T21:08:42Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-16T12:45:37.370720Z","submitted_at":"2025-03-30T11:22:59Z","title":"Multi-Pass Streaming Lower Bounds for Approximating Max-Cut"},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2503.23404."}