{"as_of":"2026-08-09T21:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:098770643c4702fbde140cbeea6ba12ecac581e2b37769ac7147a5e53c747934","coverage":[{"denominator":59,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":59,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T10:32:00.346155Z","state":"measured"},{"denominator":62,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":62,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T23:35:23.879187Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-04T23:35:28.240868Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.05500","snapshot_observed_at":"2026-08-03T04:19:43.930263Z","title":"The generative leap: Sharp sample complexity for efficiently learning gaussian multi-index models","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.05704","last_updated":"2026-06-24T14:40:41Z","snapshot_observed_at":"2026-08-09T13:41:52.705316Z","submitted_at":"2026-02-05T14:29:10Z","title":"Limitations of SGD for Multi-Index Models Beyond Statistical Queries","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-03T04:19:43.930263Z"},"links":{"cited_paper":"/paper/2506.05500","citing_paper":"/paper/2602.05704"},"observation_digest":"sha256:29f1320b661f704a2daba2a5a3e1ae54d4500c99143f7d74be7fc1f5a3fb1e96","observation_id":"24064e4f-84f0-4154-999e-cc4a6c8349dc","resolution":{"observed_at":"2026-08-03T04:19:43.930263Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.05500","snapshot_observed_at":"2026-07-12T03:07:54.001891Z","title":"The generative leap: Sharp sample complexity for efficiently learning gaussian multi-index models","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.03347","last_updated":"2026-07-03T14:02:42Z","snapshot_observed_at":"2026-08-04T04:21:48.715795Z","submitted_at":"2026-07-03T14:02:42Z","title":"The Multiscale Single-Index Model: A Stylized Model for Hierarchical Feature Learning","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-07-12T03:07:54.001891Z"},"links":{"cited_paper":"/paper/2506.05500","citing_paper":"/paper/2607.03347"},"observation_digest":"sha256:0bfeffdeb12c16b1ed1a476632da798d812fc174ba7856c51fa13c49ccb233c7","observation_id":"11139e03-0d24-46c7-b45c-3d606d79053e","resolution":{"observed_at":"2026-07-12T03:07:54.001891Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"cited_work":{"arxiv_id":"2506.05500","doi":null,"metadata_source":"pith","pith_arxiv_id":"2506.05500","snapshot_observed_at":"2026-08-04T23:35:28.240868Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","venue":"cs.LG","work_id":"e4bcd66c-0459-4ca3-b00b-8bf65641648b","year":2025},"citing_paper":{"arxiv_id":"2608.01654","last_updated":"2026-08-03T03:44:13Z","snapshot_observed_at":"2026-08-09T17:21:50.028167Z","submitted_at":"2026-08-03T03:44:13Z","title":"Approximate Message Passing with Random Initialization for Phase Retrieval","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-04T23:35:23.879187Z"},"links":{"cited_paper":"/paper/2506.05500","citing_paper":"/paper/2608.01654"},"observation_digest":"sha256:c8699252a632ec50f0559619ccdb186ed595fe6733579d82ee459167537c0735","observation_id":"a910d7c5-3557-4041-b76d-b910404b7846","resolution":{"observed_at":"2026-08-04T23:35:28.248246Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2506.05500/citation-record","integrity":"/paper/2506.05500/integrity","json":"/paper/2506.05500/citation-record.json","paper":"/paper/2506.05500"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:32:00.999986Z","title":"The merged-staircase property: a necessary and nearly sufficient condition for sgd learning of sparse functions on two-layer neural networks","venue":null,"work_id":"8e6a8c14-c0ee-42cd-a627-84ef4483ba22","year":2022},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.195739Z"},"links":{"citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:406cee67448cc11295ae9285231fd8f7a70d220af3b7a9102f392815be22e2a8","observation_id":"eec43b36-4820-4efa-9d04-407c345d2f11","resolution":{"observed_at":"2026-08-07T10:32:01.002797Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:32:00.991993Z","title":"Sgd learning on neural networks: leap complexity and saddle-to-saddle dynamics","venue":null,"work_id":"26d8d791-91d5-40ad-83c7-af957bc1a2d1","year":2023},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.199262Z"},"links":{"citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:1a49fcae5cf81e865d7df4c7a72c1a7a5410f66f45aab3e332b5f573c1ed0cf5","observation_id":"257976cf-7d17-4436-ac13-48fe899219de","resolution":{"observed_at":"2026-08-07T10:32:00.995061Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:32:00.984335Z","title":"The staircase property: How hierarchical structure can guide deep learning","venue":null,"work_id":"3e48228d-7602-4712-8065-27369c55b86a","year":2021},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.202085Z"},"links":{"citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:e3d48e294688e1698615108bee553a05e799bf9f8096ad98b92710a511e3f23c","observation_id":"84b87fea-f866-4788-b652-15c8d20bd32e","resolution":{"observed_at":"2026-08-07T10:32:00.987145Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:32:00.976603Z","title":"Repetita iuvant: Data repetition allows sgd to learn high-dimensional multi-index functions, 2024","venue":null,"work_id":"eb2615f1-c878-428b-baa6-266f9b45bf40","year":2024},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.205449Z"},"links":{"citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:06951b5b8565bfd5150d1875c47d3ece0f91598ba32a1a30ccbe02df87e40f59","observation_id":"86c0a450-f32f-4a29-8499-cf181b2d5c85","resolution":{"observed_at":"2026-08-07T10:32:00.979228Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:32:00.968889Z","title":"Online stochastic gradient descent on non-convex losses from high-dimensional inference","venue":null,"work_id":"18fc1ef1-2b29-42b3-b3a4-f81d87c549b7","year":2021},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.208248Z"},"links":{"citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:6213394ce56e1c3d1e367dc39309e8720ffce109b40debbddebe2af21518b8a3","observation_id":"3609ea4f-db77-47db-bfd8-0b12e496d5d9","resolution":{"observed_at":"2026-08-07T10:32:00.971677Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:32:00.960994Z","title":"Stochastic gradient descent in high dimensions for multi-spiked tensor pca, 2024","venue":null,"work_id":"a0a8b61f-a615-4785-963f-5fa036a54416","year":2024},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.210730Z"},"links":{"citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:7a74dcee89f62a70f862456353526d6db97bdee30daa0e3b362e1c1e20c0fd0a","observation_id":"57297d56-37aa-4b92-bffa-dbff2155a784","resolution":{"observed_at":"2026-08-07T10:32:00.963874Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:32:00.953256Z","title":"Online stochastic gradient descent on non-convex losses from high-dimensional inference","venue":null,"work_id":"014610d3-65b5-40e2-b8c2-fc880bddaa31","year":2021},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.213361Z"},"links":{"citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:90125aa81254c5cb16c48cb37fa8e3ae7b00602869874e7df739c218f07eda2c","observation_id":"88df70a5-556d-42d2-95d2-3a2b10696291","resolution":{"observed_at":"2026-08-07T10:32:00.956100Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:32:00.945386Z","title":"Statistical query algorithms and low-degree tests are almost equivalent","venue":null,"work_id":"812c06d4-6519-4ec6-8f69-fc764a90bd0d","year":2021},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.215864Z"},"links":{"citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:a39d762453897c377eba54520108ed36b1822fbd128cd27c850b5b69f888c261","observation_id":"c99a00eb-242d-4941-9c83-e5e92e7fce63","resolution":{"observed_at":"2026-08-07T10:32:00.948237Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:32:00.937698Z","title":"On learning gaussian multi-index models with gradient flow","venue":null,"work_id":"f6e795f8-7712-48d6-8fa5-0efae742b4e7","year":2025},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.218336Z"},"links":{"citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:adcda6e2c04e084e10a5172739bec9a3efe5b404aad87749253944345e379256","observation_id":"bca692ca-2517-42a5-b4cc-707dec7309d8","resolution":{"observed_at":"2026-08-07T10:32:00.940359Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:32:00.930135Z","title":"Learning single-index models with shallow neural networks","venue":null,"work_id":"dd444ec1-ac84-4edd-8297-24da62822813","year":2022},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.220782Z"},"links":{"citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:6ce191d023d9a089ea2f537fad080cade0a0b3d9e25f5510e3cbbd07adb8f490","observation_id":"201ebe87-ec25-48b9-893d-b2e7cc7ef58b","resolution":{"observed_at":"2026-08-07T10:32:00.932864Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:32:00.922306Z","title":"Bandeira, March T","venue":null,"work_id":"d5bd5ffb-e64a-418a-beea-b1f602fff78b","year":2023},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.223650Z"},"links":{"citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:86d7a32808d45d18a5cfd9adf079be249e4792ad4d8722c846373f3383036331","observation_id":"1d0475b4-2f0b-46f5-9128-80a748d53ba0","resolution":{"observed_at":"2026-08-07T10:32:00.924906Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:32:00.914740Z","title":"The franz-parisi criterion and computational trade-offs in high dimensional statistics","venue":null,"work_id":"8753c1a2-ccbb-4611-96d2-7129f21ff224","year":2022},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.227624Z"},"links":{"citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:b20d77528287b06f1bb90f2ba24d9af20ba8d90ef6aa53f5ca66524f1562c0ff","observation_id":"3b187f0c-4568-4347-835e-12f6dc3d37de","resolution":{"observed_at":"2026-08-07T10:32:00.917458Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.01445","last_updated":"2022-05-03T12:09:59Z","snapshot_observed_at":"2026-08-09T13:43:20.153999Z","submitted_at":"2022-05-03T12:09:59Z","title":"High-dimensional Asymptotics of Feature Learning: How One Gradient Step Improves the Representation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.01445","snapshot_observed_at":"2026-08-07T10:32:00.230044Z","title":"High-dimensional asymptotics of feature learning: How one gradient step improves the representation","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.230044Z"},"links":{"cited_paper":"/paper/2205.01445","citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:96a936a615065ab827e2c5c29cde822d7d816f290444d77e927eb11437bee6a9","observation_id":"a7f9ffab-57fd-42bd-9aff-088f1a92a856","resolution":{"observed_at":"2026-08-07T10:32:00.230044Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.05426","last_updated":"2025-06-14T03:32:37Z","snapshot_observed_at":"2026-08-07T16:07:49.242176Z","submitted_at":"2025-04-07T18:50:11Z","title":"Survey on Algorithms for multi-index models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.05426","snapshot_observed_at":"2026-08-07T10:32:00.232733Z","title":"Survey on algorithms for multi-index models","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.232733Z"},"links":{"cited_paper":"/paper/2504.05426","citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:81772ae03f699643f91abc37674e2e9872f638387c432a95cdbc41083092f441","observation_id":"27d09cad-76a7-47d8-b749-ab992d15e743","resolution":{"observed_at":"2026-08-07T10:32:00.232733Z","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-07T10:32:00.907198Z","title":"Universality and sharp matrix concentration inequalities","venue":null,"work_id":"09c8a72d-721a-464f-a741-74804f4d00be","year":2024},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.235310Z"},"links":{"citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:6edceaccdda16e40a7b00745baf34a2ad781bdd6cc1c9e025c3950ba79d9eddc","observation_id":"6f42b07d-3485-4f25-a001-a81b648ef3fd","resolution":{"observed_at":"2026-08-07T10:32:00.909809Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:32:00.899862Z","title":"Towards understanding hierarchical learning: Benefits of neural representations","venue":null,"work_id":"efa4564d-9502-49e0-a431-7554a4e4f3e7","year":2020},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.238033Z"},"links":{"citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:e64eb26a9190f396364ef976764f41e91f6211a5618c6624564bea69f84ad51b","observation_id":"23bff638-7d78-4c98-8d63-fa4f57e17111","resolution":{"observed_at":"2026-08-07T10:32:00.902365Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:32:00.892111Z","title":"Learning narrow one-hidden-layer relu networks","venue":null,"work_id":"9499c3bc-d8c6-492d-a23d-2e9e5f217e1e","year":2023},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.240395Z"},"links":{"citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:09ef18476bebb27f84c2d1d7a412e123395eb6c3ee1df5b3474fe5d8183f4da0","observation_id":"5989068b-b910-45c6-8e38-6e0de9056971","resolution":{"observed_at":"2026-08-07T10:32:00.895030Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:32:00.884333Z","title":"Learning deep relu networks is fixed-parameter tractable","venue":null,"work_id":"ca13af63-20fd-44e5-a2d5-962d83302d56","year":2021},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.242949Z"},"links":{"citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:1902109b3b58f6ff18b648b78e6c93875a030c9c54691f767d131bb5a2088dca","observation_id":"33e970e5-f984-4d67-b618-e0d0ba8aaefb","resolution":{"observed_at":"2026-08-07T10:32:00.887272Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:32:00.877229Z","title":"Dimension reduction for conditional mean in regression","venue":null,"work_id":"307b6ba8-94ac-405c-abc0-1fe0fd9a529f","year":2002},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.245239Z"},"links":{"citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:aa1bb9a7c4d04ce36be27ab8ef5425a8af2fbbcc5d3a25dac6b7b608f92dd710","observation_id":"d6271a0b-96c4-4dfd-a7ce-b6645372b8d5","resolution":{"observed_at":"2026-08-07T10:32:00.879560Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:32:00.870092Z","title":"Learning polynomials in few relevant dimensions","venue":null,"work_id":"384bf3e0-d6a9-4040-a8ec-9624caf4eb96","year":2020},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.247908Z"},"links":{"citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:ef36619427dece2e1118fdaaa4ac478260bd2f6fdfb60b0d30f37e9ba9492ef3","observation_id":"504eeb40-4838-4f38-8991-fc2201a74d16","resolution":{"observed_at":"2026-08-07T10:32:00.872566Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:32:00.862698Z","title":"Dennis Cook","venue":null,"work_id":"f9bb2e6a-a41b-4c50-8a3f-fbe80a3eaf43","year":2000},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.250262Z"},"links":{"citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:21be8e7bea4b64f18df84efb901c48200f012a05d70feb1a8868e7cc416b2425","observation_id":"2ce5ca44-d344-47fe-8c8a-30be026b2198","resolution":{"observed_at":"2026-08-07T10:32:00.864988Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.02545","last_updated":"2025-06-10T17:55:07Z","snapshot_observed_at":"2026-08-09T11:45:25.723705Z","submitted_at":"2025-02-04T18:15:51Z","title":"Optimal Spectral Transitions in High-Dimensional Multi-Index Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.02545","snapshot_observed_at":"2026-08-07T10:32:00.252569Z","title":"Optimal spectral transitions in high-dimensional multi-index models","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.252569Z"},"links":{"cited_paper":"/paper/2502.02545","citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:884e14e43e6a8aa198d30edb22fc6aaffa516b86b8bc8684ad8d31fd7e14f6f2","observation_id":"03dff563-4ab1-4999-b226-a7bf2501dc57","resolution":{"observed_at":"2026-08-07T10:32:00.252569Z","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-07T10:32:00.855397Z","title":"Learning single-index models in gaussian space","venue":null,"work_id":"1ba03921-57c2-43e6-8133-111064ca561d","year":2018},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.255208Z"},"links":{"citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:f0426ba6fdd5733c3ce3c6f1ad00d646796b68a50bb47b7b313f211909d2d064","observation_id":"e9d0ca6e-4164-48cd-ae36-5913ada8a864","resolution":{"observed_at":"2026-08-07T10:32:00.858247Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:32:00.848180Z","title":"Statistical query lower bounds for tensor pca","venue":null,"work_id":"45fe4b38-2dc8-4985-b19c-d207dee24212","year":2021},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.257604Z"},"links":{"citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:c1f8c54bd0b8ddbc2eb4f8ed7107de50df55a9fc4603087fcc7ad1f21e7a3d9a","observation_id":"f9e330ca-1bbf-450c-be02-d2afdd4730a3","resolution":{"observed_at":"2026-08-07T10:32:00.850672Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:32:00.840272Z","title":"Statistical-computational trade-offs in tensor PCA and related problems via communication complexity","venue":null,"work_id":"d7c49821-e089-4031-ba68-c254ab90349c","year":2024},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.260096Z"},"links":{"citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:a6b92054e3f528a41c36e8b2571595829827ddd150a9bbadeb03c45ae2546064","observation_id":"233c4883-cb12-4d23-957f-0b6030336e66","resolution":{"observed_at":"2026-08-07T10:32:00.843110Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:32:00.832590Z","title":"Kane, and Lisheng Ren","venue":null,"work_id":"f7fc49cc-e541-45eb-98c9-a2b6f3e4041b","year":2025},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.262591Z"},"links":{"citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:ef97574705a900b2a3e3b72e1408b7cdff6c807a80467e32e0b093bf39b895d3","observation_id":"8f925cf8-b735-4551-8a26-cb1b7f03ecce","resolution":{"observed_at":"2026-08-07T10:32:00.835104Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:32:00.824933Z","title":"Kane, and Nikos Zarifis","venue":null,"work_id":"ce05c04b-e430-404d-a97c-7de13cdf7612","year":2025},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.264969Z"},"links":{"citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:7dde2b380a591153b64f2a036db4d16055070425b708d598438de57e6c96c473","observation_id":"1415d91e-cad6-4f78-8e11-50729745ec5d","resolution":{"observed_at":"2026-08-07T10:32:00.827749Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:32:00.817281Z","title":"Efficiently learning one-hidden-layer relu networks via schur polynomials","venue":null,"work_id":"bc43ca45-4427-4184-ac0b-fd16d50f5379","year":2024},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.268287Z"},"links":{"citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:e35ef5faa42a9973582e36803b3d3f85c99972ad7011e712df6f8db52729141c","observation_id":"abf464eb-3ab4-4a6a-894a-28225a1b6189","resolution":{"observed_at":"2026-08-07T10:32:00.819992Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:32:00.809432Z","title":"How two-layer neural networks learn, one (giant) step at a time","venue":null,"work_id":"9e1d8b04-6480-4c8b-a257-9cb62038356f","year":2024},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.270693Z"},"links":{"citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:40556df21d6fa97f5015753d83799ca9f9d9aea9a4249ba1b39b87534ebc2747","observation_id":"63b5b56e-517e-40da-b966-4d4baa2021ae","resolution":{"observed_at":"2026-08-07T10:32:00.812405Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:32:00.801461Z","title":"Kane, and Alistair Stewart","venue":null,"work_id":"ae6ee591-ca3b-4665-bce3-ac6b1272498c","year":2017},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.273311Z"},"links":{"citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:ab18d39953a1bab5d55a3ffd90cefc7da927bc84cb78882302b5d2861a83946c","observation_id":"0d85ef35-82b6-4b48-a555-ff258cb5430a","resolution":{"observed_at":"2026-08-07T10:32:00.804091Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:32:00.793513Z","title":"de la Pe \\ n a and Evarist Gin \\'e","venue":null,"work_id":"50264586-ed7d-4748-b85b-7f8b30584143","year":1999},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.275902Z"},"links":{"citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:49ec791c646f6e51db41b4f6f97ae5861856549f337cfec8fd920d8d9ad25607","observation_id":"5e5660d5-c2c5-44bf-93c5-bb1bda3b84d5","resolution":{"observed_at":"2026-08-07T10:32:00.796305Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:32:00.785044Z","title":"Neural networks can learn representations with gradient descent","venue":null,"work_id":"c1aa9d4b-6109-4a2a-9594-58794c3def4d","year":2022},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.278326Z"},"links":{"citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:c10ff1c146a674bad8cab6df21a4c46b086d828e78861b165e3088a3500eb61a","observation_id":"d85d7806-5b29-4084-867f-64c6444fd538","resolution":{"observed_at":"2026-08-07T10:32:00.787569Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09167","last_updated":"2025-05-14T06:03:07Z","snapshot_observed_at":"2026-08-08T18:03:54.120620Z","submitted_at":"2025-05-14T06:03:07Z","title":"Online Learning of Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09167","snapshot_observed_at":"2026-08-07T10:32:00.280739Z","title":"Online learning of neural networks","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.280739Z"},"links":{"cited_paper":"/paper/2505.09167","citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:276864df51e218eaa4adcd772272f2f631be89fd0b6936c91464e7bbb6b50fa5","observation_id":"400b9ef6-9c70-4f0f-8ff6-31cbb1dd5e43","resolution":{"observed_at":"2026-08-07T10:32:00.280739Z","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-07T10:32:00.777191Z","title":"Smoothing the landscape boosts the signal for sgd: Optimal sample complexity for learning single index models","venue":null,"work_id":"f11b4b73-3fb5-4588-9480-55bc51acbae9","year":2023},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.283748Z"},"links":{"citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:41a9bddeed4e0c4013698c0ee45ed7ad11f91d741ab1218d82c6dd132b719f48","observation_id":"b54ab9b3-b9c9-4a24-a8b3-b395342fc9ca","resolution":{"observed_at":"2026-08-07T10:32:00.779861Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:32:00.769390Z","title":"Computational-statistical gaps in gaussian single-index models","venue":null,"work_id":"c5833f9f-8106-4160-b2e2-caeaf79e1ab7","year":2024},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.286258Z"},"links":{"citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:0196a6199b5f1d2796932e025cda3b0c0f32f689144759239cab25eefaaaf832","observation_id":"d2e146b9-81ec-4ec5-8b46-edb9d28b9aa4","resolution":{"observed_at":"2026-08-07T10:32:00.771943Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:32:00.761386Z","title":"The benefits of reusing batches for gradient descent in two-layer networks: breaking the curse of information and leap exponents","venue":null,"work_id":"85b6d3fe-20ab-428f-8f72-3beeab554dd8","year":2024},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.288951Z"},"links":{"citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:62596d3373ccf78048029803000778f73182a9c0a43d373c09311dfb93fbe8a5","observation_id":"7a4afc0f-35aa-452a-ab00-94b011c61dda","resolution":{"observed_at":"2026-08-07T10:32:00.764646Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:32:00.753190Z","title":"Structure adaptive approach for dimension reduction","venue":null,"work_id":"6bfb70ac-8441-426a-8209-8ee39f397e84","year":2001},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.291565Z"},"links":{"citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:e8468aac82f1873364120a69cb688dad0f3e254bb9100f2e9d54b079d95ada4c","observation_id":"ee1d80cc-9761-4933-80ec-dc9b9717cd4b","resolution":{"observed_at":"2026-08-07T10:32:00.756049Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:32:00.293991Z","title":"The power of sum-of-squares for detecting hidden structures","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.293991Z"},"links":{"citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:09767b9d0839b816bc4ecf0fe784ecbe2c21d7e4188ab01db400af57b28f0bbc","observation_id":"08163a78-bbae-4164-bca7-7ff7e4727703","resolution":{"observed_at":"2026-08-07T10:32:00.293991Z","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-07T10:32:00.739971Z","title":"Statistical inference and the sum of squares method","venue":null,"work_id":"81b21cf8-7594-4582-82bd-02d3c0c4b150","year":2018},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.296285Z"},"links":{"citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:cf651c754c6244c5c3ccffb0fc9289090754edc42c608a0e410942518fc00bca","observation_id":"0082ebdd-63c4-4d9e-b7da-56b55fcaa0f5","resolution":{"observed_at":"2026-08-07T10:32:00.742665Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:32:00.731753Z","title":"Tensor principal component analysis via sum-of-square proofs","venue":null,"work_id":"80c98249-4156-4f2b-889c-d6b461d77de4","year":2015},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.298699Z"},"links":{"citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:50a8531667d887ff8f03ffede7e1b9f2d17f18a1f0d2c9503e00897601b6d804","observation_id":"84f1a3a9-af5d-4b84-a00e-dabcc419b21a","resolution":{"observed_at":"2026-08-07T10:32:00.734553Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:32:00.723951Z","title":"On the complexity of learning sparse functions with statistical and gradient queries","venue":null,"work_id":"de5e5123-e843-4915-91d2-df526b9e9ff4","year":2024},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.301034Z"},"links":{"citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:ddd71f476c252885500491f81611d31168469c7bf8b4b16d9b54e3df57ad3569","observation_id":"119a0d30-e85e-4791-b0c1-2fb6e359055b","resolution":{"observed_at":"2026-08-07T10:32:00.726785Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:32:00.716401Z","title":"Learning geometric concepts via gaussian surface area","venue":null,"work_id":"6730db9f-9b39-44fc-a5b5-7c8669cc077b","year":2008},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.303472Z"},"links":{"citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:65245354a27a38bd04c7684f6a741dd14fda9d72ad0fdf2b01c2072d5796e998","observation_id":"a99e5686-e035-49fa-a02b-a81445b392eb","resolution":{"observed_at":"2026-08-07T10:32:00.719142Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:32:00.708142Z","title":"Learning intersections of halfspaces with distribution shift: Improved algorithms and sq lower bounds","venue":null,"work_id":"0237267b-5ae8-4fc7-9609-7187e39e75d7","year":2024},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.305834Z"},"links":{"citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:1f45d8b66a54db947388e8f4aaab7561e862bd0a1a7ff8447b752a95c85c0ede","observation_id":"07169a0a-d3ef-4ad8-b039-036057db024f","resolution":{"observed_at":"2026-08-07T10:32:00.711005Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1907.11636","last_updated":"2019-07-26T15:46:05Z","snapshot_observed_at":"2026-08-04T11:05:37.084515Z","submitted_at":"2019-07-26T15:46:05Z","title":"Notes on Computational Hardness of Hypothesis Testing: Predictions using the Low-Degree Likelihood Ratio","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.11636","snapshot_observed_at":"2026-08-07T10:32:00.308756Z","title":"Notes on computational hardness of hypothesis testing: Predictions using the low-degree likelihood ratio","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.308756Z"},"links":{"cited_paper":"/paper/1907.11636","citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:d93dd012ddf7d428165b27c1fef812b515aae34c209a6ffabeefd4011eb5d0c1","observation_id":"a2ae5aa5-b462-460e-a0d1-8e6290538250","resolution":{"observed_at":"2026-08-07T10:32:00.308756Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.01583","last_updated":"2025-06-10T17:54:02Z","snapshot_observed_at":"2026-08-09T14:51:16.501549Z","submitted_at":"2025-02-03T18:08:30Z","title":"Spectral Estimators for Multi-Index Models: Precise Asymptotics and Optimal Weak Recovery","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.01583","snapshot_observed_at":"2026-08-07T10:32:00.311902Z","title":"Spectral estimators for multi-index models: Precise asymptotics and optimal weak recovery","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.311902Z"},"links":{"cited_paper":"/paper/2502.01583","citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:eaf4a9ce7e06306f6be19af644cc94864c27f08ae657b17e85c9df539ac65219","observation_id":"930647d0-faf3-4a32-b813-ef21ea8f7ac9","resolution":{"observed_at":"2026-08-07T10:32:00.311902Z","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-07T10:32:00.314452Z","title":"Sliced inverse regression for dimension reduction","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.314452Z"},"links":{"citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:51c4464e919891f9901b58b0cc4f589dbda244f634bd34b9a6a2cfcf37dafbcd","observation_id":"f0c2be20-ebae-494d-b9f0-5a5e538673e1","resolution":{"observed_at":"2026-08-07T10:32:00.314452Z","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-07T10:32:00.695096Z","title":"Neural network learns low-dimensional polynomials with sgd near the information-theoretic limit","venue":null,"work_id":"88b3c5df-99ec-4a8d-8971-d3bdf87fe4b3","year":2024},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.316767Z"},"links":{"citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:fb60335b51253ff09063527e186c68c100081b4db216ba1b809632a2b3874960","observation_id":"a61fc7bc-5652-43cd-9faf-e7a8dd541e2c","resolution":{"observed_at":"2026-08-07T10:32:00.697707Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1512.07276","last_updated":"2015-12-22T22:01:22Z","snapshot_observed_at":"2026-07-06T04:40:50.003234Z","submitted_at":"2015-12-22T22:01:22Z","title":"The Zero Set of a Real Analytic Function","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1512.07276","snapshot_observed_at":"2026-08-07T10:32:00.319028Z","title":"The zero set of a real analytic function","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.319028Z"},"links":{"cited_paper":"/paper/1512.07276","citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:deab9ea848b4549adc23000123038923376ddbcba3ec42675696adc691457dd5","observation_id":"86b53d4f-e51f-4a24-9b31-477378159798","resolution":{"observed_at":"2026-08-07T10:32:00.319028Z","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-07T10:32:00.687963Z","title":"Learning juntas","venue":null,"work_id":"a452928d-ec05-4c4a-bb42-401011a653a9","year":2003},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.321717Z"},"links":{"citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:b7fb1253e20162423d0f0062cc9385a88af9d48659b176728fc7ea7b82e8dc04","observation_id":"21388ebb-5932-40b8-85d3-068c92ab4edf","resolution":{"observed_at":"2026-08-07T10:32:00.690372Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:32:00.680566Z","title":"A statistical model for tensor pca","venue":null,"work_id":"fff59688-932e-46c9-a81f-807c9ac259b9","year":2014},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.324215Z"},"links":{"citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:9eef12bd0283245f5e6230f1874d206ae0ba85358dc77d724b697ff3efad2e66","observation_id":"6fb7510c-3d7a-480a-9fcc-493105184215","resolution":{"observed_at":"2026-08-07T10:32:00.682934Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2410.09678","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:32:00.552555Z","title":"Learning orthogonal multi-index models: A fine-grained information exponent analysis","venue":null,"work_id":"70e82245-2fc8-4886-b78e-ec2411c0d515","year":2024},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.326932Z"},"links":{"citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:ddbe6aef065e82aa1e98f758e2204a1460bf35596ba0c77010921df644a57a15","observation_id":"e67f7440-4d67-4ff8-86dd-529c0ac3019e","resolution":{"observed_at":"2026-08-07T10:32:00.560964Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:32:00.329545Z","title":"Emergence and scaling laws in sgd learning of shallow neural networks","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.329545Z"},"links":{"citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:4ed60348e6a240caaa0adde198dab47c9db3da0ea5ea749eac8fb7656949da4f","observation_id":"606d6f5e-4a2a-4d79-a54b-c9b2a5751032","resolution":{"observed_at":"2026-08-07T10:32:00.329545Z","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-07T10:32:00.672934Z","title":"Sriperumbudur, Arthur Gretton, Kenji Fukumizu, Bernhard Sch \\\" o lkopf, and Gert R","venue":null,"work_id":"ebffc167-2738-42c7-af74-26b51401cb39","year":2010},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.332055Z"},"links":{"citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:40c68655089b283604919c7fd0d1c26329aebd0700dfb4f8b84f3ee0d0cf4928","observation_id":"223a1637-072f-43a7-8c54-3027862d8a82","resolution":{"observed_at":"2026-08-07T10:32:00.675831Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:32:00.664408Z","title":"Fundamental limits of weak learnability in high-dimensional multi-index models, 2024","venue":null,"work_id":"7f2161ee-c1d0-428b-bc84-481eeffa7094","year":2024},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.334315Z"},"links":{"citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:8463de57dd4a828bb3ea8c3aee95ab20a6e65b89b91d3e27446e02cfd65f918a","observation_id":"1ffdd41f-b9ce-43ec-8108-6b9767cf7dee","resolution":{"observed_at":"2026-08-07T10:32:00.667371Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:32:00.655378Z","title":"Learning convex concepts from gaussian distributions with pca","venue":null,"work_id":"75ea854f-64ad-4a0c-b300-60872ae52590","year":2010},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.336597Z"},"links":{"citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:a34f5a24633f7061700f0dd70046bf347bbefcf46798e9f9c63ac8c22ec227a9","observation_id":"3a7f9810-6a22-41f6-a1ed-129218466098","resolution":{"observed_at":"2026-08-07T10:32:00.658193Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:32:00.647175Z","title":"Vempala and Ying Xiao","venue":null,"work_id":"a05e4966-2754-420e-918d-62c221119b0f","year":2012},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.339019Z"},"links":{"citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:8c58f947bdc6888a740bda72687d5a90bbccb45f4042db3940fab4d7448ee45c","observation_id":"5f543766-1e69-4ef1-bb20-23e0e2353bfe","resolution":{"observed_at":"2026-08-07T10:32:00.650082Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:32:00.638580Z","title":"A multiple-index model and dimension reduction","venue":null,"work_id":"07908343-f091-4935-9a47-cc062e614fed","year":2008},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.341447Z"},"links":{"citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:1b05e35dbe08f9e730b3dd25c134130deca170a4f4121e55f51dc5b24ef092bd","observation_id":"94b8ee27-65ca-45a2-9618-f7d206e6ae89","resolution":{"observed_at":"2026-08-07T10:32:00.641718Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:32:00.630745Z","title":"An adaptive estimation of dimension reduction space","venue":null,"work_id":"0bc57022-b791-433a-9929-b5fe7edff68c","year":2002},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.343828Z"},"links":{"citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:1ee390554fa8fecec129812cafafb754726979e6aadb0ef8dec3e9081b10c368","observation_id":"17dc52b7-d696-4108-998f-ddf0ca1040d8","resolution":{"observed_at":"2026-08-07T10:32:00.633412Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T10:32:00.622924Z","title":"Interpolating convex and non-convex tensor decompositions via the subspace norm","venue":null,"work_id":"7a8e8c83-ffd0-400d-9990-5b3cac23f3f3","year":2015},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.346155Z"},"links":{"citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:771400a7ca9a5488dd7fab979c158c73cf2d89ac0f596754c3be61c8aeb768ff","observation_id":"1a703740-8f24-475a-b3fc-6bfe48f01856","resolution":{"observed_at":"2026-08-07T10:32:00.625696Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models"},"reference_resolution":{"displayed":59,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":10,"verified_exact":1,"verified_fuzzy":48},"total_outbound_references":59},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 59 of 59 outbound references and 3 inbound Pith citation observations for arXiv:2506.05500."}