{"as_of":"2026-08-19T17:19:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6904c1385db5c74b9e06ab2f40ebbdbcc99e0e6282882cb61d2b3b43f8459979","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-14T05:31:33.092441Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-14T05:30:13.952765Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1304.0480","last_updated":"2013-03-29T04:35:58Z","snapshot_observed_at":"2026-08-15T00:23:17.661012Z","submitted_at":"2013-03-29T04:35:58Z","title":"A problem dependent analysis of SOCP algorithms in noisy compressed sensing","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1304.0480","snapshot_observed_at":"2026-08-14T05:31:33.092441Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1909.01175","last_updated":"2019-09-03T13:43:42Z","snapshot_observed_at":"2026-08-17T04:44:01.919033Z","submitted_at":"2019-09-03T13:43:42Z","title":"Controlled Loosening-up (CLuP) -- achieving exact MIMO ML in polynomial time","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T05:31:33.092441Z"},"links":{"cited_paper":"/paper/1304.0480","citing_paper":"/paper/1909.01175"},"observation_digest":"sha256:1238be3787495ed70c4973694d468eec4a6aabb2c041c800644ea6badf73e2f1","observation_id":"02d3d4b2-eaef-4c3e-87dd-2b9fb605f0f7","resolution":{"observed_at":"2026-08-14T05:31:33.092441Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1304.0480","last_updated":"2013-03-29T04:35:58Z","snapshot_observed_at":"2026-08-15T00:23:17.661012Z","submitted_at":"2013-03-29T04:35:58Z","title":"A problem dependent analysis of SOCP algorithms in noisy compressed sensing","version":1},"cited_work":{"arxiv_id":"1304.0480","doi":null,"metadata_source":"pith","pith_arxiv_id":"1304.0480","snapshot_observed_at":"2026-08-14T05:30:13.952765Z","title":"A problem dependent analysis of SOCP algorithms in noisy compressed sensing","venue":"cs.IT","work_id":"b8b91071-bf54-49a5-83e1-297e0326fa07","year":2013},"citing_paper":{"arxiv_id":"1909.01190","last_updated":"2019-09-04T11:14:52Z","snapshot_observed_at":"2026-08-18T22:41:13.280317Z","submitted_at":"2019-09-03T13:59:06Z","title":"Complexity analysis of the Controlled Loosening-up (CLuP) algorithm","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T05:30:13.745112Z"},"links":{"cited_paper":"/paper/1304.0480","citing_paper":"/paper/1909.01190"},"observation_digest":"sha256:cb978ebfeff6387ec8947bb1fd93fe934838527d9489b9f1c34c95b050beb7b3","observation_id":"563a1f37-2a5b-4687-ad71-68ddb733c1a8","resolution":{"observed_at":"2026-08-14T05:30:13.958926Z","resolver_source":"local_arxiv","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"}},{"citation":{"cited_paper":{"arxiv_id":"1304.0480","last_updated":"2013-03-29T04:35:58Z","snapshot_observed_at":"2026-08-15T00:23:17.661012Z","submitted_at":"2013-03-29T04:35:58Z","title":"A problem dependent analysis of SOCP algorithms in noisy compressed sensing","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1304.0480","snapshot_observed_at":"2026-08-14T05:31:25.993586Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1909.01201","last_updated":"2019-09-03T14:13:29Z","snapshot_observed_at":"2026-08-18T17:39:37.381993Z","submitted_at":"2019-09-03T14:13:29Z","title":"Starting CLuP with polytope relaxation","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T05:31:25.993586Z"},"links":{"cited_paper":"/paper/1304.0480","citing_paper":"/paper/1909.01201"},"observation_digest":"sha256:6c1a68b6e39ad6fcab04dbdfc184b8a91936c6517b3365cf96cce16a12dd828f","observation_id":"fca60877-37d7-42c2-b63b-620d496ccde8","resolution":{"observed_at":"2026-08-14T05:31:25.993586Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1304.0480/citation-record","integrity":"/paper/1304.0480/integrity","json":"/paper/1304.0480/citation-record.json","paper":"/paper/1304.0480"},"outbound":[],"paper":{"arxiv_id":"1304.0480","last_updated":"2013-03-29T04:35:58Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-15T00:23:17.661012Z","submitted_at":"2013-03-29T04:35:58Z","title":"A problem dependent analysis of SOCP algorithms in noisy compressed sensing"},"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 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1304.0480."}