{"as_of":"2026-08-22T05:32:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:336c9d29488e8cbbe893e8186665e1795d6893332d79f8af380253bb8be95b0a","coverage":[{"denominator":47,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":47,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:18:14.566374Z","state":"measured"},{"denominator":48,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":48,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+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-06-26T05:19:56.528337Z","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-07-04T13:19:50.610188Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.15661","last_updated":"2025-05-21T15:36:38Z","snapshot_observed_at":"2026-08-13T09:23:32.890157Z","submitted_at":"2025-05-21T15:36:38Z","title":"Deep greedy unfolding: Sorting out argsorting in greedy sparse recovery algorithms","version":1},"cited_work":{"arxiv_id":"2505.15661","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.15661","snapshot_observed_at":"2026-07-04T13:19:50.610188Z","title":"J., and Brugiapaglia, S.Deep greedy unfolding: Sorting out argsorting in greedy sparse recovery algorithms.arXiv preprint arXiv:2505.15661(2025)","venue":null,"work_id":"9daa26e2-8d97-44ff-a186-31c6e23228e0","year":2025},"citing_paper":{"arxiv_id":"2606.26705","last_updated":"2026-06-25T07:34:20Z","snapshot_observed_at":"2026-08-09T12:01:27.764764Z","submitted_at":"2026-06-25T07:34:20Z","title":"Algorithmic Foundations of Deep Learning: Complexity-Theoretic Rates and a Characterization of Universal Approximation","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-26T05:19:56.528337Z"},"links":{"cited_paper":"/paper/2505.15661","citing_paper":"/paper/2606.26705"},"observation_digest":"sha256:902f0967b71ce3e7d97104574e3516b184bb96159c7c2f51ef9b2426730aff25","observation_id":"fbf8cadb-c77b-4a4d-aa10-a1fde94d3839","resolution":{"observed_at":"2026-07-04T13:19:50.611959Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2505.15661/citation-record","integrity":"/paper/2505.15661/integrity","json":"/paper/2505.15661/citation-record.json","paper":"/paper/2505.15661"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:18:11.258944Z","title":"Adcock, S","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.15661","last_updated":"2025-05-21T15:36:38Z","snapshot_observed_at":"2026-08-13T09:23:32.890157Z","submitted_at":"2025-05-21T15:36:38Z","title":"Deep greedy unfolding: Sorting out argsorting in greedy sparse recovery algorithms","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T15:18:11.258944Z"},"links":{"citing_paper":"/paper/2505.15661"},"observation_digest":"sha256:48f221c5dd650f46bf02b567c0b1c04ac4d109582db5b714392d897a890b7b48","observation_id":"f8823d6b-0c88-419c-b70a-a0243cd5c482","resolution":{"observed_at":"2026-08-07T15:18:11.258944Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:18:22.151520Z","title":"Adcock and A","venue":null,"work_id":"6606300a-73fe-43f8-acd2-7f2fd945f0e3","year":2021},"citing_paper":{"arxiv_id":"2505.15661","last_updated":"2025-05-21T15:36:38Z","snapshot_observed_at":"2026-08-13T09:23:32.890157Z","submitted_at":"2025-05-21T15:36:38Z","title":"Deep greedy unfolding: Sorting out argsorting in greedy sparse recovery algorithms","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T15:18:11.352643Z"},"links":{"citing_paper":"/paper/2505.15661"},"observation_digest":"sha256:33e7debcabe7d10f52c64d8441717cf581a0635d164a4cb2e491e18ca385f46d","observation_id":"1a26b6d7-6bc9-4e60-9534-74b9121869c0","resolution":{"observed_at":"2026-08-07T15:18:22.232109Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-07T15:18:21.977152Z","title":"Arora and B","venue":null,"work_id":"83271e90-8c54-4594-a007-6dadf38aabb2","year":2009},"citing_paper":{"arxiv_id":"2505.15661","last_updated":"2025-05-21T15:36:38Z","snapshot_observed_at":"2026-08-13T09:23:32.890157Z","submitted_at":"2025-05-21T15:36:38Z","title":"Deep greedy unfolding: Sorting out argsorting in greedy sparse recovery algorithms","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T15:18:11.435523Z"},"links":{"citing_paper":"/paper/2505.15661"},"observation_digest":"sha256:7f197f8a1557ffb7c95bb17b5dab28c2263b31a988191df9f720a88d8e8b9bb5","observation_id":"4b5ae961-acc4-4ba2-bcd4-6728ce146297","resolution":{"observed_at":"2026-08-07T15:18:22.071066Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-07T15:18:21.827033Z","title":"Bah and R","venue":null,"work_id":"83232f6e-8d8b-44ad-bfe9-99054377bee8","year":2016},"citing_paper":{"arxiv_id":"2505.15661","last_updated":"2025-05-21T15:36:38Z","snapshot_observed_at":"2026-08-13T09:23:32.890157Z","submitted_at":"2025-05-21T15:36:38Z","title":"Deep greedy unfolding: Sorting out argsorting in greedy sparse recovery algorithms","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T15:18:11.480550Z"},"links":{"citing_paper":"/paper/2505.15661"},"observation_digest":"sha256:ee7af04658d79610fcb11856ff3496e85c5e8cc6d98c2b3580ba82557dad2620","observation_id":"e2034f3c-715d-4007-b620-27f23889edfb","resolution":{"observed_at":"2026-08-07T15:18:21.903125Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-07T15:18:21.623650Z","title":"Behboodi, H","venue":null,"work_id":"389133b9-c89f-47db-80f0-b0f7c40caf11","year":2022},"citing_paper":{"arxiv_id":"2505.15661","last_updated":"2025-05-21T15:36:38Z","snapshot_observed_at":"2026-08-13T09:23:32.890157Z","submitted_at":"2025-05-21T15:36:38Z","title":"Deep greedy unfolding: Sorting out argsorting in greedy sparse recovery algorithms","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T15:18:11.550360Z"},"links":{"citing_paper":"/paper/2505.15661"},"observation_digest":"sha256:b8e70d794cf05ab375ca78e24b348d79bfa056730f3e8b7f3a70ab775794b532","observation_id":"d5a57ff1-0ac5-4611-b797-ef0535e49a84","resolution":{"observed_at":"2026-08-07T15:18:21.731539Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-07T15:18:21.359841Z","title":"Blondel, O","venue":null,"work_id":"2debd878-f964-4760-9db7-4e539801fb79","year":2020},"citing_paper":{"arxiv_id":"2505.15661","last_updated":"2025-05-21T15:36:38Z","snapshot_observed_at":"2026-08-13T09:23:32.890157Z","submitted_at":"2025-05-21T15:36:38Z","title":"Deep greedy unfolding: Sorting out argsorting in greedy sparse recovery algorithms","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T15:18:11.581449Z"},"links":{"citing_paper":"/paper/2505.15661"},"observation_digest":"sha256:2769032822b5fcdfea5932fd37dcf80db84ab6f842f8049a4dd6f23baa6113b9","observation_id":"6811fe2d-2cfb-4a2a-b5bc-9a7d7de5c3ac","resolution":{"observed_at":"2026-08-07T15:18:21.476708Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-07T15:18:21.204328Z","title":"Blumensath and M","venue":null,"work_id":"d9a67b74-34d8-4d10-836d-b8563a81a2c7","year":2008},"citing_paper":{"arxiv_id":"2505.15661","last_updated":"2025-05-21T15:36:38Z","snapshot_observed_at":"2026-08-13T09:23:32.890157Z","submitted_at":"2025-05-21T15:36:38Z","title":"Deep greedy unfolding: Sorting out argsorting in greedy sparse recovery algorithms","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T15:18:11.683193Z"},"links":{"citing_paper":"/paper/2505.15661"},"observation_digest":"sha256:5701471ebf1454b3e6ab3ff84780cf6623bc9837c884109ece730539c065d644","observation_id":"d73722e6-bcc5-485d-9c18-9fcae54b3ba1","resolution":{"observed_at":"2026-08-07T15:18:21.274756Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1701.01671","last_updated":"2017-12-15T19:02:58Z","snapshot_observed_at":"2026-08-15T21:06:52.138576Z","submitted_at":"2017-01-06T15:51:43Z","title":"Multi-level Compressed Sensing Petrov-Galerkin discretization of high-dimensional parametric PDEs","version":2},"cited_work":{"arxiv_id":"1701.01671","doi":null,"metadata_source":"pith","pith_arxiv_id":"1701.01671","snapshot_observed_at":"2026-08-07T15:18:14.871209Z","title":"Multi-level Compressed Sensing Petrov-Galerkin discretization of high-dimensional parametric PDEs","venue":"math.NA","work_id":"ba181f69-a79a-461e-b41b-d913654db6ea","year":2017},"citing_paper":{"arxiv_id":"2505.15661","last_updated":"2025-05-21T15:36:38Z","snapshot_observed_at":"2026-08-13T09:23:32.890157Z","submitted_at":"2025-05-21T15:36:38Z","title":"Deep greedy unfolding: Sorting out argsorting in greedy sparse recovery algorithms","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T15:18:11.788351Z"},"links":{"cited_paper":"/paper/1701.01671","citing_paper":"/paper/2505.15661"},"observation_digest":"sha256:6cd65e2250305af51317c480b6d6f5935795d4941912dd00e4235fef5783b2cb","observation_id":"579ea7d8-6894-4236-8ce3-50dc879d4f61","resolution":{"observed_at":"2026-08-07T15:18:14.941492Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-07T15:18:21.051793Z","title":"Chambolle and T","venue":null,"work_id":"8f04bd8b-db36-4e2e-a48f-506126b88a47","year":2011},"citing_paper":{"arxiv_id":"2505.15661","last_updated":"2025-05-21T15:36:38Z","snapshot_observed_at":"2026-08-13T09:23:32.890157Z","submitted_at":"2025-05-21T15:36:38Z","title":"Deep greedy unfolding: Sorting out argsorting in greedy sparse recovery algorithms","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T15:18:11.865177Z"},"links":{"citing_paper":"/paper/2505.15661"},"observation_digest":"sha256:8eccf30b737f4932a98fe50c7d6e2e6098ed0ed3dda32590df6c58e31e07a0db","observation_id":"d951ed6b-699a-4986-bc09-5a9f744bb038","resolution":{"observed_at":"2026-08-07T15:18:21.087777Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-07T15:18:20.935670Z","title":null,"venue":null,"work_id":"6b820225-7ba0-4ecf-835b-c7f2dd886f20","year":2021},"citing_paper":{"arxiv_id":"2505.15661","last_updated":"2025-05-21T15:36:38Z","snapshot_observed_at":"2026-08-13T09:23:32.890157Z","submitted_at":"2025-05-21T15:36:38Z","title":"Deep greedy unfolding: Sorting out argsorting in greedy sparse recovery algorithms","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T15:18:11.911652Z"},"links":{"citing_paper":"/paper/2505.15661"},"observation_digest":"sha256:abfe38c1595cef1982fc2cedb46b6f530d33ffe7484cb4165d2868dcfea064eb","observation_id":"6dbff719-d9ad-479f-ab25-22765a05cbe0","resolution":{"observed_at":"2026-08-07T15:18:20.986117Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-07T15:18:20.780630Z","title":null,"venue":null,"work_id":"01e18b56-8cf3-43ba-a8a5-a56b40c9bec6","year":2021},"citing_paper":{"arxiv_id":"2505.15661","last_updated":"2025-05-21T15:36:38Z","snapshot_observed_at":"2026-08-13T09:23:32.890157Z","submitted_at":"2025-05-21T15:36:38Z","title":"Deep greedy unfolding: Sorting out argsorting in greedy sparse recovery algorithms","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T15:18:11.977202Z"},"links":{"citing_paper":"/paper/2505.15661"},"observation_digest":"sha256:3bae5ac39071f3ef100c275d63d2caec6a212e531f32d3ffbff7d3fbe17eee9b","observation_id":"77c0e8d4-7acb-4d48-9794-7414b3620ccb","resolution":{"observed_at":"2026-08-07T15:18:20.842908Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-07T15:18:20.615992Z","title":null,"venue":null,"work_id":"fa30836d-dd08-4433-8d7d-6d29e69189a6","year":2022},"citing_paper":{"arxiv_id":"2505.15661","last_updated":"2025-05-21T15:36:38Z","snapshot_observed_at":"2026-08-13T09:23:32.890157Z","submitted_at":"2025-05-21T15:36:38Z","title":"Deep greedy unfolding: Sorting out argsorting in greedy sparse recovery algorithms","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T15:18:12.051393Z"},"links":{"citing_paper":"/paper/2505.15661"},"observation_digest":"sha256:fd2fae5094867da55b1b5efebd12f12cf3d5ab8836227e54e9ecc6ccb99a9328","observation_id":"f16a278f-280b-45d2-9c62-83bf667163bd","resolution":{"observed_at":"2026-08-07T15:18:20.671802Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-07T15:18:20.468757Z","title":"Cuturi, O","venue":null,"work_id":"f99d4fe8-3ff6-4ddf-84bd-bb1c5a210a22","year":2019},"citing_paper":{"arxiv_id":"2505.15661","last_updated":"2025-05-21T15:36:38Z","snapshot_observed_at":"2026-08-13T09:23:32.890157Z","submitted_at":"2025-05-21T15:36:38Z","title":"Deep greedy unfolding: Sorting out argsorting in greedy sparse recovery algorithms","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T15:18:12.143963Z"},"links":{"citing_paper":"/paper/2505.15661"},"observation_digest":"sha256:1cc8dc7bffb3982effd256b816a67a9683209dc601b53e5bf81458f11d5ce42b","observation_id":"7bc01727-1783-4563-8a79-1625405fe8d1","resolution":{"observed_at":"2026-08-07T15:18:20.526723Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-07T15:18:20.265887Z","title":"Dai and O","venue":null,"work_id":"9f40a104-51aa-467d-9ade-032ebc769001","year":2009},"citing_paper":{"arxiv_id":"2505.15661","last_updated":"2025-05-21T15:36:38Z","snapshot_observed_at":"2026-08-13T09:23:32.890157Z","submitted_at":"2025-05-21T15:36:38Z","title":"Deep greedy unfolding: Sorting out argsorting in greedy sparse recovery algorithms","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T15:18:12.190383Z"},"links":{"citing_paper":"/paper/2505.15661"},"observation_digest":"sha256:29ba28dde6d9ada1e34ad89b508d789566c99c6b63662922fbb48bbe1bdc06aa","observation_id":"83c5f770-4851-40e5-b21d-f9a12e7bda6d","resolution":{"observed_at":"2026-08-07T15:18:20.379484Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-07T15:18:20.056155Z","title":"Daubechies, M","venue":null,"work_id":"507b4b20-fc42-4f54-944a-495cdab41e6f","year":2004},"citing_paper":{"arxiv_id":"2505.15661","last_updated":"2025-05-21T15:36:38Z","snapshot_observed_at":"2026-08-13T09:23:32.890157Z","submitted_at":"2025-05-21T15:36:38Z","title":"Deep greedy unfolding: Sorting out argsorting in greedy sparse recovery algorithms","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T15:18:12.249878Z"},"links":{"citing_paper":"/paper/2505.15661"},"observation_digest":"sha256:bcab104de0366baef842e5df8dc8a10975c69a088b14c24f48d612a5f45b99a7","observation_id":"a9a50eaf-705d-4bfa-a3d3-e01aa9ee485d","resolution":{"observed_at":"2026-08-07T15:18:20.148844Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-07T15:18:19.877834Z","title":null,"venue":null,"work_id":"ed834064-e7a1-479a-a0a9-49115aea90c6","year":1994},"citing_paper":{"arxiv_id":"2505.15661","last_updated":"2025-05-21T15:36:38Z","snapshot_observed_at":"2026-08-13T09:23:32.890157Z","submitted_at":"2025-05-21T15:36:38Z","title":"Deep greedy unfolding: Sorting out argsorting in greedy sparse recovery algorithms","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T15:18:12.306637Z"},"links":{"citing_paper":"/paper/2505.15661"},"observation_digest":"sha256:800d3cd1d8436a95c844bff4b75f38f40fa601358a1d75b3f559e2e492e6dc23","observation_id":"0edc8cf0-8521-4b36-b32d-bead3f8875df","resolution":{"observed_at":"2026-08-07T15:18:19.942041Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-07T15:18:19.737193Z","title":"Fornasier and H","venue":null,"work_id":"b40e474d-1c01-4ede-be7d-a2af29204325","year":2008},"citing_paper":{"arxiv_id":"2505.15661","last_updated":"2025-05-21T15:36:38Z","snapshot_observed_at":"2026-08-13T09:23:32.890157Z","submitted_at":"2025-05-21T15:36:38Z","title":"Deep greedy unfolding: Sorting out argsorting in greedy sparse recovery algorithms","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T15:18:12.379206Z"},"links":{"citing_paper":"/paper/2505.15661"},"observation_digest":"sha256:7405255630fb02dec690df554ab4d7ef21f312b6de4fb5308f0010a6a1463ecf","observation_id":"c7f06251-489c-4bde-ab8c-ca9926534d95","resolution":{"observed_at":"2026-08-07T15:18:19.826822Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-07T15:18:19.554257Z","title":"Foucart and H","venue":null,"work_id":"2a339d1c-d367-4184-b8bd-13fe6b55a13b","year":2013},"citing_paper":{"arxiv_id":"2505.15661","last_updated":"2025-05-21T15:36:38Z","snapshot_observed_at":"2026-08-13T09:23:32.890157Z","submitted_at":"2025-05-21T15:36:38Z","title":"Deep greedy unfolding: Sorting out argsorting in greedy sparse recovery algorithms","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T15:18:12.455536Z"},"links":{"citing_paper":"/paper/2505.15661"},"observation_digest":"sha256:88bbae7d4aaba5a9413cf6dde0373f54758003c4e7dffd943addddf547e1f59b","observation_id":"26b59b7f-0bd0-484f-a090-501cd7070b36","resolution":{"observed_at":"2026-08-07T15:18:19.641948Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-07T15:18:19.381690Z","title":null,"venue":null,"work_id":"d29fa07c-89b7-4304-a67f-2f5f89cfe075","year":2011},"citing_paper":{"arxiv_id":"2505.15661","last_updated":"2025-05-21T15:36:38Z","snapshot_observed_at":"2026-08-13T09:23:32.890157Z","submitted_at":"2025-05-21T15:36:38Z","title":"Deep greedy unfolding: Sorting out argsorting in greedy sparse recovery algorithms","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T15:18:12.538636Z"},"links":{"citing_paper":"/paper/2505.15661"},"observation_digest":"sha256:5cfab0704715d64e46b58439c29957a2d57abc7d86646a992c041f07a42ffd61","observation_id":"eadc9c68-5bea-4a6e-8a64-e38bacd8e882","resolution":{"observed_at":"2026-08-07T15:18:19.498489Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1704.00805","last_updated":"2018-08-21T00:02:44Z","snapshot_observed_at":"2026-08-20T00:00:03.960014Z","submitted_at":"2017-04-03T20:50:29Z","title":"On the Properties of the Softmax Function with Application in Game Theory and Reinforcement Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1704.00805","snapshot_observed_at":"2026-08-07T15:18:12.610956Z","title":"Gao and L","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.15661","last_updated":"2025-05-21T15:36:38Z","snapshot_observed_at":"2026-08-13T09:23:32.890157Z","submitted_at":"2025-05-21T15:36:38Z","title":"Deep greedy unfolding: Sorting out argsorting in greedy sparse recovery algorithms","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T15:18:12.610956Z"},"links":{"cited_paper":"/paper/1704.00805","citing_paper":"/paper/2505.15661"},"observation_digest":"sha256:da1983de63ab81f15e1c8c0d981005853bb57248876fa2f203fb22f2ab077dfc","observation_id":"4d784979-6f53-485f-a65c-a8f2008c0cd0","resolution":{"observed_at":"2026-08-07T15:18:12.610956Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:18:19.201441Z","title":"Goodfellow, Y","venue":null,"work_id":"227b5eeb-61b2-46a7-a07d-361d8a208ea3","year":2016},"citing_paper":{"arxiv_id":"2505.15661","last_updated":"2025-05-21T15:36:38Z","snapshot_observed_at":"2026-08-13T09:23:32.890157Z","submitted_at":"2025-05-21T15:36:38Z","title":"Deep greedy unfolding: Sorting out argsorting in greedy sparse recovery algorithms","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T15:18:12.657845Z"},"links":{"citing_paper":"/paper/2505.15661"},"observation_digest":"sha256:d60aad66068409a95557cea228954e546ae67b7648bf2286a3139d98b416f34c","observation_id":"073c252e-fe90-4d41-bbd3-b3e60d7d79c9","resolution":{"observed_at":"2026-08-07T15:18:19.294594Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-07T15:18:18.998151Z","title":"Gregor and Y","venue":null,"work_id":"f4f0db67-5fc8-4b9e-8e8f-078424e5e5a8","year":2010},"citing_paper":{"arxiv_id":"2505.15661","last_updated":"2025-05-21T15:36:38Z","snapshot_observed_at":"2026-08-13T09:23:32.890157Z","submitted_at":"2025-05-21T15:36:38Z","title":"Deep greedy unfolding: Sorting out argsorting in greedy sparse recovery algorithms","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T15:18:12.771161Z"},"links":{"citing_paper":"/paper/2505.15661"},"observation_digest":"sha256:c440c968eec4bf1b4f8eec107ebd5361e26e2c93db989d31359ead7f239ed5c1","observation_id":"8f01b40a-e17e-4435-8599-803a7dd141b9","resolution":{"observed_at":"2026-08-07T15:18:19.114640Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1903.08850","last_updated":"2019-04-29T07:56:18Z","snapshot_observed_at":"2026-08-14T16:59:01.602246Z","submitted_at":"2019-03-21T07:05:44Z","title":"Stochastic Optimization of Sorting Networks via Continuous Relaxations","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1903.08850","snapshot_observed_at":"2026-08-07T15:18:12.876611Z","title":"Grover, E","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.15661","last_updated":"2025-05-21T15:36:38Z","snapshot_observed_at":"2026-08-13T09:23:32.890157Z","submitted_at":"2025-05-21T15:36:38Z","title":"Deep greedy unfolding: Sorting out argsorting in greedy sparse recovery algorithms","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T15:18:12.876611Z"},"links":{"cited_paper":"/paper/1903.08850","citing_paper":"/paper/2505.15661"},"observation_digest":"sha256:796c1e207c85f5cbc8d8c75eca4ea385ef73ad5d39287581c2a2488b3de06145","observation_id":"bff32ed7-350f-48b9-9211-585eb20de3ac","resolution":{"observed_at":"2026-08-07T15:18:12.876611Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:18:18.759398Z","title":"Heaven et al","venue":null,"work_id":"2893b02e-8cc6-4820-a23c-6b0f1cac5438","year":2019},"citing_paper":{"arxiv_id":"2505.15661","last_updated":"2025-05-21T15:36:38Z","snapshot_observed_at":"2026-08-13T09:23:32.890157Z","submitted_at":"2025-05-21T15:36:38Z","title":"Deep greedy unfolding: Sorting out argsorting in greedy sparse recovery algorithms","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T15:18:12.936122Z"},"links":{"citing_paper":"/paper/2505.15661"},"observation_digest":"sha256:59c34a99630d613355838c2dd7c42ff5573215695b8668f317378c12f3c6363e","observation_id":"a2dd70fe-bd55-46cc-bc85-cd2ad40d803b","resolution":{"observed_at":"2026-08-07T15:18:18.871430Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1611.01144","last_updated":"2017-08-05T22:45:19Z","snapshot_observed_at":"2026-08-15T03:05:41.956181Z","submitted_at":"2016-11-03T19:48:08Z","title":"Categorical Reparameterization with Gumbel-Softmax","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.01144","snapshot_observed_at":"2026-08-07T15:18:12.991154Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.15661","last_updated":"2025-05-21T15:36:38Z","snapshot_observed_at":"2026-08-13T09:23:32.890157Z","submitted_at":"2025-05-21T15:36:38Z","title":"Deep greedy unfolding: Sorting out argsorting in greedy sparse recovery algorithms","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T15:18:12.991154Z"},"links":{"cited_paper":"/paper/1611.01144","citing_paper":"/paper/2505.15661"},"observation_digest":"sha256:30779b57c61b5714d526f6c2b671e1148890636404aae2edb6c6e826330aba6e","observation_id":"19ff2ec5-7fdb-4c36-bfa0-1bd3a7183e03","resolution":{"observed_at":"2026-08-07T15:18:12.991154Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1312.3582","last_updated":"2015-01-07T20:01:08Z","snapshot_observed_at":"2026-08-14T23:51:51.913034Z","submitted_at":"2013-12-12T18:39:21Z","title":"Iterative Hard Thresholding for Weighted Sparse Approximation","version":4},"cited_work":{"arxiv_id":"1312.3582","doi":null,"metadata_source":"pith","pith_arxiv_id":"1312.3582","snapshot_observed_at":"2026-08-07T15:18:14.710527Z","title":"Iterative Hard Thresholding for Weighted Sparse Approximation","venue":"cs.IT","work_id":"28fc53fa-51ff-4784-91e5-043f7b18b8d1","year":2013},"citing_paper":{"arxiv_id":"2505.15661","last_updated":"2025-05-21T15:36:38Z","snapshot_observed_at":"2026-08-13T09:23:32.890157Z","submitted_at":"2025-05-21T15:36:38Z","title":"Deep greedy unfolding: Sorting out argsorting in greedy sparse recovery algorithms","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T15:18:13.042434Z"},"links":{"cited_paper":"/paper/1312.3582","citing_paper":"/paper/2505.15661"},"observation_digest":"sha256:5111286007a9d81b53db4326ae0420785002e0b44bef87e55596e066414dd2ac","observation_id":"34adfe20-d4e8-4baa-bf05-6da00c44ac01","resolution":{"observed_at":"2026-08-07T15:18:14.753981Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-07T15:18:18.535913Z","title":null,"venue":null,"work_id":"a294ab54-d980-4f68-bb79-982519567371","year":2011},"citing_paper":{"arxiv_id":"2505.15661","last_updated":"2025-05-21T15:36:38Z","snapshot_observed_at":"2026-08-13T09:23:32.890157Z","submitted_at":"2025-05-21T15:36:38Z","title":"Deep greedy unfolding: Sorting out argsorting in greedy sparse recovery algorithms","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T15:18:13.118864Z"},"links":{"citing_paper":"/paper/2505.15661"},"observation_digest":"sha256:7ef8012c04e24b5a1bb784155c433085c85d19f6fdb61bb41979e5c812de1b50","observation_id":"83fa0a92-46c0-4421-9e60-25a8c68d2842","resolution":{"observed_at":"2026-08-07T15:18:18.610295Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-07T15:18:18.306450Z","title":"Khatib, D","venue":null,"work_id":"c0b9c28f-1c9f-4e6b-8681-c42828ace2e3","year":2021},"citing_paper":{"arxiv_id":"2505.15661","last_updated":"2025-05-21T15:36:38Z","snapshot_observed_at":"2026-08-13T09:23:32.890157Z","submitted_at":"2025-05-21T15:36:38Z","title":"Deep greedy unfolding: Sorting out argsorting in greedy sparse recovery algorithms","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T15:18:13.203709Z"},"links":{"citing_paper":"/paper/2505.15661"},"observation_digest":"sha256:1459c6d539d9345c640a631a0395acf1726239022ab83c6f882b1a0d59e8eefb","observation_id":"a14cca50-95fc-4ec0-9a66-641b7052b5e9","resolution":{"observed_at":"2026-08-07T15:18:18.386179Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-07T15:18:18.104647Z","title":"Kutyniok , The mathematics of reliable artificial intelligence , Collections, 57 (2024)","venue":null,"work_id":"0b6ee5ca-cde7-4267-826c-d75e6e48ca63","year":2024},"citing_paper":{"arxiv_id":"2505.15661","last_updated":"2025-05-21T15:36:38Z","snapshot_observed_at":"2026-08-13T09:23:32.890157Z","submitted_at":"2025-05-21T15:36:38Z","title":"Deep greedy unfolding: Sorting out argsorting in greedy sparse recovery algorithms","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T15:18:13.291388Z"},"links":{"citing_paper":"/paper/2505.15661"},"observation_digest":"sha256:24dd89b949d080801dca9c3217fc808d26cc94c423d72e56ad65fc996ba3b10c","observation_id":"215995a4-5ba0-4bdc-89e3-547e7f8c4246","resolution":{"observed_at":"2026-08-07T15:18:18.229209Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-07T15:18:17.856615Z","title":null,"venue":null,"work_id":"9d6a64ac-49e9-4ea0-9492-19154a70e721","year":2013},"citing_paper":{"arxiv_id":"2505.15661","last_updated":"2025-05-21T15:36:38Z","snapshot_observed_at":"2026-08-13T09:23:32.890157Z","submitted_at":"2025-05-21T15:36:38Z","title":"Deep greedy unfolding: Sorting out argsorting in greedy sparse recovery algorithms","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T15:18:13.351224Z"},"links":{"citing_paper":"/paper/2505.15661"},"observation_digest":"sha256:61c0a56333797729886850b16f32d8a679c72b279839c049a3e58734ee9ce70c","observation_id":"2668c8b5-2029-4a20-a15e-19db488aece4","resolution":{"observed_at":"2026-08-07T15:18:18.010880Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-07T15:18:17.644311Z","title":"Liang, J","venue":null,"work_id":"c7c983ff-bb37-4f1c-b080-e89f37722147","year":2020},"citing_paper":{"arxiv_id":"2505.15661","last_updated":"2025-05-21T15:36:38Z","snapshot_observed_at":"2026-08-13T09:23:32.890157Z","submitted_at":"2025-05-21T15:36:38Z","title":"Deep greedy unfolding: Sorting out argsorting in greedy sparse recovery algorithms","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T15:18:13.397839Z"},"links":{"citing_paper":"/paper/2505.15661"},"observation_digest":"sha256:02d4700ccbd9ca86f35a0388b587afc433e2a5b499a77cc3dc3624f62dd87abb","observation_id":"1ddd5780-54c9-4b75-abae-235f683a58b9","resolution":{"observed_at":"2026-08-07T15:18:17.760926Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1802.08665","last_updated":"2018-02-23T18:15:13Z","snapshot_observed_at":"2026-08-14T19:42:46.664224Z","submitted_at":"2018-02-23T18:15:13Z","title":"Learning Latent Permutations with Gumbel-Sinkhorn Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1802.08665","snapshot_observed_at":"2026-08-07T15:18:13.457161Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.15661","last_updated":"2025-05-21T15:36:38Z","snapshot_observed_at":"2026-08-13T09:23:32.890157Z","submitted_at":"2025-05-21T15:36:38Z","title":"Deep greedy unfolding: Sorting out argsorting in greedy sparse recovery algorithms","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T15:18:13.457161Z"},"links":{"cited_paper":"/paper/1802.08665","citing_paper":"/paper/2505.15661"},"observation_digest":"sha256:5195e79fb18c6e3029e88ac1ee7848791917428ad358e5e7c28aa389d3e33e0c","observation_id":"09c7f3c1-6bcc-4bc9-a816-9c35fad81bc6","resolution":{"observed_at":"2026-08-07T15:18:13.457161Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:18:17.407536Z","title":"Mohammad-Taheri and S","venue":null,"work_id":"d043239f-65db-4816-893f-71c8d430011d","year":2025},"citing_paper":{"arxiv_id":"2505.15661","last_updated":"2025-05-21T15:36:38Z","snapshot_observed_at":"2026-08-13T09:23:32.890157Z","submitted_at":"2025-05-21T15:36:38Z","title":"Deep greedy unfolding: Sorting out argsorting in greedy sparse recovery algorithms","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T15:18:13.506994Z"},"links":{"citing_paper":"/paper/2505.15661"},"observation_digest":"sha256:b02a9031a1f905adb275b30d21467227500dce759d674eb352495eb38e8ce2f2","observation_id":"50061ec2-9a08-4425-98a6-99f479ec4af2","resolution":{"observed_at":"2026-08-07T15:18:17.526437Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-07T15:18:17.208086Z","title":"Mohammad-Taheri, M","venue":null,"work_id":"6a03cc18-ac98-43c0-8f6d-a9fe62a9493c","year":2024},"citing_paper":{"arxiv_id":"2505.15661","last_updated":"2025-05-21T15:36:38Z","snapshot_observed_at":"2026-08-13T09:23:32.890157Z","submitted_at":"2025-05-21T15:36:38Z","title":"Deep greedy unfolding: Sorting out argsorting in greedy sparse recovery algorithms","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T15:18:13.559085Z"},"links":{"citing_paper":"/paper/2505.15661"},"observation_digest":"sha256:0235a00f881c9151cf2a94b3f828451667d9f69972d67f82a1579f61b7e79414","observation_id":"0230397e-b86f-4e55-8833-013c5776cf22","resolution":{"observed_at":"2026-08-07T15:18:17.307346Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-07T15:18:17.082681Z","title":"Monga, Y","venue":null,"work_id":"7191d8cd-5af0-4194-8316-5c8c4112b76b","year":2021},"citing_paper":{"arxiv_id":"2505.15661","last_updated":"2025-05-21T15:36:38Z","snapshot_observed_at":"2026-08-13T09:23:32.890157Z","submitted_at":"2025-05-21T15:36:38Z","title":"Deep greedy unfolding: Sorting out argsorting in greedy sparse recovery algorithms","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T15:18:13.650013Z"},"links":{"citing_paper":"/paper/2505.15661"},"observation_digest":"sha256:f7888d8165e54fa3eaa645ae4688ae2b70125bf1b123ae710d00edf60704940f","observation_id":"5f3e86e5-0dc7-4cb2-b424-c03685e0bd99","resolution":{"observed_at":"2026-08-07T15:18:17.139964Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-07T15:18:16.899636Z","title":"Needell and J","venue":null,"work_id":"4c6d941d-b278-4551-8705-38ac6a87ec11","year":2009},"citing_paper":{"arxiv_id":"2505.15661","last_updated":"2025-05-21T15:36:38Z","snapshot_observed_at":"2026-08-13T09:23:32.890157Z","submitted_at":"2025-05-21T15:36:38Z","title":"Deep greedy unfolding: Sorting out argsorting in greedy sparse recovery algorithms","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-07T15:18:13.729189Z"},"links":{"citing_paper":"/paper/2505.15661"},"observation_digest":"sha256:63bc94fcfba928e0f64230700dc9dcfe65cb11ba8f30ea869f74ea22ee6c5b13","observation_id":"6a6dbadb-8987-4a1e-a1fe-1756700fdbaa","resolution":{"observed_at":"2026-08-07T15:18:16.975298Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-07T15:18:16.719918Z","title":null,"venue":null,"work_id":"49cce8e1-42fa-4d1f-9d8e-f4453816b0fb","year":1993},"citing_paper":{"arxiv_id":"2505.15661","last_updated":"2025-05-21T15:36:38Z","snapshot_observed_at":"2026-08-13T09:23:32.890157Z","submitted_at":"2025-05-21T15:36:38Z","title":"Deep greedy unfolding: Sorting out argsorting in greedy sparse recovery algorithms","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T15:18:13.842697Z"},"links":{"citing_paper":"/paper/2505.15661"},"observation_digest":"sha256:82ceaf147b7d96866b9b68c97c355b8aa804d3d1d7eeaa66c2783dd561b9d3e5","observation_id":"7282560c-22b8-4b1f-8e3b-dd7f61d0e5f0","resolution":{"observed_at":"2026-08-07T15:18:16.801448Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-07T15:18:16.497357Z","title":"Prillo and J","venue":null,"work_id":"e147591a-9af1-44d1-98d3-edd79e76576d","year":2020},"citing_paper":{"arxiv_id":"2505.15661","last_updated":"2025-05-21T15:36:38Z","snapshot_observed_at":"2026-08-13T09:23:32.890157Z","submitted_at":"2025-05-21T15:36:38Z","title":"Deep greedy unfolding: Sorting out argsorting in greedy sparse recovery algorithms","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-07T15:18:13.929322Z"},"links":{"citing_paper":"/paper/2505.15661"},"observation_digest":"sha256:299ce38014715067ae8b21a11b7ada0f5cfcca87a19395444d462917e929059b","observation_id":"26cc6746-d58a-4adc-9d81-6d620600440b","resolution":{"observed_at":"2026-08-07T15:18:16.615725Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-07T15:18:16.290767Z","title":"Rauhut and R","venue":null,"work_id":"021a0a67-db51-4e40-accf-65c8f0b0ff03","year":2016},"citing_paper":{"arxiv_id":"2505.15661","last_updated":"2025-05-21T15:36:38Z","snapshot_observed_at":"2026-08-13T09:23:32.890157Z","submitted_at":"2025-05-21T15:36:38Z","title":"Deep greedy unfolding: Sorting out argsorting in greedy sparse recovery algorithms","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-07T15:18:14.016875Z"},"links":{"citing_paper":"/paper/2505.15661"},"observation_digest":"sha256:d4b34a06ca4b183d3ef89f37d86ebe23c03f2a209a975d74e2d71bafd6b7e637","observation_id":"594e5666-6393-42e6-8dd3-6860a87b0736","resolution":{"observed_at":"2026-08-07T15:18:16.398884Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-07T15:18:16.106703Z","title":null,"venue":null,"work_id":"f1c9c23a-364c-479b-be3c-c9f304277ce7","year":2023},"citing_paper":{"arxiv_id":"2505.15661","last_updated":"2025-05-21T15:36:38Z","snapshot_observed_at":"2026-08-13T09:23:32.890157Z","submitted_at":"2025-05-21T15:36:38Z","title":"Deep greedy unfolding: Sorting out argsorting in greedy sparse recovery algorithms","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-07T15:18:14.076339Z"},"links":{"citing_paper":"/paper/2505.15661"},"observation_digest":"sha256:65f2645ad59683280d5a74aae97763cf584b8a2ef7acf00590aaec917f58e4b8","observation_id":"1681b973-3a43-4267-a0d8-e52e102b8409","resolution":{"observed_at":"2026-08-07T15:18:16.189506Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-07T15:18:15.885342Z","title":"Scarlett, R","venue":null,"work_id":"e8c3c023-b0c1-4e85-bf68-c19e156bd8c8","year":2022},"citing_paper":{"arxiv_id":"2505.15661","last_updated":"2025-05-21T15:36:38Z","snapshot_observed_at":"2026-08-13T09:23:32.890157Z","submitted_at":"2025-05-21T15:36:38Z","title":"Deep greedy unfolding: Sorting out argsorting in greedy sparse recovery algorithms","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-07T15:18:14.162343Z"},"links":{"citing_paper":"/paper/2505.15661"},"observation_digest":"sha256:0c92419e24073a2a3c93f61c5f1e8a9b691e3bdb5c8ca09c1ef9b4e39cafc6e0","observation_id":"7a5978eb-2024-419a-ac7e-a4e96ffa4e9e","resolution":{"observed_at":"2026-08-07T15:18:15.992421Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-07T15:18:15.688457Z","title":null,"venue":null,"work_id":"2faf0a07-c13e-4594-9f1e-909fcf156d20","year":2022},"citing_paper":{"arxiv_id":"2505.15661","last_updated":"2025-05-21T15:36:38Z","snapshot_observed_at":"2026-08-13T09:23:32.890157Z","submitted_at":"2025-05-21T15:36:38Z","title":"Deep greedy unfolding: Sorting out argsorting in greedy sparse recovery algorithms","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-07T15:18:14.243715Z"},"links":{"citing_paper":"/paper/2505.15661"},"observation_digest":"sha256:0b586f97e2e017126d0a65ba07a465a5e8e59f518aabd326aa7d05667e37b45b","observation_id":"d2707964-f589-40ca-a2f4-006e2d5c1b87","resolution":{"observed_at":"2026-08-07T15:18:15.770611Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-07T15:18:15.502330Z","title":null,"venue":null,"work_id":"9babf72b-eb8c-45c2-9b09-53fceab215dc","year":2016},"citing_paper":{"arxiv_id":"2505.15661","last_updated":"2025-05-21T15:36:38Z","snapshot_observed_at":"2026-08-13T09:23:32.890157Z","submitted_at":"2025-05-21T15:36:38Z","title":"Deep greedy unfolding: Sorting out argsorting in greedy sparse recovery algorithms","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-07T15:18:14.288431Z"},"links":{"citing_paper":"/paper/2505.15661"},"observation_digest":"sha256:7235cf84a30fc4a9eac60ea16381376a894dd5a75662432dc5ca65265e202640","observation_id":"7de74f1d-69d0-498e-a4a3-c8d4ad57fa77","resolution":{"observed_at":"2026-08-07T15:18:15.596830Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-07T15:18:15.356906Z","title":null,"venue":null,"work_id":"82063aed-2732-4971-85b2-d6df7de2bff0","year":2016},"citing_paper":{"arxiv_id":"2505.15661","last_updated":"2025-05-21T15:36:38Z","snapshot_observed_at":"2026-08-13T09:23:32.890157Z","submitted_at":"2025-05-21T15:36:38Z","title":"Deep greedy unfolding: Sorting out argsorting in greedy sparse recovery algorithms","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-07T15:18:14.357134Z"},"links":{"citing_paper":"/paper/2505.15661"},"observation_digest":"sha256:eedaa01c6f8097008e62104d7d94e0e404805639758501f6418361cc5215802e","observation_id":"9051dec8-a6bb-4a55-b6de-ff2a42010c3f","resolution":{"observed_at":"2026-08-07T15:18:15.410453Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-07T15:18:15.220508Z","title":"Zhang and B","venue":null,"work_id":"166d4744-2e93-489d-905b-d0f9f104d080","year":2018},"citing_paper":{"arxiv_id":"2505.15661","last_updated":"2025-05-21T15:36:38Z","snapshot_observed_at":"2026-08-13T09:23:32.890157Z","submitted_at":"2025-05-21T15:36:38Z","title":"Deep greedy unfolding: Sorting out argsorting in greedy sparse recovery algorithms","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-07T15:18:14.415746Z"},"links":{"citing_paper":"/paper/2505.15661"},"observation_digest":"sha256:6bf7406396cd0a87157f0508105a9360627bb6b65c12a5a1e42dfa753f78d54a","observation_id":"d472efbf-a457-421d-acd1-bd2f440a295d","resolution":{"observed_at":"2026-08-07T15:18:15.276065Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-07T15:18:15.052739Z","title":"Zhang , Sparse recovery with orthogonal matching pursuit under RIP , IEEE Transactions on Information Theory, 57 (2011), pp","venue":null,"work_id":"e58a567f-d731-4ec5-8ab8-ba9b7af00593","year":2011},"citing_paper":{"arxiv_id":"2505.15661","last_updated":"2025-05-21T15:36:38Z","snapshot_observed_at":"2026-08-13T09:23:32.890157Z","submitted_at":"2025-05-21T15:36:38Z","title":"Deep greedy unfolding: Sorting out argsorting in greedy sparse recovery algorithms","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-07T15:18:14.477906Z"},"links":{"citing_paper":"/paper/2505.15661"},"observation_digest":"sha256:82a06eddb5263d44f22eb7dfb3192632db71f5817e8d942f94caab129ef2027f","observation_id":"7d4ef552-150e-4b5d-aa9b-d2b5cbacdcd2","resolution":{"observed_at":"2026-08-07T15:18:15.145971Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:18:14.566374Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.15661","last_updated":"2025-05-21T15:36:38Z","snapshot_observed_at":"2026-08-13T09:23:32.890157Z","submitted_at":"2025-05-21T15:36:38Z","title":"Deep greedy unfolding: Sorting out argsorting in greedy sparse recovery algorithms","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-07T15:18:14.566374Z"},"links":{"citing_paper":"/paper/2505.15661"},"observation_digest":"sha256:186e99c22b50b826b58dfae4b7bdd97c63d231d45097098593628049b840dfc3","observation_id":"febe93a9-d5f7-40aa-8c21-e253da3d65e1","resolution":{"observed_at":"2026-08-07T15:18:14.566374Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.15661","last_updated":"2025-05-21T15:36:38Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-13T09:23:32.890157Z","submitted_at":"2025-05-21T15:36:38Z","title":"Deep greedy unfolding: Sorting out argsorting in greedy sparse recovery algorithms"},"reference_resolution":{"displayed":47,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":18,"verified_exact":2,"verified_fuzzy":27},"total_outbound_references":47},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 47 of 47 outbound references and 1 inbound Pith citation observation for arXiv:2505.15661."}