{"as_of":"2026-08-12T11:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e49766f721a6234be7d31d380eaaacb38cbbc4a80cc2c183e08b8c7e7cb3f943","coverage":[{"denominator":20,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":20,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T22:49:49.794883Z","state":"measured"},{"denominator":23,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":23,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+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-03T04:19:47.037946Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.00817","last_updated":"2025-01-08T10:42:53Z","snapshot_observed_at":"2026-08-11T22:41:47.894858Z","submitted_at":"2025-01-01T12:04:06Z","title":"Hardness of Learning Fixed Parities with Neural Networks","version":2},"cited_work":{"arxiv_id":"2501.00817","doi":"10.48550/arxiv.2501.00817","metadata_source":"arxiv_reference","pith_arxiv_id":"2501.00817","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Hardness of learning fixed parities with neural networks","venue":"arXiv (Cornell University)","work_id":"735fe5db-bbd3-4b5d-bddf-aa7fc5eca9d5","year":2025},"citing_paper":{"arxiv_id":"2510.26745","last_updated":"2026-05-18T17:56:38Z","snapshot_observed_at":"2026-08-02T20:19:54.425869Z","submitted_at":"2025-10-30T17:40:22Z","title":"Deep sequence models tend to memorize geometrically; it is unclear why","version":3},"reference_index":165,"source":"pdf_text","source_observed_at":"2026-05-21T20:38:18.005002Z"},"links":{"cited_paper":"/paper/2501.00817","citing_paper":"/paper/2510.26745"},"observation_digest":"sha256:8e4e9af78da17ba7f511ff538f52ae9419e227daafbf68afc7b0d9fc8d64a19d","observation_id":"026f25f2-02f8-4751-a1f8-636ff9b19f22","resolution":{"observed_at":"2026-05-21T20:40:36.262167Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.00817","last_updated":"2025-01-08T10:42:53Z","snapshot_observed_at":"2026-08-11T22:41:47.894858Z","submitted_at":"2025-01-01T12:04:06Z","title":"Hardness of Learning Fixed Parities with Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.00817","snapshot_observed_at":"2026-08-03T04:19:47.037946Z","title":"Hardness of learning fixed parities with neural networks","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":41,"source":"arxiv_source","source_observed_at":"2026-08-03T04:19:47.037946Z"},"links":{"cited_paper":"/paper/2501.00817","citing_paper":"/paper/2602.05704"},"observation_digest":"sha256:858f586657cdf001203a3306b5324ab8d7c0673195a0d47c58cb224662c9a8f2","observation_id":"7ac56ca2-2b13-4ac3-83b5-ac7b60fcede3","resolution":{"observed_at":"2026-08-03T04:19:47.037946Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.00817","last_updated":"2025-01-08T10:42:53Z","snapshot_observed_at":"2026-08-11T22:41:47.894858Z","submitted_at":"2025-01-01T12:04:06Z","title":"Hardness of Learning Fixed Parities with Neural Networks","version":2},"cited_work":{"arxiv_id":"2501.00817","doi":"10.48550/arxiv.2501.00817","metadata_source":"arxiv_reference","pith_arxiv_id":"2501.00817","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Hardness of learning fixed parities with neural networks","venue":"arXiv (Cornell University)","work_id":"735fe5db-bbd3-4b5d-bddf-aa7fc5eca9d5","year":2025},"citing_paper":{"arxiv_id":"2606.20937","last_updated":"2026-06-18T21:01:42Z","snapshot_observed_at":"2026-08-02T17:33:10.336044Z","submitted_at":"2026-06-18T21:01:42Z","title":"Learning through Internalization","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-06-26T17:43:18.915404Z"},"links":{"cited_paper":"/paper/2501.00817","citing_paper":"/paper/2606.20937"},"observation_digest":"sha256:137ca515af7d0db7b7eb108d064c24a18b01076085daa1b4252904734965fa44","observation_id":"a0c4ae17-744c-453d-a63c-11733740d56d","resolution":{"observed_at":"2026-06-26T17:49:40.655923Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2501.00817/citation-record","integrity":"/paper/2501.00817/integrity","json":"/paper/2501.00817/citation-record.json","paper":"/paper/2501.00817"},"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-10T22:49:50.073027Z","title":"On the non-universality of deep learning: quantifying the cost of symmetry","venue":null,"work_id":"160af386-d347-4807-b99b-171c278b3185","year":2022},"citing_paper":{"arxiv_id":"2501.00817","last_updated":"2025-01-08T10:42:53Z","snapshot_observed_at":"2026-08-11T22:41:47.894858Z","submitted_at":"2025-01-01T12:04:06Z","title":"Hardness of Learning Fixed Parities with Neural Networks","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-10T22:49:49.711702Z"},"links":{"citing_paper":"/paper/2501.00817"},"observation_digest":"sha256:71015f1104911bc15f51afbbb09e381d99e37989b62e32888231c4928dff6a45","observation_id":"b6db95a8-71c7-453d-8a14-f6e46b0171b6","resolution":{"observed_at":"2026-08-10T22:49:50.078039Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2001.02992","last_updated":"2020-01-07T08:31:50Z","snapshot_observed_at":"2026-08-11T22:42:03.804752Z","submitted_at":"2020-01-07T08:31:50Z","title":"Poly-time universality and limitations of deep learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2001.02992","snapshot_observed_at":"2026-08-10T22:49:49.716245Z","title":"Poly-time universality and limitations of deep learning","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2501.00817","last_updated":"2025-01-08T10:42:53Z","snapshot_observed_at":"2026-08-11T22:41:47.894858Z","submitted_at":"2025-01-01T12:04:06Z","title":"Hardness of Learning Fixed Parities with Neural Networks","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-10T22:49:49.716245Z"},"links":{"cited_paper":"/paper/2001.02992","citing_paper":"/paper/2501.00817"},"observation_digest":"sha256:fa8614b1c3d4f8c8d6f94a149e0d7261e83d331a5168ada184b90108f6692b92","observation_id":"961ea479-e4f8-4721-b7c4-e147025c7266","resolution":{"observed_at":"2026-08-10T22:49:49.716245Z","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-10T22:49:50.058868Z","title":"On the universality of deep learning","venue":null,"work_id":"6d69f335-fc4f-4f81-a2e1-8fe832c6ce63","year":2020},"citing_paper":{"arxiv_id":"2501.00817","last_updated":"2025-01-08T10:42:53Z","snapshot_observed_at":"2026-08-11T22:41:47.894858Z","submitted_at":"2025-01-01T12:04:06Z","title":"Hardness of Learning Fixed Parities with Neural Networks","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-10T22:49:49.721249Z"},"links":{"citing_paper":"/paper/2501.00817"},"observation_digest":"sha256:40492f608d8897a6f41077799e9ffce5d7729153bd82b2bdfedfe9973b868e20","observation_id":"2060f76f-cf0d-4fa1-89dd-31b2d1a29979","resolution":{"observed_at":"2026-08-10T22:49:50.063311Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T22:49:50.043497Z","title":"On the power of differentiable learning versus pac and sq learning","venue":null,"work_id":"5d74c52a-d2a6-4bb0-bade-6763320c0d9c","year":2021},"citing_paper":{"arxiv_id":"2501.00817","last_updated":"2025-01-08T10:42:53Z","snapshot_observed_at":"2026-08-11T22:41:47.894858Z","submitted_at":"2025-01-01T12:04:06Z","title":"Hardness of Learning Fixed Parities with Neural Networks","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-10T22:49:49.725227Z"},"links":{"citing_paper":"/paper/2501.00817"},"observation_digest":"sha256:38c6eeb9fb1e5b010daa46f6493a6b821f0436d66f8c400d22967726249ee449","observation_id":"0a3aa8ef-4e84-44ec-b83b-ef325d9cd7e0","resolution":{"observed_at":"2026-08-10T22:49:50.048836Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T22:49:50.028569Z","title":"Noise-tolerant learning, the parity problem, and the statistical query model","venue":null,"work_id":"7229a541-fd43-4cd2-aa94-60e8d0c02457","year":2003},"citing_paper":{"arxiv_id":"2501.00817","last_updated":"2025-01-08T10:42:53Z","snapshot_observed_at":"2026-08-11T22:41:47.894858Z","submitted_at":"2025-01-01T12:04:06Z","title":"Hardness of Learning Fixed Parities with Neural Networks","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-10T22:49:49.730185Z"},"links":{"citing_paper":"/paper/2501.00817"},"observation_digest":"sha256:ddec23d30d6850d09c4e48698bc760a0da46c674ee4c61462873c579f58b54c9","observation_id":"b290d281-7181-4ba4-a545-4a655d115ba8","resolution":{"observed_at":"2026-08-10T22:49:50.032959Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T22:49:50.014406Z","title":"Further and stronger analogy between sampling and optimization: Langevin monte carlo and gradient descent","venue":null,"work_id":"41bad9da-ecf1-49e7-b7db-a685f32e7822","year":2017},"citing_paper":{"arxiv_id":"2501.00817","last_updated":"2025-01-08T10:42:53Z","snapshot_observed_at":"2026-08-11T22:41:47.894858Z","submitted_at":"2025-01-01T12:04:06Z","title":"Hardness of Learning Fixed Parities with Neural Networks","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-10T22:49:49.734933Z"},"links":{"citing_paper":"/paper/2501.00817"},"observation_digest":"sha256:f4367a4d41e21ed33778d112e99631a11ea703df24d6b0a17cd22f123b59c23d","observation_id":"1d3a0ebb-c310-45b6-8a59-3049b04a2765","resolution":{"observed_at":"2026-08-10T22:49:50.019650Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T22:49:50.001435Z","title":"Gradient descent can take exponential time to escape saddle points","venue":null,"work_id":"d0ae51ef-21a9-4ca0-a098-1d5e143916b1","year":2017},"citing_paper":{"arxiv_id":"2501.00817","last_updated":"2025-01-08T10:42:53Z","snapshot_observed_at":"2026-08-11T22:41:47.894858Z","submitted_at":"2025-01-01T12:04:06Z","title":"Hardness of Learning Fixed Parities with Neural Networks","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-10T22:49:49.739598Z"},"links":{"citing_paper":"/paper/2501.00817"},"observation_digest":"sha256:1cd51998d542fd3223465be267c391b6e0f8a8251fdf6156923321ed274e5fb5","observation_id":"5176d386-74c2-4560-ae11-77a17a43d688","resolution":{"observed_at":"2026-08-10T22:49:50.005912Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T22:49:49.988590Z","title":"Nonasymptotic convergence analysis for the unadjusted langevin algorithm","venue":null,"work_id":"3a8baf97-d867-4c14-ac18-817f5c1afb93","year":2017},"citing_paper":{"arxiv_id":"2501.00817","last_updated":"2025-01-08T10:42:53Z","snapshot_observed_at":"2026-08-11T22:41:47.894858Z","submitted_at":"2025-01-01T12:04:06Z","title":"Hardness of Learning Fixed Parities with Neural Networks","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-10T22:49:49.744786Z"},"links":{"citing_paper":"/paper/2501.00817"},"observation_digest":"sha256:18430e327039bf50772ed001e9c9a80781c4be434337ccde08078ad40b48edfa","observation_id":"5349aed5-46b2-4ae2-824c-3c9f7c4705c2","resolution":{"observed_at":"2026-08-10T22:49:49.992723Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T22:49:49.974413Z","title":"Statistical algorithms and a lower bound for detecting planted cliques","venue":null,"work_id":"15b4ec89-201a-4f9f-b73b-6d14bcb4eb03","year":2017},"citing_paper":{"arxiv_id":"2501.00817","last_updated":"2025-01-08T10:42:53Z","snapshot_observed_at":"2026-08-11T22:41:47.894858Z","submitted_at":"2025-01-01T12:04:06Z","title":"Hardness of Learning Fixed Parities with Neural Networks","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-10T22:49:49.748822Z"},"links":{"citing_paper":"/paper/2501.00817"},"observation_digest":"sha256:aeb67798ac28bc1ef992f9de516dc3e10b8429260718f4fc9082b193f17f0853","observation_id":"2a1f0040-b406-4bd4-a707-fbc93bda52d8","resolution":{"observed_at":"2026-08-10T22:49:49.979654Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T22:49:49.752818Z","title":"How to escape saddle points efficiently","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.00817","last_updated":"2025-01-08T10:42:53Z","snapshot_observed_at":"2026-08-11T22:41:47.894858Z","submitted_at":"2025-01-01T12:04:06Z","title":"Hardness of Learning Fixed Parities with Neural Networks","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-10T22:49:49.752818Z"},"links":{"citing_paper":"/paper/2501.00817"},"observation_digest":"sha256:2d249cd6a9132ec3d81ea5401ca0eb977f8ede6aa8fad44eb411c53f3ea383c7","observation_id":"3d634e7f-5942-4229-93b9-a1974f9732a4","resolution":{"observed_at":"2026-08-10T22:49:49.752818Z","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-10T22:49:49.954116Z","title":"Efficient noise-tolerant learning from statistical queries","venue":null,"work_id":"4b18d072-1bf3-4896-be89-dedf2d7ad71b","year":1998},"citing_paper":{"arxiv_id":"2501.00817","last_updated":"2025-01-08T10:42:53Z","snapshot_observed_at":"2026-08-11T22:41:47.894858Z","submitted_at":"2025-01-01T12:04:06Z","title":"Hardness of Learning Fixed Parities with Neural Networks","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-10T22:49:49.756455Z"},"links":{"citing_paper":"/paper/2501.00817"},"observation_digest":"sha256:5e997731919e1173c436debb984f5373a4fdf9a252aaeeb0357e97168a1696a8","observation_id":"9398f5bf-a446-4f32-b233-093f0d9bb9be","resolution":{"observed_at":"2026-08-10T22:49:49.958817Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T22:49:49.760425Z","title":"An introduction to computational learning theory","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2501.00817","last_updated":"2025-01-08T10:42:53Z","snapshot_observed_at":"2026-08-11T22:41:47.894858Z","submitted_at":"2025-01-01T12:04:06Z","title":"Hardness of Learning Fixed Parities with Neural Networks","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-10T22:49:49.760425Z"},"links":{"citing_paper":"/paper/2501.00817"},"observation_digest":"sha256:11e696e1d53485f79a3ba4a731fda4305441594d7a3b7367217b13001285ade0","observation_id":"babbeeb7-08d6-42f1-8c2e-2701a87165b0","resolution":{"observed_at":"2026-08-10T22:49:49.760425Z","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-10T22:49:49.931518Z","title":"On symmetry and initialization for neural networks","venue":null,"work_id":"4f553a31-8900-41bd-b62b-c7008e51f2a2","year":2020},"citing_paper":{"arxiv_id":"2501.00817","last_updated":"2025-01-08T10:42:53Z","snapshot_observed_at":"2026-08-11T22:41:47.894858Z","submitted_at":"2025-01-01T12:04:06Z","title":"Hardness of Learning Fixed Parities with Neural Networks","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-10T22:49:49.764252Z"},"links":{"citing_paper":"/paper/2501.00817"},"observation_digest":"sha256:0fea1245825e5f7f1fd4e3c5fb052184f6873a798b7b4604da0c8f820502c36c","observation_id":"55e55270-5b29-450f-ba09-5b3c9698ff14","resolution":{"observed_at":"2026-08-10T22:49:49.936116Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2105.10386","last_updated":"2021-05-21T15:00:35Z","snapshot_observed_at":"2026-08-11T22:41:12.274735Z","submitted_at":"2021-05-21T15:00:35Z","title":"Analysis of Boolean Functions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.10386","snapshot_observed_at":"2026-08-10T22:49:49.768026Z","title":"Analysis of boolean functions, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.00817","last_updated":"2025-01-08T10:42:53Z","snapshot_observed_at":"2026-08-11T22:41:47.894858Z","submitted_at":"2025-01-01T12:04:06Z","title":"Hardness of Learning Fixed Parities with Neural Networks","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-10T22:49:49.768026Z"},"links":{"cited_paper":"/paper/2105.10386","citing_paper":"/paper/2501.00817"},"observation_digest":"sha256:b108ac004e49f5fb78ccb0d02c62d44f86cc6401eb0ebbb804e53bdc51988ba8","observation_id":"84b2f23c-784a-40de-ac56-dfa09ebfb8b4","resolution":{"observed_at":"2026-08-10T22:49:49.768026Z","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-10T22:49:49.916313Z","title":"Fast learning requires good memory: A time-space lower bound for parity learning","venue":null,"work_id":"51cda477-fc80-4040-8268-f64ab94596ed","year":2018},"citing_paper":{"arxiv_id":"2501.00817","last_updated":"2025-01-08T10:42:53Z","snapshot_observed_at":"2026-08-11T22:41:47.894858Z","submitted_at":"2025-01-01T12:04:06Z","title":"Hardness of Learning Fixed Parities with Neural Networks","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-10T22:49:49.772760Z"},"links":{"citing_paper":"/paper/2501.00817"},"observation_digest":"sha256:b79f6f3a22c46a4a896554a97e213512025f1ba054651a710380281c7836925e","observation_id":"1f380dc3-9ec6-4dc7-9b77-20b4e2c6caf2","resolution":{"observed_at":"2026-08-10T22:49:49.921275Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2004.00557","last_updated":"2020-05-14T14:32:38Z","snapshot_observed_at":"2026-08-11T04:10:25.389112Z","submitted_at":"2020-04-01T16:37:10Z","title":"Statistical Queries and Statistical Algorithms: Foundations and Applications","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.00557","snapshot_observed_at":"2026-08-10T22:49:49.776829Z","title":"Statistical queries and statistical algorithms: Foundations and applications","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2501.00817","last_updated":"2025-01-08T10:42:53Z","snapshot_observed_at":"2026-08-11T22:41:47.894858Z","submitted_at":"2025-01-01T12:04:06Z","title":"Hardness of Learning Fixed Parities with Neural Networks","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-10T22:49:49.776829Z"},"links":{"cited_paper":"/paper/2004.00557","citing_paper":"/paper/2501.00817"},"observation_digest":"sha256:82510f951ac12d7bcd60e24fd93dde2d64cfa00689108e55c3987d5bd718b473","observation_id":"337b4323-328c-4e7c-8b91-282e4d2fd084","resolution":{"observed_at":"2026-08-10T22:49:49.776829Z","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-10T22:49:49.903020Z","title":"Failures of gradient-based deep learning","venue":null,"work_id":"3317ae8c-be8e-4515-8eb5-3be845bc7c2d","year":2017},"citing_paper":{"arxiv_id":"2501.00817","last_updated":"2025-01-08T10:42:53Z","snapshot_observed_at":"2026-08-11T22:41:47.894858Z","submitted_at":"2025-01-01T12:04:06Z","title":"Hardness of Learning Fixed Parities with Neural Networks","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-10T22:49:49.781558Z"},"links":{"citing_paper":"/paper/2501.00817"},"observation_digest":"sha256:b0a2de4ea3fea2447c089b9e97e859560d53616c14d18168a48ecc73c02dfeb2","observation_id":"c4538453-a627-4c16-8e6b-623c42ef2cc5","resolution":{"observed_at":"2026-08-10T22:49:49.907909Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T22:49:49.890212Z","title":"Global convergence of langevin dynamics based algorithms for nonconvex optimization","venue":null,"work_id":"9f049a41-f772-4bac-b486-4410bd0a2d38","year":2018},"citing_paper":{"arxiv_id":"2501.00817","last_updated":"2025-01-08T10:42:53Z","snapshot_observed_at":"2026-08-11T22:41:47.894858Z","submitted_at":"2025-01-01T12:04:06Z","title":"Hardness of Learning Fixed Parities with Neural Networks","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-10T22:49:49.786833Z"},"links":{"citing_paper":"/paper/2501.00817"},"observation_digest":"sha256:d024ca53ed8805e4cf0a3ca447771bd784beca827766ee5fb51a64384bc27351","observation_id":"3809b4c9-e832-48f9-ae91-7677af5b4fe0","resolution":{"observed_at":"2026-08-10T22:49:49.894739Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T22:49:49.876999Z","title":"New lower bounds for statistical query learning","venue":null,"work_id":"571e6761-9ccb-4946-8f93-a7f42811aad4","year":2005},"citing_paper":{"arxiv_id":"2501.00817","last_updated":"2025-01-08T10:42:53Z","snapshot_observed_at":"2026-08-11T22:41:47.894858Z","submitted_at":"2025-01-01T12:04:06Z","title":"Hardness of Learning Fixed Parities with Neural Networks","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-10T22:49:49.791060Z"},"links":{"citing_paper":"/paper/2501.00817"},"observation_digest":"sha256:56a6d045a52d5047627b11f8b1e7aa2a6e49e1a2344fbf0e5577ec9d00f2c5f4","observation_id":"0002ae2d-a3eb-499a-93a2-939e4b41b240","resolution":{"observed_at":"2026-08-10T22:49:49.881203Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T22:49:49.860646Z","title":"Escape saddle points by a simple gradient-descent based algorithm","venue":null,"work_id":"c9b631d2-4ecc-4a8a-8513-15adc2ef73ff","year":2021},"citing_paper":{"arxiv_id":"2501.00817","last_updated":"2025-01-08T10:42:53Z","snapshot_observed_at":"2026-08-11T22:41:47.894858Z","submitted_at":"2025-01-01T12:04:06Z","title":"Hardness of Learning Fixed Parities with Neural Networks","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-10T22:49:49.794883Z"},"links":{"citing_paper":"/paper/2501.00817"},"observation_digest":"sha256:b325989c5d0e11a92be21f7cf23f132736ee4413a4d1529aa72ba493937691ca","observation_id":"09a9e761-7ad2-4518-9717-3c1644ea5ef4","resolution":{"observed_at":"2026-08-10T22:49:49.867492Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.00817","last_updated":"2025-01-08T10:42:53Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-11T22:41:47.894858Z","submitted_at":"2025-01-01T12:04:06Z","title":"Hardness of Learning Fixed Parities with Neural Networks"},"reference_resolution":{"displayed":20,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":0,"verified_fuzzy":15},"total_outbound_references":20},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 20 of 20 outbound references and 3 inbound Pith citation observations for arXiv:2501.00817."}