{"as_of":"2026-08-10T11:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:794a2b6156b77537a84a60175f3dfdb4988e9d0f2d5170cec6a7d0af90e8f6e4","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T21:42:18.101365Z","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-06T21:42:19.175300Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2504.13633","last_updated":"2025-04-22T11:02:40Z","snapshot_observed_at":"2026-08-10T08:08:20.560078Z","submitted_at":"2025-04-18T11:14:25Z","title":"Efficient algorithms for the Hadamard decomposition","version":2},"cited_work":{"arxiv_id":"2504.13633","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.13633","snapshot_observed_at":"2026-08-06T21:42:19.175300Z","title":"Efficient algorithms for the Hadamard decomposition","venue":"cs.LG","work_id":"42336ac7-07e9-4136-9105-f9c3214f6064","year":2025},"citing_paper":{"arxiv_id":"2608.04584","last_updated":"2026-08-05T08:49:16Z","snapshot_observed_at":"2026-08-10T07:04:11.835242Z","submitted_at":"2026-08-05T08:49:16Z","title":"Variable Smoothing for Weakly Convex Problems with Non-Euclidean Directions","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:18.101365Z"},"links":{"cited_paper":"/paper/2504.13633","citing_paper":"/paper/2608.04584"},"observation_digest":"sha256:5f49d37673da067849ced1911fd9b9dde610185a00dd635967c79d9fec90e0a5","observation_id":"e73f7a58-1d7a-4f55-bc65-4958c75f4b26","resolution":{"observed_at":"2026-08-06T21:42:19.243702Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2504.13633/citation-record","integrity":"/paper/2504.13633/integrity","json":"/paper/2504.13633/citation-record.json","paper":"/paper/2504.13633"},"outbound":[],"paper":{"arxiv_id":"2504.13633","last_updated":"2025-04-22T11:02:40Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-10T08:08:20.560078Z","submitted_at":"2025-04-18T11:14:25Z","title":"Efficient algorithms for the Hadamard 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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2504.13633."}