{"as_of":"2026-08-07T22:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bdab6cf730821e0aab0983bcecc631d5fdbf8360b389047eb3cbbad52b812191","coverage":[{"denominator":51,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":51,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T20:11:23.360058Z","state":"measured"},{"denominator":51,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":51,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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/2507.03833/citation-record","integrity":"/paper/2507.03833/integrity","json":"/paper/2507.03833/citation-record.json","paper":"/paper/2507.03833"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:11:17.962312Z","title":"Dion: A communication-efficient optimizer for large models","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.03833","last_updated":"2025-07-16T01:56:38Z","snapshot_observed_at":"2026-08-06T19:59:13.081691Z","submitted_at":"2025-07-04T22:57:33Z","title":"MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:17.962312Z"},"links":{"citing_paper":"/paper/2507.03833"},"observation_digest":"sha256:d1bfa024ef34a01b4f10b80bf5a9ad837314255601eb4051e08061e7633ad12d","observation_id":"1c2e8aea-06d0-471f-8759-b0b0f7c45ab3","resolution":{"observed_at":"2026-08-06T20:11:17.962312Z","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-06T20:11:26.383853Z","title":"independent components","venue":null,"work_id":"e0300013-d0ef-4b52-a25b-5a33c345d0c9","year":1997},"citing_paper":{"arxiv_id":"2507.03833","last_updated":"2025-07-16T01:56:38Z","snapshot_observed_at":"2026-08-06T19:59:13.081691Z","submitted_at":"2025-07-04T22:57:33Z","title":"MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:18.012988Z"},"links":{"citing_paper":"/paper/2507.03833"},"observation_digest":"sha256:fe2eabe289c0461beadc8f01c9f9e989fae554efb133d135269f44ac1f5de2df","observation_id":"0f505b2e-ee50-4e98-a2d6-33fed1814219","resolution":{"observed_at":"2026-08-06T20:11:26.386906Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T20:11:18.120898Z","title":"A survey of monte carlo tree search methods.IEEE Transactions on Computational Intelligence and AI in games, 4(1):1–43, 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2507.03833","last_updated":"2025-07-16T01:56:38Z","snapshot_observed_at":"2026-08-06T19:59:13.081691Z","submitted_at":"2025-07-04T22:57:33Z","title":"MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:18.120898Z"},"links":{"citing_paper":"/paper/2507.03833"},"observation_digest":"sha256:426df782a423891a1376787d71e1fe01e425c5e3e957961dd8dd2ee5a9195752","observation_id":"73c756ff-31c9-475c-a76c-09eac1666dc8","resolution":{"observed_at":"2026-08-06T20:11:18.120898Z","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-06T20:11:26.367032Z","title":"Solving the algebraic riccati equation with the matrix sign function.Linear Algebra and its Applications, 85:267–279, 1987","venue":null,"work_id":"e1b00674-337d-4429-965b-97b5b3bb18df","year":1987},"citing_paper":{"arxiv_id":"2507.03833","last_updated":"2025-07-16T01:56:38Z","snapshot_observed_at":"2026-08-06T19:59:13.081691Z","submitted_at":"2025-07-04T22:57:33Z","title":"MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:18.199316Z"},"links":{"citing_paper":"/paper/2507.03833"},"observation_digest":"sha256:79d9f9e0582d9aae5cfc443c0e050690b11d85bd83800c65a765133d73092574","observation_id":"cc441e43-5737-481b-8ab1-c8955e03f07a","resolution":{"observed_at":"2026-08-06T20:11:26.370384Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T20:11:26.356881Z","title":"A new scaling for newton’s iteration for the polar decomposition and its backward stability.SIAM Journal on Matrix Analysis and Applications, 30(2):822–843, 2008","venue":null,"work_id":"a9370985-5908-4eb3-93d7-25d83194a1e2","year":2008},"citing_paper":{"arxiv_id":"2507.03833","last_updated":"2025-07-16T01:56:38Z","snapshot_observed_at":"2026-08-06T19:59:13.081691Z","submitted_at":"2025-07-04T22:57:33Z","title":"MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:18.303177Z"},"links":{"citing_paper":"/paper/2507.03833"},"observation_digest":"sha256:6216c522eb2a90c2a82a73253a24bd84fa6a0824e7f16dfb50fdb4316ac88b5c","observation_id":"be860898-26a9-4813-9266-d12d3677dd4b","resolution":{"observed_at":"2026-08-06T20:11:26.360131Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T20:11:26.346592Z","title":"Monte-carlo tree search in production management problems","venue":null,"work_id":"6a30846a-705b-42d3-b2e5-3f08844b2a62","year":2006},"citing_paper":{"arxiv_id":"2507.03833","last_updated":"2025-07-16T01:56:38Z","snapshot_observed_at":"2026-08-06T19:59:13.081691Z","submitted_at":"2025-07-04T22:57:33Z","title":"MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:18.411577Z"},"links":{"citing_paper":"/paper/2507.03833"},"observation_digest":"sha256:3ba85cb2cc22bcd2539256039d9c93d2f56974d7c45b207ac95e0fc7b5191b9c","observation_id":"b8391065-b802-4bf1-9471-00edf2325c6a","resolution":{"observed_at":"2026-08-06T20:11:26.349919Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T20:11:26.336674Z","title":"Progressive strategies for monte-carlo tree search.New Mathematics and Natural Computation, 4(03):343–357, 2008","venue":null,"work_id":"e18ec224-1854-4935-9c2c-34642eac92c5","year":2008},"citing_paper":{"arxiv_id":"2507.03833","last_updated":"2025-07-16T01:56:38Z","snapshot_observed_at":"2026-08-06T19:59:13.081691Z","submitted_at":"2025-07-04T22:57:33Z","title":"MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:18.486396Z"},"links":{"citing_paper":"/paper/2507.03833"},"observation_digest":"sha256:ba2c1ea127ca2422aecad5fb36ae3b1c138178bfc41131abe45ea41f388ebea6","observation_id":"a358c2cc-3352-4f5c-b388-e90c54c08641","resolution":{"observed_at":"2026-08-06T20:11:26.340449Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T20:11:26.327101Z","title":null,"venue":null,"work_id":"681b3d2e-d7be-446e-bb2e-22d0e1e3efa8","year":2014},"citing_paper":{"arxiv_id":"2507.03833","last_updated":"2025-07-16T01:56:38Z","snapshot_observed_at":"2026-08-06T19:59:13.081691Z","submitted_at":"2025-07-04T22:57:33Z","title":"MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:18.581115Z"},"links":{"citing_paper":"/paper/2507.03833"},"observation_digest":"sha256:5fc6db0f490e60f35fae469548bed57972478ebb04ce2a0502a65b6d2b29a1e9","observation_id":"075f72ba-4975-43bb-8905-9fcf9cdd79d0","resolution":{"observed_at":"2026-08-06T20:11:26.330872Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T20:11:26.315982Z","title":"Continuous upper confidence trees","venue":null,"work_id":"a62b0bd5-0188-4339-9375-7e447191af0c","year":2011},"citing_paper":{"arxiv_id":"2507.03833","last_updated":"2025-07-16T01:56:38Z","snapshot_observed_at":"2026-08-06T19:59:13.081691Z","submitted_at":"2025-07-04T22:57:33Z","title":"MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:18.689493Z"},"links":{"citing_paper":"/paper/2507.03833"},"observation_digest":"sha256:acb03650dce6e046743d92df146a42061b2e45fda70f40c9a8e4d68d47a9d5c9","observation_id":"f64f4076-aa80-4a4c-8f6c-0db32fe90443","resolution":{"observed_at":"2026-08-06T20:11:26.320411Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T20:11:18.796837Z","title":"Convolutional neural networks on graphs with fast localized spectral filtering.Advances in neural information processing systems, 29, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2507.03833","last_updated":"2025-07-16T01:56:38Z","snapshot_observed_at":"2026-08-06T19:59:13.081691Z","submitted_at":"2025-07-04T22:57:33Z","title":"MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:18.796837Z"},"links":{"citing_paper":"/paper/2507.03833"},"observation_digest":"sha256:22c7393c1a953b2ef630746e6f1e3d6720d30126819b633ad0e4eafeb26adb12","observation_id":"d62080ac-e55a-43b8-8951-3f5339f033af","resolution":{"observed_at":"2026-08-06T20:11:18.796837Z","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-06T20:11:26.297810Z","title":"The matrix sign function and computations in systems.Applied mathematics and Computation, 2(1):63–94, 1976","venue":null,"work_id":"260f78cd-b178-469b-bb07-d15ac7212844","year":1976},"citing_paper":{"arxiv_id":"2507.03833","last_updated":"2025-07-16T01:56:38Z","snapshot_observed_at":"2026-08-06T19:59:13.081691Z","submitted_at":"2025-07-04T22:57:33Z","title":"MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:18.912992Z"},"links":{"citing_paper":"/paper/2507.03833"},"observation_digest":"sha256:ec75776493bb7028066e12ef8cb5f95e4a6f72e768920d1ec3150f2daf6fca15","observation_id":"63e617c0-1b90-44bb-bcfc-1df5f6d49dd7","resolution":{"observed_at":"2026-08-06T20:11:26.301338Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T20:11:26.285852Z","title":"An introduction to mathematical optimal control theory version 0.2.Lecture notes available at http://math","venue":null,"work_id":"dbd165e7-feaa-41a7-8f93-dd31f64ae954","year":1983},"citing_paper":{"arxiv_id":"2507.03833","last_updated":"2025-07-16T01:56:38Z","snapshot_observed_at":"2026-08-06T19:59:13.081691Z","submitted_at":"2025-07-04T22:57:33Z","title":"MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:18.919553Z"},"links":{"citing_paper":"/paper/2507.03833"},"observation_digest":"sha256:6d8bef2c4312e2fa3f3b9d70d0e54329fd59d8f2462bed7a3a8b30a7f4e619d0","observation_id":"1e519235-6676-4e00-a9c1-788407edce33","resolution":{"observed_at":"2026-08-06T20:11:26.289473Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T20:11:26.273399Z","title":"Discovering faster matrix multiplication algorithms with reinforcement learning.Nature, 610(7930):47–53, 2022","venue":null,"work_id":"7a6431be-d618-4be9-b04e-e5e54881c481","year":2022},"citing_paper":{"arxiv_id":"2507.03833","last_updated":"2025-07-16T01:56:38Z","snapshot_observed_at":"2026-08-06T19:59:13.081691Z","submitted_at":"2025-07-04T22:57:33Z","title":"MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:19.038996Z"},"links":{"citing_paper":"/paper/2507.03833"},"observation_digest":"sha256:2c7335f5cbe0f291a25cc36e3b311c88b69aa69e375997b7b8510b170dcae83e","observation_id":"ef12841c-b196-42ed-92ae-ee2fd002bd59","resolution":{"observed_at":"2026-08-06T20:11:26.278960Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T20:11:26.262910Z","title":"Zolotarev iterations for the matrix square root.SIAM journal on matrix analysis and applications, 40(2):696–719, 2019","venue":null,"work_id":"1ef68e62-7309-4198-b297-1915c1453654","year":2019},"citing_paper":{"arxiv_id":"2507.03833","last_updated":"2025-07-16T01:56:38Z","snapshot_observed_at":"2026-08-06T19:59:13.081691Z","submitted_at":"2025-07-04T22:57:33Z","title":"MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:19.120636Z"},"links":{"citing_paper":"/paper/2507.03833"},"observation_digest":"sha256:541163b8c381403c7d07f5424374e9fef9c55a31dddab479a0deba737589c303","observation_id":"fd390be0-85d1-4f78-bf2b-564c282d88c9","resolution":{"observed_at":"2026-08-06T20:11:26.266407Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T20:11:26.252732Z","title":"On newton’s method and halley’s method for the principal pth root of a matrix","venue":null,"work_id":"5be6fa6b-99cf-461c-af87-2f6c7493d163","year":1905},"citing_paper":{"arxiv_id":"2507.03833","last_updated":"2025-07-16T01:56:38Z","snapshot_observed_at":"2026-08-06T19:59:13.081691Z","submitted_at":"2025-07-04T22:57:33Z","title":"MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:19.202503Z"},"links":{"citing_paper":"/paper/2507.03833"},"observation_digest":"sha256:dc813ed75b3a56b38f7949634e459b725f6ff8d640bd990fb7f076fec4c65ffa","observation_id":"ea04f6e7-e169-4a61-b069-73570a28cb00","resolution":{"observed_at":"2026-08-06T20:11:26.256695Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T20:11:19.323909Z","title":"Shampoo: Preconditioned stochastic tensor optimization","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.03833","last_updated":"2025-07-16T01:56:38Z","snapshot_observed_at":"2026-08-06T19:59:13.081691Z","submitted_at":"2025-07-04T22:57:33Z","title":"MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:19.323909Z"},"links":{"citing_paper":"/paper/2507.03833"},"observation_digest":"sha256:ad02831255042948df30ecb2f8989555f638c6ee1733200d8faa13f434d887a7","observation_id":"1d100ca7-c826-4f2c-8e2f-5cf48e12ea48","resolution":{"observed_at":"2026-08-06T20:11:19.323909Z","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-06T20:11:26.235297Z","title":"Stable iterations for the matrix square root.Numerical Algorithms, 15:227–242, 1997","venue":null,"work_id":"adca787a-fa66-4b29-9a63-12e082ef2cc3","year":1997},"citing_paper":{"arxiv_id":"2507.03833","last_updated":"2025-07-16T01:56:38Z","snapshot_observed_at":"2026-08-06T19:59:13.081691Z","submitted_at":"2025-07-04T22:57:33Z","title":"MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:19.404305Z"},"links":{"citing_paper":"/paper/2507.03833"},"observation_digest":"sha256:df6784e32bee1f7a127f78de5d31d356ba241f47a8ae31b1eb71eb9aebc705c9","observation_id":"739d1d22-89f1-4c08-bcd1-8eff82a45ed9","resolution":{"observed_at":"2026-08-06T20:11:26.238600Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T20:11:26.225199Z","title":"SIAM, 2008","venue":null,"work_id":"5f1794b9-21c3-4c23-8db2-686580463584","year":2008},"citing_paper":{"arxiv_id":"2507.03833","last_updated":"2025-07-16T01:56:38Z","snapshot_observed_at":"2026-08-06T19:59:13.081691Z","submitted_at":"2025-07-04T22:57:33Z","title":"MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:19.491108Z"},"links":{"citing_paper":"/paper/2507.03833"},"observation_digest":"sha256:55c6e1ed6558e9b6775d1e72baadacce0a9e3137bdc3128392f26a56934e2696","observation_id":"10c921f8-843b-42c0-9c87-b51814ba1f55","resolution":{"observed_at":"2026-08-06T20:11:26.228367Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T20:11:26.215302Z","title":"Fast polar decomposition of an arbitrary matrix","venue":null,"work_id":"fb65aead-900b-49d3-b6ab-dcafcda14927","year":1990},"citing_paper":{"arxiv_id":"2507.03833","last_updated":"2025-07-16T01:56:38Z","snapshot_observed_at":"2026-08-06T19:59:13.081691Z","submitted_at":"2025-07-04T22:57:33Z","title":"MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:19.593890Z"},"links":{"citing_paper":"/paper/2507.03833"},"observation_digest":"sha256:b411ea409661c639af1ba8e8e6331444bcfc52529c83f541b8cd0d5d03f3fe1b","observation_id":"234024a7-92d2-4aee-8e0b-f4c9369abb5d","resolution":{"observed_at":"2026-08-06T20:11:26.218531Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T20:11:26.206074Z","title":"Intelligent agents for the game of go.IEEE Computational Intelligence Magazine, 5(4):28–42, 2010","venue":null,"work_id":"ed355566-0b3b-443c-be74-6221d692bb31","year":2010},"citing_paper":{"arxiv_id":"2507.03833","last_updated":"2025-07-16T01:56:38Z","snapshot_observed_at":"2026-08-06T19:59:13.081691Z","submitted_at":"2025-07-04T22:57:33Z","title":"MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:19.678248Z"},"links":{"citing_paper":"/paper/2507.03833"},"observation_digest":"sha256:1c61728aff34b50f36401990b60f7256cc29ad799b5115d2dd0d2eeec8fb7609","observation_id":"16e0b4e2-0610-4ae1-b702-28be4545f476","resolution":{"observed_at":"2026-08-06T20:11:26.208936Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T20:11:26.197126Z","title":"A faster, more stable method for computing the pth roots of positive definite matrices.Linear Algebra and Its Applications, 26:139–163, 1979","venue":null,"work_id":"b00c1a86-be8c-47b7-b233-8333f3dcbbdb","year":1979},"citing_paper":{"arxiv_id":"2507.03833","last_updated":"2025-07-16T01:56:38Z","snapshot_observed_at":"2026-08-06T19:59:13.081691Z","submitted_at":"2025-07-04T22:57:33Z","title":"MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:19.762315Z"},"links":{"citing_paper":"/paper/2507.03833"},"observation_digest":"sha256:ba92f23b70408bd8c8eb597b70e640bd5f6009daa3bb06a4d1d76a98d2434852","observation_id":"a9624877-d0df-4213-877d-aaf6901072e6","resolution":{"observed_at":"2026-08-06T20:11:26.200608Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T20:11:26.187731Z","title":"A note on computing the matrix square root.Calcolo, 40(4):273–283, 2003","venue":null,"work_id":"6b2e6c53-33a2-4c4c-b939-fe424476aa9b","year":2003},"citing_paper":{"arxiv_id":"2507.03833","last_updated":"2025-07-16T01:56:38Z","snapshot_observed_at":"2026-08-06T19:59:13.081691Z","submitted_at":"2025-07-04T22:57:33Z","title":"MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:19.864027Z"},"links":{"citing_paper":"/paper/2507.03833"},"observation_digest":"sha256:17f58ce66fa21d43576b630d526ccffc80250fa0d94c4af3cbee286405d1fa3e","observation_id":"e9c1c795-778a-4f90-b4c4-999b832cb409","resolution":{"observed_at":"2026-08-06T20:11:26.191130Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T20:11:26.178831Z","title":"On the newton method for the matrix p th root.SIAM journal on matrix analysis and applications, 28(2):503–523, 2006","venue":null,"work_id":"838e43ca-f877-40b8-8a94-770b538ebf23","year":2006},"citing_paper":{"arxiv_id":"2507.03833","last_updated":"2025-07-16T01:56:38Z","snapshot_observed_at":"2026-08-06T19:59:13.081691Z","submitted_at":"2025-07-04T22:57:33Z","title":"MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:19.982111Z"},"links":{"citing_paper":"/paper/2507.03833"},"observation_digest":"sha256:c4d0a18075aa3b57163b1f3b541cd73b4f26df0d2cb92a2704f48834b13f363b","observation_id":"889f5c68-f8d2-4166-ae0d-3d931a01c75c","resolution":{"observed_at":"2026-08-06T20:11:26.182152Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T20:11:20.090925Z","title":"Muon: An optimizer for hidden layers in neural networks, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.03833","last_updated":"2025-07-16T01:56:38Z","snapshot_observed_at":"2026-08-06T19:59:13.081691Z","submitted_at":"2025-07-04T22:57:33Z","title":"MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:20.090925Z"},"links":{"citing_paper":"/paper/2507.03833"},"observation_digest":"sha256:0cfd555cf017240b654f118eda8be76bb29e8f4ebf657b6a4fa2aacaae609b72","observation_id":"97ea60b0-a643-434f-a86d-ec3d43490b42","resolution":{"observed_at":"2026-08-06T20:11:20.090925Z","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-06T20:11:26.165181Z","title":"Deep generative symbolic regression with monte-carlo-tree-search","venue":null,"work_id":"64a106b6-009b-4c2e-b400-f277c9eabb11","year":2023},"citing_paper":{"arxiv_id":"2507.03833","last_updated":"2025-07-16T01:56:38Z","snapshot_observed_at":"2026-08-06T19:59:13.081691Z","submitted_at":"2025-07-04T22:57:33Z","title":"MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:20.201919Z"},"links":{"citing_paper":"/paper/2507.03833"},"observation_digest":"sha256:7e7394328fca8eb11ebb63119fe2cd1f078dde42e357d2760c3c678207fcbc45","observation_id":"dd8d9487-4f4c-441f-97cb-531c21cb1742","resolution":{"observed_at":"2026-08-06T20:11:26.168334Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T20:11:26.155632Z","title":"Learning to relax: Setting solver parameters across a sequence of linear system instances","venue":null,"work_id":"e80ba8d9-9093-4d55-8de5-c79ab3a74e49","year":2024},"citing_paper":{"arxiv_id":"2507.03833","last_updated":"2025-07-16T01:56:38Z","snapshot_observed_at":"2026-08-06T19:59:13.081691Z","submitted_at":"2025-07-04T22:57:33Z","title":"MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:20.314170Z"},"links":{"citing_paper":"/paper/2507.03833"},"observation_digest":"sha256:de7397ac4f0535680e94231b9de1d9678ddb20e7c1cbb27152a5d1fecd4c5b76","observation_id":"8382d941-9fe3-4d89-8a9a-0242edff145d","resolution":{"observed_at":"2026-08-06T20:11:26.158894Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T20:11:20.393163Z","title":"Bandit based monte-carlo planning","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2507.03833","last_updated":"2025-07-16T01:56:38Z","snapshot_observed_at":"2026-08-06T19:59:13.081691Z","submitted_at":"2025-07-04T22:57:33Z","title":"MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:20.393163Z"},"links":{"citing_paper":"/paper/2507.03833"},"observation_digest":"sha256:22161163ca93130cadb66f21e0cfaff52457847244b41e59a1a931b598efb214","observation_id":"4c196d68-b869-4da2-aa38-f85b5630febc","resolution":{"observed_at":"2026-08-06T20:11:20.393163Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:11:20.472509Z","title":"Learning multiple layers of features from tiny images","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2507.03833","last_updated":"2025-07-16T01:56:38Z","snapshot_observed_at":"2026-08-06T19:59:13.081691Z","submitted_at":"2025-07-04T22:57:33Z","title":"MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:20.472509Z"},"links":{"citing_paper":"/paper/2507.03833"},"observation_digest":"sha256:85a38f8e8a6a89950d4a744b07e049ec0562d7a7e073aceab14a46fbf3af412e","observation_id":"df824ee2-b82c-4e63-b526-cf024e18ad4e","resolution":{"observed_at":"2026-08-06T20:11:20.472509Z","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-06T20:11:26.133840Z","title":"Chebyshev- type methods and preconditioning techniques.Applied Mathematics and Computation, 218(2):260–270, 2011","venue":null,"work_id":"147ea41e-c0ff-46f5-b77f-08b2bf0ad83d","year":2011},"citing_paper":{"arxiv_id":"2507.03833","last_updated":"2025-07-16T01:56:38Z","snapshot_observed_at":"2026-08-06T19:59:13.081691Z","submitted_at":"2025-07-04T22:57:33Z","title":"MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:20.555922Z"},"links":{"citing_paper":"/paper/2507.03833"},"observation_digest":"sha256:417c3b2b2a716c2080ee323da35bf8502959d3b5dae9397e8eb4fba93fa1d8be","observation_id":"947e7c66-0ba5-45e1-8aa6-17dcf8afc696","resolution":{"observed_at":"2026-08-06T20:11:26.136763Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1703.00441","last_updated":"2017-11-30T18:59:01Z","snapshot_observed_at":"2026-07-06T05:31:57.481191Z","submitted_at":"2017-03-01T18:52:23Z","title":"Learning to Optimize Neural Nets","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1703.00441","snapshot_observed_at":"2026-08-06T20:11:20.638117Z","title":"Learning to optimize neural nets.arXiv preprint arXiv:1703.00441, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2507.03833","last_updated":"2025-07-16T01:56:38Z","snapshot_observed_at":"2026-08-06T19:59:13.081691Z","submitted_at":"2025-07-04T22:57:33Z","title":"MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:20.638117Z"},"links":{"cited_paper":"/paper/1703.00441","citing_paper":"/paper/2507.03833"},"observation_digest":"sha256:80d65d22405164889c674d900925c8d669154c76601cf6a567c75069e909db2f","observation_id":"557f8ec7-1fcf-4ff1-9eed-50071332bd96","resolution":{"observed_at":"2026-08-06T20:11:20.638117Z","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-06T20:11:26.125416Z","title":"An effec- tive mcts-based algorithm for minimizing makespan in dynamic flexible job shop scheduling problem.Computers & Industrial Engineering, 155:107211, 2021","venue":null,"work_id":"c1b962ca-6b88-40a3-931c-2cca4d05738b","year":2021},"citing_paper":{"arxiv_id":"2507.03833","last_updated":"2025-07-16T01:56:38Z","snapshot_observed_at":"2026-08-06T19:59:13.081691Z","submitted_at":"2025-07-04T22:57:33Z","title":"MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:20.725752Z"},"links":{"citing_paper":"/paper/2507.03833"},"observation_digest":"sha256:1944a780bb681beecc2e585adba3e97aa538e63bd5acd3ad45f71ca7945a52d2","observation_id":"724ed62f-5157-43db-be6e-8bf26f9d3456","resolution":{"observed_at":"2026-08-06T20:11:26.128140Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T20:11:26.117023Z","title":"Towards faster training of global covariance pooling networks by iterative matrix square root normalization","venue":null,"work_id":"e0f478db-86d1-4a60-ac5f-302e0bd5b3aa","year":2018},"citing_paper":{"arxiv_id":"2507.03833","last_updated":"2025-07-16T01:56:38Z","snapshot_observed_at":"2026-08-06T19:59:13.081691Z","submitted_at":"2025-07-04T22:57:33Z","title":"MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:20.819576Z"},"links":{"citing_paper":"/paper/2507.03833"},"observation_digest":"sha256:7f7f2131525ce7c78145844d94e7c7ce64b82a810055c8c156c9f32582bbb041","observation_id":"8377fdb4-9962-47f5-9487-7aa6dd50d0c4","resolution":{"observed_at":"2026-08-06T20:11:26.119906Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T20:11:26.107799Z","title":"Fast algorithm for extracting the diagonal of the inverse matrix with application to the electronic structure analysis of metallic systems","venue":null,"work_id":"96f838d4-2f10-4c3c-98d0-031ac2472510","year":2009},"citing_paper":{"arxiv_id":"2507.03833","last_updated":"2025-07-16T01:56:38Z","snapshot_observed_at":"2026-08-06T19:59:13.081691Z","submitted_at":"2025-07-04T22:57:33Z","title":"MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:20.898450Z"},"links":{"citing_paper":"/paper/2507.03833"},"observation_digest":"sha256:5ebf4a198769de38fe657b9ae3ca2fd8b2f0e40094fa9ec86bef4224941696ed","observation_id":"8a2fdd30-9c54-4cff-83a2-6bec20afcafd","resolution":{"observed_at":"2026-08-06T20:11:26.111444Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T20:11:26.098619Z","title":"Faster sorting algorithms discovered using deep reinforcement learning.Nature, 618(7964):257–263, 2023","venue":null,"work_id":"87eec1b7-11b2-4abe-9169-35f7522aacf5","year":2023},"citing_paper":{"arxiv_id":"2507.03833","last_updated":"2025-07-16T01:56:38Z","snapshot_observed_at":"2026-08-06T19:59:13.081691Z","submitted_at":"2025-07-04T22:57:33Z","title":"MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:20.954259Z"},"links":{"citing_paper":"/paper/2507.03833"},"observation_digest":"sha256:ed3d8b05b864860dfb09bfab625797aa005a41e14ed545071becd93d293b5b52","observation_id":"e0fd5a81-dce5-483e-a0e7-02eaa7f64bbb","resolution":{"observed_at":"2026-08-06T20:11:26.101680Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T20:11:26.089473Z","title":"A fractional graph laplacian approach to oversmoothing.Advances in Neural Information Processing Systems, 36:13022– 13063, 2023","venue":null,"work_id":"eb8e0e67-8b72-48fa-8483-e7b28528549e","year":2023},"citing_paper":{"arxiv_id":"2507.03833","last_updated":"2025-07-16T01:56:38Z","snapshot_observed_at":"2026-08-06T19:59:13.081691Z","submitted_at":"2025-07-04T22:57:33Z","title":"MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:21.087024Z"},"links":{"citing_paper":"/paper/2507.03833"},"observation_digest":"sha256:40e3d605015659629ccf7748c05b17ab9cf9c3824ee1a270e547a3af974ffe04","observation_id":"1f295623-5acd-4ea7-acf5-c45c8bbd135f","resolution":{"observed_at":"2026-08-06T20:11:26.092926Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T20:11:26.081184Z","title":"Evaluation of simulation strategy on single-player monte-carlo tree search and its discussion for a practical scheduling problem","venue":null,"work_id":"1928c529-a9c8-48f4-aaf7-0e58d8af9dd6","year":2012},"citing_paper":{"arxiv_id":"2507.03833","last_updated":"2025-07-16T01:56:38Z","snapshot_observed_at":"2026-08-06T19:59:13.081691Z","submitted_at":"2025-07-04T22:57:33Z","title":"MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:21.218985Z"},"links":{"citing_paper":"/paper/2507.03833"},"observation_digest":"sha256:28fb67ae6a593b354ca376f4fcc6f6b134d1bc75468150af988a8a37fbb84936","observation_id":"ebb2646d-8a00-4d34-b430-eb8c37b99cfb","resolution":{"observed_at":"2026-08-06T20:11:26.084211Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T20:11:26.072840Z","title":"Optimizing halley’s iteration for computing the matrix polar decomposition.SIAM Journal on Matrix Analysis and Applications, 31(5):2700– 2720, 2010","venue":null,"work_id":"bf1fae7d-5d13-422b-845d-1aabe71cfe7e","year":2010},"citing_paper":{"arxiv_id":"2507.03833","last_updated":"2025-07-16T01:56:38Z","snapshot_observed_at":"2026-08-06T19:59:13.081691Z","submitted_at":"2025-07-04T22:57:33Z","title":"MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:21.382212Z"},"links":{"citing_paper":"/paper/2507.03833"},"observation_digest":"sha256:523609863f582e56dbe87ee53aad6196a2e614c9d6a1aadcc6c660f6a55af111","observation_id":"fe6651d3-1aaa-42fa-ae14-8f6b2e3d725e","resolution":{"observed_at":"2026-08-06T20:11:26.075946Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T20:11:26.063121Z","title":"Computing fundamental matrix decompositions accurately via the matrix sign function in two iterations: The power of zolotarev’s functions","venue":null,"work_id":"9811ab97-ae1c-447a-8403-65ee0431f9e2","year":2016},"citing_paper":{"arxiv_id":"2507.03833","last_updated":"2025-07-16T01:56:38Z","snapshot_observed_at":"2026-08-06T19:59:13.081691Z","submitted_at":"2025-07-04T22:57:33Z","title":"MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:21.542955Z"},"links":{"citing_paper":"/paper/2507.03833"},"observation_digest":"sha256:7003b05ac2b20d219a8fe55da2424c8c2771b37861a256a4f774e19d55b91b5d","observation_id":"640dccdd-fd94-4e84-978e-243d7a04dbfc","resolution":{"observed_at":"2026-08-06T20:11:26.066221Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T20:11:21.703269Z","title":"An improved newton iteration for the generalized inverse of a matrix, with applications.SIAM Journal on Scientific and Statistical Computing, 12(5):1109– 1130, 1991","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2507.03833","last_updated":"2025-07-16T01:56:38Z","snapshot_observed_at":"2026-08-06T19:59:13.081691Z","submitted_at":"2025-07-04T22:57:33Z","title":"MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:21.703269Z"},"links":{"citing_paper":"/paper/2507.03833"},"observation_digest":"sha256:34c005d88b3277b1c2de91b1ffdfc1c6eecb276d72ca322828b081ca4da5e34c","observation_id":"b45a8a91-634a-4321-9662-fdfb3ab8856c","resolution":{"observed_at":"2026-08-06T20:11:21.703269Z","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-06T20:11:25.767960Z","title":"The edge of orthogonality: A simple view of what makes byol tick","venue":null,"work_id":"a20aa2a2-9fd6-495f-8f1f-ce7b48c2b840","year":2023},"citing_paper":{"arxiv_id":"2507.03833","last_updated":"2025-07-16T01:56:38Z","snapshot_observed_at":"2026-08-06T19:59:13.081691Z","submitted_at":"2025-07-04T22:57:33Z","title":"MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:21.835625Z"},"links":{"citing_paper":"/paper/2507.03833"},"observation_digest":"sha256:5d4cf7679b2ae370af47ae825b59c656a8308c6bda7b7961b52ceceb5dc7267e","observation_id":"5415683a-3877-4800-89d3-a255d8223cdb","resolution":{"observed_at":"2026-08-06T20:11:25.930744Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T20:11:25.633535Z","title":"Optimization of the nested monte-carlo algorithm on the traveling salesman problem with time windows","venue":null,"work_id":"589e040d-d2c9-4209-a34e-5fcdaeda3369","year":2011},"citing_paper":{"arxiv_id":"2507.03833","last_updated":"2025-07-16T01:56:38Z","snapshot_observed_at":"2026-08-06T19:59:13.081691Z","submitted_at":"2025-07-04T22:57:33Z","title":"MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:22.003025Z"},"links":{"citing_paper":"/paper/2507.03833"},"observation_digest":"sha256:af54fb4133cb8b48a9da59ffc6c811c25bb06adbb3a99dd295ade5f7678b2186","observation_id":"a2c6431d-d61b-41b0-9ddc-73a24155fa8e","resolution":{"observed_at":"2026-08-06T20:11:25.684756Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T20:11:25.381098Z","title":"Guiding combinatorial optimization with uct","venue":null,"work_id":"29bb3ab8-4957-44d2-a3e7-7de65e80d251","year":2012},"citing_paper":{"arxiv_id":"2507.03833","last_updated":"2025-07-16T01:56:38Z","snapshot_observed_at":"2026-08-06T19:59:13.081691Z","submitted_at":"2025-07-04T22:57:33Z","title":"MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:22.226105Z"},"links":{"citing_paper":"/paper/2507.03833"},"observation_digest":"sha256:57617e660554efb36fdd9ad2b7db6b95b51d853d0c373ac6256fbc98b092e212","observation_id":"54fb816f-b021-4274-9e58-fd7d9c8ddc00","resolution":{"observed_at":"2026-08-06T20:11:25.471731Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T20:11:22.366749Z","title":"Iterative berechung der reziproken matrix.ZAMM-Journal of Applied Math- ematics and Mechanics/Zeitschrift für Angewandte Mathematik und Mechanik, 13(1):57–59, 1933","venue":null,"work_id":null,"year":1933},"citing_paper":{"arxiv_id":"2507.03833","last_updated":"2025-07-16T01:56:38Z","snapshot_observed_at":"2026-08-06T19:59:13.081691Z","submitted_at":"2025-07-04T22:57:33Z","title":"MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:22.366749Z"},"links":{"citing_paper":"/paper/2507.03833"},"observation_digest":"sha256:4bde3199354a4f82edcab998319b00a0fdb61af05f26876ff7d0bec7237297cb","observation_id":"f33bf291-75ab-4ed8-884a-b2caae098fea","resolution":{"observed_at":"2026-08-06T20:11:22.366749Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:11:22.517041Z","title":"Mastering the game of go without human knowledge.nature, 550(7676):354–359, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2507.03833","last_updated":"2025-07-16T01:56:38Z","snapshot_observed_at":"2026-08-06T19:59:13.081691Z","submitted_at":"2025-07-04T22:57:33Z","title":"MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:22.517041Z"},"links":{"citing_paper":"/paper/2507.03833"},"observation_digest":"sha256:301b0ef81163f05bbe1439c01b8d4eb30e36c0b7236da9c73eba27cd21c61c6f","observation_id":"832f07e6-62bd-4398-b082-156cbc318b9a","resolution":{"observed_at":"2026-08-06T20:11:22.517041Z","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-06T20:11:25.047979Z","title":"Tactical planning using mcts in the game of starcraft.Master’s thesis, Maastricht University, 2014","venue":null,"work_id":"457fc910-5e98-4d95-994b-cc4f7abd1792","year":2014},"citing_paper":{"arxiv_id":"2507.03833","last_updated":"2025-07-16T01:56:38Z","snapshot_observed_at":"2026-08-06T19:59:13.081691Z","submitted_at":"2025-07-04T22:57:33Z","title":"MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:22.622662Z"},"links":{"citing_paper":"/paper/2507.03833"},"observation_digest":"sha256:4008dc4b4fe0617e4d6ef263f61e716b769b81239298f32304be7c863ab5c9aa","observation_id":"0734f011-471b-493d-bee5-f5852a5f86ee","resolution":{"observed_at":"2026-08-06T20:11:25.189840Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T20:11:24.769625Z","title":null,"venue":null,"work_id":"0f4d176e-a010-4c69-a259-5097ef9c25df","year":2021},"citing_paper":{"arxiv_id":"2507.03833","last_updated":"2025-07-16T01:56:38Z","snapshot_observed_at":"2026-08-06T19:59:13.081691Z","submitted_at":"2025-07-04T22:57:33Z","title":"MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:22.730915Z"},"links":{"citing_paper":"/paper/2507.03833"},"observation_digest":"sha256:f65c81152f80f453c387aba339452cccc0e92b86811bcd0b448da71a8aba50f2","observation_id":"c4815267-6c33-4b07-9564-56c725cb20c8","resolution":{"observed_at":"2026-08-06T20:11:24.932466Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2201.08663","last_updated":"2022-01-21T12:18:06Z","snapshot_observed_at":"2026-08-07T18:08:50.245623Z","submitted_at":"2022-01-21T12:18:06Z","title":"Fast Differentiable Matrix Square Root","version":1},"cited_work":{"arxiv_id":"2201.08663","doi":null,"metadata_source":"pith","pith_arxiv_id":"2201.08663","snapshot_observed_at":"2026-08-06T20:11:23.496164Z","title":"Fast Differentiable Matrix Square Root","venue":"cs.CV","work_id":"d3ff1bc2-97cd-40fc-abca-e6a70fba1f74","year":2022},"citing_paper":{"arxiv_id":"2507.03833","last_updated":"2025-07-16T01:56:38Z","snapshot_observed_at":"2026-08-06T19:59:13.081691Z","submitted_at":"2025-07-04T22:57:33Z","title":"MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:22.853588Z"},"links":{"cited_paper":"/paper/2201.08663","citing_paper":"/paper/2507.03833"},"observation_digest":"sha256:7b2823646fc7dc9edeb723e36363a744b5aba5135e1a8f7dfeba83958b39c8bc","observation_id":"917df4e1-722d-4d2c-829b-e226260eb918","resolution":{"observed_at":"2026-08-06T20:11:23.631095Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T20:11:24.487035Z","title":"A monte-carlo aixi approximation.Journal of Artificial Intelligence Research, 40:95–142, 2011","venue":null,"work_id":"62919130-b172-4df3-87d2-034e03214db1","year":2011},"citing_paper":{"arxiv_id":"2507.03833","last_updated":"2025-07-16T01:56:38Z","snapshot_observed_at":"2026-08-06T19:59:13.081691Z","submitted_at":"2025-07-04T22:57:33Z","title":"MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:22.960158Z"},"links":{"citing_paper":"/paper/2507.03833"},"observation_digest":"sha256:57cc3ab73371ce589c45551a415d357f8197ac352e6c3407c1232f7cfc5df740","observation_id":"ba05b774-6b3e-4a39-a3a9-89352016a3a8","resolution":{"observed_at":"2026-08-06T20:11:24.603480Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T20:11:24.259895Z","title":"Deep cnns meet global covariance pooling: Better representation and generalization.IEEE transactions on pattern analysis and machine intelligence, 43(8):2582–2597, 2020","venue":null,"work_id":"54974c1a-39eb-4ac8-b929-b2c8e55de786","year":2020},"citing_paper":{"arxiv_id":"2507.03833","last_updated":"2025-07-16T01:56:38Z","snapshot_observed_at":"2026-08-06T19:59:13.081691Z","submitted_at":"2025-07-04T22:57:33Z","title":"MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:23.074127Z"},"links":{"citing_paper":"/paper/2507.03833"},"observation_digest":"sha256:dbab823ecd89ba3a04b496b0f5fb71d82a74a7c3cee8dd607a3ffa730e46b80e","observation_id":"5f42e04f-80c5-4afa-8c5d-aeac8af9840c","resolution":{"observed_at":"2026-08-06T20:11:24.381074Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T20:11:23.982151Z","title":"On fractional powers of a matrix.Journal of the American Statistical Association, 62(319):1018–1021, 1967","venue":null,"work_id":"bcf1b603-6664-41e6-9c24-87ed42135c2d","year":1967},"citing_paper":{"arxiv_id":"2507.03833","last_updated":"2025-07-16T01:56:38Z","snapshot_observed_at":"2026-08-06T19:59:13.081691Z","submitted_at":"2025-07-04T22:57:33Z","title":"MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:23.226385Z"},"links":{"citing_paper":"/paper/2507.03833"},"observation_digest":"sha256:c55242ae508659bdaa8721cc90579922deff9a644774b148ea8a0280412f6c60","observation_id":"67654f21-2f66-4129-b38f-7521b8def571","resolution":{"observed_at":"2026-08-06T20:11:24.089971Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T20:11:23.888702Z","title":"difference","venue":null,"work_id":"b84240fd-d191-4507-b2e5-e4f3187c9094","year":null},"citing_paper":{"arxiv_id":"2507.03833","last_updated":"2025-07-16T01:56:38Z","snapshot_observed_at":"2026-08-06T19:59:13.081691Z","submitted_at":"2025-07-04T22:57:33Z","title":"MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:23.360058Z"},"links":{"citing_paper":"/paper/2507.03833"},"observation_digest":"sha256:121e5784b40d93d30233212a7b4a36d376bbd2d37add3440fc586d251c3536fa","observation_id":"dd67f59b-fc11-4909-9eb4-0fd3da476b99","resolution":{"observed_at":"2026-08-06T20:11:23.962213Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.03833","last_updated":"2025-07-16T01:56:38Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-06T19:59:13.081691Z","submitted_at":"2025-07-04T22:57:33Z","title":"MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search"},"reference_resolution":{"displayed":51,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":13,"verified_exact":1,"verified_fuzzy":37},"total_outbound_references":51},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 51 of 51 outbound references and 0 inbound Pith citation observations for arXiv:2507.03833."}