{"as_of":"2026-08-08T13:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:452daa909d9118066556983959f519e32251198509767cd7f22074012a752f31","coverage":[{"denominator":54,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":54,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T11:52:04.648050Z","state":"measured"},{"denominator":54,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":54,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2506.01832/citation-record","integrity":"/paper/2506.01832/integrity","json":"/paper/2506.01832/citation-record.json","paper":"/paper/2506.01832"},"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-07T11:52:10.973286Z","title":"Simple constructions of almost k -wise independent random variables","venue":null,"work_id":"374a64eb-6ee5-4ba2-897d-6097f60223c1","year":1992},"citing_paper":{"arxiv_id":"2506.01832","last_updated":"2025-06-04T13:44:02Z","snapshot_observed_at":"2026-08-07T11:30:27.108011Z","submitted_at":"2025-06-02T16:21:30Z","title":"Pseudorandom bits for non-commutative programs","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T11:51:51.067331Z"},"links":{"citing_paper":"/paper/2506.01832"},"observation_digest":"sha256:5b2d6d90eed800d4c8e8471396b766bc8aa1e60585c725ee6235e45a745d6d2e","observation_id":"32a964c3-a5cd-463c-abc0-31c5f83a313a","resolution":{"observed_at":"2026-08-07T11:52:11.049201Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:52:10.820857Z","title":"Cryptography in NC ^0","venue":null,"work_id":"c53ceb6c-c6da-48b2-a90a-57a1e82607de","year":2006},"citing_paper":{"arxiv_id":"2506.01832","last_updated":"2025-06-04T13:44:02Z","snapshot_observed_at":"2026-08-07T11:30:27.108011Z","submitted_at":"2025-06-02T16:21:30Z","title":"Pseudorandom bits for non-commutative programs","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T11:51:51.850440Z"},"links":{"citing_paper":"/paper/2506.01832"},"observation_digest":"sha256:1a4fdcd040969b21913e824d7f54ea6e2be7cea5effdceae77f04afe1b960105","observation_id":"bb59a898-f202-47dd-90c1-9b2eb49a2c5e","resolution":{"observed_at":"2026-08-07T11:52:10.883723Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:52:10.713361Z","title":"Semi-direct product in groups and zig-zag product in graphs: Connections and applications","venue":null,"work_id":"5ac36b4c-f7c3-43e5-b8f2-882a610a76b5","year":2001},"citing_paper":{"arxiv_id":"2506.01832","last_updated":"2025-06-04T13:44:02Z","snapshot_observed_at":"2026-08-07T11:30:27.108011Z","submitted_at":"2025-06-02T16:21:30Z","title":"Pseudorandom bits for non-commutative programs","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T11:51:53.413555Z"},"links":{"citing_paper":"/paper/2506.01832"},"observation_digest":"sha256:b2d4c0abc3dba6b6c3ce10ef10f65541a8171a691d3e235d1f005ac9bfc30b91","observation_id":"2bdb94d9-eca7-485c-af17-8bdfe325408d","resolution":{"observed_at":"2026-08-07T11:52:10.769441Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:52:10.551217Z","title":"Saks, Avi Wigderson, and Shiyu Zhou","venue":null,"work_id":"c3509f41-8658-4fda-be5a-558a054f459d","year":1996},"citing_paper":{"arxiv_id":"2506.01832","last_updated":"2025-06-04T13:44:02Z","snapshot_observed_at":"2026-08-07T11:30:27.108011Z","submitted_at":"2025-06-02T16:21:30Z","title":"Pseudorandom bits for non-commutative programs","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T11:51:55.169716Z"},"links":{"citing_paper":"/paper/2506.01832"},"observation_digest":"sha256:274b6756b924d8b0f5770da7f0b8f7bfdd60c5d1676e45205279157dd7849b70","observation_id":"ada7f89e-340b-4fbe-9cc6-8eb193f065bc","resolution":{"observed_at":"2026-08-07T11:52:10.612125Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:52:10.409957Z","title":"Deterministic simulation of probabilistic constant-depth circuits","venue":null,"work_id":"be26a075-4e98-4225-b885-815f9c94d70f","year":1989},"citing_paper":{"arxiv_id":"2506.01832","last_updated":"2025-06-04T13:44:02Z","snapshot_observed_at":"2026-08-07T11:30:27.108011Z","submitted_at":"2025-06-02T16:21:30Z","title":"Pseudorandom bits for non-commutative programs","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T11:51:55.335861Z"},"links":{"citing_paper":"/paper/2506.01832"},"observation_digest":"sha256:3e94fcc7467c807eafb44b9219fad0f4b1a8eb085d3fe045144df473782c3528","observation_id":"336681e4-8e04-4e6e-85a3-597d8e481578","resolution":{"observed_at":"2026-08-07T11:52:10.477784Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:52:10.311911Z","title":"Mix Barrington","venue":null,"work_id":"9274fd50-7b2c-4ef8-ad87-a6d8bf0651a4","year":1989},"citing_paper":{"arxiv_id":"2506.01832","last_updated":"2025-06-04T13:44:02Z","snapshot_observed_at":"2026-08-07T11:30:27.108011Z","submitted_at":"2025-06-02T16:21:30Z","title":"Pseudorandom bits for non-commutative programs","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T11:51:55.487281Z"},"links":{"citing_paper":"/paper/2506.01832"},"observation_digest":"sha256:11c2eb58c428eaba72182866d497b2e4a78af972fe02a579331ab032ba95934f","observation_id":"7e12c87f-0cdb-4df6-bb4d-197f291b39ef","resolution":{"observed_at":"2026-08-07T11:52:10.356587Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1712.02302","last_updated":"2017-12-06T17:38:48Z","snapshot_observed_at":"2026-07-06T06:13:06.864978Z","submitted_at":"2017-12-06T17:38:48Z","title":"Which groups are amenable to proving exponent two for matrix multiplication?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1712.02302","snapshot_observed_at":"2026-08-07T11:51:55.637470Z","title":"Grochow, and Chris Umans","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.01832","last_updated":"2025-06-04T13:44:02Z","snapshot_observed_at":"2026-08-07T11:30:27.108011Z","submitted_at":"2025-06-02T16:21:30Z","title":"Pseudorandom bits for non-commutative programs","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T11:51:55.637470Z"},"links":{"cited_paper":"/paper/1712.02302","citing_paper":"/paper/2506.01832"},"observation_digest":"sha256:c560987633797e09e9007d23c3a902bce46ef1f50e200a51aba2de578e4d005f","observation_id":"4b6f8a77-1da6-4c43-ae8b-82976358698c","resolution":{"observed_at":"2026-08-07T11:51:55.637470Z","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-07T11:52:10.164813Z","title":"Pseudorandom bits for polynomials","venue":null,"work_id":"05d5f579-ed62-40eb-87c0-a4d2124d16b9","year":2010},"citing_paper":{"arxiv_id":"2506.01832","last_updated":"2025-06-04T13:44:02Z","snapshot_observed_at":"2026-08-07T11:30:27.108011Z","submitted_at":"2025-06-02T16:21:30Z","title":"Pseudorandom bits for non-commutative programs","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T11:51:55.852715Z"},"links":{"citing_paper":"/paper/2506.01832"},"observation_digest":"sha256:9fff8a372b30b79f9a83979b46df8837685331cd53f56ed5682fb980caef66b5","observation_id":"30003f54-a50c-4f7c-aef5-0af0a80446e5","resolution":{"observed_at":"2026-08-07T11:52:10.222269Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:52:10.070087Z","title":"Pseudorandom generators from polarizing random walks","venue":null,"work_id":"1c37c8f4-0859-4591-989c-a3fb3967fe1a","year":2019},"citing_paper":{"arxiv_id":"2506.01832","last_updated":"2025-06-04T13:44:02Z","snapshot_observed_at":"2026-08-07T11:30:27.108011Z","submitted_at":"2025-06-02T16:21:30Z","title":"Pseudorandom bits for non-commutative programs","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T11:51:56.192891Z"},"links":{"citing_paper":"/paper/2506.01832"},"observation_digest":"sha256:68cdefaa35d37a07257ff8813d12bb65ddb2ee65a8321bc9aeb11f72c19bb488","observation_id":"f7ff8c9c-4ccd-4cea-89ce-841a0dc93412","resolution":{"observed_at":"2026-08-07T11:52:10.116182Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:52:09.965828Z","title":"Kleinberg, Bal \\'a zs Szegedy, and Christopher Umans","venue":null,"work_id":"62c84bad-2a24-404a-9b01-bb699dc7c35c","year":2005},"citing_paper":{"arxiv_id":"2506.01832","last_updated":"2025-06-04T13:44:02Z","snapshot_observed_at":"2026-08-07T11:30:27.108011Z","submitted_at":"2025-06-02T16:21:30Z","title":"Pseudorandom bits for non-commutative programs","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T11:51:56.393518Z"},"links":{"citing_paper":"/paper/2506.01832"},"observation_digest":"sha256:ca999fcd76d982866241e30ec1ec78c26a26a66f50e15c52cc81af8aa0cf11f8","observation_id":"ca403f29-9242-4670-bdb7-804c7f283251","resolution":{"observed_at":"2026-08-07T11:52:10.011841Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:52:09.879196Z","title":"Dummit and Richard M","venue":null,"work_id":"69b444de-bde0-4d3f-977f-0e3c6d3017f2","year":2004},"citing_paper":{"arxiv_id":"2506.01832","last_updated":"2025-06-04T13:44:02Z","snapshot_observed_at":"2026-08-07T11:30:27.108011Z","submitted_at":"2025-06-02T16:21:30Z","title":"Pseudorandom bits for non-commutative programs","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T11:51:56.594200Z"},"links":{"citing_paper":"/paper/2506.01832"},"observation_digest":"sha256:44f3ef647bfb479e84dbc6d720e102cf9a1129930b1316c37ec7b9265e2cd3eb","observation_id":"d3600f7b-7cd3-4526-8b98-e7c96f4f20fc","resolution":{"observed_at":"2026-08-07T11:52:09.894117Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:52:09.770803Z","title":"u cken, Germany (Virtual Conference) , volume 169 of LIPIcs , pages 6:1--6:36. Schloss Dagstuhl - Leibniz-Zentrum f \\","venue":null,"work_id":"40555d6f-c87f-4650-b825-37578ba7c3c1","year":2020},"citing_paper":{"arxiv_id":"2506.01832","last_updated":"2025-06-04T13:44:02Z","snapshot_observed_at":"2026-08-07T11:30:27.108011Z","submitted_at":"2025-06-02T16:21:30Z","title":"Pseudorandom bits for non-commutative programs","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T11:51:56.848598Z"},"links":{"citing_paper":"/paper/2506.01832"},"observation_digest":"sha256:6c2e506a93ec4135df316b280165d905f64035284029d1a65a73c5e4125fb8f4","observation_id":"1fcf0ba5-798b-430c-8116-cab2d5113bc3","resolution":{"observed_at":"2026-08-07T11:52:09.819566Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:52:09.627632Z","title":"Group representations in probability and statistics , volume 11 of Institute of Mathematical Statistics Lecture Notes---Monograph Series","venue":null,"work_id":"951d6426-ddf7-4b31-a6be-87fec0e075bb","year":1988},"citing_paper":{"arxiv_id":"2506.01832","last_updated":"2025-06-04T13:44:02Z","snapshot_observed_at":"2026-08-07T11:30:27.108011Z","submitted_at":"2025-06-02T16:21:30Z","title":"Pseudorandom bits for non-commutative programs","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T11:51:57.263240Z"},"links":{"citing_paper":"/paper/2506.01832"},"observation_digest":"sha256:41edeec2bef537bf09a9241f1da786aa6bcf7cb4c3bf2a552ab64c65f640c0be","observation_id":"efa68933-8b15-4ad5-9321-d2c2b8005014","resolution":{"observed_at":"2026-08-07T11:52:09.691190Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:52:09.546447Z","title":"Pseudorandomness, symmetry, smoothing: Ii, 2024","venue":null,"work_id":"924a12a4-163f-4d8d-92cc-6b4a1f9f6fb5","year":2024},"citing_paper":{"arxiv_id":"2506.01832","last_updated":"2025-06-04T13:44:02Z","snapshot_observed_at":"2026-08-07T11:30:27.108011Z","submitted_at":"2025-06-02T16:21:30Z","title":"Pseudorandom bits for non-commutative programs","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T11:51:57.923128Z"},"links":{"citing_paper":"/paper/2506.01832"},"observation_digest":"sha256:a391be866e368e1a6a3b3fffc713610569c0874a501142d770199ce000c8e4de","observation_id":"596a91f1-445c-46b4-b6c1-3137d5958ae3","resolution":{"observed_at":"2026-08-07T11:52:09.580714Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:52:09.427699Z","title":"Boosting uniformity in quasirandom groups: fast and simple","venue":null,"work_id":"139bda24-e78b-4134-b3eb-91f1d0cedc26","year":2024},"citing_paper":{"arxiv_id":"2506.01832","last_updated":"2025-06-04T13:44:02Z","snapshot_observed_at":"2026-08-07T11:30:27.108011Z","submitted_at":"2025-06-02T16:21:30Z","title":"Pseudorandom bits for non-commutative programs","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T11:51:58.691737Z"},"links":{"citing_paper":"/paper/2506.01832"},"observation_digest":"sha256:c10da2ec350d307b37ddd6d7c3ec451f7b6bcb68167a0d4764965839ee08dd2d","observation_id":"d378b4de-fdb8-4d1b-9a72-df6e5205b9c6","resolution":{"observed_at":"2026-08-07T11:52:09.474141Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:52:09.279391Z","title":"Forbes and Zander Kelley","venue":null,"work_id":"5d02dd25-4c7b-45e3-b4df-c712caf41b70","year":2018},"citing_paper":{"arxiv_id":"2506.01832","last_updated":"2025-06-04T13:44:02Z","snapshot_observed_at":"2026-08-07T11:30:27.108011Z","submitted_at":"2025-06-02T16:21:30Z","title":"Pseudorandom bits for non-commutative programs","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T11:51:59.172590Z"},"links":{"citing_paper":"/paper/2506.01832"},"observation_digest":"sha256:20d592020ac733d84c199be951b0e7bb97c2cb4ab75d0b0ff41dfd19830451fa","observation_id":"cb2430e2-c72b-47fb-8626-9b7760a5ffa1","resolution":{"observed_at":"2026-08-07T11:52:09.339254Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:52:09.119436Z","title":"Pseudorandomness via the discrete fourier transform","venue":null,"work_id":"d599bac3-8e03-42bb-aa0f-afba2bbf9437","year":2015},"citing_paper":{"arxiv_id":"2506.01832","last_updated":"2025-06-04T13:44:02Z","snapshot_observed_at":"2026-08-07T11:30:27.108011Z","submitted_at":"2025-06-02T16:21:30Z","title":"Pseudorandom bits for non-commutative programs","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T11:51:59.379619Z"},"links":{"citing_paper":"/paper/2506.01832"},"observation_digest":"sha256:6f6db98c61b94ae47bccbdc98abbb73044c8890c9ab08bdc86eb28c33522efea","observation_id":"5f181cad-51ec-45a7-8f4f-4cbd508cd237","resolution":{"observed_at":"2026-08-07T11:52:09.194813Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:52:09.032378Z","title":"Kane, and Raghu Meka","venue":null,"work_id":"89d0a5d1-a60b-4954-914c-bac7d3acfb1c","year":2018},"citing_paper":{"arxiv_id":"2506.01832","last_updated":"2025-06-04T13:44:02Z","snapshot_observed_at":"2026-08-07T11:30:27.108011Z","submitted_at":"2025-06-02T16:21:30Z","title":"Pseudorandom bits for non-commutative programs","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T11:51:59.669419Z"},"links":{"citing_paper":"/paper/2506.01832"},"observation_digest":"sha256:65b2f1991492505da116f20c7c3f77cf9362a5881fe6dc0bcd99cb47cf6d9d0a","observation_id":"456e39dc-ca6e-472b-bfd7-c0338de20389","resolution":{"observed_at":"2026-08-07T11:52:09.070006Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:52:08.858851Z","title":"Better pseudorandom generators from milder pseudorandom restrictions","venue":null,"work_id":"24a68a7a-bf38-401b-9ce5-54216cf83558","year":2012},"citing_paper":{"arxiv_id":"2506.01832","last_updated":"2025-06-04T13:44:02Z","snapshot_observed_at":"2026-08-07T11:30:27.108011Z","submitted_at":"2025-06-02T16:21:30Z","title":"Pseudorandom bits for non-commutative programs","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T11:51:59.897267Z"},"links":{"citing_paper":"/paper/2506.01832"},"observation_digest":"sha256:95e137a266b6c5c9760f2b7d56fb9ea64625804fecbc1d4d7da480c3e8584f76","observation_id":"ffb64db4-deae-4908-8652-dee4f74680db","resolution":{"observed_at":"2026-08-07T11:52:08.940070Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:52:08.763640Z","title":"Pseudorandom generators for combinatorial shapes","venue":null,"work_id":"4fb452c7-4ca2-430e-952f-2578cdf2e25c","year":2013},"citing_paper":{"arxiv_id":"2506.01832","last_updated":"2025-06-04T13:44:02Z","snapshot_observed_at":"2026-08-07T11:30:27.108011Z","submitted_at":"2025-06-02T16:21:30Z","title":"Pseudorandom bits for non-commutative programs","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T11:52:00.307208Z"},"links":{"citing_paper":"/paper/2506.01832"},"observation_digest":"sha256:3054e48c6be201f49e1d882cd86df0e783419411427c9c761957a874450f0cb2","observation_id":"2bff27bf-d6ee-42a7-a024-1e71376e62c2","resolution":{"observed_at":"2026-08-07T11:52:08.804430Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:52:08.636832Z","title":null,"venue":null,"work_id":"227fd1ac-805c-421a-a747-d736d1fd8f96","year":2017},"citing_paper":{"arxiv_id":"2506.01832","last_updated":"2025-06-04T13:44:02Z","snapshot_observed_at":"2026-08-07T11:30:27.108011Z","submitted_at":"2025-06-02T16:21:30Z","title":"Pseudorandom bits for non-commutative programs","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T11:52:00.830569Z"},"links":{"citing_paper":"/paper/2506.01832"},"observation_digest":"sha256:c2f4bede0c84b5db008382df7e73216e15d0537d0ceec1a724abddcc0cce7148","observation_id":"622102b5-8c82-4f30-8bbe-4bc2640ca8c7","resolution":{"observed_at":"2026-08-07T11:52:08.679571Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:52:08.522125Z","title":null,"venue":null,"work_id":"154b5370-8f81-458a-b97a-4e25bf34efbf","year":2022},"citing_paper":{"arxiv_id":"2506.01832","last_updated":"2025-06-04T13:44:02Z","snapshot_observed_at":"2026-08-07T11:30:27.108011Z","submitted_at":"2025-06-02T16:21:30Z","title":"Pseudorandom bits for non-commutative programs","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T11:52:01.560104Z"},"links":{"citing_paper":"/paper/2506.01832"},"observation_digest":"sha256:ff945413ca46d002d42c8c4cb2d6c149ade780bf68145f483129edb8c9efc6a4","observation_id":"362d523e-25bf-4f34-a513-85e4c7dea26b","resolution":{"observed_at":"2026-08-07T11:52:08.580254Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:52:08.433977Z","title":"Paradigms for unconditional pseudorandom generators","venue":null,"work_id":"f5c52026-4501-4660-bb61-369415520cec","year":2024},"citing_paper":{"arxiv_id":"2506.01832","last_updated":"2025-06-04T13:44:02Z","snapshot_observed_at":"2026-08-07T11:30:27.108011Z","submitted_at":"2025-06-02T16:21:30Z","title":"Pseudorandom bits for non-commutative programs","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T11:52:01.870339Z"},"links":{"citing_paper":"/paper/2506.01832"},"observation_digest":"sha256:ce2cabd68d2a15d7bb843080f10fe1e725f5cc772d30c7be28dc3df5657ab9cc","observation_id":"c867ab8b-5a5a-4984-836d-0ef33ae8557f","resolution":{"observed_at":"2026-08-07T11:52:08.469163Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:52:08.349020Z","title":"Bounded independence plus noise fools products","venue":null,"work_id":"c6ea2ab2-3f7a-48d3-be9e-41feec9f2c5e","year":2018},"citing_paper":{"arxiv_id":"2506.01832","last_updated":"2025-06-04T13:44:02Z","snapshot_observed_at":"2026-08-07T11:30:27.108011Z","submitted_at":"2025-06-02T16:21:30Z","title":"Pseudorandom bits for non-commutative programs","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T11:52:01.967029Z"},"links":{"citing_paper":"/paper/2506.01832"},"observation_digest":"sha256:0a42ddea27898b622c26377c2b6cd0fc188e382899ac54cda49166aadbc90b62","observation_id":"b5e69d36-d886-47cb-b9fa-674b0c9d8b19","resolution":{"observed_at":"2026-08-07T11:52:08.377410Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:52:08.269792Z","title":"Pseudorandom generators for group products: extended abstract","venue":null,"work_id":"0c6fb0e3-1bfb-41c8-aefc-3ccfa3d94df9","year":2011},"citing_paper":{"arxiv_id":"2506.01832","last_updated":"2025-06-04T13:44:02Z","snapshot_observed_at":"2026-08-07T11:30:27.108011Z","submitted_at":"2025-06-02T16:21:30Z","title":"Pseudorandom bits for non-commutative programs","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T11:52:02.058586Z"},"links":{"citing_paper":"/paper/2506.01832"},"observation_digest":"sha256:57c4375aaa8ce7e578439ab89ae21cba501e32da9405f9afb5c11a04da6ac290","observation_id":"4875fe8e-1c6e-40b2-9d80-2c818561b39e","resolution":{"observed_at":"2026-08-07T11:52:08.311710Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:52:08.190465Z","title":null,"venue":null,"work_id":"74d454e7-2c38-4f06-b36d-90a24d7b09fa","year":2002},"citing_paper":{"arxiv_id":"2506.01832","last_updated":"2025-06-04T13:44:02Z","snapshot_observed_at":"2026-08-07T11:30:27.108011Z","submitted_at":"2025-06-02T16:21:30Z","title":"Pseudorandom bits for non-commutative programs","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T11:52:02.145561Z"},"links":{"citing_paper":"/paper/2506.01832"},"observation_digest":"sha256:ed1c6b2fac8b02262d9af87eafa41b9c33aa2a3ee0ce679cfc1fe0de9872ae33","observation_id":"1883e9b6-ac2a-4ff5-8944-6c441c9d5458","resolution":{"observed_at":"2026-08-07T11:52:08.235752Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:52:08.089847Z","title":"Fourier bounds and pseudorandom generators for product tests","venue":null,"work_id":"bdc36f76-23fc-48fe-98d1-3fb39ae3bd8c","year":2019},"citing_paper":{"arxiv_id":"2506.01832","last_updated":"2025-06-04T13:44:02Z","snapshot_observed_at":"2026-08-07T11:30:27.108011Z","submitted_at":"2025-06-02T16:21:30Z","title":"Pseudorandom bits for non-commutative programs","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T11:52:02.247432Z"},"links":{"citing_paper":"/paper/2506.01832"},"observation_digest":"sha256:fd78e961f00a88b158b237f15b54a8950596a155cd3f4777398637b2f6245adc","observation_id":"35692e2c-5f4c-41e8-9161-9cc40d9346ad","resolution":{"observed_at":"2026-08-07T11:52:08.136890Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:52:07.971381Z","title":"Pseudorandom generators for CC^0[p] and the F ourier spectrum of low-degree polynomials over finite fields","venue":null,"work_id":"66df53bb-1989-41e4-9440-0f2ff2943398","year":2010},"citing_paper":{"arxiv_id":"2506.01832","last_updated":"2025-06-04T13:44:02Z","snapshot_observed_at":"2026-08-07T11:30:27.108011Z","submitted_at":"2025-06-02T16:21:30Z","title":"Pseudorandom bits for non-commutative programs","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T11:52:02.331736Z"},"links":{"citing_paper":"/paper/2506.01832"},"observation_digest":"sha256:17a99f39e23c921de408155e501971e9ae6622e1193dcbecab04f622cbf5ddf2","observation_id":"763c27c4-f1ab-4bd0-bdd6-3eb41f3da62c","resolution":{"observed_at":"2026-08-07T11:52:08.021167Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:52:07.879195Z","title":"Unconditional pseudorandom generators for low degree polynomials","venue":null,"work_id":"8241e777-3a76-425f-a1c5-e6dc11a61d72","year":2009},"citing_paper":{"arxiv_id":"2506.01832","last_updated":"2025-06-04T13:44:02Z","snapshot_observed_at":"2026-08-07T11:30:27.108011Z","submitted_at":"2025-06-02T16:21:30Z","title":"Pseudorandom bits for non-commutative programs","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T11:52:02.404773Z"},"links":{"citing_paper":"/paper/2506.01832"},"observation_digest":"sha256:54ab989aaebce3284ea0fa668c94dd7aa11f495d79aaa8e321a61584735da9cb","observation_id":"ed038f88-e981-4233-ae2a-06f08fec3a39","resolution":{"observed_at":"2026-08-07T11:52:07.919730Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:52:07.780797Z","title":"Fourier growth of regular branching programs","venue":null,"work_id":"0ba5fa76-e1d1-4600-b79b-c955034f4ca7","year":2022},"citing_paper":{"arxiv_id":"2506.01832","last_updated":"2025-06-04T13:44:02Z","snapshot_observed_at":"2026-08-07T11:30:27.108011Z","submitted_at":"2025-06-02T16:21:30Z","title":"Pseudorandom bits for non-commutative programs","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T11:52:02.491496Z"},"links":{"citing_paper":"/paper/2506.01832"},"observation_digest":"sha256:50eba83eebca5907c43dde60ca2916d7c768ca57cc6560d49382da1b6960205a","observation_id":"f0f85ba9-9580-42e7-88c0-1eb0c1eb63c5","resolution":{"observed_at":"2026-08-07T11:52:07.828186Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:52:07.661516Z","title":"Pseudorandom bit generators that fool modular sums","venue":null,"work_id":"21cd40c1-bbf6-46b6-bdc4-6ba10a4f0f9d","year":2009},"citing_paper":{"arxiv_id":"2506.01832","last_updated":"2025-06-04T13:44:02Z","snapshot_observed_at":"2026-08-07T11:30:27.108011Z","submitted_at":"2025-06-02T16:21:30Z","title":"Pseudorandom bits for non-commutative programs","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T11:52:02.557479Z"},"links":{"citing_paper":"/paper/2506.01832"},"observation_digest":"sha256:4534e4d0ba2327c0f2e7681223c8944d636b0d8b5ffebb9219eb53a28aa28830","observation_id":"b47cd4c4-124f-4e1c-b748-a062ce45e003","resolution":{"observed_at":"2026-08-07T11:52:07.700164Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:52:07.538608Z","title":null,"venue":null,"work_id":"8aeb214b-1a09-41d7-8a84-4d9fc1671550","year":2009},"citing_paper":{"arxiv_id":"2506.01832","last_updated":"2025-06-04T13:44:02Z","snapshot_observed_at":"2026-08-07T11:30:27.108011Z","submitted_at":"2025-06-02T16:21:30Z","title":"Pseudorandom bits for non-commutative programs","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T11:52:02.674495Z"},"links":{"citing_paper":"/paper/2506.01832"},"observation_digest":"sha256:fbbaefd12e06247f14d8e876ea4f429dc9904d3272b64d21c73c88b3d332c9a6","observation_id":"69540daf-f665-4215-8798-a15598144349","resolution":{"observed_at":"2026-08-07T11:52:07.587451Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:52:07.439421Z","title":"Improved pseudorandom generators for combinatorial rectangles","venue":null,"work_id":"14042682-66a4-4cc1-b6b8-9fffc41cfaef","year":2002},"citing_paper":{"arxiv_id":"2506.01832","last_updated":"2025-06-04T13:44:02Z","snapshot_observed_at":"2026-08-07T11:30:27.108011Z","submitted_at":"2025-06-02T16:21:30Z","title":"Pseudorandom bits for non-commutative programs","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T11:52:02.744718Z"},"links":{"citing_paper":"/paper/2506.01832"},"observation_digest":"sha256:777250d9853bd284ebde3ace958baa2280c15ab97b032a334d888b95704863f8","observation_id":"1d156c02-6be4-43d2-b934-bc2fc976011c","resolution":{"observed_at":"2026-08-07T11:52:07.471753Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:52:07.387313Z","title":"The coin problem for product tests","venue":null,"work_id":"e1504624-c7c9-4012-9692-57578e0d47b0","year":2018},"citing_paper":{"arxiv_id":"2506.01832","last_updated":"2025-06-04T13:44:02Z","snapshot_observed_at":"2026-08-07T11:30:27.108011Z","submitted_at":"2025-06-02T16:21:30Z","title":"Pseudorandom bits for non-commutative programs","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T11:52:02.834917Z"},"links":{"citing_paper":"/paper/2506.01832"},"observation_digest":"sha256:eecc56a3f7ad44e2ebdcf8bf92c7d9fbccd3e1083424946d4b557dd1cd624132","observation_id":"6546d462-9ff5-48f0-a80c-edfe8ad16434","resolution":{"observed_at":"2026-08-07T11:52:07.406472Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:52:07.304650Z","title":"More on bounded independence plus noise: Pseudorandom generators for read-once polynomials","venue":null,"work_id":"3e8e5e6f-8cdd-493a-b804-ba1d3b7da429","year":2020},"citing_paper":{"arxiv_id":"2506.01832","last_updated":"2025-06-04T13:44:02Z","snapshot_observed_at":"2026-08-07T11:30:27.108011Z","submitted_at":"2025-06-02T16:21:30Z","title":"Pseudorandom bits for non-commutative programs","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T11:52:02.934645Z"},"links":{"citing_paper":"/paper/2506.01832"},"observation_digest":"sha256:2604d88ee8f59fc6e5d271d4cec942712984a41b3e0a9a57b4b315154b811643","observation_id":"b114df8e-1cce-464e-9823-fbdcb2c864ad","resolution":{"observed_at":"2026-08-07T11:52:07.352057Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:52:07.198095Z","title":"More on bounded independence plus noise: pseudorandom generators for read-once polynomials","venue":null,"work_id":"2224fe0d-974f-4c5b-b17a-34918f2c6e9c","year":2020},"citing_paper":{"arxiv_id":"2506.01832","last_updated":"2025-06-04T13:44:02Z","snapshot_observed_at":"2026-08-07T11:30:27.108011Z","submitted_at":"2025-06-02T16:21:30Z","title":"Pseudorandom bits for non-commutative programs","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-07T11:52:03.004777Z"},"links":{"citing_paper":"/paper/2506.01832"},"observation_digest":"sha256:bc33ff3a99c7a2840e4ee3d8d68d8ce3b9fd1c159889cb24150e1b1156ca9b8c","observation_id":"ed22512d-994a-4e99-9753-6f1aca5abba4","resolution":{"observed_at":"2026-08-07T11:52:07.233651Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:52:07.093932Z","title":"Pseudorandom generators for width-3 branching programs","venue":null,"work_id":"fd48fd77-1817-4209-ba07-f86949505c1d","year":2019},"citing_paper":{"arxiv_id":"2506.01832","last_updated":"2025-06-04T13:44:02Z","snapshot_observed_at":"2026-08-07T11:30:27.108011Z","submitted_at":"2025-06-02T16:21:30Z","title":"Pseudorandom bits for non-commutative programs","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T11:52:03.087187Z"},"links":{"citing_paper":"/paper/2506.01832"},"observation_digest":"sha256:9611345ed294d26c5c792a8ab83ae597d44f77f43b4813d90ab7a7282e04e1dd","observation_id":"8524d6c0-7f12-4cf6-8d48-9fa026b176ca","resolution":{"observed_at":"2026-08-07T11:52:07.139005Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:52:06.966423Z","title":"Pseudorandom generators for width-3 branching programs","venue":null,"work_id":"1a2e5313-8ac1-44c7-87ef-20df7e9b98fe","year":2019},"citing_paper":{"arxiv_id":"2506.01832","last_updated":"2025-06-04T13:44:02Z","snapshot_observed_at":"2026-08-07T11:30:27.108011Z","submitted_at":"2025-06-02T16:21:30Z","title":"Pseudorandom bits for non-commutative programs","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-07T11:52:03.131754Z"},"links":{"citing_paper":"/paper/2506.01832"},"observation_digest":"sha256:c423341e98548db906f5d801a75c68a6e768503b42a0baf3f1f167146dedbc1d","observation_id":"0679cd3f-a822-4e0d-b72e-99248fbc59f0","resolution":{"observed_at":"2026-08-07T11:52:07.017860Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:52:06.820250Z","title":"Small-bias spaces for group products","venue":null,"work_id":"9442b75e-4020-4e16-9199-2a64a71429a6","year":2009},"citing_paper":{"arxiv_id":"2506.01832","last_updated":"2025-06-04T13:44:02Z","snapshot_observed_at":"2026-08-07T11:30:27.108011Z","submitted_at":"2025-06-02T16:21:30Z","title":"Pseudorandom bits for non-commutative programs","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-07T11:52:03.223307Z"},"links":{"citing_paper":"/paper/2506.01832"},"observation_digest":"sha256:e01be5a9c18bb1ef7b13a7d38a964f19468b7f5d5b3bd304839bf6467d172150","observation_id":"c728b881-fbdf-412a-9073-3bfaa1e2587b","resolution":{"observed_at":"2026-08-07T11:52:06.871034Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:52:06.702808Z","title":"Small-bias spaces for group products","venue":null,"work_id":"285b9ad9-3d0f-458a-bb0c-9f64282babab","year":2009},"citing_paper":{"arxiv_id":"2506.01832","last_updated":"2025-06-04T13:44:02Z","snapshot_observed_at":"2026-08-07T11:30:27.108011Z","submitted_at":"2025-06-02T16:21:30Z","title":"Pseudorandom bits for non-commutative programs","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-07T11:52:03.344880Z"},"links":{"citing_paper":"/paper/2506.01832"},"observation_digest":"sha256:b6b761992dcdbfff55dbc6a768d0b4e1dfd3ea517d4f7ccaf0b8e30e4b4914ce","observation_id":"f6bc571f-182c-4076-8e26-acc3dc6ecc19","resolution":{"observed_at":"2026-08-07T11:52:06.739240Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:52:06.591254Z","title":"Naor and M","venue":null,"work_id":"6ff0edea-1db9-484f-a765-c7522509b33e","year":1990},"citing_paper":{"arxiv_id":"2506.01832","last_updated":"2025-06-04T13:44:02Z","snapshot_observed_at":"2026-08-07T11:30:27.108011Z","submitted_at":"2025-06-02T16:21:30Z","title":"Pseudorandom bits for non-commutative programs","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-07T11:52:03.423393Z"},"links":{"citing_paper":"/paper/2506.01832"},"observation_digest":"sha256:6bec0131d242f816ce3978fa639605709e625a65ac94df245a3a3d598480462a","observation_id":"6933a453-b32c-4e29-8a65-eaba53873db4","resolution":{"observed_at":"2026-08-07T11:52:06.633440Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:52:06.492575Z","title":"Small-bias probability spaces: efficient constructions and applications","venue":null,"work_id":"e4784aa2-e5f4-4995-8caa-c50ef23bbb02","year":1993},"citing_paper":{"arxiv_id":"2506.01832","last_updated":"2025-06-04T13:44:02Z","snapshot_observed_at":"2026-08-07T11:30:27.108011Z","submitted_at":"2025-06-02T16:21:30Z","title":"Pseudorandom bits for non-commutative programs","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-07T11:52:03.544895Z"},"links":{"citing_paper":"/paper/2506.01832"},"observation_digest":"sha256:7f75b2a8a330b202347b900a0532372c4c4e3a0adaa1fca57ee0deab599f5d7d","observation_id":"1a371f97-2287-46ba-a422-7f6c42f3992c","resolution":{"observed_at":"2026-08-07T11:52:06.517170Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:52:06.389395Z","title":"sur les langages reconnus par des groupes nilpotents","venue":null,"work_id":"df4d79bd-9de2-4f3d-b91b-2b292fb28c4e","year":2001},"citing_paper":{"arxiv_id":"2506.01832","last_updated":"2025-06-04T13:44:02Z","snapshot_observed_at":"2026-08-07T11:30:27.108011Z","submitted_at":"2025-06-02T16:21:30Z","title":"Pseudorandom bits for non-commutative programs","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-07T11:52:03.638260Z"},"links":{"citing_paper":"/paper/2506.01832"},"observation_digest":"sha256:6d35100cdf209fe71b3b59f23c7530bae279ce137641f17cf85342d34cdec563","observation_id":"e21093d8-a184-4f7f-a442-5d0be8690e1b","resolution":{"observed_at":"2026-08-07T11:52:06.445885Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:52:06.264027Z","title":null,"venue":null,"work_id":"ce430a39-b783-4cb1-ad95-658498f33efd","year":2013},"citing_paper":{"arxiv_id":"2506.01832","last_updated":"2025-06-04T13:44:02Z","snapshot_observed_at":"2026-08-07T11:30:27.108011Z","submitted_at":"2025-06-02T16:21:30Z","title":"Pseudorandom bits for non-commutative programs","version":2},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-07T11:52:03.736037Z"},"links":{"citing_paper":"/paper/2506.01832"},"observation_digest":"sha256:200ab9ddb50e0cc424b00b18e49e6bfa8dba0e1f4f3bc56dd23e37d401dcbef3","observation_id":"f5326eed-7f89-4193-ae2f-ceb4a8cf8b54","resolution":{"observed_at":"2026-08-07T11:52:06.311163Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:52:06.129467Z","title":"Iterative construction of cayley expander graphs","venue":null,"work_id":"b05c885e-8136-4d42-bb2b-ba42f13cbbce","year":2006},"citing_paper":{"arxiv_id":"2506.01832","last_updated":"2025-06-04T13:44:02Z","snapshot_observed_at":"2026-08-07T11:30:27.108011Z","submitted_at":"2025-06-02T16:21:30Z","title":"Pseudorandom bits for non-commutative programs","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-07T11:52:03.847346Z"},"links":{"citing_paper":"/paper/2506.01832"},"observation_digest":"sha256:884fad0a97e1e2d5969fc3fcda91843dc5fee8a0625cef35d1854f8a704700f8","observation_id":"61e4c632-9b04-4a6f-98d7-7bdc2d60dce1","resolution":{"observed_at":"2026-08-07T11:52:06.182750Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:52:05.892908Z","title":"Linear Representations of Finite Groups","venue":null,"work_id":"a2f02f40-75aa-430d-b6bf-b7715af1c73b","year":1977},"citing_paper":{"arxiv_id":"2506.01832","last_updated":"2025-06-04T13:44:02Z","snapshot_observed_at":"2026-08-07T11:30:27.108011Z","submitted_at":"2025-06-02T16:21:30Z","title":"Pseudorandom bits for non-commutative programs","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-07T11:52:03.968636Z"},"links":{"citing_paper":"/paper/2506.01832"},"observation_digest":"sha256:7ca6ac340039b2012cafc3483e7ec6ac277902ec1747655bd8276900e4a1a279","observation_id":"1a477668-d878-4f04-aa7d-3f5cdc838f3c","resolution":{"observed_at":"2026-08-07T11:52:05.998972Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:52:05.771968Z","title":"Pseudorandomness for permutation branching programs without the group theory","venue":null,"work_id":"f58bd780-313b-4cb0-94d1-1fecee234bce","year":2012},"citing_paper":{"arxiv_id":"2506.01832","last_updated":"2025-06-04T13:44:02Z","snapshot_observed_at":"2026-08-07T11:30:27.108011Z","submitted_at":"2025-06-02T16:21:30Z","title":"Pseudorandom bits for non-commutative programs","version":2},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-07T11:52:04.024665Z"},"links":{"citing_paper":"/paper/2506.01832"},"observation_digest":"sha256:4f0008dbe60788526c5d08f17e573501c2e7d41019335ef182648a33eea4f1c5","observation_id":"007e45b8-d292-4e77-89d4-bc22356851c4","resolution":{"observed_at":"2026-08-07T11:52:05.823519Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:52:05.591316Z","title":"Faster isomorphism for p-groups of class 2 and exponent p","venue":null,"work_id":"eb71964d-b549-4597-9de5-2dc78f4b2dec","year":2023},"citing_paper":{"arxiv_id":"2506.01832","last_updated":"2025-06-04T13:44:02Z","snapshot_observed_at":"2026-08-07T11:30:27.108011Z","submitted_at":"2025-06-02T16:21:30Z","title":"Pseudorandom bits for non-commutative programs","version":2},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-07T11:52:04.145543Z"},"links":{"citing_paper":"/paper/2506.01832"},"observation_digest":"sha256:8308c3492d52321bc1de738eda3cd85a37461630f68ab04f250dd362be8e6a6f","observation_id":"7e77d839-cf53-45ee-8924-973cd211563d","resolution":{"observed_at":"2026-08-07T11:52:05.658886Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:52:05.460987Z","title":"Fourier analysis on finite groups and applications , volume 43 of London Mathematical Society Student Texts","venue":null,"work_id":"49eda311-53b7-4750-9a36-19294f61502e","year":1999},"citing_paper":{"arxiv_id":"2506.01832","last_updated":"2025-06-04T13:44:02Z","snapshot_observed_at":"2026-08-07T11:30:27.108011Z","submitted_at":"2025-06-02T16:21:30Z","title":"Pseudorandom bits for non-commutative programs","version":2},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-07T11:52:04.248099Z"},"links":{"citing_paper":"/paper/2506.01832"},"observation_digest":"sha256:ceb2810721b8fb7c15b346a6d7b5987aae3bcb809ac10a64f7f3d500fd439da2","observation_id":"57efd6ac-e123-4c51-83b1-b67d98cb3a8b","resolution":{"observed_at":"2026-08-07T11:52:05.511343Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:52:04.342777Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2506.01832","last_updated":"2025-06-04T13:44:02Z","snapshot_observed_at":"2026-08-07T11:30:27.108011Z","submitted_at":"2025-06-02T16:21:30Z","title":"Pseudorandom bits for non-commutative programs","version":2},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-07T11:52:04.342777Z"},"links":{"citing_paper":"/paper/2506.01832"},"observation_digest":"sha256:c6e646f38f38224160519d869a3acc0c7a831f23a04e8780b08a1c50a0cfab78","observation_id":"6fe63e81-327f-4408-8fa4-ff77dd9e2d4c","resolution":{"observed_at":"2026-08-07T11:52:04.342777Z","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-07T11:52:05.258567Z","title":"On the power of small-depth computation","venue":null,"work_id":"a636e424-0772-4f48-b158-4df18213eebc","year":2009},"citing_paper":{"arxiv_id":"2506.01832","last_updated":"2025-06-04T13:44:02Z","snapshot_observed_at":"2026-08-07T11:30:27.108011Z","submitted_at":"2025-06-02T16:21:30Z","title":"Pseudorandom bits for non-commutative programs","version":2},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-07T11:52:04.460534Z"},"links":{"citing_paper":"/paper/2506.01832"},"observation_digest":"sha256:19e96a821efe3a1c0b2f642bc758608b4e3adf1ec56d6f082802b1991150c960","observation_id":"0b379b6a-da1c-44ad-b043-7bd3de844c4b","resolution":{"observed_at":"2026-08-07T11:52:05.305739Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:52:05.166164Z","title":"The sum of d small-bias generators fools polynomials of degree d","venue":null,"work_id":"19228f02-dba1-41e0-9e1d-e965c9065dbd","year":2009},"citing_paper":{"arxiv_id":"2506.01832","last_updated":"2025-06-04T13:44:02Z","snapshot_observed_at":"2026-08-07T11:30:27.108011Z","submitted_at":"2025-06-02T16:21:30Z","title":"Pseudorandom bits for non-commutative programs","version":2},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-07T11:52:04.548057Z"},"links":{"citing_paper":"/paper/2506.01832"},"observation_digest":"sha256:9bf961ea3279de91425bb03503839b4e65463f39d6bfe6e2bdceb59835a095c0","observation_id":"db35775d-7791-43a2-9da8-032e64773050","resolution":{"observed_at":"2026-08-07T11:52:05.217701Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:52:05.004719Z","title":"Pseudorandom generators for combinatorial checkerboards","venue":null,"work_id":"1c9b7e8c-6961-42df-9aae-7ca53ff74349","year":2013},"citing_paper":{"arxiv_id":"2506.01832","last_updated":"2025-06-04T13:44:02Z","snapshot_observed_at":"2026-08-07T11:30:27.108011Z","submitted_at":"2025-06-02T16:21:30Z","title":"Pseudorandom bits for non-commutative programs","version":2},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-07T11:52:04.617475Z"},"links":{"citing_paper":"/paper/2506.01832"},"observation_digest":"sha256:df1e43c4692b2acc85d5a36c2e28db93bae07e86317d4823a8dfb71fc6fa3710","observation_id":"391acfa1-6119-468a-949a-4b3fcca59ce4","resolution":{"observed_at":"2026-08-07T11:52:05.084388Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:52:04.822968Z","title":"Representation theory of finite groups, and applications","venue":null,"work_id":"64e39be3-0924-4614-aa4d-af9b877d3fbc","year":2010},"citing_paper":{"arxiv_id":"2506.01832","last_updated":"2025-06-04T13:44:02Z","snapshot_observed_at":"2026-08-07T11:30:27.108011Z","submitted_at":"2025-06-02T16:21:30Z","title":"Pseudorandom bits for non-commutative programs","version":2},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-07T11:52:04.648050Z"},"links":{"citing_paper":"/paper/2506.01832"},"observation_digest":"sha256:c2bcf9ce144a4f9bc7c21702d7da305d776ac61265f1a67f606624a5319ed355","observation_id":"5ed35d4f-16ea-4aab-8f58-f49055b6860c","resolution":{"observed_at":"2026-08-07T11:52:04.901002Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.01832","last_updated":"2025-06-04T13:44:02Z","latest_version":2,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-07T11:30:27.108011Z","submitted_at":"2025-06-02T16:21:30Z","title":"Pseudorandom bits for non-commutative programs"},"reference_resolution":{"displayed":54,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":0,"verified_fuzzy":47},"total_outbound_references":54},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 54 of 54 outbound references and 0 inbound Pith citation observations for arXiv:2506.01832."}