{"as_of":"2026-08-19T01:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4e8c8436f03a697ff2f4236d43ef1535af06874c8abb20fdc33f782340243cf1","coverage":[{"denominator":19,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":19,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T12:25:56.778384Z","state":"measured"},{"denominator":19,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":19,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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/2509.01607/citation-record","integrity":"/paper/2509.01607/integrity","json":"/paper/2509.01607/citation-record.json","paper":"/paper/2509.01607"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2104.14516","last_updated":"2021-04-29T17:32:56Z","snapshot_observed_at":"2026-08-16T18:28:07.901444Z","submitted_at":"2021-04-29T17:32:56Z","title":"Constructions in combinatorics via neural networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.14516","snapshot_observed_at":"2026-08-05T12:25:56.728914Z","title":"Constructions in combinatorics via neural networks,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.01607","last_updated":"2025-09-01T16:37:17Z","snapshot_observed_at":"2026-08-14T06:51:27.914677Z","submitted_at":"2025-09-01T16:37:17Z","title":"Reinforcement learning for graph theory, Parallelizing Wagner's approach","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T12:25:56.728914Z"},"links":{"cited_paper":"/paper/2104.14516","citing_paper":"/paper/2509.01607"},"observation_digest":"sha256:ebdb0bf4baac7a7cefc3b635ddf23d7b903bdbfe5be41110b59f95075eb659d3","observation_id":"a3909692-2597-47fb-8666-9a58c688f572","resolution":{"observed_at":"2026-08-05T12:25:56.728914Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.18429","last_updated":"2024-03-30T10:47:13Z","snapshot_observed_at":"2026-08-17T01:47:24.378645Z","submitted_at":"2024-03-27T10:35:41Z","title":"Reinforcement learning for graph theory, I. Reimplementation of Wagner's approach","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.18429","snapshot_observed_at":"2026-08-05T12:25:56.732575Z","title":"Reinforcement learning for graph theory, i. reimplementation of wagner’s approach,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.01607","last_updated":"2025-09-01T16:37:17Z","snapshot_observed_at":"2026-08-14T06:51:27.914677Z","submitted_at":"2025-09-01T16:37:17Z","title":"Reinforcement learning for graph theory, Parallelizing Wagner's approach","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T12:25:56.732575Z"},"links":{"cited_paper":"/paper/2403.18429","citing_paper":"/paper/2509.01607"},"observation_digest":"sha256:1a3077472d017ea3649b9db4697fa342769b188f2477fbe9fb969cef2aea116e","observation_id":"fc876007-75a3-4c84-8453-e823ebe38bb2","resolution":{"observed_at":"2026-08-05T12:25:56.732575Z","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-05T12:25:56.968030Z","title":"Variable neighborhood search for extremal vertices: The autographix-iii system,","venue":null,"work_id":"da33f999-5459-4c6b-b8bb-3a00e414da6c","year":2017},"citing_paper":{"arxiv_id":"2509.01607","last_updated":"2025-09-01T16:37:17Z","snapshot_observed_at":"2026-08-14T06:51:27.914677Z","submitted_at":"2025-09-01T16:37:17Z","title":"Reinforcement learning for graph theory, Parallelizing Wagner's approach","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T12:25:56.735762Z"},"links":{"citing_paper":"/paper/2509.01607"},"observation_digest":"sha256:a6ba4040d41481a4b71576babebccedcaeb0cf7c6d8442089622dc385aba547d","observation_id":"33c28d1b-13e4-4bb3-98ed-46fd18941111","resolution":{"observed_at":"2026-08-05T12:25:56.971500Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T12:25:56.959011Z","title":"Automated conjectures on upper bounds for the largest laplacian eigenvalue of graphs,","venue":null,"work_id":"67388fab-b87b-44f9-978c-97cbb77790ce","year":2006},"citing_paper":{"arxiv_id":"2509.01607","last_updated":"2025-09-01T16:37:17Z","snapshot_observed_at":"2026-08-14T06:51:27.914677Z","submitted_at":"2025-09-01T16:37:17Z","title":"Reinforcement learning for graph theory, Parallelizing Wagner's approach","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T12:25:56.738655Z"},"links":{"citing_paper":"/paper/2509.01607"},"observation_digest":"sha256:820731f340c435028bbf07a05040e1301e0430e0112a0e1d9e6405f751113200","observation_id":"f84bbd52-1152-40f4-9f91-03f6496f9525","resolution":{"observed_at":"2026-08-05T12:25:56.961945Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T12:25:56.949713Z","title":"A nordhaus-gaddum type problem for the normalized laplacian spectrum and graph cheeger constant,","venue":null,"work_id":"e5af4bad-5045-45a8-8419-f09cdb649ced","year":2024},"citing_paper":{"arxiv_id":"2509.01607","last_updated":"2025-09-01T16:37:17Z","snapshot_observed_at":"2026-08-14T06:51:27.914677Z","submitted_at":"2025-09-01T16:37:17Z","title":"Reinforcement learning for graph theory, Parallelizing Wagner's approach","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T12:25:56.741371Z"},"links":{"citing_paper":"/paper/2509.01607"},"observation_digest":"sha256:d2516d0de9ce5cb0f3e8435a6f1a0d9a440b2f8d2c4955353b68b9d20450625a","observation_id":"525cbc72-2d57-47ce-8126-170c53935611","resolution":{"observed_at":"2026-08-05T12:25:56.952923Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T12:25:56.941138Z","title":"A survey of automated conjectures in spectral graph theory,","venue":null,"work_id":"73e890be-03ae-4857-8941-8bd5d2822fa0","year":2010},"citing_paper":{"arxiv_id":"2509.01607","last_updated":"2025-09-01T16:37:17Z","snapshot_observed_at":"2026-08-14T06:51:27.914677Z","submitted_at":"2025-09-01T16:37:17Z","title":"Reinforcement learning for graph theory, Parallelizing Wagner's approach","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T12:25:56.744262Z"},"links":{"citing_paper":"/paper/2509.01607"},"observation_digest":"sha256:8f19ff7678ff9bfa104cce480d9899abda868c936fcab799666bfa0c6c364400","observation_id":"b6f7fced-8f3c-4fc6-9e20-7ff5335423b9","resolution":{"observed_at":"2026-08-05T12:25:56.944007Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.02731","last_updated":"2024-07-03T01:03:09Z","snapshot_observed_at":"2026-08-16T13:37:33.906558Z","submitted_at":"2024-07-03T01:03:09Z","title":"Artificial intelligence and machine learning generated conjectures with TxGraffiti","version":1},"cited_work":{"arxiv_id":"2407.02731","doi":null,"metadata_source":"pith","pith_arxiv_id":"2407.02731","snapshot_observed_at":"2026-08-05T12:25:56.854162Z","title":"Artificial intelligence and machine learning generated conjectures with TxGraffiti","venue":"cs.AI","work_id":"47dd3f0f-a066-444c-9dd9-ed84facb7cf0","year":2024},"citing_paper":{"arxiv_id":"2509.01607","last_updated":"2025-09-01T16:37:17Z","snapshot_observed_at":"2026-08-14T06:51:27.914677Z","submitted_at":"2025-09-01T16:37:17Z","title":"Reinforcement learning for graph theory, Parallelizing Wagner's approach","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T12:25:56.747229Z"},"links":{"cited_paper":"/paper/2407.02731","citing_paper":"/paper/2509.01607"},"observation_digest":"sha256:954bce6960468e861eb813f73a46824a6c5fdb9ce4e878373ca1c1d6a89e3449","observation_id":"5e505a5f-b07f-46b5-8a7a-e637aab4946c","resolution":{"observed_at":"2026-08-05T12:25:56.857427Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.20055","last_updated":"2024-03-29T08:46:57Z","snapshot_observed_at":"2026-08-16T14:05:15.440123Z","submitted_at":"2024-03-29T08:46:57Z","title":"Reinforcement learning for graph theory, II. Small Ramsey numbers","version":1},"cited_work":{"arxiv_id":"2403.20055","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.20055","snapshot_observed_at":"2026-08-05T12:25:56.839334Z","title":"Reinforcement learning for graph theory, II. Small Ramsey numbers","venue":"math.CO","work_id":"30f5226c-3efa-4164-ad17-9ac83d03078c","year":2024},"citing_paper":{"arxiv_id":"2509.01607","last_updated":"2025-09-01T16:37:17Z","snapshot_observed_at":"2026-08-14T06:51:27.914677Z","submitted_at":"2025-09-01T16:37:17Z","title":"Reinforcement learning for graph theory, Parallelizing Wagner's approach","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T12:25:56.750049Z"},"links":{"cited_paper":"/paper/2403.20055","citing_paper":"/paper/2509.01607"},"observation_digest":"sha256:267370181b22ac98125fe3cbc12de43037229acd26335bd880daec0cf977677a","observation_id":"56f0ed85-78f1-4849-be95-c0bc30bc5788","resolution":{"observed_at":"2026-08-05T12:25:56.844085Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T12:25:56.932784Z","title":"Graph6java: A researcher–friendly java framework for testing conjectures in chemical graph theory,","venue":null,"work_id":"46c2d74d-3365-4022-b66c-8bc400cfce15","year":2019},"citing_paper":{"arxiv_id":"2509.01607","last_updated":"2025-09-01T16:37:17Z","snapshot_observed_at":"2026-08-14T06:51:27.914677Z","submitted_at":"2025-09-01T16:37:17Z","title":"Reinforcement learning for graph theory, Parallelizing Wagner's approach","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T12:25:56.752873Z"},"links":{"citing_paper":"/paper/2509.01607"},"observation_digest":"sha256:b3c11afdeba259de189e7c5518083b77df0961d98e3acafaab810f2875c313c3","observation_id":"1434cae6-47a4-438b-ab46-b4d3b2dd099e","resolution":{"observed_at":"2026-08-05T12:25:56.935544Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T12:25:56.923802Z","title":"Tempestas ex machina: A review of machine learning methods for wavefront control,","venue":null,"work_id":"da625a2c-94fd-403f-8d93-0953763671e6","year":2023},"citing_paper":{"arxiv_id":"2509.01607","last_updated":"2025-09-01T16:37:17Z","snapshot_observed_at":"2026-08-14T06:51:27.914677Z","submitted_at":"2025-09-01T16:37:17Z","title":"Reinforcement learning for graph theory, Parallelizing Wagner's approach","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T12:25:56.755457Z"},"links":{"citing_paper":"/paper/2509.01607"},"observation_digest":"sha256:7971b6c21efee062f477989b9324f83bafd98083cbf4ebb59677db556c0ede78","observation_id":"88426275-cd53-42f3-a9ec-023d6b0f7ca3","resolution":{"observed_at":"2026-08-05T12:25:56.927038Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T12:25:56.914689Z","title":"A tutorial on the cross-entropy method,","venue":null,"work_id":"cc771adb-c3d0-4833-baaf-f986c79594df","year":2005},"citing_paper":{"arxiv_id":"2509.01607","last_updated":"2025-09-01T16:37:17Z","snapshot_observed_at":"2026-08-14T06:51:27.914677Z","submitted_at":"2025-09-01T16:37:17Z","title":"Reinforcement learning for graph theory, Parallelizing Wagner's approach","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T12:25:56.757926Z"},"links":{"citing_paper":"/paper/2509.01607"},"observation_digest":"sha256:8bfc1d36159530b5c02b76b811a58757a21ecb4eb02d73360fe70c2475dde604","observation_id":"db0ad815-2438-4756-94a7-c89b71f23ed5","resolution":{"observed_at":"2026-08-05T12:25:56.917899Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T12:25:56.906297Z","title":"A simple decentralized cross-entropy method,","venue":null,"work_id":"ae937eaf-b160-4309-8b00-53cbdd57ad4a","year":2022},"citing_paper":{"arxiv_id":"2509.01607","last_updated":"2025-09-01T16:37:17Z","snapshot_observed_at":"2026-08-14T06:51:27.914677Z","submitted_at":"2025-09-01T16:37:17Z","title":"Reinforcement learning for graph theory, Parallelizing Wagner's approach","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T12:25:56.760317Z"},"links":{"citing_paper":"/paper/2509.01607"},"observation_digest":"sha256:064bb1b0e9183275635fc4ffb2f97691e6b4150dd8ca474a4dd0efc2d9cc27dd","observation_id":"acda165e-d4f6-4261-a28e-445dd6da99a7","resolution":{"observed_at":"2026-08-05T12:25:56.909040Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6980","last_updated":"2017-01-30T01:27:54Z","snapshot_observed_at":"2026-08-17T19:26:44.032537Z","submitted_at":"2014-12-22T13:54:29Z","title":"Adam: A Method for Stochastic Optimization","version":9},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6980","snapshot_observed_at":"2026-08-05T12:25:56.762986Z","title":"Adam: A method for stochastic optimization,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2509.01607","last_updated":"2025-09-01T16:37:17Z","snapshot_observed_at":"2026-08-14T06:51:27.914677Z","submitted_at":"2025-09-01T16:37:17Z","title":"Reinforcement learning for graph theory, Parallelizing Wagner's approach","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T12:25:56.762986Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/2509.01607"},"observation_digest":"sha256:134f78ce24b26852362d1d6e490b5914391b90a3d26c8dd5fe724e8ab7383bce","observation_id":"821f2573-e007-40a5-a84b-20cf38c03066","resolution":{"observed_at":"2026-08-05T12:25:56.762986Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1606.08415","last_updated":"2023-06-06T01:53:32Z","snapshot_observed_at":"2026-08-13T19:48:28.322536Z","submitted_at":"2016-06-27T19:20:40Z","title":"Gaussian Error Linear Units (GELUs)","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1606.08415","snapshot_observed_at":"2026-08-05T12:25:56.765976Z","title":"Gaussian error linear units (gelus),","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2509.01607","last_updated":"2025-09-01T16:37:17Z","snapshot_observed_at":"2026-08-14T06:51:27.914677Z","submitted_at":"2025-09-01T16:37:17Z","title":"Reinforcement learning for graph theory, Parallelizing Wagner's approach","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T12:25:56.765976Z"},"links":{"cited_paper":"/paper/1606.08415","citing_paper":"/paper/2509.01607"},"observation_digest":"sha256:4d7e99ad5e0ac5ad49a4928b83a2b515b6d17f3fbe68b2b0075f42d38d090ac0","observation_id":"1932ce59-bb62-474b-944c-f7d4c1f7e83e","resolution":{"observed_at":"2026-08-05T12:25:56.765976Z","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-05T12:25:56.897507Z","title":"Annealing adaptive search, cross-entropy, and stochastic approximation in global optimization,","venue":null,"work_id":"7483fac5-3485-448e-bf81-72c396f4cefd","year":2011},"citing_paper":{"arxiv_id":"2509.01607","last_updated":"2025-09-01T16:37:17Z","snapshot_observed_at":"2026-08-14T06:51:27.914677Z","submitted_at":"2025-09-01T16:37:17Z","title":"Reinforcement learning for graph theory, Parallelizing Wagner's approach","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T12:25:56.768663Z"},"links":{"citing_paper":"/paper/2509.01607"},"observation_digest":"sha256:0e8ec5904e94d9ba35337ff1b15325fb1cb4cb098eb7607994d5a1fcd5bd7002","observation_id":"fdb10dc0-466c-4b6a-a1e5-a1e68251c4c5","resolution":{"observed_at":"2026-08-05T12:25:56.900623Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.00566","last_updated":"2024-11-01T13:23:58Z","snapshot_observed_at":"2026-08-16T19:04:17.849917Z","submitted_at":"2024-11-01T13:23:58Z","title":"PatternBoost: Constructions in Mathematics with a Little Help from AI","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.00566","snapshot_observed_at":"2026-08-05T12:25:56.771059Z","title":"Patternboost: Constructions in mathe- matics with a little help from ai,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.01607","last_updated":"2025-09-01T16:37:17Z","snapshot_observed_at":"2026-08-14T06:51:27.914677Z","submitted_at":"2025-09-01T16:37:17Z","title":"Reinforcement learning for graph theory, Parallelizing Wagner's approach","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T12:25:56.771059Z"},"links":{"cited_paper":"/paper/2411.00566","citing_paper":"/paper/2509.01607"},"observation_digest":"sha256:a5710c4fb2ac4ac40acf33d793a3b315e8e4b7b22f2933a329970fdba3294926","observation_id":"034e05ac-66d9-435a-8210-a453820be5f0","resolution":{"observed_at":"2026-08-05T12:25:56.771059Z","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-05T12:25:56.888788Z","title":"Small ramsey numbers,","venue":null,"work_id":"a2038101-4811-43aa-82e2-c5b7a4e87cb8","year":2012},"citing_paper":{"arxiv_id":"2509.01607","last_updated":"2025-09-01T16:37:17Z","snapshot_observed_at":"2026-08-14T06:51:27.914677Z","submitted_at":"2025-09-01T16:37:17Z","title":"Reinforcement learning for graph theory, Parallelizing Wagner's approach","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T12:25:56.773568Z"},"links":{"citing_paper":"/paper/2509.01607"},"observation_digest":"sha256:7ef0b89ab94630d609b48f7a2b5413cdbf42ddff999f6ccda50b3ad3e9001f02","observation_id":"7d4da545-7dd0-441a-99a4-570bd9ad8e1d","resolution":{"observed_at":"2026-08-05T12:25:56.891504Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T12:25:56.879996Z","title":"Action space shaping in deep reinforcement learning,","venue":null,"work_id":"46a9a93b-02c7-4475-be1c-2300a34c5e3f","year":2020},"citing_paper":{"arxiv_id":"2509.01607","last_updated":"2025-09-01T16:37:17Z","snapshot_observed_at":"2026-08-14T06:51:27.914677Z","submitted_at":"2025-09-01T16:37:17Z","title":"Reinforcement learning for graph theory, Parallelizing Wagner's approach","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T12:25:56.776036Z"},"links":{"citing_paper":"/paper/2509.01607"},"observation_digest":"sha256:10f4d74e70441278d2265182e7812a9eefaad0a77416df32ee26d3506ddbdeeb","observation_id":"a73fddac-5036-4c2e-8efb-428fbab3df17","resolution":{"observed_at":"2026-08-05T12:25:56.883056Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1711.09846","last_updated":"2017-11-28T16:16:21Z","snapshot_observed_at":"2026-08-15T05:47:29.683783Z","submitted_at":"2017-11-27T17:33:27Z","title":"Population Based Training of Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.09846","snapshot_observed_at":"2026-08-05T12:25:56.778384Z","title":"Population based training of neural networks,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.01607","last_updated":"2025-09-01T16:37:17Z","snapshot_observed_at":"2026-08-14T06:51:27.914677Z","submitted_at":"2025-09-01T16:37:17Z","title":"Reinforcement learning for graph theory, Parallelizing Wagner's approach","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-05T12:25:56.778384Z"},"links":{"cited_paper":"/paper/1711.09846","citing_paper":"/paper/2509.01607"},"observation_digest":"sha256:c0f865b5510192bff97fa9a14447f3049cadb01bd338385437b591a6fe2dfd2a","observation_id":"7fbc6af2-d0ce-41d2-8d59-58a1fbd5e6fe","resolution":{"observed_at":"2026-08-05T12:25:56.778384Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2509.01607","last_updated":"2025-09-01T16:37:17Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-14T06:51:27.914677Z","submitted_at":"2025-09-01T16:37:17Z","title":"Reinforcement learning for graph theory, Parallelizing Wagner's approach"},"reference_resolution":{"displayed":19,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":2,"verified_fuzzy":11},"total_outbound_references":19},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 19 of 19 outbound references and 0 inbound Pith citation observations for arXiv:2509.01607."}