Pith. sign in

Paper Citation Record · LEDGER

MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search

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.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2507.03833 v2

Coverage vector

measured 51 of 51 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-06T20:11:23.360058Z

measured 51 of 51 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-07T06:34:17.273281+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

51 of 51 outbound references displayed

  • verified exact1
  • verified fuzzy37
  • unresolved13
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 1c2e8aea-06d0-471f-8759-b0b0f7c45ab3 · outbound

This paper cites Dion: A communication-efficient optimizer for large models.

MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search Dion: A communication-efficient optimizer for large models

Reference 1

Resolution
unresolved
no resolver link, observed 2026-08-06T20:11:17.962312Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-06T20:11:17.962312Z digest=sha256:d1bfa024ef34a01b4f10b80bf5a9ad837314255601eb4051e08061e7633ad12d

Observation 0f505b2e-ee50-4e98-a2d6-33fed1814219 · outbound

This paper cites independent components.

MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search independent components

Reference 2

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T20:11:26.386906Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-06T20:11:18.012988Z digest=sha256:fe2eabe289c0461beadc8f01c9f9e989fae554efb133d135269f44ac1f5de2df

Observation 73c756ff-31c9-475c-a76c-09eac1666dc8 · outbound

This paper cites A survey of monte carlo tree search methods.IEEE Transactions on Computational Intelligence and AI in games, 4(1):1–43, 2012.

MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search A survey of monte carlo tree search methods.IEEE Transactions on Computational Intelligence and AI in games, 4(1):1–43, 2012

Reference 3

Resolution
unresolved
no resolver link, observed 2026-08-06T20:11:18.120898Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-06T20:11:18.120898Z digest=sha256:426df782a423891a1376787d71e1fe01e425c5e3e957961dd8dd2ee5a9195752

Observation cc441e43-5737-481b-8ab1-c8955e03f07a · outbound

This paper cites Solving the algebraic riccati equation with the matrix sign function.Linear Algebra and its Applications, 85:267–279, 1987.

MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search Solving the algebraic riccati equation with the matrix sign function.Linear Algebra and its Applications, 85:267–279, 1987

Reference 4

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T20:11:26.370384Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-06T20:11:18.199316Z digest=sha256:79d9f9e0582d9aae5cfc443c0e050690b11d85bd83800c65a765133d73092574

Observation be860898-26a9-4813-9266-d12d3677dd4b · outbound

This paper cites 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.

MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search 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

Reference 5

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T20:11:26.360131Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-06T20:11:18.303177Z digest=sha256:6216c522eb2a90c2a82a73253a24bd84fa6a0824e7f16dfb50fdb4316ac88b5c

Observation b8391065-b802-4bf1-9471-00edf2325c6a · outbound

This paper cites Monte-carlo tree search in production management problems.

MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search Monte-carlo tree search in production management problems

Reference 6

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T20:11:26.349919Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-06T20:11:18.411577Z digest=sha256:3ba85cb2cc22bcd2539256039d9c93d2f56974d7c45b207ac95e0fc7b5191b9c

Observation a358c2cc-3352-4f5c-b388-e90c54c08641 · outbound

This paper cites Progressive strategies for monte-carlo tree search.New Mathematics and Natural Computation, 4(03):343–357, 2008.

MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search Progressive strategies for monte-carlo tree search.New Mathematics and Natural Computation, 4(03):343–357, 2008

Reference 7

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T20:11:26.340449Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-06T20:11:18.486396Z digest=sha256:ba2c1ea127ca2422aecad5fb36ae3b1c138178bfc41131abe45ea41f388ebea6

Observation 075f72ba-4975-43bb-8905-9fcf9cdd79d0 · outbound

This paper cites an unresolved cited work.

MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search Unresolved cited work

Reference 8

Resolution
unresolved
raw_fallback, observed 2026-08-06T20:11:26.330872Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-06T20:11:18.581115Z digest=sha256:5fc6db0f490e60f35fae469548bed57972478ebb04ce2a0502a65b6d2b29a1e9

Observation f64f4076-aa80-4a4c-8f6c-0db32fe90443 · outbound

This paper cites Continuous upper confidence trees.

MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search Continuous upper confidence trees

Reference 9

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T20:11:26.320411Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-06T20:11:18.689493Z digest=sha256:acb03650dce6e046743d92df146a42061b2e45fda70f40c9a8e4d68d47a9d5c9

Observation d62080ac-e55a-43b8-8951-3f5339f033af · outbound

This paper cites Convolutional neural networks on graphs with fast localized spectral filtering.Advances in neural information processing systems, 29, 2016.

MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search Convolutional neural networks on graphs with fast localized spectral filtering.Advances in neural information processing systems, 29, 2016

Reference 10

Resolution
unresolved
no resolver link, observed 2026-08-06T20:11:18.796837Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-06T20:11:18.796837Z digest=sha256:22c7393c1a953b2ef630746e6f1e3d6720d30126819b633ad0e4eafeb26adb12

Observation 63e617c0-1b90-44bb-bcfc-1df5f6d49dd7 · outbound

This paper cites The matrix sign function and computations in systems.Applied mathematics and Computation, 2(1):63–94, 1976.

MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search The matrix sign function and computations in systems.Applied mathematics and Computation, 2(1):63–94, 1976

Reference 11

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T20:11:26.301338Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-06T20:11:18.912992Z digest=sha256:ec75776493bb7028066e12ef8cb5f95e4a6f72e768920d1ec3150f2daf6fca15

Observation 1e519235-6676-4e00-a9c1-788407edce33 · outbound

This paper cites An introduction to mathematical optimal control theory version 0.2.Lecture notes available at http://math.

MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search An introduction to mathematical optimal control theory version 0.2.Lecture notes available at http://math

Reference 12

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T20:11:26.289473Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-06T20:11:18.919553Z digest=sha256:6d8bef2c4312e2fa3f3b9d70d0e54329fd59d8f2462bed7a3a8b30a7f4e619d0

Observation ef12841c-b196-42ed-92ae-ee2fd002bd59 · outbound

This paper cites Discovering faster matrix multiplication algorithms with reinforcement learning.Nature, 610(7930):47–53, 2022.

MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search Discovering faster matrix multiplication algorithms with reinforcement learning.Nature, 610(7930):47–53, 2022

Reference 13

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T20:11:26.278960Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-06T20:11:19.038996Z digest=sha256:2c7335f5cbe0f291a25cc36e3b311c88b69aa69e375997b7b8510b170dcae83e

Observation fd390be0-85d1-4f78-bf2b-564c282d88c9 · outbound

This paper cites Zolotarev iterations for the matrix square root.SIAM journal on matrix analysis and applications, 40(2):696–719, 2019.

MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search Zolotarev iterations for the matrix square root.SIAM journal on matrix analysis and applications, 40(2):696–719, 2019

Reference 14

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T20:11:26.266407Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-06T20:11:19.120636Z digest=sha256:541163b8c381403c7d07f5424374e9fef9c55a31dddab479a0deba737589c303

Observation ea04f6e7-e169-4a61-b069-73570a28cb00 · outbound

This paper cites On newton’s method and halley’s method for the principal pth root of a matrix.

MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search On newton’s method and halley’s method for the principal pth root of a matrix

Reference 15

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T20:11:26.256695Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-06T20:11:19.202503Z digest=sha256:dc813ed75b3a56b38f7949634e459b725f6ff8d640bd990fb7f076fec4c65ffa

Observation 1d100ca7-c826-4f2c-8e2f-5cf48e12ea48 · outbound

This paper cites Shampoo: Preconditioned stochastic tensor optimization.

MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search Shampoo: Preconditioned stochastic tensor optimization

Reference 16

Resolution
unresolved
no resolver link, observed 2026-08-06T20:11:19.323909Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-06T20:11:19.323909Z digest=sha256:ad02831255042948df30ecb2f8989555f638c6ee1733200d8faa13f434d887a7

Observation 739d1d22-89f1-4c08-bcd1-8eff82a45ed9 · outbound

This paper cites Stable iterations for the matrix square root.Numerical Algorithms, 15:227–242, 1997.

MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search Stable iterations for the matrix square root.Numerical Algorithms, 15:227–242, 1997

Reference 17

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T20:11:26.238600Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-06T20:11:19.404305Z digest=sha256:df6784e32bee1f7a127f78de5d31d356ba241f47a8ae31b1eb71eb9aebc705c9

Observation 10c921f8-843b-42c0-9c87-b51814ba1f55 · outbound

This paper cites SIAM, 2008.

MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search SIAM, 2008

Reference 18

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T20:11:26.228367Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-06T20:11:19.491108Z digest=sha256:55c6e1ed6558e9b6775d1e72baadacce0a9e3137bdc3128392f26a56934e2696

Observation 234024a7-92d2-4aee-8e0b-f4c9369abb5d · outbound

This paper cites Fast polar decomposition of an arbitrary matrix.

MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search Fast polar decomposition of an arbitrary matrix

Reference 19

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T20:11:26.218531Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-06T20:11:19.593890Z digest=sha256:b411ea409661c639af1ba8e8e6331444bcfc52529c83f541b8cd0d5d03f3fe1b

Observation 16e0b4e2-0610-4ae1-b702-28be4545f476 · outbound

This paper cites Intelligent agents for the game of go.IEEE Computational Intelligence Magazine, 5(4):28–42, 2010.

MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search Intelligent agents for the game of go.IEEE Computational Intelligence Magazine, 5(4):28–42, 2010

Reference 20

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T20:11:26.208936Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-06T20:11:19.678248Z digest=sha256:1c61728aff34b50f36401990b60f7256cc29ad799b5115d2dd0d2eeec8fb7609

Observation a9624877-d0df-4213-877d-aaf6901072e6 · outbound

This paper cites A faster, more stable method for computing the pth roots of positive definite matrices.Linear Algebra and Its Applications, 26:139–163, 1979.

MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search A faster, more stable method for computing the pth roots of positive definite matrices.Linear Algebra and Its Applications, 26:139–163, 1979

Reference 21

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T20:11:26.200608Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-06T20:11:19.762315Z digest=sha256:ba92f23b70408bd8c8eb597b70e640bd5f6009daa3bb06a4d1d76a98d2434852

Observation e9c1c795-778a-4f90-b4c4-999b832cb409 · outbound

This paper cites A note on computing the matrix square root.Calcolo, 40(4):273–283, 2003.

MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search A note on computing the matrix square root.Calcolo, 40(4):273–283, 2003

Reference 22

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T20:11:26.191130Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-06T20:11:19.864027Z digest=sha256:17f58ce66fa21d43576b630d526ccffc80250fa0d94c4af3cbee286405d1fa3e

Observation 889f5c68-f8d2-4166-ae0d-3d931a01c75c · outbound

This paper cites On the newton method for the matrix p th root.SIAM journal on matrix analysis and applications, 28(2):503–523, 2006.

MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search On the newton method for the matrix p th root.SIAM journal on matrix analysis and applications, 28(2):503–523, 2006

Reference 23

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T20:11:26.182152Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-06T20:11:19.982111Z digest=sha256:c4d0a18075aa3b57163b1f3b541cd73b4f26df0d2cb92a2704f48834b13f363b

Observation 97ea60b0-a643-434f-a86d-ec3d43490b42 · outbound

This paper cites Muon: An optimizer for hidden layers in neural networks, 2024.

MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search Muon: An optimizer for hidden layers in neural networks, 2024

Reference 24

Resolution
unresolved
no resolver link, observed 2026-08-06T20:11:20.090925Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-06T20:11:20.090925Z digest=sha256:0cfd555cf017240b654f118eda8be76bb29e8f4ebf657b6a4fa2aacaae609b72

Observation dd8d9487-4f4c-441f-97cb-531c21cb1742 · outbound

This paper cites Deep generative symbolic regression with monte-carlo-tree-search.

MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search Deep generative symbolic regression with monte-carlo-tree-search

Reference 25

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T20:11:26.168334Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-06T20:11:20.201919Z digest=sha256:7e7394328fca8eb11ebb63119fe2cd1f078dde42e357d2760c3c678207fcbc45

Observation 8382d941-9fe3-4d89-8a9a-0242edff145d · outbound

This paper cites Learning to relax: Setting solver parameters across a sequence of linear system instances.

MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search Learning to relax: Setting solver parameters across a sequence of linear system instances

Reference 26

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T20:11:26.158894Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-06T20:11:20.314170Z digest=sha256:de7397ac4f0535680e94231b9de1d9678ddb20e7c1cbb27152a5d1fecd4c5b76

Observation 4c196d68-b869-4da2-aa38-f85b5630febc · outbound

This paper cites Bandit based monte-carlo planning.

MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search Bandit based monte-carlo planning

Reference 27

Resolution
unresolved
no resolver link, observed 2026-08-06T20:11:20.393163Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-06T20:11:20.393163Z digest=sha256:22161163ca93130cadb66f21e0cfaff52457847244b41e59a1a931b598efb214

Observation df824ee2-b82c-4e63-b526-cf024e18ad4e · outbound

This paper cites Learning multiple layers of features from tiny images.

MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search Learning multiple layers of features from tiny images

Reference 28

Resolution
unresolved
no resolver link, observed 2026-08-06T20:11:20.472509Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-06T20:11:20.472509Z digest=sha256:85a38f8e8a6a89950d4a744b07e049ec0562d7a7e073aceab14a46fbf3af412e

Observation 947e7c66-0ba5-45e1-8aa6-17dcf8afc696 · outbound

This paper cites Chebyshev- type methods and preconditioning techniques.Applied Mathematics and Computation, 218(2):260–270, 2011.

MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search Chebyshev- type methods and preconditioning techniques.Applied Mathematics and Computation, 218(2):260–270, 2011

Reference 29

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T20:11:26.136763Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-06T20:11:20.555922Z digest=sha256:417c3b2b2a716c2080ee323da35bf8502959d3b5dae9397e8eb4fba93fa1d8be

Observation 557f8ec7-1fcf-4ff1-9eed-50071332bd96 · outbound

This paper cites Learning to Optimize Neural Nets.

MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search Learning to Optimize Neural Nets

Reference 30

Resolution
unresolved
no resolver link, observed 2026-08-06T20:11:20.638117Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-06T20:11:20.638117Z digest=sha256:80d65d22405164889c674d900925c8d669154c76601cf6a567c75069e909db2f

Observation 724ed62f-5157-43db-be6e-8bf26f9d3456 · outbound

This paper cites An effec- tive mcts-based algorithm for minimizing makespan in dynamic flexible job shop scheduling problem.Computers & Industrial Engineering, 155:107211, 2021.

MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search An effec- tive mcts-based algorithm for minimizing makespan in dynamic flexible job shop scheduling problem.Computers & Industrial Engineering, 155:107211, 2021

Reference 31

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T20:11:26.128140Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-06T20:11:20.725752Z digest=sha256:1944a780bb681beecc2e585adba3e97aa538e63bd5acd3ad45f71ca7945a52d2

Observation 8377fdb4-9962-47f5-9487-7aa6dd50d0c4 · outbound

This paper cites Towards faster training of global covariance pooling networks by iterative matrix square root normalization.

MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search Towards faster training of global covariance pooling networks by iterative matrix square root normalization

Reference 32

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T20:11:26.119906Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-06T20:11:20.819576Z digest=sha256:7f7f2131525ce7c78145844d94e7c7ce64b82a810055c8c156c9f32582bbb041

Observation 8a2fdd30-9c54-4cff-83a2-6bec20afcafd · outbound

This paper cites Fast algorithm for extracting the diagonal of the inverse matrix with application to the electronic structure analysis of metallic systems.

MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search Fast algorithm for extracting the diagonal of the inverse matrix with application to the electronic structure analysis of metallic systems

Reference 33

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T20:11:26.111444Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-06T20:11:20.898450Z digest=sha256:5ebf4a198769de38fe657b9ae3ca2fd8b2f0e40094fa9ec86bef4224941696ed

Observation e0fd5a81-dce5-483e-a0e7-02eaa7f64bbb · outbound

This paper cites Faster sorting algorithms discovered using deep reinforcement learning.Nature, 618(7964):257–263, 2023.

MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search Faster sorting algorithms discovered using deep reinforcement learning.Nature, 618(7964):257–263, 2023

Reference 34

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T20:11:26.101680Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-06T20:11:20.954259Z digest=sha256:ed3d8b05b864860dfb09bfab625797aa005a41e14ed545071becd93d293b5b52

Observation 1f295623-5acd-4ea7-acf5-c45c8bbd135f · outbound

This paper cites A fractional graph laplacian approach to oversmoothing.Advances in Neural Information Processing Systems, 36:13022– 13063, 2023.

MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search A fractional graph laplacian approach to oversmoothing.Advances in Neural Information Processing Systems, 36:13022– 13063, 2023

Reference 35

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T20:11:26.092926Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-06T20:11:21.087024Z digest=sha256:40e3d605015659629ccf7748c05b17ab9cf9c3824ee1a270e547a3af974ffe04

Observation ebb2646d-8a00-4d34-b430-eb8c37b99cfb · outbound

This paper cites Evaluation of simulation strategy on single-player monte-carlo tree search and its discussion for a practical scheduling problem.

MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search Evaluation of simulation strategy on single-player monte-carlo tree search and its discussion for a practical scheduling problem

Reference 36

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T20:11:26.084211Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-06T20:11:21.218985Z digest=sha256:28fb67ae6a593b354ca376f4fcc6f6b134d1bc75468150af988a8a37fbb84936

Observation fe6651d3-1aaa-42fa-ae14-8f6b2e3d725e · outbound

This paper cites Optimizing halley’s iteration for computing the matrix polar decomposition.SIAM Journal on Matrix Analysis and Applications, 31(5):2700– 2720, 2010.

MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search Optimizing halley’s iteration for computing the matrix polar decomposition.SIAM Journal on Matrix Analysis and Applications, 31(5):2700– 2720, 2010

Reference 37

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T20:11:26.075946Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-06T20:11:21.382212Z digest=sha256:523609863f582e56dbe87ee53aad6196a2e614c9d6a1aadcc6c660f6a55af111

Observation 640dccdd-fd94-4e84-978e-243d7a04dbfc · outbound

This paper cites Computing fundamental matrix decompositions accurately via the matrix sign function in two iterations: The power of zolotarev’s functions.

MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search Computing fundamental matrix decompositions accurately via the matrix sign function in two iterations: The power of zolotarev’s functions

Reference 38

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T20:11:26.066221Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-06T20:11:21.542955Z digest=sha256:7003b05ac2b20d219a8fe55da2424c8c2771b37861a256a4f774e19d55b91b5d

Observation b45a8a91-634a-4321-9662-fdfb3ab8856c · outbound

This paper cites 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.

MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search 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

Reference 39

Resolution
unresolved
no resolver link, observed 2026-08-06T20:11:21.703269Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-06T20:11:21.703269Z digest=sha256:34c005d88b3277b1c2de91b1ffdfc1c6eecb276d72ca322828b081ca4da5e34c

Observation 5415683a-3877-4800-89d3-a255d8223cdb · outbound

This paper cites The edge of orthogonality: A simple view of what makes byol tick.

MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search The edge of orthogonality: A simple view of what makes byol tick

Reference 40

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T20:11:25.930744Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-06T20:11:21.835625Z digest=sha256:5d4cf7679b2ae370af47ae825b59c656a8308c6bda7b7961b52ceceb5dc7267e

Observation a2c6431d-d61b-41b0-9ddc-73a24155fa8e · outbound

This paper cites Optimization of the nested monte-carlo algorithm on the traveling salesman problem with time windows.

MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search Optimization of the nested monte-carlo algorithm on the traveling salesman problem with time windows

Reference 41

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T20:11:25.684756Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-06T20:11:22.003025Z digest=sha256:af54fb4133cb8b48a9da59ffc6c811c25bb06adbb3a99dd295ade5f7678b2186

Observation 54fb816f-b021-4274-9e58-fd7d9c8ddc00 · outbound

This paper cites Guiding combinatorial optimization with uct.

MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search Guiding combinatorial optimization with uct

Reference 42

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T20:11:25.471731Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-06T20:11:22.226105Z digest=sha256:57617e660554efb36fdd9ad2b7db6b95b51d853d0c373ac6256fbc98b092e212

Observation f33bf291-75ab-4ed8-884a-b2caae098fea · outbound

This paper cites 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.

MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search 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

Reference 43

Resolution
unresolved
no resolver link, observed 2026-08-06T20:11:22.366749Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-06T20:11:22.366749Z digest=sha256:4bde3199354a4f82edcab998319b00a0fdb61af05f26876ff7d0bec7237297cb

Observation 832f07e6-62bd-4398-b082-156cbc318b9a · outbound

This paper cites Mastering the game of go without human knowledge.nature, 550(7676):354–359, 2017.

MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search Mastering the game of go without human knowledge.nature, 550(7676):354–359, 2017

Reference 44

Resolution
unresolved
no resolver link, observed 2026-08-06T20:11:22.517041Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-06T20:11:22.517041Z digest=sha256:301b0ef81163f05bbe1439c01b8d4eb30e36c0b7236da9c73eba27cd21c61c6f

Observation 0734f011-471b-493d-bee5-f5852a5f86ee · outbound

This paper cites Tactical planning using mcts in the game of starcraft.Master’s thesis, Maastricht University, 2014.

MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search Tactical planning using mcts in the game of starcraft.Master’s thesis, Maastricht University, 2014

Reference 45

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T20:11:25.189840Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-06T20:11:22.622662Z digest=sha256:4008dc4b4fe0617e4d6ef263f61e716b769b81239298f32304be7c863ab5c9aa

Observation c4815267-6c33-4b07-9564-56c725cb20c8 · outbound

This paper cites an unresolved cited work.

MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search Unresolved cited work

Reference 46

Resolution
unresolved
raw_fallback, observed 2026-08-06T20:11:24.932466Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-06T20:11:22.730915Z digest=sha256:f65c81152f80f453c387aba339452cccc0e92b86811bcd0b448da71a8aba50f2

Observation 917df4e1-722d-4d2c-829b-e226260eb918 · outbound

This paper cites Fast Differentiable Matrix Square Root.

MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search Fast Differentiable Matrix Square Root

Reference 47

Resolution
verified exact
local_arxiv, observed 2026-08-06T20:11:23.631095Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-06T20:11:22.853588Z digest=sha256:7b2823646fc7dc9edeb723e36363a744b5aba5135e1a8f7dfeba83958b39c8bc

Observation ba05b774-6b3e-4a39-a3a9-89352016a3a8 · outbound

This paper cites A monte-carlo aixi approximation.Journal of Artificial Intelligence Research, 40:95–142, 2011.

MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search A monte-carlo aixi approximation.Journal of Artificial Intelligence Research, 40:95–142, 2011

Reference 48

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T20:11:24.603480Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-06T20:11:22.960158Z digest=sha256:57cc3ab73371ce589c45551a415d357f8197ac352e6c3407c1232f7cfc5df740

Observation 5f42e04f-80c5-4afa-8c5d-aeac8af9840c · outbound

This paper cites Deep cnns meet global covariance pooling: Better representation and generalization.IEEE transactions on pattern analysis and machine intelligence, 43(8):2582–2597, 2020.

MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search Deep cnns meet global covariance pooling: Better representation and generalization.IEEE transactions on pattern analysis and machine intelligence, 43(8):2582–2597, 2020

Reference 49

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T20:11:24.381074Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-06T20:11:23.074127Z digest=sha256:dbab823ecd89ba3a04b496b0f5fb71d82a74a7c3cee8dd607a3ffa730e46b80e

Observation 67654f21-2f66-4129-b38f-7521b8def571 · outbound

This paper cites On fractional powers of a matrix.Journal of the American Statistical Association, 62(319):1018–1021, 1967.

MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search On fractional powers of a matrix.Journal of the American Statistical Association, 62(319):1018–1021, 1967

Reference 50

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T20:11:24.089971Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-06T20:11:23.226385Z digest=sha256:c55242ae508659bdaa8721cc90579922deff9a644774b148ea8a0280412f6c60

Observation dd67f59b-fc11-4909-9eb4-0fd3da476b99 · outbound

This paper cites difference.

MatRL: Provably Generalizable Iterative Algorithm Discovery via Monte-Carlo Tree Search difference

Reference 51

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T20:11:23.962213Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-06T20:11:23.360058Z digest=sha256:121e5784b40d93d30233212a7b4a36d376bbd2d37add3440fc586d251c3536fa

Pith citing papers

No inbound Pith citation observations are available.