{"as_of":"2026-08-19T06:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1e56d59fbbf294b7596a485e40d65c3a0889e07de30f2bb7e6bcd290d8e7fd4a","coverage":[{"denominator":13,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":13,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T12:08:48.844314Z","state":"measured"},{"denominator":14,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":14,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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-16T12:00:56.580403Z","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-18T14:37:13.650980Z","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:9b353292c0f3561543e8e1ff79199c5e31b886f570b2e6b2326d8ad00e28c22d","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-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"}}],"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":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:08:49.585762Z","title":"Hyeon-Woo, M","venue":null,"work_id":"5f2ffc26-2e00-4db8-b15f-8c6985fb3658","year":2022},"citing_paper":{"arxiv_id":"2504.13633","last_updated":"2025-04-22T11:02:40Z","snapshot_observed_at":"2026-08-16T12:00:56.580403Z","submitted_at":"2025-04-18T11:14:25Z","title":"Efficient algorithms for the Hadamard decomposition","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-16T12:08:48.700929Z"},"links":{"citing_paper":"/paper/2504.13633"},"observation_digest":"sha256:233524e77467e46acb6d94bac87b61e179c8b8c10238efd15e955349ee71b6c7","observation_id":"a90a0f4a-5a82-4b8d-ada8-da3d2af5d8ac","resolution":{"observed_at":"2026-08-16T12:08:49.589369Z","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-16T12:08:49.573560Z","title":"Ciaperoni, A","venue":null,"work_id":"808f3c5a-b2b0-40e1-a993-5ed8b23ef3b4","year":2024},"citing_paper":{"arxiv_id":"2504.13633","last_updated":"2025-04-22T11:02:40Z","snapshot_observed_at":"2026-08-16T12:00:56.580403Z","submitted_at":"2025-04-18T11:14:25Z","title":"Efficient algorithms for the Hadamard decomposition","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-16T12:08:48.758430Z"},"links":{"citing_paper":"/paper/2504.13633"},"observation_digest":"sha256:1b00a3031b61adff0806c95cd7128249fef9b5f1dce4c198711eca1cb1fa1d56","observation_id":"a5be2e30-9e8d-450d-aed8-d0bdfb465485","resolution":{"observed_at":"2026-08-16T12:08:49.578770Z","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-16T12:08:49.477676Z","title":"Gillis and F","venue":null,"work_id":"5d05bb70-941a-4a4b-9d5c-27e7a63940a1","year":null},"citing_paper":{"arxiv_id":"2504.13633","last_updated":"2025-04-22T11:02:40Z","snapshot_observed_at":"2026-08-16T12:00:56.580403Z","submitted_at":"2025-04-18T11:14:25Z","title":"Efficient algorithms for the Hadamard decomposition","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-16T12:08:48.805384Z"},"links":{"citing_paper":"/paper/2504.13633"},"observation_digest":"sha256:f5540250151c35371c511252bae056895d78353ab35e081bc186cb23ff8cce25","observation_id":"29ce9e15-d138-40f1-af35-91f371dd5bc6","resolution":{"observed_at":"2026-08-16T12:08:49.543780Z","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-16T12:08:49.465708Z","title":"Gillis, ”Nonnegative Matrix Factorization”, Societ y for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 2021","venue":null,"work_id":"4eebefcc-3226-4c77-b650-71d37161aa16","year":2021},"citing_paper":{"arxiv_id":"2504.13633","last_updated":"2025-04-22T11:02:40Z","snapshot_observed_at":"2026-08-16T12:00:56.580403Z","submitted_at":"2025-04-18T11:14:25Z","title":"Efficient algorithms for the Hadamard decomposition","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-16T12:08:48.808858Z"},"links":{"citing_paper":"/paper/2504.13633"},"observation_digest":"sha256:70f9018021a5b0717770710d286e0a0d1283a13188211fa291c668784b22c7f1","observation_id":"077c7ee2-9eb9-4bc3-87ea-9af80501f5a3","resolution":{"observed_at":"2026-08-16T12:08:49.470179Z","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-16T12:08:49.413571Z","title":null,"venue":null,"work_id":"91fb2b25-923a-472b-88b2-e9e4b5eaa22a","year":2019},"citing_paper":{"arxiv_id":"2504.13633","last_updated":"2025-04-22T11:02:40Z","snapshot_observed_at":"2026-08-16T12:00:56.580403Z","submitted_at":"2025-04-18T11:14:25Z","title":"Efficient algorithms for the Hadamard decomposition","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-16T12:08:48.812914Z"},"links":{"citing_paper":"/paper/2504.13633"},"observation_digest":"sha256:7c69a06a2ba543eca46c8fe22e3071977957a4af8c001477082d851226e87919","observation_id":"9631f44b-8ac7-4e6c-85cd-22bdac4bf75e","resolution":{"observed_at":"2026-08-16T12:08:49.458470Z","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-16T12:08:49.363878Z","title":"Ciaperoni, ”HadamardDecomposition,” GitHub reposi tory, github.com/maciap/HadamardDecomposition, 2023","venue":null,"work_id":"14d67178-f88b-418e-9873-77512ddeb20f","year":2023},"citing_paper":{"arxiv_id":"2504.13633","last_updated":"2025-04-22T11:02:40Z","snapshot_observed_at":"2026-08-16T12:00:56.580403Z","submitted_at":"2025-04-18T11:14:25Z","title":"Efficient algorithms for the Hadamard decomposition","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-16T12:08:48.816897Z"},"links":{"citing_paper":"/paper/2504.13633"},"observation_digest":"sha256:1e51768234cc508265e7f785871d1b59706932f0ab7e9f788b0f8a13fd82ec7c","observation_id":"1739dd22-d98f-4235-88cd-39cb29c10a8f","resolution":{"observed_at":"2026-08-16T12:08:49.368518Z","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-16T12:08:49.208504Z","title":"Girvan and M","venue":null,"work_id":"d090ec50-a12f-4b76-8ee2-61ffd2fb9cd7","year":2002},"citing_paper":{"arxiv_id":"2504.13633","last_updated":"2025-04-22T11:02:40Z","snapshot_observed_at":"2026-08-16T12:00:56.580403Z","submitted_at":"2025-04-18T11:14:25Z","title":"Efficient algorithms for the Hadamard decomposition","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-16T12:08:48.820399Z"},"links":{"citing_paper":"/paper/2504.13633"},"observation_digest":"sha256:4a41060a23595c5af6c6e709f43b60f73ace94d1626b37c556226568ca33db0f","observation_id":"88b3b835-b942-4ef4-a9dd-1c5773e467b3","resolution":{"observed_at":"2026-08-16T12:08:49.298929Z","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-16T12:08:49.195884Z","title":null,"venue":null,"work_id":"c7caf4f7-65e7-4371-9a05-73029ab7d877","year":1993},"citing_paper":{"arxiv_id":"2504.13633","last_updated":"2025-04-22T11:02:40Z","snapshot_observed_at":"2026-08-16T12:00:56.580403Z","submitted_at":"2025-04-18T11:14:25Z","title":"Efficient algorithms for the Hadamard decomposition","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-16T12:08:48.824520Z"},"links":{"citing_paper":"/paper/2504.13633"},"observation_digest":"sha256:f24880263e54749930ae9ce0f3201441609d87b73b01ca263733457c8e78bb45","observation_id":"3a933732-ce96-4197-8d8a-51fe775756d6","resolution":{"observed_at":"2026-08-16T12:08:49.199470Z","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":"10.24432/c5b02r","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:08:48.924838Z","title":null,"venue":null,"work_id":"c6104b9d-300f-408a-86c4-4c0b0f0db42e","year":1988},"citing_paper":{"arxiv_id":"2504.13633","last_updated":"2025-04-22T11:02:40Z","snapshot_observed_at":"2026-08-16T12:00:56.580403Z","submitted_at":"2025-04-18T11:14:25Z","title":"Efficient algorithms for the Hadamard decomposition","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-16T12:08:48.828066Z"},"links":{"citing_paper":"/paper/2504.13633"},"observation_digest":"sha256:55e9f025fb07c94968003b2d7ff629fe9b6b3a84622284bb8fb6caff2966bae9","observation_id":"8a3a40ad-fe9a-45a9-a99d-e57ec0a23870","resolution":{"observed_at":"2026-08-16T12:08:48.984228Z","resolver_source":"doi","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-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-16T12:08:49.125773Z","title":"By removing the jth entry of r (reducing p by one) and increasing the kth entry of r by one, we obtain a better solution, since 1∗ rk < r k + 1","venue":null,"work_id":"33b68449-0960-4779-a440-10516860b351","year":null},"citing_paper":{"arxiv_id":"2504.13633","last_updated":"2025-04-22T11:02:40Z","snapshot_observed_at":"2026-08-16T12:00:56.580403Z","submitted_at":"2025-04-18T11:14:25Z","title":"Efficient algorithms for the Hadamard decomposition","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-16T12:08:48.831265Z"},"links":{"citing_paper":"/paper/2504.13633"},"observation_digest":"sha256:5bd7e59e58299afaeb1d7acc43d6814cd5bb561f5ec8c7c422f15f826e50adac","observation_id":"54a395fc-e176-4284-8e80-094b822b2b5f","resolution":{"observed_at":"2026-08-16T12:08:49.164120Z","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-16T12:08:49.112244Z","title":"Then it is possible to create another admissible solution by setting rj = 1 +K and by adding an entry rp+1 = 3","venue":null,"work_id":"f4745852-0ac6-4285-afac-a7de65d8fe85","year":null},"citing_paper":{"arxiv_id":"2504.13633","last_updated":"2025-04-22T11:02:40Z","snapshot_observed_at":"2026-08-16T12:00:56.580403Z","submitted_at":"2025-04-18T11:14:25Z","title":"Efficient algorithms for the Hadamard decomposition","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-16T12:08:48.835418Z"},"links":{"citing_paper":"/paper/2504.13633"},"observation_digest":"sha256:3f3eb57678467cb8c0d90d60b36a333a78cbf30f88ff71ac29b838fe5e2caf79","observation_id":"a147ea14-0b91-4d54-a8e5-86eb605e85b9","resolution":{"observed_at":"2026-08-16T12:08:49.117274Z","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-16T12:08:49.002453Z","title":null,"venue":null,"work_id":"2970bcd7-29f1-4b45-8b3d-1ad90855e2f7","year":null},"citing_paper":{"arxiv_id":"2504.13633","last_updated":"2025-04-22T11:02:40Z","snapshot_observed_at":"2026-08-16T12:00:56.580403Z","submitted_at":"2025-04-18T11:14:25Z","title":"Efficient algorithms for the Hadamard decomposition","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-16T12:08:48.840416Z"},"links":{"citing_paper":"/paper/2504.13633"},"observation_digest":"sha256:275de3db274cbd2cad920877e9cb1662ff34a8378f589873edfb0053a560481d","observation_id":"11d83941-92c4-41fb-8634-7312dfcc0078","resolution":{"observed_at":"2026-08-16T12:08:49.072352Z","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-16T12:08:48.992032Z","title":null,"venue":null,"work_id":"9cc31abd-9390-4509-a021-c200a43b4582","year":null},"citing_paper":{"arxiv_id":"2504.13633","last_updated":"2025-04-22T11:02:40Z","snapshot_observed_at":"2026-08-16T12:00:56.580403Z","submitted_at":"2025-04-18T11:14:25Z","title":"Efficient algorithms for the Hadamard decomposition","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-16T12:08:48.844314Z"},"links":{"citing_paper":"/paper/2504.13633"},"observation_digest":"sha256:239243a1b607132114dfc08f5b0ec2b903d1c69c3f61a0ff00dfb1b0682fe033","observation_id":"b8bf9438-8cf8-44b9-ae5b-da27b3d736da","resolution":{"observed_at":"2026-08-16T12:08:48.995327Z","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":"2504.13633","last_updated":"2025-04-22T11:02:40Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T12:00:56.580403Z","submitted_at":"2025-04-18T11:14:25Z","title":"Efficient algorithms for the Hadamard decomposition"},"reference_resolution":{"displayed":13,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":1,"verified_fuzzy":8},"total_outbound_references":13},"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 19 August 2026, this Paper Citation Record lists 13 of 13 outbound references and 1 inbound Pith citation observation for arXiv:2504.13633."}