{"as_of":"2026-08-21T19:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:713f4a1726d0b7246254615b397d8a4c4f48490512c606f27e58731edbd8191a","coverage":[{"denominator":39,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":39,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-10T06:24:05.170531Z","state":"measured"},{"denominator":39,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":39,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2604.17276/citation-record","integrity":"/paper/2604.17276/integrity","json":"/paper/2604.17276/citation-record.json","paper":"/paper/2604.17276"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Arag´ on Artacho and Rub´ en Campoy","venue":null,"work_id":"63d3b6bd-b72a-4723-9bd8-c71dadd327ea","year":2019},"citing_paper":{"arxiv_id":"2604.17276","last_updated":"2026-04-19T06:12:32Z","snapshot_observed_at":"2026-08-08T13:00:57.688653Z","submitted_at":"2026-04-19T06:12:32Z","title":"Generalized Composed Alternating Relaxed Projection Algorithm for Two-Set Feasibility Problem","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-10T06:24:05.170531Z"},"links":{"citing_paper":"/paper/2604.17276"},"observation_digest":"sha256:f0ca2df853bf8e7a95ea0545f02fcf3dc169be2c844c83c85ff9c9d84a282267","observation_id":"fe6225c8-0ca0-4c17-8bd7-7618bbe28781","resolution":{"observed_at":"2026-05-21T16:55:24.241144Z","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":"2203.02410","last_updated":"2022-03-04T16:24:00Z","snapshot_observed_at":"2026-08-16T17:16:54.598642Z","submitted_at":"2022-03-04T16:24:00Z","title":"A circumcentered-reflection method for finding common fixed points of firmly nonexpansive operators","version":1},"cited_work":{"arxiv_id":"2203.02410","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2203.02410","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Iusem, and Luiz-Rafael Santos","venue":null,"work_id":"0dd58ba9-33a0-4ca3-a53e-5e9440f79e2a","year":2022},"citing_paper":{"arxiv_id":"2604.17276","last_updated":"2026-04-19T06:12:32Z","snapshot_observed_at":"2026-08-08T13:00:57.688653Z","submitted_at":"2026-04-19T06:12:32Z","title":"Generalized Composed Alternating Relaxed Projection Algorithm for Two-Set Feasibility Problem","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-10T06:24:05.170531Z"},"links":{"cited_paper":"/paper/2203.02410","citing_paper":"/paper/2604.17276"},"observation_digest":"sha256:d48c896c8c17592c6f9d743e12132a5611c7ca45e204860453f3334a0e6936a4","observation_id":"ba5e084e-dea8-48aa-b8ce-51757cb1b152","resolution":{"observed_at":"2026-05-10T06:26:27.398248Z","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"dd26b5b6-3a31-4899-bcd0-9618f9905f19","year":1993},"citing_paper":{"arxiv_id":"2604.17276","last_updated":"2026-04-19T06:12:32Z","snapshot_observed_at":"2026-08-08T13:00:57.688653Z","submitted_at":"2026-04-19T06:12:32Z","title":"Generalized Composed Alternating Relaxed Projection Algorithm for Two-Set Feasibility Problem","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-10T06:24:05.170531Z"},"links":{"citing_paper":"/paper/2604.17276"},"observation_digest":"sha256:aa602c44d0ad9b1c5ba8a72b17481d87af2462a71ab1a81c8295993cd698058b","observation_id":"cc773a6a-03e0-4bff-b770-57dbcb7c0f11","resolution":{"observed_at":"2026-05-21T16:55:24.285092Z","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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"97f8a504-88e2-4719-8c19-808e428200dd","year":2014},"citing_paper":{"arxiv_id":"2604.17276","last_updated":"2026-04-19T06:12:32Z","snapshot_observed_at":"2026-08-08T13:00:57.688653Z","submitted_at":"2026-04-19T06:12:32Z","title":"Generalized Composed Alternating Relaxed Projection Algorithm for Two-Set Feasibility Problem","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-10T06:24:05.170531Z"},"links":{"citing_paper":"/paper/2604.17276"},"observation_digest":"sha256:0943171a9d1d73d09e739a42086d8d5d3abfbf3540d02184bd6246ca2c5457c8","observation_id":"e9f60dd9-27c2-40f2-b3b1-b1f290a9e0d0","resolution":{"observed_at":"2026-05-21T16:55:24.287163Z","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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"bc9504be-d2c0-4601-8a93-39d9d848d22d","year":2016},"citing_paper":{"arxiv_id":"2604.17276","last_updated":"2026-04-19T06:12:32Z","snapshot_observed_at":"2026-08-08T13:00:57.688653Z","submitted_at":"2026-04-19T06:12:32Z","title":"Generalized Composed Alternating Relaxed Projection Algorithm for Two-Set Feasibility Problem","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-10T06:24:05.170531Z"},"links":{"citing_paper":"/paper/2604.17276"},"observation_digest":"sha256:20a6a91e5ee115eb60f0780428a64daab4f8d9f180291592dc0afeafb16ce72a","observation_id":"2197fd17-5435-4604-8425-7a99ff9c16ea","resolution":{"observed_at":"2026-05-21T16:55:24.304283Z","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-06-05T21:23:00.469572Z","title":"Bauschke, Tom Bendit, and Walaa M","venue":null,"work_id":"52db2be0-3d26-448d-8b95-6429694a8440","year":2023},"citing_paper":{"arxiv_id":"2604.17276","last_updated":"2026-04-19T06:12:32Z","snapshot_observed_at":"2026-08-08T13:00:57.688653Z","submitted_at":"2026-04-19T06:12:32Z","title":"Generalized Composed Alternating Relaxed Projection Algorithm for Two-Set Feasibility Problem","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-10T06:24:05.170531Z"},"links":{"citing_paper":"/paper/2604.17276"},"observation_digest":"sha256:61d9f478448073e95e83f9c1b220608ba297a8838d21db8015e5734a2883ccbf","observation_id":"ef394bb6-caa1-4dbf-be44-347b18bd3fb2","resolution":{"observed_at":"2026-05-21T16:55:24.263347Z","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-06-05T21:23:00.469572Z","title":"Correction to: convex analysis and mono- tone operator theory in hilbert spaces","venue":null,"work_id":"5aaeec0b-1523-4e62-893c-a50e63b374eb","year":2020},"citing_paper":{"arxiv_id":"2604.17276","last_updated":"2026-04-19T06:12:32Z","snapshot_observed_at":"2026-08-08T13:00:57.688653Z","submitted_at":"2026-04-19T06:12:32Z","title":"Generalized Composed Alternating Relaxed Projection Algorithm for Two-Set Feasibility Problem","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-10T06:24:05.170531Z"},"links":{"citing_paper":"/paper/2604.17276"},"observation_digest":"sha256:b5fa903a0ee20b53c8ec821b9e658d6f95179ab966d8de7478aecfa208227666","observation_id":"f78e57c2-ffe8-44e1-a447-741f8fbb72ed","resolution":{"observed_at":"2026-05-21T16:55:24.275042Z","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-06-05T21:23:00.469572Z","title":"Bauschke, Patrick L","venue":null,"work_id":"6c2c350e-fadd-4e0b-8ad2-fcf3ab48d0c1","year":2005},"citing_paper":{"arxiv_id":"2604.17276","last_updated":"2026-04-19T06:12:32Z","snapshot_observed_at":"2026-08-08T13:00:57.688653Z","submitted_at":"2026-04-19T06:12:32Z","title":"Generalized Composed Alternating Relaxed Projection Algorithm for Two-Set Feasibility Problem","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-10T06:24:05.170531Z"},"links":{"citing_paper":"/paper/2604.17276"},"observation_digest":"sha256:26a57ed80b15c72ff4e1bcb12b04b1948353bf6260f762c837dac2e25cf1d60f","observation_id":"676464e9-aa81-41dc-bebb-bd19255411c7","resolution":{"observed_at":"2026-05-21T16:55:24.278899Z","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-06-05T21:23:00.469572Z","title":"Bauschke, J","venue":null,"work_id":"6e3c4171-0aaf-4b91-95e1-3f38eeecafbe","year":2016},"citing_paper":{"arxiv_id":"2604.17276","last_updated":"2026-04-19T06:12:32Z","snapshot_observed_at":"2026-08-08T13:00:57.688653Z","submitted_at":"2026-04-19T06:12:32Z","title":"Generalized Composed Alternating Relaxed Projection Algorithm for Two-Set Feasibility Problem","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-10T06:24:05.170531Z"},"links":{"citing_paper":"/paper/2604.17276"},"observation_digest":"sha256:e85270e5a2cc730867b936679ad5ea78cc7b6d951eb7c5c9b719fb972711c6b7","observation_id":"1d76d33b-1e3a-49fa-a711-73f72324157d","resolution":{"observed_at":"2026-05-21T16:55:24.291579Z","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-06-05T21:23:00.469572Z","title":"Bauschke, Dayou Mao, and Walaa M","venue":null,"work_id":"ab2ff6d8-9ca7-43c1-9a15-2efeaa48e452","year":2024},"citing_paper":{"arxiv_id":"2604.17276","last_updated":"2026-04-19T06:12:32Z","snapshot_observed_at":"2026-08-08T13:00:57.688653Z","submitted_at":"2026-04-19T06:12:32Z","title":"Generalized Composed Alternating Relaxed Projection Algorithm for Two-Set Feasibility Problem","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-10T06:24:05.170531Z"},"links":{"citing_paper":"/paper/2604.17276"},"observation_digest":"sha256:d7ad8dc3118ee2fb7faad34aa7e245f9c2a668565e73367598de9007a8e2b4ba","observation_id":"66233cd7-faaf-4718-bf71-ad595694373d","resolution":{"observed_at":"2026-05-21T16:55:24.267183Z","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-06-05T21:23:00.469572Z","title":"A suc- cessive centralized circumcentered-reflection method for the convex feasibility problem","venue":null,"work_id":"d7b872c2-53b2-4506-b89a-0bf6a9448b78","year":2024},"citing_paper":{"arxiv_id":"2604.17276","last_updated":"2026-04-19T06:12:32Z","snapshot_observed_at":"2026-08-08T13:00:57.688653Z","submitted_at":"2026-04-19T06:12:32Z","title":"Generalized Composed Alternating Relaxed Projection Algorithm for Two-Set Feasibility Problem","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-10T06:24:05.170531Z"},"links":{"citing_paper":"/paper/2604.17276"},"observation_digest":"sha256:141b14d4deee2d520f198faef57f35194f60076890894870abece0788d83b637","observation_id":"d666d1aa-5b18-4ad7-9444-47fb354ca290","resolution":{"observed_at":"2026-05-21T16:55:24.257132Z","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-06-05T21:23:00.469572Z","title":"On the circumcentered- reflection method for the convex feasibility problem","venue":null,"work_id":"19fa28ae-b77e-4bf0-b340-c8b49a74cfe2","year":2021},"citing_paper":{"arxiv_id":"2604.17276","last_updated":"2026-04-19T06:12:32Z","snapshot_observed_at":"2026-08-08T13:00:57.688653Z","submitted_at":"2026-04-19T06:12:32Z","title":"Generalized Composed Alternating Relaxed Projection Algorithm for Two-Set Feasibility Problem","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-10T06:24:05.170531Z"},"links":{"citing_paper":"/paper/2604.17276"},"observation_digest":"sha256:d240fe18f7012ead5d41982be3c108725588688e82200ba63f4fa138352e6d52","observation_id":"052e8595-5db3-4bb0-bfdf-9b02697891dd","resolution":{"observed_at":"2026-05-21T16:55:24.261243Z","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-06-05T21:23:00.469572Z","title":"Robust signal recovery under uncertain-but-bounded perturbations in observation matr ix","venue":null,"work_id":"d3be9de6-5967-49ba-95df-97d063e30fc4","year":2025},"citing_paper":{"arxiv_id":"2604.17276","last_updated":"2026-04-19T06:12:32Z","snapshot_observed_at":"2026-08-08T13:00:57.688653Z","submitted_at":"2026-04-19T06:12:32Z","title":"Generalized Composed Alternating Relaxed Projection Algorithm for Two-Set Feasibility Problem","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-10T06:24:05.170531Z"},"links":{"citing_paper":"/paper/2604.17276"},"observation_digest":"sha256:34b2b0a2d1ca2630fc25fdab3fd3245f7f2228ee5b0757cd7520e7cd886cad96","observation_id":"c02dc8b5-76b7-4612-a94d-ea3fd736e5ef","resolution":{"observed_at":"2026-05-21T16:55:24.259246Z","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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"efea7eca-cd1c-4821-a0d9-5146462ca6a6","year":1996},"citing_paper":{"arxiv_id":"2604.17276","last_updated":"2026-04-19T06:12:32Z","snapshot_observed_at":"2026-08-08T13:00:57.688653Z","submitted_at":"2026-04-19T06:12:32Z","title":"Generalized Composed Alternating Relaxed Projection Algorithm for Two-Set Feasibility Problem","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-10T06:24:05.170531Z"},"links":{"citing_paper":"/paper/2604.17276"},"observation_digest":"sha256:a9151e57b0db8a290d7fe319879c44e2ce9bf866855f898dfc35e2956937c4a8","observation_id":"94c8aaf5-11c0-4c10-a677-5164b563b264","resolution":{"observed_at":"2026-05-21T16:55:24.265096Z","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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"d20d65e2-4e1c-49d2-849d-8d6744167c2e","year":2015},"citing_paper":{"arxiv_id":"2604.17276","last_updated":"2026-04-19T06:12:32Z","snapshot_observed_at":"2026-08-08T13:00:57.688653Z","submitted_at":"2026-04-19T06:12:32Z","title":"Generalized Composed Alternating Relaxed Projection Algorithm for Two-Set Feasibility Problem","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-10T06:24:05.170531Z"},"links":{"citing_paper":"/paper/2604.17276"},"observation_digest":"sha256:dca391b896abc7de652ebf0295ff00ad92e40e7105b366efbd560b4e6e3c0923","observation_id":"a1cdc371-d8f2-46f1-a07e-ef4d2511471f","resolution":{"observed_at":"2026-05-21T16:55:24.243195Z","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-06-05T21:23:00.469572Z","title":"Fast projection onto the simplex and th e l1 ball","venue":null,"work_id":"e9e24cc1-cd75-478f-9cb8-25405f624869","year":2016},"citing_paper":{"arxiv_id":"2604.17276","last_updated":"2026-04-19T06:12:32Z","snapshot_observed_at":"2026-08-08T13:00:57.688653Z","submitted_at":"2026-04-19T06:12:32Z","title":"Generalized Composed Alternating Relaxed Projection Algorithm for Two-Set Feasibility Problem","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-10T06:24:05.170531Z"},"links":{"citing_paper":"/paper/2604.17276"},"observation_digest":"sha256:3183bfae08b65ca23ed1a64be1c5086d89d7a32bc663ff5495bece0b8d376837","observation_id":"7655c88f-a7fa-47cf-a84a-f0349a39e919","resolution":{"observed_at":"2026-05-21T16:55:24.276968Z","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-06-05T21:23:00.469572Z","title":"Linear convergence of the gene ralized douglas–rachford algorithm for feasibility problems","venue":null,"work_id":"6e79a7d1-0965-40a6-b983-6c8acc8ebe32","year":2018},"citing_paper":{"arxiv_id":"2604.17276","last_updated":"2026-04-19T06:12:32Z","snapshot_observed_at":"2026-08-08T13:00:57.688653Z","submitted_at":"2026-04-19T06:12:32Z","title":"Generalized Composed Alternating Relaxed Projection Algorithm for Two-Set Feasibility Problem","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-10T06:24:05.170531Z"},"links":{"citing_paper":"/paper/2604.17276"},"observation_digest":"sha256:fa66fff30e7c7cd3b1c8a71d469f98309126d8c8d69876455c10de56ad18f4d3","observation_id":"12b5a770-6d8c-44b3-97aa-732b8edab076","resolution":{"observed_at":"2026-05-21T16:55:24.283370Z","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-06-05T21:23:00.469572Z","title":"Dao and Hung M","venue":null,"work_id":"71436ea4-faaa-43da-8a67-5677d8790e7a","year":2019},"citing_paper":{"arxiv_id":"2604.17276","last_updated":"2026-04-19T06:12:32Z","snapshot_observed_at":"2026-08-08T13:00:57.688653Z","submitted_at":"2026-04-19T06:12:32Z","title":"Generalized Composed Alternating Relaxed Projection Algorithm for Two-Set Feasibility Problem","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-10T06:24:05.170531Z"},"links":{"citing_paper":"/paper/2604.17276"},"observation_digest":"sha256:69bf5ecdd7c28e86b27ec5c9914b7bbbe4c18906508e85c6bedd8714d579d6d9","observation_id":"4c43d466-d778-4163-b274-b12bcc4e1191","resolution":{"observed_at":"2026-05-21T16:55:24.239063Z","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-06-05T21:23:00.469572Z","title":"Douglas and H","venue":null,"work_id":"85fee63e-83fc-4a28-bdd4-5558b1658b82","year":1956},"citing_paper":{"arxiv_id":"2604.17276","last_updated":"2026-04-19T06:12:32Z","snapshot_observed_at":"2026-08-08T13:00:57.688653Z","submitted_at":"2026-04-19T06:12:32Z","title":"Generalized Composed Alternating Relaxed Projection Algorithm for Two-Set Feasibility Problem","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-10T06:24:05.170531Z"},"links":{"citing_paper":"/paper/2604.17276"},"observation_digest":"sha256:ac0ef5a0fbcb0c33ba018190e2a8e3b4be4e686dc26153f061c782ec04a254f1","observation_id":"42d40c3a-8c09-4474-9b03-6a1447443bbb","resolution":{"observed_at":"2026-05-21T16:55:24.268973Z","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-06-05T21:23:00.469572Z","title":"Efficient pro- jections onto the ℓ1-ball for learning in high dimensions","venue":null,"work_id":"a3c84b23-fb07-4d17-83ea-4145e4fa32db","year":2008},"citing_paper":{"arxiv_id":"2604.17276","last_updated":"2026-04-19T06:12:32Z","snapshot_observed_at":"2026-08-08T13:00:57.688653Z","submitted_at":"2026-04-19T06:12:32Z","title":"Generalized Composed Alternating Relaxed Projection Algorithm for Two-Set Feasibility Problem","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-10T06:24:05.170531Z"},"links":{"citing_paper":"/paper/2604.17276"},"observation_digest":"sha256:bb67305be6eae8db9ec04ffd5b95256aa6671b414974a81d2b4ce185de2679a8","observation_id":"7f159a4d-9c71-4399-b002-875d78249f78","resolution":{"observed_at":"2026-05-21T16:55:24.270884Z","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-06-05T21:23:00.469572Z","title":"F¨ alt and P","venue":null,"work_id":"9dc762cb-9570-403a-92a5-1516029e0153","year":2017},"citing_paper":{"arxiv_id":"2604.17276","last_updated":"2026-04-19T06:12:32Z","snapshot_observed_at":"2026-08-08T13:00:57.688653Z","submitted_at":"2026-04-19T06:12:32Z","title":"Generalized Composed Alternating Relaxed Projection Algorithm for Two-Set Feasibility Problem","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-10T06:24:05.170531Z"},"links":{"citing_paper":"/paper/2604.17276"},"observation_digest":"sha256:980bc48bacf8194ec66b031099e6a18965e2846c5300a422b086030ff962e291","observation_id":"02aab5a3-aaad-4227-b986-9b367a3aad6a","resolution":{"observed_at":"2026-05-21T16:55:24.247275Z","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-06-05T21:23:00.469572Z","title":"Convergence improvement and noise attenuation consi derations for beyond alias projection onto convex sets reconstruction","venue":null,"work_id":"f1b6af29-50a7-430a-aacb-1c442e09c8aa","year":2013},"citing_paper":{"arxiv_id":"2604.17276","last_updated":"2026-04-19T06:12:32Z","snapshot_observed_at":"2026-08-08T13:00:57.688653Z","submitted_at":"2026-04-19T06:12:32Z","title":"Generalized Composed Alternating Relaxed Projection Algorithm for Two-Set Feasibility Problem","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-10T06:24:05.170531Z"},"links":{"citing_paper":"/paper/2604.17276"},"observation_digest":"sha256:140bc22b3bd24b4c34219632aa5d30cb528ca5b3c781a091e0b9daabf979b4c6","observation_id":"0928c876-2e9a-4048-b466-57513f935761","resolution":{"observed_at":"2026-05-21T16:55:24.251092Z","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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"771ff2d3-74fe-46ed-8eea-17ff961e8497","year":1967},"citing_paper":{"arxiv_id":"2604.17276","last_updated":"2026-04-19T06:12:32Z","snapshot_observed_at":"2026-08-08T13:00:57.688653Z","submitted_at":"2026-04-19T06:12:32Z","title":"Generalized Composed Alternating Relaxed Projection Algorithm for Two-Set Feasibility Problem","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-10T06:24:05.170531Z"},"links":{"citing_paper":"/paper/2604.17276"},"observation_digest":"sha256:cf044deeb621e1b42391aef97fd58bfb435061472b8f70a86a9de301087756de","observation_id":"7da2ade5-cadd-4b04-9f8a-5ba4845fb269","resolution":{"observed_at":"2026-05-21T16:55:24.254988Z","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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"b01878b1-9dbc-4fa0-b4e4-ed5237d016c0","year":2007},"citing_paper":{"arxiv_id":"2604.17276","last_updated":"2026-04-19T06:12:32Z","snapshot_observed_at":"2026-08-08T13:00:57.688653Z","submitted_at":"2026-04-19T06:12:32Z","title":"Generalized Composed Alternating Relaxed Projection Algorithm for Two-Set Feasibility Problem","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-10T06:24:05.170531Z"},"links":{"citing_paper":"/paper/2604.17276"},"observation_digest":"sha256:e1f895333dc5fa2db591b75f32ebb51992fa7452e2ba6c0a6309b666ab1eb8c1","observation_id":"d13d16e9-04eb-4973-b558-4b7b627a3d6b","resolution":{"observed_at":"2026-05-21T16:55:24.253152Z","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-06-05T21:23:00.469572Z","title":"Lewis, D","venue":null,"work_id":"3b09d0f3-0c5b-43ce-940e-251f40835ad5","year":2009},"citing_paper":{"arxiv_id":"2604.17276","last_updated":"2026-04-19T06:12:32Z","snapshot_observed_at":"2026-08-08T13:00:57.688653Z","submitted_at":"2026-04-19T06:12:32Z","title":"Generalized Composed Alternating Relaxed Projection Algorithm for Two-Set Feasibility Problem","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-10T06:24:05.170531Z"},"links":{"citing_paper":"/paper/2604.17276"},"observation_digest":"sha256:815c7747c4739c3a4e03ff98b7069acf66fedc6db6ef0ce124ef1a81aeb14edb","observation_id":"75e92a10-40a7-4237-82a5-74b52c0ab5e0","resolution":{"observed_at":"2026-05-21T16:55:24.310528Z","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-06-05T21:23:00.469572Z","title":"Douglas–rachford splittin g for nonconvex optimization with application to nonconvex feasibility problems","venue":null,"work_id":"0e283f26-d26c-471e-af9b-ade06e63a03d","year":2016},"citing_paper":{"arxiv_id":"2604.17276","last_updated":"2026-04-19T06:12:32Z","snapshot_observed_at":"2026-08-08T13:00:57.688653Z","submitted_at":"2026-04-19T06:12:32Z","title":"Generalized Composed Alternating Relaxed Projection Algorithm for Two-Set Feasibility Problem","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-10T06:24:05.170531Z"},"links":{"citing_paper":"/paper/2604.17276"},"observation_digest":"sha256:ae6130bb38acfeebf6cf131189343ee7d73e95eef5fd1a515b35b85e755339f1","observation_id":"5a7058fe-7e5d-42f9-aec9-fef5e960422f","resolution":{"observed_at":"2026-05-21T16:55:24.300395Z","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-06-05T21:23:00.469572Z","title":"Liang, J","venue":null,"work_id":"9b495194-3ed1-4c98-aa56-ce2dfd8617f0","year":2016},"citing_paper":{"arxiv_id":"2604.17276","last_updated":"2026-04-19T06:12:32Z","snapshot_observed_at":"2026-08-08T13:00:57.688653Z","submitted_at":"2026-04-19T06:12:32Z","title":"Generalized Composed Alternating Relaxed Projection Algorithm for Two-Set Feasibility Problem","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-10T06:24:05.170531Z"},"links":{"citing_paper":"/paper/2604.17276"},"observation_digest":"sha256:43aa2be5f044c7edc3d447d393c43574e87a2a2e5a16cea409a8d633e44bd8bd","observation_id":"512e38c7-c702-474d-9d60-8f6aa07b1266","resolution":{"observed_at":"2026-05-21T16:55:24.302233Z","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-06-05T21:23:00.469572Z","title":"Liang, J","venue":null,"work_id":"baace9f5-25bf-4e31-904f-45542f36d901","year":2017},"citing_paper":{"arxiv_id":"2604.17276","last_updated":"2026-04-19T06:12:32Z","snapshot_observed_at":"2026-08-08T13:00:57.688653Z","submitted_at":"2026-04-19T06:12:32Z","title":"Generalized Composed Alternating Relaxed Projection Algorithm for Two-Set Feasibility Problem","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-10T06:24:05.170531Z"},"links":{"citing_paper":"/paper/2604.17276"},"observation_digest":"sha256:385ea9e9487f097ec957fbbb91574e20752972c36d18afeffc52884dc68d7d36","observation_id":"9de69cb0-ff6c-46bb-9cf7-0f228d401686","resolution":{"observed_at":"2026-05-21T16:55:24.293597Z","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-06-05T21:23:00.469572Z","title":"Lorenz and Quoc Tran-Dinh","venue":null,"work_id":"44e02f89-37d7-4c27-ab1a-f2b06bc336e6","year":2019},"citing_paper":{"arxiv_id":"2604.17276","last_updated":"2026-04-19T06:12:32Z","snapshot_observed_at":"2026-08-08T13:00:57.688653Z","submitted_at":"2026-04-19T06:12:32Z","title":"Generalized Composed Alternating Relaxed Projection Algorithm for Two-Set Feasibility Problem","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-10T06:24:05.170531Z"},"links":{"citing_paper":"/paper/2604.17276"},"observation_digest":"sha256:bc42fdb3d01155b9a96d02d74ddc125a7ea6010dd949c90b1f3bce115ed8657b","observation_id":"78fa46fd-fe23-4c93-bdb5-a67d4ae537ac","resolution":{"observed_at":"2026-05-21T16:55:24.295651Z","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-06-05T21:23:00.469572Z","title":"Russell Luke","venue":null,"work_id":"2a0d0e49-d480-463b-aea6-3d60817f4688","year":2004},"citing_paper":{"arxiv_id":"2604.17276","last_updated":"2026-04-19T06:12:32Z","snapshot_observed_at":"2026-08-08T13:00:57.688653Z","submitted_at":"2026-04-19T06:12:32Z","title":"Generalized Composed Alternating Relaxed Projection Algorithm for Two-Set Feasibility Problem","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-10T06:24:05.170531Z"},"links":{"citing_paper":"/paper/2604.17276"},"observation_digest":"sha256:ce8e4e6e2f3ae0adb0a11c3879b5a5d522d0a296e142851ef2951873c1dadce5","observation_id":"81a36ba9-8f33-4f6a-b823-ef58ef86005a","resolution":{"observed_at":"2026-05-21T16:55:24.297512Z","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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"0b686c5e-3463-4671-a3a4-09e1d0d5244d","year":1955},"citing_paper":{"arxiv_id":"2604.17276","last_updated":"2026-04-19T06:12:32Z","snapshot_observed_at":"2026-08-08T13:00:57.688653Z","submitted_at":"2026-04-19T06:12:32Z","title":"Generalized Composed Alternating Relaxed Projection Algorithm for Two-Set Feasibility Problem","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-10T06:24:05.170531Z"},"links":{"citing_paper":"/paper/2604.17276"},"observation_digest":"sha256:986ead4541461b6e16b7a66ba67c2fe7861b61c2f748a0799949ef960ee33156","observation_id":"9f5f6730-9e19-42be-8a1e-6fad62987cb2","resolution":{"observed_at":"2026-05-21T16:55:24.306230Z","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-06-05T21:23:00.469572Z","title":"Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem","venue":null,"work_id":"dd684e80-4352-4d7c-a1c9-5020e30d6d4e","year":2016},"citing_paper":{"arxiv_id":"2604.17276","last_updated":"2026-04-19T06:12:32Z","snapshot_observed_at":"2026-08-08T13:00:57.688653Z","submitted_at":"2026-04-19T06:12:32Z","title":"Generalized Composed Alternating Relaxed Projection Algorithm for Two-Set Feasibility Problem","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-10T06:24:05.170531Z"},"links":{"citing_paper":"/paper/2604.17276"},"observation_digest":"sha256:9f820bd3f7e130c953b2e59d99de52cbe5b31b4275bb27fb877fce93ce52bc53","observation_id":"60a2850b-d3e2-4770-a82b-2aaffd46d0e8","resolution":{"observed_at":"2026-05-21T16:55:24.289504Z","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-06-05T21:23:00.469572Z","title":"Trajectory of alternat ing direction method of multipliers and adaptive acceleration","venue":null,"work_id":"8a82aff3-f725-4c30-a2bd-c7b9c3559ceb","year":2019},"citing_paper":{"arxiv_id":"2604.17276","last_updated":"2026-04-19T06:12:32Z","snapshot_observed_at":"2026-08-08T13:00:57.688653Z","submitted_at":"2026-04-19T06:12:32Z","title":"Generalized Composed Alternating Relaxed Projection Algorithm for Two-Set Feasibility Problem","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-10T06:24:05.170531Z"},"links":{"citing_paper":"/paper/2604.17276"},"observation_digest":"sha256:ac3abb2eb124d6d971761343d4ace48348fec087dc7371fc92d10bb1aa21a141","observation_id":"d9c9f4f0-582f-4785-8814-71811a1ce45a","resolution":{"observed_at":"2026-05-21T16:55:24.308517Z","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":"2003.03910","last_updated":"2020-09-08T23:32:32Z","snapshot_observed_at":"2026-08-09T19:49:47.008261Z","submitted_at":"2020-03-09T03:51:38Z","title":"Geometry of First-Order Methods and Adaptive Acceleration","version":2},"cited_work":{"arxiv_id":"2003.03910","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2003.03910","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Geometry of first-order methods and adaptive acceleration","venue":null,"work_id":"addfff4c-f91e-4186-a344-9d6f9a779dac","year":2003},"citing_paper":{"arxiv_id":"2604.17276","last_updated":"2026-04-19T06:12:32Z","snapshot_observed_at":"2026-08-08T13:00:57.688653Z","submitted_at":"2026-04-19T06:12:32Z","title":"Generalized Composed Alternating Relaxed Projection Algorithm for Two-Set Feasibility Problem","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-10T06:24:05.170531Z"},"links":{"cited_paper":"/paper/2003.03910","citing_paper":"/paper/2604.17276"},"observation_digest":"sha256:7d982b302e9be929f8ce0b4b90658a9ad2da83838285ef9aa5038084111dc041","observation_id":"83536954-7795-4e54-900d-b52321f317ad","resolution":{"observed_at":"2026-05-10T06:26:27.400745Z","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The optimal error bound for the method of simultaneous projections","venue":null,"work_id":"bd55abd8-d4c8-4ded-ab29-c76ddf627a90","year":2017},"citing_paper":{"arxiv_id":"2604.17276","last_updated":"2026-04-19T06:12:32Z","snapshot_observed_at":"2026-08-08T13:00:57.688653Z","submitted_at":"2026-04-19T06:12:32Z","title":"Generalized Composed Alternating Relaxed Projection Algorithm for Two-Set Feasibility Problem","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-10T06:24:05.170531Z"},"links":{"citing_paper":"/paper/2604.17276"},"observation_digest":"sha256:e598b14437d5cdced31c350cc0ffc1c1f0a398d0ebef59f2821bc10a13cfb848","observation_id":"7fbd75fa-b2b7-4b1a-bbd7-5c6cb213cc45","resolution":{"observed_at":"2026-05-21T16:55:24.281337Z","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":"2504.11313","last_updated":"2025-04-15T15:53:10Z","snapshot_observed_at":"2026-08-16T12:40:49.917947Z","submitted_at":"2025-04-15T15:53:10Z","title":"A Composed Alternating Relaxed Projection Algorithm for Feasibility Problem","version":1},"cited_work":{"arxiv_id":"2504.11313","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.11313","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A composed alternating r elaxed projection algorithm for feasibility problem","venue":null,"work_id":"bf98afd2-cf39-4af2-8bcf-c3d8f3690f63","year":2025},"citing_paper":{"arxiv_id":"2604.17276","last_updated":"2026-04-19T06:12:32Z","snapshot_observed_at":"2026-08-08T13:00:57.688653Z","submitted_at":"2026-04-19T06:12:32Z","title":"Generalized Composed Alternating Relaxed Projection Algorithm for Two-Set Feasibility Problem","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-10T06:24:05.170531Z"},"links":{"cited_paper":"/paper/2504.11313","citing_paper":"/paper/2604.17276"},"observation_digest":"sha256:0340be078c6ce9b50a51d02c4051b33dceb6c0d340d60a67db903fecc52144ea","observation_id":"ae54de1e-2f3c-4736-bcee-57d4ccd30bad","resolution":{"observed_at":"2026-05-10T06:26:27.403263Z","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Learning models for seismic-i nduced vibrations optimal control in structures via random forests","venue":null,"work_id":"644221a6-d447-4291-a111-3ad4d9b1cd0d","year":2020},"citing_paper":{"arxiv_id":"2604.17276","last_updated":"2026-04-19T06:12:32Z","snapshot_observed_at":"2026-08-08T13:00:57.688653Z","submitted_at":"2026-04-19T06:12:32Z","title":"Generalized Composed Alternating Relaxed Projection Algorithm for Two-Set Feasibility Problem","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-10T06:24:05.170531Z"},"links":{"citing_paper":"/paper/2604.17276"},"observation_digest":"sha256:37b512d80a05bfc7818fdc4aa40db90ce26e54b0c646e1262e2a826e743098db","observation_id":"6473ef86-2440-44f4-941f-6075094a0d97","resolution":{"observed_at":"2026-05-21T16:55:24.272909Z","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-06-05T21:23:00.469572Z","title":"A new hybrid cq algorithm for the split feasibility problem in hilbert spaces and its a pplications to compressed sensing","venue":null,"work_id":"c40894c0-f974-406e-8ad8-64ab0bf6e4dc","year":2019},"citing_paper":{"arxiv_id":"2604.17276","last_updated":"2026-04-19T06:12:32Z","snapshot_observed_at":"2026-08-08T13:00:57.688653Z","submitted_at":"2026-04-19T06:12:32Z","title":"Generalized Composed Alternating Relaxed Projection Algorithm for Two-Set Feasibility Problem","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-10T06:24:05.170531Z"},"links":{"citing_paper":"/paper/2604.17276"},"observation_digest":"sha256:160874668e99ec409e26c9f6291129377361187d209ba5e11377c4dd12e415a0","observation_id":"ff659989-1811-41f5-bace-0e5b0e9e6b4c","resolution":{"observed_at":"2026-05-21T16:55:24.249204Z","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-06-05T21:23:00.469572Z","title":"Friedlander, Gilles Henn enfent, Felix J","venue":null,"work_id":"03a4c4dc-98c4-4e7b-8765-89259abfa63a","year":2009},"citing_paper":{"arxiv_id":"2604.17276","last_updated":"2026-04-19T06:12:32Z","snapshot_observed_at":"2026-08-08T13:00:57.688653Z","submitted_at":"2026-04-19T06:12:32Z","title":"Generalized Composed Alternating Relaxed Projection Algorithm for Two-Set Feasibility Problem","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-10T06:24:05.170531Z"},"links":{"citing_paper":"/paper/2604.17276"},"observation_digest":"sha256:1def312cd67930ca033919d605faaa83152d958d50e27f906df4ee4d9d8d775f","observation_id":"6f1b424d-bfd9-4ae2-96ca-cf6311f85ada","resolution":{"observed_at":"2026-05-21T16:55:24.245163Z","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"}}],"paper":{"arxiv_id":"2604.17276","last_updated":"2026-04-19T06:12:32Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-08T13:00:57.688653Z","submitted_at":"2026-04-19T06:12:32Z","title":"Generalized Composed Alternating Relaxed Projection Algorithm for Two-Set Feasibility Problem"},"reference_resolution":{"displayed":39,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":3,"verified_fuzzy":28},"total_outbound_references":39},"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 21 August 2026, this Paper Citation Record lists 39 of 39 outbound references and 0 inbound Pith citation observations for arXiv:2604.17276."}