{"as_of":"2026-08-20T03:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:55793a35653829976378f60d3ec4c22ba3b5137c119e83fe30eb225616507993","coverage":[{"denominator":137,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T18:57:39.636612Z","state":"measured"},{"denominator":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+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/2506.18275/citation-record","integrity":"/paper/2506.18275/integrity","json":"/paper/2506.18275/citation-record.json","paper":"/paper/2506.18275"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.101144Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.101144Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:8fc00568ef7ce307e764cacbd3d3b879f7ffefe8a7ab0e531528a3ac3ec9f3c2","observation_id":"f8cb7391-7014-42c1-b715-83dfd638a7f4","resolution":{"observed_at":"2026-08-15T18:57:39.101144Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.108542Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.108542Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:37e34fffe224dad9cc55e84e6a5f714fe21c7dc21b70633142dff5e783e808ac","observation_id":"5df42b91-30e3-4e07-82a5-b9e4d1d88e76","resolution":{"observed_at":"2026-08-15T18:57:39.108542Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.114761Z","title":"Achlioptas, A","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.114761Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:b752a3eede4bcb0fc1357941691618ec2bdcf49ba97db385129aed71e21bab7c","observation_id":"97532933-28fb-486d-a258-51874e79744a","resolution":{"observed_at":"2026-08-15T18:57:39.114761Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.120555Z","title":"Achlioptas and F","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.120555Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:a73f1e0410549149d14059a511d2f25f52f6e29871ae625c900a0dc01c5a48d6","observation_id":"3390c0cb-b6f5-4786-94bb-2180a530cb8f","resolution":{"observed_at":"2026-08-15T18:57:39.120555Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.126199Z","title":"Ahmed, B","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.126199Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:9b32d34bfcb7ed5540354476967021aba9daedb43438d1af4d7d4c6fac767d13","observation_id":"83be0349-b36f-4d60-a2f4-cada6029d401","resolution":{"observed_at":"2026-08-15T18:57:39.126199Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.131984Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.131984Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:91e60c2250f2670ffcd185520b00927c8cf1f88d0089166d25c6877307c75988","observation_id":"74374021-dba4-48fc-9ed2-d1c8112f4b8e","resolution":{"observed_at":"2026-08-15T18:57:39.131984Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.138581Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.138581Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:3b0be06e0f453e5893913c3054d78dc2b1196e79aa7bf5f46161c05587c52f9e","observation_id":"e4a72d2a-36c6-468a-8a7f-7ce0685c472b","resolution":{"observed_at":"2026-08-15T18:57:39.138581Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.144013Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.144013Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:aa4608002279cc1d8aa8b7fd04d2176c12bd9e6d1e6df9f64620955ccc9606b8","observation_id":"236c19c9-6202-4dba-9d44-b6dad7360014","resolution":{"observed_at":"2026-08-15T18:57:39.144013Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.02008","last_updated":"2020-06-12T07:40:52Z","snapshot_observed_at":"2026-08-14T19:08:40.386269Z","submitted_at":"2019-12-04T14:20:34Z","title":"Exact asymptotics for phase retrieval and compressed sensing with random generative priors","version":2},"cited_work":{"arxiv_id":"1912.02008","doi":null,"metadata_source":"pith","pith_arxiv_id":"1912.02008","snapshot_observed_at":"2026-08-15T18:57:40.177742Z","title":"Exact asymptotics for phase retrieval and compressed sensing with random generative priors","venue":"math.ST","work_id":"3154e24a-e16e-45df-8e8f-07d9f9761440","year":2019},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.155568Z"},"links":{"cited_paper":"/paper/1912.02008","citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:51b1353e544613a9b12928e769e97d33ace88e037009f6d3fb92e88086db697a","observation_id":"5f30502a-ea01-47c0-93f2-ec3eefa2468f","resolution":{"observed_at":"2026-08-15T18:57:40.183696Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.161123Z","title":"Bahmani and J","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.161123Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:87b3efbd76cc844d54c6560808676e330b85bf5714229977df0e5e0cf3b5fe5f","observation_id":"58639ecd-8e8a-4675-b9b0-8d5df3987a41","resolution":{"observed_at":"2026-08-15T18:57:39.161123Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.166392Z","title":"Balan, B","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.166392Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:494852a8a925843cc474e2f9c1808d12e40976d4d8857a679ceed3baf79765c8","observation_id":"f00b3359-1c62-489e-8c4b-308173d997d7","resolution":{"observed_at":"2026-08-15T18:57:39.166392Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.172273Z","title":"Balan, P","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.172273Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:b55b854522f84e4038617c7bb32fd9d109f5670e0a3885b31e703053e110bf36","observation_id":"1770bfac-d3b1-4fed-a6f3-6bba859367a1","resolution":{"observed_at":"2026-08-15T18:57:39.172273Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.177597Z","title":"Baldassi, A","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.177597Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:ea555e9fdd0d9ebdb3b3205d79cb8c3528d62f18e5d0617163be51c58cefd242","observation_id":"06a7ba15-6a3b-432e-ab43-f00e26de5d78","resolution":{"observed_at":"2026-08-15T18:57:39.177597Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.182863Z","title":"Baldassi, A","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.182863Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:d2bb1d616530e67f32234c374430a6d66914abd903babfb71a5bbdfea243571e","observation_id":"f6ad7c49-a7ea-4d95-bd87-7c68325bcf2e","resolution":{"observed_at":"2026-08-15T18:57:39.182863Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.188573Z","title":"Baldassi, R","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.188573Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:d89a9a403362262a4e72de20d4870dd98fe9beac62f777eec81f9f4d2b084a16","observation_id":"3eb28351-b463-47b3-9f13-b16b4e1bfef0","resolution":{"observed_at":"2026-08-15T18:57:39.188573Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.194150Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.194150Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:7166804d1633228f2bb81258dfb610fd98122dfc91c22709275bc3e7dfca633f","observation_id":"552474e4-e481-4d41-91f4-5c9c4105920e","resolution":{"observed_at":"2026-08-15T18:57:39.194150Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.199968Z","title":"Bansal and J","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.199968Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:598b61be30ce331822d15b81d36e9dfd4d146f14811fc2edfe9fa65374e68fb8","observation_id":"e6e1090b-4163-4f51-86bc-88892307587b","resolution":{"observed_at":"2026-08-15T18:57:39.199968Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.205352Z","title":"Barbier, A","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.205352Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:34e83d2e8e658f8b3c72029d2d5decdd86e2cf3642bf681944cc395126976bd7","observation_id":"9e8f9474-aef6-4ed0-ada6-136173971379","resolution":{"observed_at":"2026-08-15T18:57:39.205352Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1708.03395","last_updated":"2018-11-01T12:05:50Z","snapshot_observed_at":"2026-08-17T15:48:32.874494Z","submitted_at":"2017-08-10T21:53:40Z","title":"Optimal Errors and Phase Transitions in High-Dimensional Generalized Linear Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1708.03395","snapshot_observed_at":"2026-08-15T18:57:39.210625Z","title":"Barbier, F","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.210625Z"},"links":{"cited_paper":"/paper/1708.03395","citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:8188ccc4bb37ecce60aaeb2d13a592290c4ce8b7d7372b8f503edce77bb0838f","observation_id":"109d1996-fd63-484e-976e-f5f413ae0636","resolution":{"observed_at":"2026-08-15T18:57:39.210625Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.216592Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.216592Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:24e58ef1daa07154073390869aa9e26af991d5078072c2fec16ee3aaeea9495e","observation_id":"f9e3acb2-0c6c-45aa-8067-d1d04a61d069","resolution":{"observed_at":"2026-08-15T18:57:39.216592Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.221693Z","title":"Bruck and L.G","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.221693Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:c992e372918fd03473fb91d3d74428a4cafd39aef03509e3af6c3bc29d9209c3","observation_id":"11fe6241-6690-4054-8a98-ddcc466ac9eb","resolution":{"observed_at":"2026-08-15T18:57:39.221693Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.227147Z","title":null,"venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.227147Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:22a696fd3087476b0c83958280b035d32764adf71c9b511afce0e62149aa2d0d","observation_id":"52fe98d7-6804-420a-9344-459385a82142","resolution":{"observed_at":"2026-08-15T18:57:39.227147Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.232568Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.232568Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:fa2204a8b698ec971359d3f4ff00388566ada863fa13cd9b81859b5c5818b186","observation_id":"a4369044-f46a-472c-974d-936856442e0d","resolution":{"observed_at":"2026-08-15T18:57:39.232568Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.237884Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.237884Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:2420e23970451a5a7f5fc701c4acb3f2911de388ce9576fe7a7f82118d6093d2","observation_id":"0b25084e-bdf3-4536-8f93-6d6a350b3bdd","resolution":{"observed_at":"2026-08-15T18:57:39.237884Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.243550Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.243550Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:83bdba5dd4b7de24be448b50b527712a3bc8ac786dddf252d21af2cdc45f8037","observation_id":"46b98800-d06b-4480-b46e-9a9b3b06c2cf","resolution":{"observed_at":"2026-08-15T18:57:39.243550Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.249907Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.249907Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:c18b7792b9a5961bfa10106e914db415530e8a5d1d165ce0de7c70feaef40fd0","observation_id":"626ec244-a865-40ce-8cf5-8e4a6150924f","resolution":{"observed_at":"2026-08-15T18:57:39.249907Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.255541Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.255541Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:fbd90bb11c76d804eecc838765f78685bd9af33e03a7e9ab7e859e946fec4726","observation_id":"c73c3a07-1904-4a1e-bdfd-57efc65640b9","resolution":{"observed_at":"2026-08-15T18:57:39.255541Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.261219Z","title":null,"venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.261219Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:8ff927202983dc0b3654120ce4a71fbbd6354960a67418b7812fca4292c712b5","observation_id":"da8455bd-0297-4a2d-87ef-8ce1f7869eee","resolution":{"observed_at":"2026-08-15T18:57:39.261219Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.266736Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.266736Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:981a2b598a57e54c8a4f248f707ac53c1b1be17c66bee35500fa20db25487fe4","observation_id":"d200a4fb-458f-4e92-b259-a818124be811","resolution":{"observed_at":"2026-08-15T18:57:39.266736Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.272377Z","title":"Chen and E","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.272377Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:67523ff54fdee3b44bac7a5fad074488d3cef53d92de2064c850aa042e4c3f22","observation_id":"5096c2e3-e082-4a18-81fc-053f8819d788","resolution":{"observed_at":"2026-08-15T18:57:39.272377Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.277186Z","title":"Conca, D","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.277186Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:3821cb1804b7bcd5201bbe4e8d37144d0074ae01854ba0695a479df97308c01b","observation_id":"d6349015-3ca8-461b-8ed7-591f89608508","resolution":{"observed_at":"2026-08-15T18:57:39.277186Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.282421Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.282421Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:af95afbf32c3b4c3b068daf2098ba25a1619c9b482c25e27b86f4965e35bebed","observation_id":"bf454ed6-52f5-4c30-a107-650a83514bc3","resolution":{"observed_at":"2026-08-15T18:57:39.282421Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.288318Z","title":null,"venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.288318Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:dd1c541d8ed2623b6afc9a85f5ce76f5b11b182e3083c04178e65e7a921054a5","observation_id":"e8706708-3d90-4f6e-b562-80dc33606f39","resolution":{"observed_at":"2026-08-15T18:57:39.288318Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.293313Z","title":"Daskalakis, D","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.293313Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:a67c03d1587d7ee12e7c96497af8709b9a7770df08b716b1bc27650a089b033b","observation_id":"138e87d4-41d7-42b4-99ed-2b0e25babebe","resolution":{"observed_at":"2026-08-15T18:57:39.293313Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.298100Z","title":"Daude, M","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.298100Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:cf61254d6fa7b0bbd0c37eac66fad2bdb3a648ee290a60c6db79815a7daf84a9","observation_id":"e1160f6e-e13c-4c7e-a364-0c926d26417b","resolution":{"observed_at":"2026-08-15T18:57:39.298100Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.303126Z","title":"Dhifallah, C","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.303126Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:cc141e3833f8c2d0316de1ee858b0b98072953ae8d54c18df17145bb4a57d423","observation_id":"23a4f5e6-f9cb-4415-bc3d-8c12f827825e","resolution":{"observed_at":"2026-08-15T18:57:39.303126Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.308071Z","title":"Dierolf, A","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.308071Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:da96de03866ae222793c745f1bffc872e1b6230ec0cab160a67d1123a501fd5f","observation_id":"04634187-ad40-4a5a-b6ab-9afd34e4680b","resolution":{"observed_at":"2026-08-15T18:57:39.308071Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.312805Z","title":"Donoho, A","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.312805Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:0bf2c3a6d9425980daec4ea159b3d0eba4bd4ae43956ed98609c1fafa67a13a4","observation_id":"a507824a-e5dd-4830-af40-f94330960fb0","resolution":{"observed_at":"2026-08-15T18:57:39.312805Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.319086Z","title":"Duadi, O","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.319086Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:0a5e048a613198c110cb24c3e43a25287a158479bf4e1e01f15d273b3b60d516","observation_id":"dcb32c82-e32e-4cef-b6b8-0b950e493e18","resolution":{"observed_at":"2026-08-15T18:57:39.319086Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.324158Z","title":"Dudeja, M","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.324158Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:0dfd51e44773878b5518f2d7af19c1e8d686ef86af0f1bb846ee5443fb4a23be","observation_id":"ba4685b7-90c4-4aaf-9087-a4b1edc55e12","resolution":{"observed_at":"2026-08-15T18:57:39.324158Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.329462Z","title":"Fannjiang and Z","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.329462Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:e80f349549f6fec15b9ef5fcc9f716f6036c0a694f68cd2325a369d7fa30b13e","observation_id":"dbbd9eea-65ff-4c89-b2b2-4e40f54aa32e","resolution":{"observed_at":"2026-08-15T18:57:39.329462Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.334672Z","title":null,"venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.334672Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:6be3b0e51a84d3c2c863f5ca3214b86a9a553546ac84eb1416e6a43347c91091","observation_id":"078694f6-fe58-4f02-b547-8e54ebb72bc2","resolution":{"observed_at":"2026-08-15T18:57:39.334672Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.339758Z","title":null,"venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.339758Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:ba27700501d673d2478c740d01c7cfe4621f2e22e254b26db8e2878adf7df131","observation_id":"204ece03-e6e5-4e26-9db4-b1b5d25463af","resolution":{"observed_at":"2026-08-15T18:57:39.339758Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.345070Z","title":null,"venue":null,"work_id":null,"year":1948},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.345070Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:5b02f3a916eb8a38697e14c4913ae0f7f8ee37a5b107efd87348b0ca2ae232ab","observation_id":"507ca715-6435-4b17-84fe-1be2372d942c","resolution":{"observed_at":"2026-08-15T18:57:39.345070Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.350016Z","title":"Gabor, G","venue":null,"work_id":null,"year":1965},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.350016Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:82d5bde42d71a55450711d7ee7862d40a59a937fb22509884d81a442e087b4f6","observation_id":"1e6b9314-77ba-4f64-826c-0c83382e0c1c","resolution":{"observed_at":"2026-08-15T18:57:39.350016Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.355563Z","title":"Gamarnik","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.355563Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:ac6068ab61cff5f9eff59a62431e024ed866061d23c16e0cbe3ec1712f901521","observation_id":"aa818bc9-7535-45b7-90f7-85487736477c","resolution":{"observed_at":"2026-08-15T18:57:39.355563Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.360834Z","title":"Gamarnik, E","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.360834Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:eb4b056d4321598155aa317109aa433f3601c236e41bcc390cc2138ea2486179","observation_id":"57a9bf6e-2ec1-4b68-a69b-8ee1beec0510","resolution":{"observed_at":"2026-08-15T18:57:39.360834Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.365814Z","title":"Gamarnik, C","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.365814Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:b8cd1025cf89c294b9a4e998e2598b15624b5ab2248b75a7087a1edd6c64623a","observation_id":"768d63f6-d715-468c-8a3e-4ee4ceea89e2","resolution":{"observed_at":"2026-08-15T18:57:39.365814Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.371980Z","title":"Gamarnik and M","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.371980Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:bb1024efa6b11d56231484c4a67a19f86154d0744a65ae9d210fce1dd8c516fb","observation_id":"7d34352b-5128-4f95-b1f5-a7f6ad0d5f91","resolution":{"observed_at":"2026-08-15T18:57:39.371980Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.376856Z","title":"Gamarnik and M","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.376856Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:9e0a8aaa3a6b10fbdaa3958baab2061d56197a31bf2430fcf73d40f554fa7ffa","observation_id":"6bb166bc-a0bf-4846-91b8-e2aed9bb5bb0","resolution":{"observed_at":"2026-08-15T18:57:39.376856Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.382005Z","title":"Gamarnik and M","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.382005Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:c3b9bd2bf27a37e732fc8b86ad0ea4dce69b4c0373bceb4e3ee06cb7452ea7e5","observation_id":"7b081a52-d011-4354-8862-3d13823b2043","resolution":{"observed_at":"2026-08-15T18:57:39.382005Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.388055Z","title":null,"venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.388055Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:eca3e60263e3e33b673236f1c6d6eb1973df942edf4d4913fb5616e9ae220911","observation_id":"a708318e-56dd-402b-b66f-0f4f93b676b2","resolution":{"observed_at":"2026-08-15T18:57:39.388055Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.393469Z","title":"Goldstein and C","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.393469Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:441f62289323f35260ccb8b66b332da280423231a34355018c862462ab6739d6","observation_id":"8c095132-8141-4a94-9c6e-fde5ba6e184d","resolution":{"observed_at":"2026-08-15T18:57:39.393469Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.398553Z","title":null,"venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.398553Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:d78d72276311bf65bc9d8aec0cd4e38bc52beb3c3359faf4c45c2a7bf699207d","observation_id":"b7adee96-1da6-4969-91dc-202d4304b8c8","resolution":{"observed_at":"2026-08-15T18:57:39.398553Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.404176Z","title":"Gross, F","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.404176Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:df7bd371f93c1fcf9e187be5fbc2a74f12b9bb74d0901cae74034c648330d0a6","observation_id":"99c45142-5606-4b37-a03e-14f8266f6cb9","resolution":{"observed_at":"2026-08-15T18:57:39.404176Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.409287Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.409287Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:3e6e530c2eea2bc45a7c1f77f077b5f507244abf5d01100a8b176e51d0ae5014","observation_id":"5e050126-9097-4e78-91a7-24cb29da5549","resolution":{"observed_at":"2026-08-15T18:57:39.409287Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.415233Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.415233Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:d3e0f476412f74d3d550576c82f08e4a206630ce4ea77d70fd0ee0df0e2e0f91","observation_id":"705de1ce-90a6-4959-b3bc-06bcfcfc5593","resolution":{"observed_at":"2026-08-15T18:57:39.415233Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.420307Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.420307Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:c1f2255e12575a141e4bdd7e1943f043d1a560de23871d9120d8acede5f2552b","observation_id":"161f0f04-a94c-4d0f-bae9-baa7c20e2937","resolution":{"observed_at":"2026-08-15T18:57:39.420307Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.425599Z","title":"Hand and V","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.425599Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:cac09702907a7fae0cd85d8ba9507dd9de4fc16b1977f2119a0d47a3960ee123","observation_id":"8dfa9c8f-6106-440e-8acf-ce001e972810","resolution":{"observed_at":"2026-08-15T18:57:39.425599Z","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-15T18:57:41.327822Z","title":null,"venue":null,"work_id":"1a66d043-d9c7-4906-a374-862aab856647","year":1993},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.430123Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:e4c123e31a7dc819d67ecdf8fec8f2cc4973233abd035b9148e231b16f763e22","observation_id":"37b5989e-f420-4863-aec4-035c25709b74","resolution":{"observed_at":"2026-08-15T18:57:41.333520Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:41.310040Z","title":"Heinosaari, L","venue":null,"work_id":"cf4e4a8f-11a8-4913-a030-6500f431f0f1","year":2013},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.434686Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:25b44bc4efc9148541d3402db60f0141fb087bdc7600e788c83f2b961df255aa","observation_id":"f459a3fc-bdb3-46af-a87a-9636f8c9922c","resolution":{"observed_at":"2026-08-15T18:57:41.315325Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.438989Z","title":"Huang and M","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.438989Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:0c5a235434e754167e15234dd7c42cfc7f5fbe20c7ee8b04fea75c15ac58cd5b","observation_id":"c5bc7b52-2fd1-481b-b951-74a524d1ed75","resolution":{"observed_at":"2026-08-15T18:57:39.438989Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.444068Z","title":"Huang and Y","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.444068Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:49d93bfeaea1d2b91c38818473015120bc734460ee9d89ff962f3f14b3a34ad1","observation_id":"90af7a60-1e7a-401d-81c8-785c741e004c","resolution":{"observed_at":"2026-08-15T18:57:39.444068Z","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-15T18:57:41.268232Z","title":"Huang, K","venue":null,"work_id":"7f601cb2-be97-4363-bfe9-307f29445b06","year":2013},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.449883Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:88858c5ce079c3f7df888789fb757d16794656a70abf4b82193b9cc50b3e1f5e","observation_id":"0b3cf896-a8cb-4b92-b5f9-d3a2ba8c7ae2","resolution":{"observed_at":"2026-08-15T18:57:41.273609Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:41.251314Z","title":null,"venue":null,"work_id":"b256e061-db08-4724-8c2f-eeb025c05b28","year":1989},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.455166Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:4664fa9d9a1153d974932cf0ad05cb31c8e70413e06cf1f9ba8d3f9ff5e9e2bd","observation_id":"f05e179a-50ba-4e49-8a38-20c6ddeddca8","resolution":{"observed_at":"2026-08-15T18:57:41.256718Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.460271Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.460271Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:c04bd8938bb179df4d437dd9fe3a81d8f0739746a29d7f11c150b26322657a46","observation_id":"18a00fd2-cea1-49a6-b97f-8815c95aff35","resolution":{"observed_at":"2026-08-15T18:57:39.460271Z","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-15T18:57:41.220403Z","title":"Jaganathan, S","venue":null,"work_id":"1aa2571d-bb45-4371-ba96-79683e3bc709","year":2017},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.465205Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:3ab10781b8bfa29f176ca3ac582c6ccfa32461b281fa796bb983a24a9dc5fa44","observation_id":"c8b93fbf-5f1c-4287-b1b4-ace3233d9f61","resolution":{"observed_at":"2026-08-15T18:57:41.226078Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.470440Z","title":"Jordan and A","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.470440Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:a5294c36a78c23a14984efa7299aece5e2249078f5b846d67cd2e7674caa60ea","observation_id":"efb34e24-bdbb-47df-bbea-08b59508cd37","resolution":{"observed_at":"2026-08-15T18:57:39.470440Z","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-15T18:57:41.189274Z","title":null,"venue":null,"work_id":"443e91f7-3c29-4d30-95d9-5e4a5befa1e8","year":2017},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.475825Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:689bb411e62f0b4e1e255a45270acd0bbe2d728f96c273abcb272c02ca68ba44","observation_id":"72a220e5-04f4-4e06-9705-d4e45e1a5f07","resolution":{"observed_at":"2026-08-15T18:57:41.195743Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.09913","last_updated":"2025-07-07T00:47:01Z","snapshot_observed_at":"2026-08-20T01:16:05.520155Z","submitted_at":"2023-09-18T16:26:53Z","title":"Sharp Thresholds for the Overlap Gap Property: Ising $p$-Spin Glass and Random $k$-SAT","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.09913","snapshot_observed_at":"2026-08-15T18:57:39.481047Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.481047Z"},"links":{"cited_paper":"/paper/2309.09913","citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:1c25dad11e252cd06ee84f576ed855da179eea3753c35f22c71cf3b0e1385ed2","observation_id":"f905c53e-77df-4575-aaec-9d0c28fd94a5","resolution":{"observed_at":"2026-08-15T18:57:39.481047Z","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-15T18:57:41.169945Z","title":null,"venue":null,"work_id":"bad917a3-5ac8-4920-8029-cf96df013061","year":1995},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.486606Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:a818f2ba8dfec568b329bf299b5356067e48e821726ec0267747f55a7d52b6a2","observation_id":"53103e1c-9b13-4eb9-bba7-fbf4e384ee41","resolution":{"observed_at":"2026-08-15T18:57:41.176796Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:41.149838Z","title":"Kueng, H","venue":null,"work_id":"c1faf1a7-a7a2-4254-9f5b-4322f9375bf1","year":2017},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.491744Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:aa85238c482c409bf36d7e6ff0344778f61cb220be5a3e2aa302c51c0f7387da","observation_id":"4d68bedb-6f7b-412a-96eb-80c414eda6f7","resolution":{"observed_at":"2026-08-15T18:57:41.156555Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:41.129137Z","title":null,"venue":null,"work_id":"38fa9d78-1194-414b-bbe6-40b4e1d8f83f","year":2019},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.497362Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:e909cc3341417a6d58f972656fd9da1fc275273ef258028c6aaa83fff087b3fa","observation_id":"ffae93e8-d7cb-4cd8-9a15-0da918cb64ec","resolution":{"observed_at":"2026-08-15T18:57:41.136035Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.01836","last_updated":"2025-06-24T04:51:07Z","snapshot_observed_at":"2026-08-18T01:43:39.537203Z","submitted_at":"2024-11-04T06:15:25Z","title":"Some easy optimization problems have the overlap-gap property","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.01836","snapshot_observed_at":"2026-08-15T18:57:39.502779Z","title":"Li and T","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.502779Z"},"links":{"cited_paper":"/paper/2411.01836","citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:908ab77bd851b0a12e44a1610f0ce14bcc0f9a8645046cf95dad70464a062441","observation_id":"1b41891a-653a-4191-b1be-05cf95f4d051","resolution":{"observed_at":"2026-08-15T18:57:39.502779Z","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-15T18:57:41.108704Z","title":null,"venue":null,"work_id":"c1e266c1-8e18-46ce-aa7f-0c7a9ca3e2cf","year":2017},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.508105Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:597a9861ea63c647196b5ff8069b5ad8eff484a838e2739e11f54d5b6a1b526d","observation_id":"042b50bb-fbba-4c64-9a2a-734a83f0fbbd","resolution":{"observed_at":"2026-08-15T18:57:41.114939Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:41.088843Z","title":"Li and V","venue":null,"work_id":"583187af-ba9d-40af-8bc6-65c83c11ff84","year":2013},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.513020Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:b7b0584672d503b1699d19b1ed67d06c554157c5d4cdb10631c5d1dfc662b3ad","observation_id":"696fab87-ce47-4c58-b7ec-76caadf4249b","resolution":{"observed_at":"2026-08-15T18:57:41.094942Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:41.068325Z","title":null,"venue":null,"work_id":"76ff2d02-1a18-416f-bf22-7d649a4ad5d2","year":2017},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.517980Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:2b5037bdc510da36dc62b2e11db24dbfda399cc215128769024ffa6e837d804d","observation_id":"55b03ed9-8c6e-4573-a02c-41212a3915e7","resolution":{"observed_at":"2026-08-15T18:57:41.075139Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:41.047233Z","title":null,"venue":null,"work_id":"ed9a666c-8c73-4a55-b0a4-df3ac717a6c9","year":2019},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.522881Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:fec39ffa0c483bd59986227f7e0bf8ff1330c1b47ceaaadf72b495f95b7fe427","observation_id":"1cdbd520-d290-4578-9728-c9ce3b443e5b","resolution":{"observed_at":"2026-08-15T18:57:41.053656Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:41.027678Z","title":null,"venue":null,"work_id":"fdb984f4-fae7-4aba-895f-3f20c031b686","year":2020},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.528071Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:de0af1c065fe7fc0172fc81774fc2cbc79eea8411f7446912df68e8ed4238919","observation_id":"fcc76c60-771d-4cc0-a33a-3b493f1d5a85","resolution":{"observed_at":"2026-08-15T18:57:41.033773Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:41.008096Z","title":null,"venue":null,"work_id":"f8020ca7-e963-4808-a4d8-1c27cf05d84d","year":2021},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.532774Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:9167064eda082ae0df87cabf204826bfc8f7eec7b6ce615a1f633cd941e4daf5","observation_id":"75017498-15da-4c18-b851-345259a4f0ea","resolution":{"observed_at":"2026-08-15T18:57:41.014762Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.14112","last_updated":"2024-12-12T13:15:42Z","snapshot_observed_at":"2026-08-18T21:45:00.505102Z","submitted_at":"2023-02-27T19:51:42Z","title":"Injectivity of ReLU networks: perspectives from statistical physics","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.14112","snapshot_observed_at":"2026-08-15T18:57:39.537561Z","title":"Maillard, A","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.537561Z"},"links":{"cited_paper":"/paper/2302.14112","citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:91a2efc3ab08a48605bc5833d44359106b5e7652d9c50a5a39002e1358e7a34e","observation_id":"e4002639-e43c-4fc5-9df3-5ef711567c62","resolution":{"observed_at":"2026-08-15T18:57:39.537561Z","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-15T18:57:40.986512Z","title":"Maillard, F","venue":null,"work_id":"de01ebae-66b2-44bd-ac79-4aa105e56606","year":2021},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.543047Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:3d7523e42cc7041720bb05262bdc9b0619b746f7a24d769542b7ed58951c695b","observation_id":"1a7af7fc-155f-4088-809f-3e318c196fd8","resolution":{"observed_at":"2026-08-15T18:57:40.993603Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:40.964282Z","title":"Maillard, B","venue":null,"work_id":"b9e16096-60d0-4d86-bc10-de3713c295e5","year":2020},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.548301Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:e35091ffbf62deb427837d90a449a41d42f0a577b600b92839d1ee456ee13e39","observation_id":"0ef0a4ee-3b53-4edd-8d9b-709bbf3c2641","resolution":{"observed_at":"2026-08-15T18:57:40.972127Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.554215Z","title":"Mezard, T","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.554215Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:961c5c3039f28b80f7c399f17251495df2a8ffca622a3eea57847dbab1891e44","observation_id":"057670a2-a4e4-4fa7-8de4-e2a4bd2384ef","resolution":{"observed_at":"2026-08-15T18:57:39.554215Z","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-15T18:57:40.931507Z","title":null,"venue":null,"work_id":"e117eea6-14d3-462c-bea5-89f46e27170e","year":1999},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.559240Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:f588202a03ef23ac440a581f90ec7182a08ba269c2c5a34105d6ac57f85970f1","observation_id":"84c2e4f0-34a1-4de4-9bf8-c0041f393bc1","resolution":{"observed_at":"2026-08-15T18:57:40.937733Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:40.912658Z","title":null,"venue":null,"work_id":"62bc7867-a128-4d96-9ecd-33da2f0fb6e0","year":2008},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.564256Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:dae14f555c437d5c98bef081dee106188d2159aa0edeaec860a089db71ea634a","observation_id":"8358787e-3df2-4afb-ae26-7c725f21de68","resolution":{"observed_at":"2026-08-15T18:57:40.918652Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:40.893484Z","title":null,"venue":null,"work_id":"8c47aa72-893e-42c9-acef-889b42bf8a22","year":1990},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.569473Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:af0c2ac44938fe9188e9fcd9e4068c990c437cfc6e05d5ceec6ee012ccd914c0","observation_id":"319de420-72f4-4449-b330-7d47094e4e1a","resolution":{"observed_at":"2026-08-15T18:57:40.899645Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:40.871822Z","title":null,"venue":null,"work_id":"9246cad3-06b5-41dc-bac3-3851b73f8397","year":2006},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.574677Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:0f3b42276e9cb454f78bc9cce0af67b16ec33eacc71185f5d122b6fde28c6b01","observation_id":"31ae8f0d-bbd7-4d92-91bc-9d353f2b56ca","resolution":{"observed_at":"2026-08-15T18:57:40.879676Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:40.849765Z","title":null,"venue":null,"work_id":"b5519ce1-ec49-498c-b8be-a7f4479faccc","year":1973},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.580938Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:b7918c09244bb8e3433a0f7b11b681d24ddf90f884a522c86d14c19536ce6f00","observation_id":"bfc931ea-0db8-4894-8452-3f436431c5df","resolution":{"observed_at":"2026-08-15T18:57:40.856138Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:40.828141Z","title":"Mondelli and A","venue":null,"work_id":"983a32da-a019-4073-976f-e2a8f122375d","year":2019},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.585799Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:d5eb06515b56c690dee9a73080661d95dd26ea3f3d0c87cb90580a31d13e5838","observation_id":"ee41fbf0-9d0d-4de2-b002-8a8dd7ba5f57","resolution":{"observed_at":"2026-08-15T18:57:40.835299Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:40.807991Z","title":"Montanari","venue":null,"work_id":"a103b222-af2c-4b36-9a7c-418b3e962f39","year":2019},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.591146Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:8642e61d23ba9e3db9de585dfece6b2f26a5f43ad0a0f6d2d1d2b51d14e18a7e","observation_id":"112fa2b8-4081-4bd1-986c-4e179320b12f","resolution":{"observed_at":"2026-08-15T18:57:40.814532Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:40.788499Z","title":"Netrapalli, P","venue":null,"work_id":"3c3890ad-7702-427a-a6dc-30675ebe6ee7","year":2015},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.596064Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:6edede70378e9f26b807782d3ddbfb8c7ad04c0f98d47187924c609e879c81a6","observation_id":"25228ac7-77f8-4d2b-8d71-4023bca33693","resolution":{"observed_at":"2026-08-15T18:57:40.794868Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:40.768856Z","title":"Ohlsson, A","venue":null,"work_id":"b76631c6-0ee0-4460-9a7e-2ca152d4235a","year":2012},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":93,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.601220Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:182ac1eb9d8b277f3d81899e9b105d6137b29f16e7ef56b5caaf3bbcfbee41c1","observation_id":"9b1c0d1e-25d8-4e9b-be03-81903f3a1a4d","resolution":{"observed_at":"2026-08-15T18:57:40.775224Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.606342Z","title":"Perkins and C","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":94,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.606342Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:306924a5ebad201bb7faa06751201158f60a10e43b9a0472cb33a79c2a9ffa10","observation_id":"5e46c34d-1f5b-42f0-86ff-cc0fd343109e","resolution":{"observed_at":"2026-08-15T18:57:39.606342Z","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-15T18:57:40.738583Z","title":"Rangan, P","venue":null,"work_id":"54c8c977-eca3-44ff-b31b-9b2ebcfb1a9e","year":2017},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":95,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.611026Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:1f139d7956f447721d5d52b1b956eaacdebd8d8d3d2d690306c5118a0c2bc5f2","observation_id":"0d796b22-7663-4acc-b112-39c84c11939b","resolution":{"observed_at":"2026-08-15T18:57:40.744993Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:40.718422Z","title":"Rodenburg","venue":null,"work_id":"5f32256f-fab4-4828-bc26-5f4560714db7","year":2008},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":96,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.615541Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:ed8ba0e44937554bc334855cd2e9b462b028f5cf2a0bcee9b11d597e52e4cefb","observation_id":"70a2282e-76fe-4d9d-9702-d308afae44d6","resolution":{"observed_at":"2026-08-15T18:57:40.725627Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:40.699944Z","title":"Salehi, E","venue":null,"work_id":"e892e57f-67d9-4e03-9b9c-2089c44a9763","year":2018},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":97,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.621083Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:ea853325f9354466a47ea6c7bba5dc0bc0810e615f79dc2172d44e5d8b4b59c7","observation_id":"c59d4d08-dc96-44ff-960d-01fa265bc108","resolution":{"observed_at":"2026-08-15T18:57:40.706099Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:40.680579Z","title":"Schniter and S","venue":null,"work_id":"e89a7bfc-da55-4ec5-9504-24988cc401da","year":2015},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":98,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.625684Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:d6bba60919810f4c777e870612c3a5da3bfe0f52a04fd4626df73aa3fc55c4fc","observation_id":"bf4b74dd-61a8-4e42-abf5-f6197d4408a7","resolution":{"observed_at":"2026-08-15T18:57:40.687724Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:57:39.631711Z","title":"Schniter, S","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":99,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.631711Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:686ede05e7f937dcda54bf3f22455b0e7e83132a969f8cfd3987252104fb473a","observation_id":"89f70084-2438-44c6-9822-0057793eaf50","resolution":{"observed_at":"2026-08-15T18:57:39.631711Z","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-15T18:57:40.647703Z","title":"Shechtman, Y","venue":null,"work_id":"d774932c-843d-449a-940a-cef799f8c354","year":2015},"citing_paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms","version":1},"reference_index":100,"source":"pdf_text","source_observed_at":"2026-08-15T18:57:39.636612Z"},"links":{"citing_paper":"/paper/2506.18275"},"observation_digest":"sha256:3d6f0093b6201e4f664ea2b268179762c8ebbff338476e4902f603e1067a4497","observation_id":"c2931861-ef9d-4dbd-a46e-cc5f72c85f9b","resolution":{"observed_at":"2026-08-15T18:57:40.654343Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.18275","last_updated":"2025-06-23T04:10:35Z","latest_version":1,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-20T01:16:32.759669Z","submitted_at":"2025-06-23T04:10:35Z","title":"Phase transition of \\emph{descending} phase retrieval algorithms"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":83,"verified_exact":1,"verified_fuzzy":16},"total_outbound_references":137},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 100 of 137 outbound references and 0 inbound Pith citation observations for arXiv:2506.18275."}