{"as_of":"2026-08-18T03:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a0cd79354ef680cba7b23a7c3a38e28af2237a3d04ceeeeb66f50a7eb2a0098b","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-17T06:30:58.91139+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-10T21:29:25.070448Z","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-05-11T11:01:03.158352Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2407.06936","last_updated":"2024-07-09T15:13:20Z","snapshot_observed_at":"2026-08-17T01:53:08.213026Z","submitted_at":"2024-07-09T15:13:20Z","title":"Robust Partial Least Squares Using Low Rank and Sparse Decomposition","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.06936","snapshot_observed_at":"2026-08-10T21:29:25.070448Z","title":"Robust partial least squares using low rank and sparse decomposition,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.05487","last_updated":"2025-01-08T18:18:37Z","snapshot_observed_at":"2026-08-15T14:49:36.678425Z","submitted_at":"2025-01-08T18:18:37Z","title":"The Future of AI: Exploring the Potential of Large Concept Models","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-10T21:29:25.070448Z"},"links":{"cited_paper":"/paper/2407.06936","citing_paper":"/paper/2501.05487"},"observation_digest":"sha256:d972a6d4badec3b7afbe5f8003c06ca4f2d2e65f0b8afa6731c36339815f0b2a","observation_id":"b4f927b1-09ab-4cb6-bf13-9c9ebe9c214e","resolution":{"observed_at":"2026-08-10T21:29:25.070448Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.06936","last_updated":"2024-07-09T15:13:20Z","snapshot_observed_at":"2026-08-17T01:53:08.213026Z","submitted_at":"2024-07-09T15:13:20Z","title":"Robust Partial Least Squares Using Low Rank and Sparse Decomposition","version":1},"cited_work":{"arxiv_id":"2407.06936","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.06936","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Robust partial least squares using low rank and sparse decomposition","venue":null,"work_id":"6b00fbc1-2966-4a5b-85ee-21129a9029d5","year":2024},"citing_paper":{"arxiv_id":"2604.04442","last_updated":"2026-04-06T05:40:43Z","snapshot_observed_at":"2026-08-15T00:53:02.200550Z","submitted_at":"2026-04-06T05:40:43Z","title":"Explainable Autonomous Cyber Defense using Adversarial Multi-Agent Reinforcement Learning","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-10T20:15:46.454806Z"},"links":{"cited_paper":"/paper/2407.06936","citing_paper":"/paper/2604.04442"},"observation_digest":"sha256:a59d85472832c67075124fd61878322fa36e52094ab7d170577818f41973481d","observation_id":"056d45ed-19df-4084-a009-46f2feb4363a","resolution":{"observed_at":"2026-05-10T22:05:48.400394Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.06936","last_updated":"2024-07-09T15:13:20Z","snapshot_observed_at":"2026-08-17T01:53:08.213026Z","submitted_at":"2024-07-09T15:13:20Z","title":"Robust Partial Least Squares Using Low Rank and Sparse Decomposition","version":1},"cited_work":{"arxiv_id":"2407.06936","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.06936","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Robust partial least squares using low rank and sparse decomposition","venue":null,"work_id":"6b00fbc1-2966-4a5b-85ee-21129a9029d5","year":2024},"citing_paper":{"arxiv_id":"2604.10316","last_updated":"2026-04-11T18:47:54Z","snapshot_observed_at":"2026-08-11T06:10:50.133082Z","submitted_at":"2026-04-11T18:47:54Z","title":"Comparative Analysis of Large Language Models in Healthcare","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-10T15:33:59.591966Z"},"links":{"cited_paper":"/paper/2407.06936","citing_paper":"/paper/2604.10316"},"observation_digest":"sha256:57328fb11fe7746ed59726574c77435f79ab64bff53d003acedea63aebcaaff7","observation_id":"af093f1b-b2fc-4703-8666-11d1b82d21d0","resolution":{"observed_at":"2026-05-11T10:16:07.875714Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.06936","last_updated":"2024-07-09T15:13:20Z","snapshot_observed_at":"2026-08-17T01:53:08.213026Z","submitted_at":"2024-07-09T15:13:20Z","title":"Robust Partial Least Squares Using Low Rank and Sparse Decomposition","version":1},"cited_work":{"arxiv_id":"2407.06936","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.06936","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Robust partial least squares using low rank and sparse decomposition","venue":null,"work_id":"6b00fbc1-2966-4a5b-85ee-21129a9029d5","year":2024},"citing_paper":{"arxiv_id":"2605.01739","last_updated":"2026-05-03T06:37:43Z","snapshot_observed_at":"2026-08-16T23:06:07.728565Z","submitted_at":"2026-05-03T06:37:43Z","title":"AgenticVM: Agentic AI for Adaptive Software Vulnerability Management","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-05-10T15:14:04.838666Z"},"links":{"cited_paper":"/paper/2407.06936","citing_paper":"/paper/2605.01739"},"observation_digest":"sha256:37e7e166c2581c7f5971c8e269e25ee3475bd696a61336e581cefcb9697c2a19","observation_id":"e0d70aec-9a32-4461-a82e-fd23a855f2b4","resolution":{"observed_at":"2026-05-11T11:01:03.165507Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2407.06936/citation-record","integrity":"/paper/2407.06936/integrity","json":"/paper/2407.06936/citation-record.json","paper":"/paper/2407.06936"},"outbound":[],"paper":{"arxiv_id":"2407.06936","last_updated":"2024-07-09T15:13:20Z","latest_version":1,"primary_category":"eess.SP","snapshot_observed_at":"2026-08-17T01:53:08.213026Z","submitted_at":"2024-07-09T15:13:20Z","title":"Robust Partial Least Squares Using Low Rank and Sparse Decomposition"},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2407.06936."}