{"as_of":"2026-08-18T18:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e5ffa2c8b5ebcf1264efafc1f32e57ecfb1a3ee8492a75d031e43f46d8e7ab24","coverage":[{"denominator":10,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":10,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T04:26:26.013208Z","state":"measured"},{"denominator":10,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":10,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2608.08238/citation-record","integrity":"/paper/2608.08238/integrity","json":"/paper/2608.08238/citation-record.json","paper":"/paper/2608.08238"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2607.28819","last_updated":"2026-07-30T20:21:49Z","snapshot_observed_at":"2026-08-18T16:47:22.345430Z","submitted_at":"2026-07-30T20:21:49Z","title":"A Matrix Factorization Approach in Turnstile Streaming","version":1},"cited_work":{"arxiv_id":"2607.28819","doi":"10.48550/arxiv.2607.28819","metadata_source":"pith","pith_arxiv_id":"2607.28819","snapshot_observed_at":"2026-08-11T06:16:19.390415Z","title":"A Matrix Factorization Approach in Turnstile Streaming","venue":"cs.DS","work_id":"56cef897-ceee-4427-8fb6-45a27d598c55","year":2026},"citing_paper":{"arxiv_id":"2608.08238","last_updated":"2026-08-06T17:46:47Z","snapshot_observed_at":"2026-08-14T22:37:50.018832Z","submitted_at":"2026-08-06T17:46:47Z","title":"A Near-Optimal Lower Bound for Prefix-Matrix Factorizations","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-11T04:26:25.924234Z"},"links":{"cited_paper":"/paper/2607.28819","citing_paper":"/paper/2608.08238"},"observation_digest":"sha256:8f374314ecc527008d61397260154602f1c6c2d7211c35682cfa90a20048c13e","observation_id":"b6cfe3d2-fc84-4214-9e95-2c82aa98d25b","resolution":{"observed_at":"2026-08-11T04:26:26.152534Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-15T00:38:15.688905+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-15T00:38:15.688905+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2607.28703","last_updated":"2026-08-06T12:24:59Z","snapshot_observed_at":"2026-08-09T23:12:24.025465Z","submitted_at":"2026-07-30T14:41:34Z","title":"Costs of Arbitrary Real Matrix Factorizations for Pure-DP Continual Counting","version":2},"cited_work":{"arxiv_id":"2607.28703","doi":"10.48550/arxiv.2607.28703","metadata_source":"pith","pith_arxiv_id":"2607.28703","snapshot_observed_at":"2026-08-11T06:16:19.390415Z","title":"Costs of Arbitrary Real Matrix Factorizations for Pure-DP Continual Counting","venue":"cs.CR","work_id":"c28c0687-7f6b-4eae-a50f-780449b8301b","year":2026},"citing_paper":{"arxiv_id":"2608.08238","last_updated":"2026-08-06T17:46:47Z","snapshot_observed_at":"2026-08-14T22:37:50.018832Z","submitted_at":"2026-08-06T17:46:47Z","title":"A Near-Optimal Lower Bound for Prefix-Matrix Factorizations","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-11T04:26:25.934161Z"},"links":{"cited_paper":"/paper/2607.28703","citing_paper":"/paper/2608.08238"},"observation_digest":"sha256:9a28f02bb080a5f9feb7610da4d584f571117770b6743e5e41171f4a6fa44482","observation_id":"299a0686-9890-4469-804a-84e2e995cc0b","resolution":{"observed_at":"2026-08-11T04:26:26.111470Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-15T00:38:15.801718+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-15T00:38:15.801718+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T04:26:26.361234Z","title":"Thompson , title =","venue":null,"work_id":"cb2595c5-435e-4f82-bcc7-dc5078341836","year":null},"citing_paper":{"arxiv_id":"2608.08238","last_updated":"2026-08-06T17:46:47Z","snapshot_observed_at":"2026-08-14T22:37:50.018832Z","submitted_at":"2026-08-06T17:46:47Z","title":"A Near-Optimal Lower Bound for Prefix-Matrix Factorizations","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-11T04:26:25.946509Z"},"links":{"citing_paper":"/paper/2608.08238"},"observation_digest":"sha256:4dc365b8b1300a8606edbe84d61d8cb4b544b527ac56a9d8a6fc5d7cd392eb00","observation_id":"994e14fc-3136-40fe-841b-63d0d710beba","resolution":{"observed_at":"2026-08-11T04:26:26.368264Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T04:26:26.338946Z","title":"Fredman , title =","venue":null,"work_id":"02b4a14d-aaaf-4b62-b56b-56d26eebc44b","year":1982},"citing_paper":{"arxiv_id":"2608.08238","last_updated":"2026-08-06T17:46:47Z","snapshot_observed_at":"2026-08-14T22:37:50.018832Z","submitted_at":"2026-08-06T17:46:47Z","title":"A Near-Optimal Lower Bound for Prefix-Matrix Factorizations","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-11T04:26:25.958182Z"},"links":{"citing_paper":"/paper/2608.08238"},"observation_digest":"sha256:c9d35a263473ae924dca9c882a477af801fc5b2de0ac69043249215bf086e00f","observation_id":"10a0e083-66af-4599-bd08-d9abe12a6811","resolution":{"observed_at":"2026-08-11T04:26:26.344961Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T04:26:26.309164Z","title":"Muthukrishnan , title =","venue":null,"work_id":"fe4ce439-8d5a-4c9d-b424-b80eff7cf0ef","year":2005},"citing_paper":{"arxiv_id":"2608.08238","last_updated":"2026-08-06T17:46:47Z","snapshot_observed_at":"2026-08-14T22:37:50.018832Z","submitted_at":"2026-08-06T17:46:47Z","title":"A Near-Optimal Lower Bound for Prefix-Matrix Factorizations","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-11T04:26:25.965644Z"},"links":{"citing_paper":"/paper/2608.08238"},"observation_digest":"sha256:90a73e2d447a28518093a631cfbd8c3a5f0678da7c8d188f1ba60c2ce8f250b1","observation_id":"be0faac1-7c18-4e24-acef-0508c11c45f5","resolution":{"observed_at":"2026-08-11T04:26:26.316157Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T04:26:26.285669Z","title":"Proceedings of the 2013","venue":null,"work_id":"996148cd-8c5b-4f51-8c67-68595c1c8ed2","year":2013},"citing_paper":{"arxiv_id":"2608.08238","last_updated":"2026-08-06T17:46:47Z","snapshot_observed_at":"2026-08-14T22:37:50.018832Z","submitted_at":"2026-08-06T17:46:47Z","title":"A Near-Optimal Lower Bound for Prefix-Matrix Factorizations","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-11T04:26:25.973652Z"},"links":{"citing_paper":"/paper/2608.08238"},"observation_digest":"sha256:b792f955e5cdf9483c147f8bfed0186dca5a974da1820446659c5b59dab31db0","observation_id":"5cc3a3ed-e801-467f-8f27-66ed28631ccc","resolution":{"observed_at":"2026-08-11T04:26:26.292845Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T04:26:26.259179Z","title":null,"venue":null,"work_id":"0946c649-3c05-4713-b6c7-cd2804f99bbc","year":2016},"citing_paper":{"arxiv_id":"2608.08238","last_updated":"2026-08-06T17:46:47Z","snapshot_observed_at":"2026-08-14T22:37:50.018832Z","submitted_at":"2026-08-06T17:46:47Z","title":"A Near-Optimal Lower Bound for Prefix-Matrix Factorizations","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-11T04:26:25.982356Z"},"links":{"citing_paper":"/paper/2608.08238"},"observation_digest":"sha256:18e8fad7b5acde76f00b47c49f4a05c338fe00c17191b272bbd43a140e278cf7","observation_id":"fbdfef67-8157-40dc-b820-207358814fa9","resolution":{"observed_at":"2026-08-11T04:26:26.266192Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T04:26:26.232148Z","title":"Rothblum , title =","venue":null,"work_id":"e0b5d3cb-b65f-451d-be9b-9c60df42a874","year":2010},"citing_paper":{"arxiv_id":"2608.08238","last_updated":"2026-08-06T17:46:47Z","snapshot_observed_at":"2026-08-14T22:37:50.018832Z","submitted_at":"2026-08-06T17:46:47Z","title":"A Near-Optimal Lower Bound for Prefix-Matrix Factorizations","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-11T04:26:25.991166Z"},"links":{"citing_paper":"/paper/2608.08238"},"observation_digest":"sha256:4efb25a8503834612008fbc0649719685e9aff23996ec77552f00cb54aa9d731","observation_id":"74b5b5da-070a-4a04-bf65-24ad1cef74ae","resolution":{"observed_at":"2026-08-11T04:26:26.240515Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T04:26:26.207445Z","title":"Hubert Chan and Elaine Shi and Dawn Song , title =","venue":null,"work_id":"0e53940f-cc0a-4b21-8a3d-34d805cbf5e4","year":2011},"citing_paper":{"arxiv_id":"2608.08238","last_updated":"2026-08-06T17:46:47Z","snapshot_observed_at":"2026-08-14T22:37:50.018832Z","submitted_at":"2026-08-06T17:46:47Z","title":"A Near-Optimal Lower Bound for Prefix-Matrix Factorizations","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-11T04:26:26.001545Z"},"links":{"citing_paper":"/paper/2608.08238"},"observation_digest":"sha256:b0fb04900a0030f164c0563db62e229948d94e11281f017c75c18ad6bc4bfbe3","observation_id":"aae018ca-9230-41a4-a93d-5d1793441b86","resolution":{"observed_at":"2026-08-11T04:26:26.213710Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T04:26:26.169109Z","title":null,"venue":null,"work_id":"906cb92b-9724-42ec-8814-fd739b4a013b","year":2015},"citing_paper":{"arxiv_id":"2608.08238","last_updated":"2026-08-06T17:46:47Z","snapshot_observed_at":"2026-08-14T22:37:50.018832Z","submitted_at":"2026-08-06T17:46:47Z","title":"A Near-Optimal Lower Bound for Prefix-Matrix Factorizations","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-11T04:26:26.013208Z"},"links":{"citing_paper":"/paper/2608.08238"},"observation_digest":"sha256:d61d4fdc3e38c60213db4b364be91330450d3d86cb4616e77902ba9b0310bad8","observation_id":"8cf0de63-bdf6-42d3-b298-01a92abe6884","resolution":{"observed_at":"2026-08-11T04:26:26.180242Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.08238","last_updated":"2026-08-06T17:46:47Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-14T22:37:50.018832Z","submitted_at":"2026-08-06T17:46:47Z","title":"A Near-Optimal Lower Bound for Prefix-Matrix Factorizations"},"reference_resolution":{"displayed":10,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":2,"verified_exact":1,"verified_fuzzy":6},"total_outbound_references":10},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 10 of 10 outbound references and 0 inbound Pith citation observations for arXiv:2608.08238."}