{"as_of":"2026-08-17T01:19:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b4589214e3bc2f1d4fe75407cff0e092a709f9bde3c6b9c61eab6676fb0a4551","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-16T06:30:59.297886+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-08-12T04:57:00.702736Z","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:36:35.995112Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2408.15434","last_updated":"2024-08-27T22:34:17Z","snapshot_observed_at":"2026-08-17T00:01:11.933229Z","submitted_at":"2024-08-27T22:34:17Z","title":"Weighted Matching in the Random-Order Streaming and Robust Communication Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.15434","snapshot_observed_at":"2026-08-12T04:57:00.702736Z","title":"Weighted matching in the random-order streaming and robust communication models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.01143","last_updated":"2024-12-06T18:32:32Z","snapshot_observed_at":"2026-08-12T04:36:42.997990Z","submitted_at":"2024-12-02T05:38:43Z","title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-12T04:57:00.702736Z"},"links":{"cited_paper":"/paper/2408.15434","citing_paper":"/paper/2412.01143"},"observation_digest":"sha256:6174d4ceec70e3f880a63d7685096fa741344241406f4d4fea7cb410e13d9851","observation_id":"0de2ebeb-7335-446b-8717-8acd0d072c79","resolution":{"observed_at":"2026-08-12T04:57:00.702736Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.15434","last_updated":"2024-08-27T22:34:17Z","snapshot_observed_at":"2026-08-17T00:01:11.933229Z","submitted_at":"2024-08-27T22:34:17Z","title":"Weighted Matching in the Random-Order Streaming and Robust Communication Models","version":1},"cited_work":{"arxiv_id":"2408.15434","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2408.15434","snapshot_observed_at":"2026-07-02T04:36:35.995112Z","title":"arXiv preprint arXiv:2408.15434 , year=","venue":null,"work_id":"4c9de5ac-7aef-419e-80d9-2183e405cafd","year":null},"citing_paper":{"arxiv_id":"2607.00843","last_updated":"2026-07-01T12:09:41Z","snapshot_observed_at":"2026-08-09T14:20:47.096589Z","submitted_at":"2026-07-01T12:09:41Z","title":"Submodular Maximization over Many Matroids via Ordered Local Search","version":1},"reference_index":110,"source":"arxiv_source","source_observed_at":"2026-07-02T04:31:33.375845Z"},"links":{"cited_paper":"/paper/2408.15434","citing_paper":"/paper/2607.00843"},"observation_digest":"sha256:37e2ca30ee9e3438ee512c043d95e0053bda116d36f1f60ea398ce20955b360c","observation_id":"b5c409a0-de1f-4ccc-ab0f-53774640d12a","resolution":{"observed_at":"2026-07-02T04:36:35.996641Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2408.15434/citation-record","integrity":"/paper/2408.15434/integrity","json":"/paper/2408.15434/citation-record.json","paper":"/paper/2408.15434"},"outbound":[],"paper":{"arxiv_id":"2408.15434","last_updated":"2024-08-27T22:34:17Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-17T00:01:11.933229Z","submitted_at":"2024-08-27T22:34:17Z","title":"Weighted Matching in the Random-Order Streaming and Robust Communication Models"},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2408.15434."}