{"as_of":"2026-08-08T13:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8db12e27d30af0dfb9e46665d0b0a54fb744bb6acb63a864f301fb08915df587","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-08T06:32:00.761636+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/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-04T17:14:40.836608Z","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-07T10:53:11.416949Z","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:ee28b7683cb3b5cd30b1ef381069ec21b7ba13899c1a0b91940f26b1d1d4457c","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-07-06T17:51:48.378864Z","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-07T10:53:11.416949Z","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:e519f25a740435abbd7553418dee7513b127bbe44e0664f2d5cb5f6a68b8ec58","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-07T10:53:11.416949Z","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:7440fcb488ab62bbf17f86a894a4c7d731062a98e16a32d0a733253d033958d9","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-07T10:53:11.416949Z","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:616cfa57b4f45b68b04f0f76d806eeee05e78837efa4c42c960b9e9373a9d8df","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-07T10:53:11.416949Z","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:4c2a6eff0f54f91e07a9ecf9f316041301debb982dcacd38a287f80f195aa979","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-07T10:53:11.416949Z","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:48b9c60751f5c05b33b96eaa89b3189a1387e9ea7f7184e577d8a974952e0e75","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.02731","last_updated":"2024-07-03T01:03:09Z","snapshot_observed_at":"2026-08-07T22:46:16.289622Z","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-07T10:53:11.416949Z","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:f4a39521c2677df2aa4875584790bf01ad8eec3d4c2c637ecbc21984aee88d2b","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.20055","last_updated":"2024-03-29T08:46:57Z","snapshot_observed_at":"2026-08-07T10:53:47.078467Z","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-07T10:53:11.416949Z","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:e4bde31dad2322082f69873ea9c6bdb16dc0db6f936c1026984b6b0d4a311a61","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-07T10:53:11.416949Z","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:0ede3dd1143cdadea341d829daaefc5e93fc2ed252e818a2d53dfe5a3f8af863","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-07T10:53:11.416949Z","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:20796f92a2f954d6704c99ef0432539a8ea72511787c76b0cefa3624500d94f2","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-07T10:53:11.416949Z","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:aa21b187dc7f0fdbc4353d1062446ea01a26bdf7fc3c1e35dbdea4639a5060c7","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-07T10:53:11.416949Z","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:9ce3642dfeb55c443f2307f8aeb9c949aae431b3e043197479cefff736b86a2b","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6980","last_updated":"2017-01-30T01:27:54Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","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-07T10:53:11.416949Z","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:01c8f5a5cd7b56ada039fc6f87e4e0d3c23329a211065395cae07565bbd1c947","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-07-06T05:01:27.910364Z","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-07T10:53:11.416949Z","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:a1cbd4a278a5955b52bb247908b55a33620bd6844942744a90a95a868f447575","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-07T10:53:11.416949Z","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:25ab06fa09ec4930904a3976018880e88ee08f898daa1e70811cef466e0b9f52","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.00566","last_updated":"2024-11-01T13:23:58Z","snapshot_observed_at":"2026-08-08T13:22:51.922894Z","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-07T10:53:11.416949Z","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:3ab5b9ebc65b19b91a9b3b2d5351a67d6031ac10d8c90c7b5c5436e4f2199cb9","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-07T10:53:11.416949Z","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:35116b88e77af15f2636b72c6729f30ffa22edd7188addae9b6f49a0180976d7","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-07T10:53:11.416949Z","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:9f5a337bb65547e19a3a3e075280dd93c52a2597ab820622f7ebd7061988dca9","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1711.09846","last_updated":"2017-11-28T16:16:21Z","snapshot_observed_at":"2026-07-06T06:11:24.949724Z","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-07T10:53:11.416949Z","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:a5f7f4aec6d373d3daee34139cf46974d6e7b0d1c8684fc9822187e3c7341085","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-07T10:53:11.416949Z","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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 19 of 19 outbound references and 0 inbound Pith citation observations for arXiv:2509.01607."}