{"as_of":"2026-08-14T02:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c6a67e5ee6df68cce414ee837e0458fb40b632ed047f36abbad3f9cd61e3e8ad","coverage":[{"denominator":46,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":46,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-10T17:48:17.363568Z","state":"measured"},{"denominator":46,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":46,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+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/2604.07240/citation-record","integrity":"/paper/2604.07240/integrity","json":"/paper/2604.07240/citation-record.json","paper":"/paper/2604.07240"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2602.05192","doi":"10.48550/arxiv.2602.05192","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"First proof","venue":"arXiv (Cornell University)","work_id":"0df5eef4-9d07-4838-bd4c-1772ece29fb8","year":2026},"citing_paper":{"arxiv_id":"2604.07240","last_updated":"2026-04-08T16:06:43Z","snapshot_observed_at":"2026-08-03T11:26:08.010806Z","submitted_at":"2026-04-08T16:06:43Z","title":"$k$-server-bench: Automating Potential Discovery for the $k$-Server Conjecture","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-10T17:48:17.363568Z"},"links":{"citing_paper":"/paper/2604.07240"},"observation_digest":"sha256:e4a73b33b0881d14b9104334dcd10b46b3ff6420eebeed555412c4043408fe4d","observation_id":"21ca3ae1-dc3d-4050-b950-46cf92246428","resolution":{"observed_at":"2026-05-11T06:05:58.141507Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"On the competitive ratio of the work function algorithm for the k-server problem","venue":null,"work_id":"fb7bbc23-316f-461c-b736-1f681115cc87","year":2004},"citing_paper":{"arxiv_id":"2604.07240","last_updated":"2026-04-08T16:06:43Z","snapshot_observed_at":"2026-08-03T11:26:08.010806Z","submitted_at":"2026-04-08T16:06:43Z","title":"$k$-server-bench: Automating Potential Discovery for the $k$-Server Conjecture","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-10T17:48:17.363568Z"},"links":{"citing_paper":"/paper/2604.07240"},"observation_digest":"sha256:6bb062295af2d3920016f36b36e4caa14b625e6eea974ebecf840208aee36cab","observation_id":"63f6e9c1-b6cf-4435-bc27-8d97e4c99ea2","resolution":{"observed_at":"2026-05-17T08:54:20.084656Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"The 3-server problem in the plane","venue":null,"work_id":"b7aff0ba-8a69-4396-90cf-bbfbeb92f73d","year":2002},"citing_paper":{"arxiv_id":"2604.07240","last_updated":"2026-04-08T16:06:43Z","snapshot_observed_at":"2026-08-03T11:26:08.010806Z","submitted_at":"2026-04-08T16:06:43Z","title":"$k$-server-bench: Automating Potential Discovery for the $k$-Server Conjecture","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-10T17:48:17.363568Z"},"links":{"citing_paper":"/paper/2604.07240"},"observation_digest":"sha256:24b368e282fb2dbc2c7f95595b42db986d1cb543140bbfb417414337b8d77ece","observation_id":"72cd3ecd-3d73-42c9-ab73-8a09c48f3826","resolution":{"observed_at":"2026-05-17T08:54:20.076887Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2603.04735","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-01T18:25:58.660471Z","title":"Brenner, Vincent Cohen-Addad, and David Woodruff.Solving an Open Problem in Theoretical Physics using AI-Assisted Discovery","venue":null,"work_id":"dc81ad72-5c50-46a5-9093-328fc0b0fd2f","year":2026},"citing_paper":{"arxiv_id":"2604.07240","last_updated":"2026-04-08T16:06:43Z","snapshot_observed_at":"2026-08-03T11:26:08.010806Z","submitted_at":"2026-04-08T16:06:43Z","title":"$k$-server-bench: Automating Potential Discovery for the $k$-Server Conjecture","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-10T17:48:17.363568Z"},"links":{"citing_paper":"/paper/2604.07240"},"observation_digest":"sha256:453c6c2a8dbd38359dc95a061a3ffac753120fd0b749e4b09316a699f3b78531","observation_id":"4ef49514-12b2-4c39-9bac-70e38cd75c1c","resolution":{"observed_at":"2026-05-11T06:05:58.117944Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.16951","last_updated":"2023-06-01T12:23:14Z","snapshot_observed_at":"2026-08-13T11:27:24.667397Z","submitted_at":"2023-06-01T12:23:14Z","title":"Applying language models to algebraic topology: generating simplicial cycles using multi-labeling in Wu's formula","version":1},"cited_work":{"arxiv_id":"2306.16951","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2306.16951","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"7dd1cb93-9387-4c40-81f3-43e8e79d0f82","year":2023},"citing_paper":{"arxiv_id":"2604.07240","last_updated":"2026-04-08T16:06:43Z","snapshot_observed_at":"2026-08-03T11:26:08.010806Z","submitted_at":"2026-04-08T16:06:43Z","title":"$k$-server-bench: Automating Potential Discovery for the $k$-Server Conjecture","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-10T17:48:17.363568Z"},"links":{"cited_paper":"/paper/2306.16951","citing_paper":"/paper/2604.07240"},"observation_digest":"sha256:79868c70c0933e10137a21860ee78d56ccd5b94061d7335ad31ed20c09a6d21a","observation_id":"52db7c71-7446-4644-9efd-842bc5106cd2","resolution":{"observed_at":"2026-05-11T06:05:58.151306Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2511.16072","doi":"10.48550/arxiv.2511.16072","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Early science acceleration experiments with gpt-5","venue":"ArXiv.org","work_id":"bb8efb54-7271-4cc5-bdda-162bc9c89a3e","year":2025},"citing_paper":{"arxiv_id":"2604.07240","last_updated":"2026-04-08T16:06:43Z","snapshot_observed_at":"2026-08-03T11:26:08.010806Z","submitted_at":"2026-04-08T16:06:43Z","title":"$k$-server-bench: Automating Potential Discovery for the $k$-Server Conjecture","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-10T17:48:17.363568Z"},"links":{"citing_paper":"/paper/2604.07240"},"observation_digest":"sha256:e101258b95587f8f51bc56c95ad7194bfd7cb5145165f1f1b7e848cd7057dcf8","observation_id":"f84507ac-38ef-411a-ad70-476fb7e57558","resolution":{"observed_at":"2026-05-11T06:05:58.099606Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-13T22:17:14.874759Z","submitted_at":"2024-11-01T13:23:58Z","title":"PatternBoost: Constructions in Mathematics with a Little Help from AI","version":1},"cited_work":{"arxiv_id":"2411.00566","doi":"10.48550/arxiv.2411.00566","metadata_source":"pith","pith_arxiv_id":"2411.00566","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Charton, J.S","venue":"math.CO","work_id":"6067f9a6-a677-4bb5-9664-747faa6fb7d6","year":2024},"citing_paper":{"arxiv_id":"2604.07240","last_updated":"2026-04-08T16:06:43Z","snapshot_observed_at":"2026-08-03T11:26:08.010806Z","submitted_at":"2026-04-08T16:06:43Z","title":"$k$-server-bench: Automating Potential Discovery for the $k$-Server Conjecture","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-10T17:48:17.363568Z"},"links":{"cited_paper":"/paper/2411.00566","citing_paper":"/paper/2604.07240"},"observation_digest":"sha256:b0070aef852aa0f7f14adfe1a16269a07bb9cc3c0a4c929413c732eadaad207f","observation_id":"be54e92a-62df-446a-88f0-9feb527cea85","resolution":{"observed_at":"2026-05-11T06:05:58.156549Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2602.03722","last_updated":"2026-07-03T16:14:25Z","snapshot_observed_at":"2026-08-09T06:33:59.050141Z","submitted_at":"2026-02-03T16:43:42Z","title":"Parity of $k$-differentials in genus zero and one","version":2},"cited_work":{"arxiv_id":"2602.03722","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2602.03722","snapshot_observed_at":"2026-07-07T03:17:17.768539Z","title":null,"venue":null,"work_id":"75410917-38e7-4265-baa8-8eb36b034f3d","year":2026},"citing_paper":{"arxiv_id":"2604.07240","last_updated":"2026-04-08T16:06:43Z","snapshot_observed_at":"2026-08-03T11:26:08.010806Z","submitted_at":"2026-04-08T16:06:43Z","title":"$k$-server-bench: Automating Potential Discovery for the $k$-Server Conjecture","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-10T17:48:17.363568Z"},"links":{"cited_paper":"/paper/2602.03722","citing_paper":"/paper/2604.07240"},"observation_digest":"sha256:587e76756350dcd9711da5786965dc760e262831a6273213d481c3212c659a89","observation_id":"acf6a90e-57f8-4a8d-9c3d-7cfc1360add3","resolution":{"observed_at":"2026-07-07T03:17:17.768539Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2602.03716","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-04T16:39:57.375172Z","title":"Fel’s conjecture on syzygies of numerical semigroups, 2026.https://arxiv.org/abs/2602.03716","venue":null,"work_id":"bc5f8954-1a00-4818-9203-74e6edcfa57c","year":2026},"citing_paper":{"arxiv_id":"2604.07240","last_updated":"2026-04-08T16:06:43Z","snapshot_observed_at":"2026-08-03T11:26:08.010806Z","submitted_at":"2026-04-08T16:06:43Z","title":"$k$-server-bench: Automating Potential Discovery for the $k$-Server Conjecture","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-10T17:48:17.363568Z"},"links":{"citing_paper":"/paper/2604.07240"},"observation_digest":"sha256:29d47a8384d3933429342d3a768d22764db87d232e2186d13e5dc3901579fb3f","observation_id":"07fe5753-cb9c-447b-b9c2-f650b9013b95","resolution":{"observed_at":"2026-05-11T06:05:58.227856Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"An optimal on-line algorithm for k servers on trees","venue":null,"work_id":"f0e3fc91-763b-40c1-ae7c-98c1461ad46b","year":1991},"citing_paper":{"arxiv_id":"2604.07240","last_updated":"2026-04-08T16:06:43Z","snapshot_observed_at":"2026-08-03T11:26:08.010806Z","submitted_at":"2026-04-08T16:06:43Z","title":"$k$-server-bench: Automating Potential Discovery for the $k$-Server Conjecture","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-10T17:48:17.363568Z"},"links":{"citing_paper":"/paper/2604.07240"},"observation_digest":"sha256:a64d3d274b7f39d95ab41c2907fe5f0812293e88f38d9d19d2337d100c7baac6","observation_id":"7a2010e6-e3b3-4419-8eb0-2ac233ca0584","resolution":{"observed_at":"2026-05-17T08:54:20.065987Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"New results on server problems","venue":null,"work_id":"6bf0b209-4fc1-4494-a84f-9c4b34a0a5a6","year":1991},"citing_paper":{"arxiv_id":"2604.07240","last_updated":"2026-04-08T16:06:43Z","snapshot_observed_at":"2026-08-03T11:26:08.010806Z","submitted_at":"2026-04-08T16:06:43Z","title":"$k$-server-bench: Automating Potential Discovery for the $k$-Server Conjecture","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-10T17:48:17.363568Z"},"links":{"citing_paper":"/paper/2604.07240"},"observation_digest":"sha256:a80d59bb78186825296bc6f3d4fc69ad214488a48a216a0bee1078f95ea57022","observation_id":"41436ae1-c0c5-48b6-a55c-2b079f9e3364","resolution":{"observed_at":"2026-05-17T08:54:20.069482Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2102.10474","last_updated":"2021-02-20T23:29:31Z","snapshot_observed_at":"2026-08-06T15:20:02.477829Z","submitted_at":"2021-02-20T23:29:31Z","title":"Towards the k-server conjecture: A unifying potential, pushing the frontier to the circle","version":1},"cited_work":{"arxiv_id":"2102.10474","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2102.10474","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"4612ef04-8ebd-4375-a6b7-f95838c73e22","year":2021},"citing_paper":{"arxiv_id":"2604.07240","last_updated":"2026-04-08T16:06:43Z","snapshot_observed_at":"2026-08-03T11:26:08.010806Z","submitted_at":"2026-04-08T16:06:43Z","title":"$k$-server-bench: Automating Potential Discovery for the $k$-Server Conjecture","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-10T17:48:17.363568Z"},"links":{"cited_paper":"/paper/2102.10474","citing_paper":"/paper/2604.07240"},"observation_digest":"sha256:4febd18551a0e6c35423d02e6cfd6b69a79806f318c758d206258744bf8a5e79","observation_id":"ceb67af9-bb80-46c5-a2a0-33c8916d5549","resolution":{"observed_at":"2026-05-11T06:05:58.161862Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Advancing mathematics by guiding human intuition with AI","venue":null,"work_id":"6ccb050a-6a55-4114-b0cb-ab721d865645","year":2021},"citing_paper":{"arxiv_id":"2604.07240","last_updated":"2026-04-08T16:06:43Z","snapshot_observed_at":"2026-08-03T11:26:08.010806Z","submitted_at":"2026-04-08T16:06:43Z","title":"$k$-server-bench: Automating Potential Discovery for the $k$-Server Conjecture","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-10T17:48:17.363568Z"},"links":{"citing_paper":"/paper/2604.07240"},"observation_digest":"sha256:8eb92d430b0710bc54e63b8cdbf1034d2bc893c7e594eac83df6d5d4182e8e1f","observation_id":"f01d649e-41ab-42aa-85c2-4b197136cd84","resolution":{"observed_at":"2026-05-17T08:54:20.080807Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2511.18828","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"80df8f63-352c-4d3d-acf1-4837ae91bc4f","year":2025},"citing_paper":{"arxiv_id":"2604.07240","last_updated":"2026-04-08T16:06:43Z","snapshot_observed_at":"2026-08-03T11:26:08.010806Z","submitted_at":"2026-04-08T16:06:43Z","title":"$k$-server-bench: Automating Potential Discovery for the $k$-Server Conjecture","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-10T17:48:17.363568Z"},"links":{"citing_paper":"/paper/2604.07240"},"observation_digest":"sha256:fed38aa08f3100904e2a612efd2b808034921b0e6b48cafeab41abb5c06711f4","observation_id":"1dfb71f0-e7c1-4b99-9b8d-13ea5b268bf9","resolution":{"observed_at":"2026-05-11T06:05:58.173669Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Epoch AI","venue":null,"work_id":"63954120-8f84-4d2e-9691-595f124558cd","year":2026},"citing_paper":{"arxiv_id":"2604.07240","last_updated":"2026-04-08T16:06:43Z","snapshot_observed_at":"2026-08-03T11:26:08.010806Z","submitted_at":"2026-04-08T16:06:43Z","title":"$k$-server-bench: Automating Potential Discovery for the $k$-Server Conjecture","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-10T17:48:17.363568Z"},"links":{"citing_paper":"/paper/2604.07240"},"observation_digest":"sha256:f3928836a40c74f66728adf7b6e6dfd1cf11885ac8fb42a1863b7c1ad5935a21","observation_id":"3cd2d430-2571-41f5-82fa-b1c2d215ec77","resolution":{"observed_at":"2026-05-17T08:54:20.058393Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2601.22401","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T18:17:33.715410Z","title":"Semi-autonomous mathematics discovery with gemini: A case study on the erd\\h{o}s problems","venue":null,"work_id":"95c9045d-95fe-42f1-a7bb-f3bd80e16dee","year":2026},"citing_paper":{"arxiv_id":"2604.07240","last_updated":"2026-04-08T16:06:43Z","snapshot_observed_at":"2026-08-03T11:26:08.010806Z","submitted_at":"2026-04-08T16:06:43Z","title":"$k$-server-bench: Automating Potential Discovery for the $k$-Server Conjecture","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-10T17:48:17.363568Z"},"links":{"citing_paper":"/paper/2604.07240"},"observation_digest":"sha256:a207caf783702f4b0494c0d8af1b10efe6b0fc8a97c8b4e38e535956361984a2","observation_id":"2b06401a-1db2-4146-87f9-f5af168e31b7","resolution":{"observed_at":"2026-05-11T06:05:58.146706Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2602.10177","doi":"10.48550/arxiv.2602.10177","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Trinh, Garrett Bingham, Dawsen Hwang, Yuri Chervonyi, Junehyuk Jung,JoonkyungLee,CarloPagano,SanghyunKim,FedericoPasqualotto,SergeiGukov, Jonathan N","venue":"Open MIND","work_id":"0431ee8d-6d79-4807-a403-990ddaa168a0","year":2026},"citing_paper":{"arxiv_id":"2604.07240","last_updated":"2026-04-08T16:06:43Z","snapshot_observed_at":"2026-08-03T11:26:08.010806Z","submitted_at":"2026-04-08T16:06:43Z","title":"$k$-server-bench: Automating Potential Discovery for the $k$-Server Conjecture","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-10T17:48:17.363568Z"},"links":{"citing_paper":"/paper/2604.07240"},"observation_digest":"sha256:6ace98caee1270aab858953671ce300709e942ca3586881d5d5f4c3fb74f2e70","observation_id":"9d0e780c-7495-46c6-8f88-ef31480d9be5","resolution":{"observed_at":"2026-05-11T06:05:58.282933Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-09T07:48:47.900841+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T07:48:47.900841+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Competitive k-server algorithms","venue":null,"work_id":"7db79c3d-c1fe-49f3-b199-159d0caa2f15","year":1994},"citing_paper":{"arxiv_id":"2604.07240","last_updated":"2026-04-08T16:06:43Z","snapshot_observed_at":"2026-08-03T11:26:08.010806Z","submitted_at":"2026-04-08T16:06:43Z","title":"$k$-server-bench: Automating Potential Discovery for the $k$-Server Conjecture","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-10T17:48:17.363568Z"},"links":{"citing_paper":"/paper/2604.07240"},"observation_digest":"sha256:1bdd021d82bbb19e3aad7ec3b84d803bcdd17de1bec5ab765715e574cadf07d1","observation_id":"819623f4-a129-449d-bce4-0a8b39f57a90","resolution":{"observed_at":"2026-05-17T08:54:20.054541Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2511.02864","last_updated":"2025-12-22T12:49:01Z","snapshot_observed_at":"2026-08-07T08:27:55.662438Z","submitted_at":"2025-11-03T16:04:07Z","title":"Mathematical exploration and discovery at scale","version":3},"cited_work":{"arxiv_id":"2511.02864","doi":"10.48550/arxiv.2511.02864","metadata_source":"pith","pith_arxiv_id":"2511.02864","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Mathematical exploration and discovery at scale","venue":"cs.NE","work_id":"b3882729-74ba-4d80-9240-bfe03c45c33b","year":2025},"citing_paper":{"arxiv_id":"2604.07240","last_updated":"2026-04-08T16:06:43Z","snapshot_observed_at":"2026-08-03T11:26:08.010806Z","submitted_at":"2026-04-08T16:06:43Z","title":"$k$-server-bench: Automating Potential Discovery for the $k$-Server Conjecture","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-10T17:48:17.363568Z"},"links":{"cited_paper":"/paper/2511.02864","citing_paper":"/paper/2604.07240"},"observation_digest":"sha256:304abfba5e5af80675c36d1d06851fb76cf8e149b90f4eeb2855db1b6e892978","observation_id":"df8bf479-8656-483d-ab1b-5bdd7559d80f","resolution":{"observed_at":"2026-05-11T06:05:58.311647Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Random Baselines for Simple Code Problems are Competitive with Code Evolution","venue":null,"work_id":"1fa79a38-bda8-4d74-94f0-d678e4b298c8","year":2025},"citing_paper":{"arxiv_id":"2604.07240","last_updated":"2026-04-08T16:06:43Z","snapshot_observed_at":"2026-08-03T11:26:08.010806Z","submitted_at":"2026-04-08T16:06:43Z","title":"$k$-server-bench: Automating Potential Discovery for the $k$-Server Conjecture","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-10T17:48:17.363568Z"},"links":{"citing_paper":"/paper/2604.07240"},"observation_digest":"sha256:d1474f45b8e02e43a29732ae0b4a9bd9ffc99419e299db09d0ca13839fc5a5ae","observation_id":"63d043a5-6d22-4f5e-b47e-3cb78c72e6a6","resolution":{"observed_at":"2026-05-17T08:54:20.046495Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.04872","last_updated":"2025-12-23T02:23:47Z","snapshot_observed_at":"2026-08-13T13:45:44.430193Z","submitted_at":"2024-11-07T17:07:35Z","title":"FrontierMath: A Benchmark for Evaluating Advanced Mathematical Reasoning in AI","version":7},"cited_work":{"arxiv_id":"2411.04872","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.04872","snapshot_observed_at":"2026-07-10T20:47:34.579097Z","title":"FrontierMath: A Benchmark for Evaluating Advanced Mathematical Reasoning in AI","venue":"cs.AI","work_id":"ad91b1d8-7c7c-4daf-8c63-8f81bb5a810a","year":2024},"citing_paper":{"arxiv_id":"2604.07240","last_updated":"2026-04-08T16:06:43Z","snapshot_observed_at":"2026-08-03T11:26:08.010806Z","submitted_at":"2026-04-08T16:06:43Z","title":"$k$-server-bench: Automating Potential Discovery for the $k$-Server Conjecture","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-10T17:48:17.363568Z"},"links":{"cited_paper":"/paper/2411.04872","citing_paper":"/paper/2604.07240"},"observation_digest":"sha256:fa2652137c9b7582fe362a5470d2103e08aad2c0a3d1f858c67630f4fc9a8bdb","observation_id":"768a1353-c835-449e-96c1-b29c33efa2ea","resolution":{"observed_at":"2026-05-17T00:44:01.791449Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2602.12176","doi":"10.48550/arxiv.2602.12176","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Guevara, A","venue":"Open MIND","work_id":"4030efd8-bd42-4edd-ac3a-2cb428c17dd2","year":2026},"citing_paper":{"arxiv_id":"2604.07240","last_updated":"2026-04-08T16:06:43Z","snapshot_observed_at":"2026-08-03T11:26:08.010806Z","submitted_at":"2026-04-08T16:06:43Z","title":"$k$-server-bench: Automating Potential Discovery for the $k$-Server Conjecture","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-10T17:48:17.363568Z"},"links":{"citing_paper":"/paper/2604.07240"},"observation_digest":"sha256:cf907599d7e55995c16269262e4768e9f054390e4ae05c63e68a169cc60fb087","observation_id":"a70e4201-8533-48b7-a946-eccfcf711dd2","resolution":{"observed_at":"2026-05-11T06:05:58.210778Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.08103","last_updated":"2022-05-17T05:49:46Z","snapshot_observed_at":"2026-08-13T15:42:56.093070Z","submitted_at":"2022-05-17T05:49:46Z","title":"Deterministic 3-Server on a Circle and the Limitation of Canonical Potentials","version":1},"cited_work":{"arxiv_id":"2205.08103","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2205.08103","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"321e54c0-6c8d-4644-95fd-cc4c4c31a549","year":2022},"citing_paper":{"arxiv_id":"2604.07240","last_updated":"2026-04-08T16:06:43Z","snapshot_observed_at":"2026-08-03T11:26:08.010806Z","submitted_at":"2026-04-08T16:06:43Z","title":"$k$-server-bench: Automating Potential Discovery for the $k$-Server Conjecture","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-10T17:48:17.363568Z"},"links":{"cited_paper":"/paper/2205.08103","citing_paper":"/paper/2604.07240"},"observation_digest":"sha256:24e6b922e570d7ab196b083fff9ae904c3b13da90a4637a00009651e26e733c9","observation_id":"641748ed-292b-4679-a7c5-4a271bc74489","resolution":{"observed_at":"2026-05-11T06:05:58.294338Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2602.02919","doi":"10.48550/arxiv.2602.02919","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"doi:10.48550/arXiv.2602.02919 , url =","venue":"Open MIND","work_id":"26739961-9b89-45d0-882f-cf12f8417eaa","year":2026},"citing_paper":{"arxiv_id":"2604.07240","last_updated":"2026-04-08T16:06:43Z","snapshot_observed_at":"2026-08-03T11:26:08.010806Z","submitted_at":"2026-04-08T16:06:43Z","title":"$k$-server-bench: Automating Potential Discovery for the $k$-Server Conjecture","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-10T17:48:17.363568Z"},"links":{"citing_paper":"/paper/2604.07240"},"observation_digest":"sha256:203d181c0096acb4324c68084d4be4253ff6a6f4d495f434ae2ab26e2d26ebcb","observation_id":"9613b8d0-2e13-445a-a88f-c8293574388e","resolution":{"observed_at":"2026-05-11T06:05:58.089178Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-05-30T18:55:21.88515+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-30T18:55:21.88515+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Thek-server problem","venue":null,"work_id":"c26dc567-b282-4f76-9f8c-e892ad6cd8b1","year":2009},"citing_paper":{"arxiv_id":"2604.07240","last_updated":"2026-04-08T16:06:43Z","snapshot_observed_at":"2026-08-03T11:26:08.010806Z","submitted_at":"2026-04-08T16:06:43Z","title":"$k$-server-bench: Automating Potential Discovery for the $k$-Server Conjecture","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-10T17:48:17.363568Z"},"links":{"citing_paper":"/paper/2604.07240"},"observation_digest":"sha256:4ae199f92cbdd3b2b52c9e3d0344d8b6f4d9bd6a1b2f246a87b7ca442187d252","observation_id":"24ccce82-e981-4f2e-b766-fb8ae7e8b7ea","resolution":{"observed_at":"2026-05-17T08:54:20.049012Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"On thek-server conjecture","venue":null,"work_id":"a0cefea1-d1f3-4efd-8259-983319d6df98","year":1995},"citing_paper":{"arxiv_id":"2604.07240","last_updated":"2026-04-08T16:06:43Z","snapshot_observed_at":"2026-08-03T11:26:08.010806Z","submitted_at":"2026-04-08T16:06:43Z","title":"$k$-server-bench: Automating Potential Discovery for the $k$-Server Conjecture","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-10T17:48:17.363568Z"},"links":{"citing_paper":"/paper/2604.07240"},"observation_digest":"sha256:03ab51a31fd1873867db1a8a30ed1d2782b76dc4898838ee0becd1c8f1eef64d","observation_id":"874812ea-10ba-45d5-a33b-f805e58cfd39","resolution":{"observed_at":"2026-05-17T08:54:20.051883Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"0998963e-4bcd-4eaa-8bad-724d817bcd72","year":null},"citing_paper":{"arxiv_id":"2604.07240","last_updated":"2026-04-08T16:06:43Z","snapshot_observed_at":"2026-08-03T11:26:08.010806Z","submitted_at":"2026-04-08T16:06:43Z","title":"$k$-server-bench: Automating Potential Discovery for the $k$-Server Conjecture","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-10T17:48:17.363568Z"},"links":{"citing_paper":"/paper/2604.07240"},"observation_digest":"sha256:a8aa0bf0c5490427571b2e47e3b8c11334e8816a3e0f0567b16a457ae85c6385","observation_id":"f8ba69e4-0960-4123-8f34-ff13577c91e2","resolution":{"observed_at":"2026-05-17T08:54:20.061648Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1912.01412","last_updated":"2019-12-02T15:05:24Z","snapshot_observed_at":"2026-08-07T08:07:25.563461Z","submitted_at":"2019-12-02T15:05:24Z","title":"Deep Learning for Symbolic Mathematics","version":1},"cited_work":{"arxiv_id":"1912.01412","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1912.01412","snapshot_observed_at":"2026-07-02T20:47:22.644628Z","title":"Lample and F","venue":null,"work_id":"31fd8fbd-1ae7-44ff-aafe-6b60ab1872b3","year":1912},"citing_paper":{"arxiv_id":"2604.07240","last_updated":"2026-04-08T16:06:43Z","snapshot_observed_at":"2026-08-03T11:26:08.010806Z","submitted_at":"2026-04-08T16:06:43Z","title":"$k$-server-bench: Automating Potential Discovery for the $k$-Server Conjecture","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-10T17:48:17.363568Z"},"links":{"cited_paper":"/paper/1912.01412","citing_paper":"/paper/2604.07240"},"observation_digest":"sha256:45e4295aa1e506ca817e62f3ead6af6e20c47bae746cce322aa7741fe5659aa0","observation_id":"631006c5-6fb6-4f93-a0d1-e9d5346b3c9b","resolution":{"observed_at":"2026-05-11T06:05:58.127984Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2509.19349","last_updated":"2025-09-17T17:49:02Z","snapshot_observed_at":"2026-08-12T18:56:15.144016Z","submitted_at":"2025-09-17T17:49:02Z","title":"ShinkaEvolve: Towards Open-Ended And Sample-Efficient Program Evolution","version":1},"cited_work":{"arxiv_id":"2509.19349","doi":null,"metadata_source":"pith","pith_arxiv_id":"2509.19349","snapshot_observed_at":"2026-07-04T20:00:08.586809Z","title":"ShinkaEvolve: Towards Open-Ended And Sample-Efficient Program Evolution","venue":"cs.CL","work_id":"41f30c7f-ee82-49b7-9ce9-463d3124269c","year":2025},"citing_paper":{"arxiv_id":"2604.07240","last_updated":"2026-04-08T16:06:43Z","snapshot_observed_at":"2026-08-03T11:26:08.010806Z","submitted_at":"2026-04-08T16:06:43Z","title":"$k$-server-bench: Automating Potential Discovery for the $k$-Server Conjecture","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-10T17:48:17.363568Z"},"links":{"cited_paper":"/paper/2509.19349","citing_paper":"/paper/2604.07240"},"observation_digest":"sha256:ffbbd3e7dacc2138429dc43da1ed70192c6df9dbbac9190a09bf6717692d216c","observation_id":"e39590a1-06c5-402c-b694-81b99885bb10","resolution":{"observed_at":"2026-05-16T13:58:59.364492Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.06292","last_updated":"2024-09-01T00:41:18Z","snapshot_observed_at":"2026-07-06T18:59:43.564435Z","submitted_at":"2024-08-12T16:58:11Z","title":"The AI Scientist: Towards Fully Automated Open-Ended Scientific Discovery","version":3},"cited_work":{"arxiv_id":"2408.06292","doi":"10.48550/arxiv.2408.06292","metadata_source":"pith","pith_arxiv_id":"2408.06292","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"The AI Scientist: Towards Fully Automated Open-Ended Scientific Discovery","venue":"cs.AI","work_id":"56b6b58d-e73a-4317-896e-36ac5f84e957","year":2024},"citing_paper":{"arxiv_id":"2604.07240","last_updated":"2026-04-08T16:06:43Z","snapshot_observed_at":"2026-08-03T11:26:08.010806Z","submitted_at":"2026-04-08T16:06:43Z","title":"$k$-server-bench: Automating Potential Discovery for the $k$-Server Conjecture","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-10T17:48:17.363568Z"},"links":{"cited_paper":"/paper/2408.06292","citing_paper":"/paper/2604.07240"},"observation_digest":"sha256:53dde75577dc8a418fa68f5d9d600ac6ddeb6a0f4fb3f782b4e27bc81064922a","observation_id":"87a0b853-8e44-4a22-894b-1ea867171e8a","resolution":{"observed_at":"2026-05-11T06:05:58.083789Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-05-25T19:23:20.611352+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T19:23:20.611352+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"pii/0196677","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"10 Alexander Grigoriev and Hans L Bodlaender","venue":null,"work_id":"3d0c90fd-61ef-44af-8fee-6cbef7041958","year":1985},"citing_paper":{"arxiv_id":"2604.07240","last_updated":"2026-04-08T16:06:43Z","snapshot_observed_at":"2026-08-03T11:26:08.010806Z","submitted_at":"2026-04-08T16:06:43Z","title":"$k$-server-bench: Automating Potential Discovery for the $k$-Server Conjecture","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-10T17:48:17.363568Z"},"links":{"citing_paper":"/paper/2604.07240"},"observation_digest":"sha256:e7b3ea642c3042b165abad1fe249222750fbc7d3d26f7f6b5499e4ad32223621","observation_id":"651a1593-4031-4f1a-a911-de3641e35a7d","resolution":{"observed_at":"2026-05-11T06:05:58.221073Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2509.18057","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-04T05:49:37.525629Z","title":"Reinforced generation of combinatorial structures: Hardness of approximation","venue":null,"work_id":"be4801a6-343c-4dd6-b704-1860500ac519","year":2026},"citing_paper":{"arxiv_id":"2604.07240","last_updated":"2026-04-08T16:06:43Z","snapshot_observed_at":"2026-08-03T11:26:08.010806Z","submitted_at":"2026-04-08T16:06:43Z","title":"$k$-server-bench: Automating Potential Discovery for the $k$-Server Conjecture","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-10T17:48:17.363568Z"},"links":{"citing_paper":"/paper/2604.07240"},"observation_digest":"sha256:9323facd8c7a4436716ab632f4157166ab772203c74e58256538cd08f12ba734","observation_id":"bce3b57f-800c-4bcd-9ed5-8ac37870ca61","resolution":{"observed_at":"2026-05-11T06:05:58.244215Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2603.09172","last_updated":"2026-04-21T16:45:32Z","snapshot_observed_at":"2026-07-06T22:48:26.306802Z","submitted_at":"2026-03-10T04:20:40Z","title":"Reinforced Generation of Combinatorial Structures: Ramsey Numbers","version":5},"cited_work":{"arxiv_id":"2603.09172","doi":"10.48550/arxiv.2603.09172","metadata_source":"pith","pith_arxiv_id":"2603.09172","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Reinforced Generation of Combinatorial Structures: Ramsey Numbers","venue":"math.CO","work_id":"8b6b6189-c4f9-40dc-b9cd-4aebf237eed8","year":2026},"citing_paper":{"arxiv_id":"2604.07240","last_updated":"2026-04-08T16:06:43Z","snapshot_observed_at":"2026-08-03T11:26:08.010806Z","submitted_at":"2026-04-08T16:06:43Z","title":"$k$-server-bench: Automating Potential Discovery for the $k$-Server Conjecture","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-10T17:48:17.363568Z"},"links":{"cited_paper":"/paper/2603.09172","citing_paper":"/paper/2604.07240"},"observation_digest":"sha256:f70e350681d4a9b9c89521ec5f1d0d23f138fbefbe1d607fc5b847a17bf84d2f","observation_id":"25c3b642-04d7-4050-8b6a-61fa7870184e","resolution":{"observed_at":"2026-05-11T06:05:58.094184Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.13131","last_updated":"2025-06-16T06:37:18Z","snapshot_observed_at":"2026-08-11T23:48:15.512738Z","submitted_at":"2025-06-16T06:37:18Z","title":"AlphaEvolve: A coding agent for scientific and algorithmic discovery","version":1},"cited_work":{"arxiv_id":"2506.13131","doi":"10.1016/j.shpsa.2017.03.005","metadata_source":"pith","pith_arxiv_id":"2506.13131","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"AlphaEvolve: A coding agent for scientific and algorithmic discovery","venue":"cs.AI","work_id":"76a0f850-d490-4e4f-ab98-8d25df82cd23","year":2025},"citing_paper":{"arxiv_id":"2604.07240","last_updated":"2026-04-08T16:06:43Z","snapshot_observed_at":"2026-08-03T11:26:08.010806Z","submitted_at":"2026-04-08T16:06:43Z","title":"$k$-server-bench: Automating Potential Discovery for the $k$-Server Conjecture","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-10T17:48:17.363568Z"},"links":{"cited_paper":"/paper/2506.13131","citing_paper":"/paper/2604.07240"},"observation_digest":"sha256:5ef8e9f8b61e70a698f6bf81613bd09bd30470db1223ca07520ede0cb7ae8875","observation_id":"529a5899-0a04-41f7-b0b2-848f9cea9faf","resolution":{"observed_at":"2026-05-11T06:05:58.193799Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2005.01917","last_updated":"2020-08-17T22:01:54Z","snapshot_observed_at":"2026-07-06T09:17:39.683454Z","submitted_at":"2020-05-05T02:27:00Z","title":"Learning selection strategies in Buchberger's algorithm","version":3},"cited_work":{"arxiv_id":"2005.01917","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2005.01917","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"9120d4a1-d713-4ea7-9825-41fde955b73f","year":2020},"citing_paper":{"arxiv_id":"2604.07240","last_updated":"2026-04-08T16:06:43Z","snapshot_observed_at":"2026-08-03T11:26:08.010806Z","submitted_at":"2026-04-08T16:06:43Z","title":"$k$-server-bench: Automating Potential Discovery for the $k$-Server Conjecture","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-10T17:48:17.363568Z"},"links":{"cited_paper":"/paper/2005.01917","citing_paper":"/paper/2604.07240"},"observation_digest":"sha256:587b31fa453f4801274219590924400d8cf16285f15267875643e5eedb528963","observation_id":"d2fd2bf0-5bf6-4303-8d7b-39abd958fce9","resolution":{"observed_at":"2026-05-11T06:05:58.204411Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Mathematical discoveries from program search with large language models","venue":null,"work_id":"0a006aa6-06d2-4479-b16a-68f98142577c","year":2024},"citing_paper":{"arxiv_id":"2604.07240","last_updated":"2026-04-08T16:06:43Z","snapshot_observed_at":"2026-08-03T11:26:08.010806Z","submitted_at":"2026-04-08T16:06:43Z","title":"$k$-server-bench: Automating Potential Discovery for the $k$-Server Conjecture","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-10T17:48:17.363568Z"},"links":{"citing_paper":"/paper/2604.07240"},"observation_digest":"sha256:0543b8af1a632367272eab86b25aa6182167bf0d3333a1b37c03f09107d26d2b","observation_id":"dc2a6f50-cdf6-462e-92c2-76cd80082fc1","resolution":{"observed_at":"2026-05-17T08:54:20.072922Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"2025.url: https://github.com/algorithmicsuperintelligence/openevolve","venue":null,"work_id":"d8894094-5b07-4342-a97c-8a87ed08a60e","year":2025},"citing_paper":{"arxiv_id":"2604.07240","last_updated":"2026-04-08T16:06:43Z","snapshot_observed_at":"2026-08-03T11:26:08.010806Z","submitted_at":"2026-04-08T16:06:43Z","title":"$k$-server-bench: Automating Potential Discovery for the $k$-Server Conjecture","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-10T17:48:17.363568Z"},"links":{"citing_paper":"/paper/2604.07240"},"observation_digest":"sha256:c2cc03feb5549b2b9f1313e474a0237af57c64667c8a923680827baa4c0548bf","observation_id":"a28f8f00-9fc4-4ad8-9c64-0bfae2465312","resolution":{"observed_at":"2026-05-17T08:54:20.043295Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"c8c9045f-7191-4363-8272-b6c35348bc40","year":2026},"citing_paper":{"arxiv_id":"2604.07240","last_updated":"2026-04-08T16:06:43Z","snapshot_observed_at":"2026-08-03T11:26:08.010806Z","submitted_at":"2026-04-08T16:06:43Z","title":"$k$-server-bench: Automating Potential Discovery for the $k$-Server Conjecture","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-10T17:48:17.363568Z"},"links":{"citing_paper":"/paper/2604.07240"},"observation_digest":"sha256:8f80e8d33dcfe43b139f57f5665fb40de3df022d6900cd0c9c7ee40f75108a67","observation_id":"223296a6-393e-4b52-ae49-a8afd3d596fc","resolution":{"observed_at":"2026-05-17T08:54:20.037785Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.05108","last_updated":"2025-08-04T13:41:35Z","snapshot_observed_at":"2026-08-13T02:05:34.894777Z","submitted_at":"2025-04-07T14:14:15Z","title":"Algorithm Discovery With LLMs: Evolutionary Search Meets Reinforcement Learning","version":4},"cited_work":{"arxiv_id":"2504.05108","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.05108","snapshot_observed_at":"2026-07-01T23:16:23.680321Z","title":"arXiv preprint arXiv:2504.05108 , year=","venue":"cs.AI","work_id":"99cb928e-072e-4f23-b18b-e510aa9529fb","year":2025},"citing_paper":{"arxiv_id":"2604.07240","last_updated":"2026-04-08T16:06:43Z","snapshot_observed_at":"2026-08-03T11:26:08.010806Z","submitted_at":"2026-04-08T16:06:43Z","title":"$k$-server-bench: Automating Potential Discovery for the $k$-Server Conjecture","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-10T17:48:17.363568Z"},"links":{"cited_paper":"/paper/2504.05108","citing_paper":"/paper/2604.07240"},"observation_digest":"sha256:ca957e095da5babe59f6c7d5d350c0f2ae19d5d12d5a96a29f8938eb9010111c","observation_id":"e521f4ec-6c4f-4b97-b428-9a2b8870a1a6","resolution":{"observed_at":"2026-05-26T03:03:09.892884Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2104.14516","last_updated":"2021-04-29T17:32:56Z","snapshot_observed_at":"2026-08-13T23:31:29.044748Z","submitted_at":"2021-04-29T17:32:56Z","title":"Constructions in combinatorics via neural networks","version":1},"cited_work":{"arxiv_id":"2104.14516","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2104.14516","snapshot_observed_at":"2026-07-04T15:39:56.696477Z","title":"ArXiv abs/2104.14516 (2021)","venue":null,"work_id":"4dfb898c-d69f-4278-9022-bf903e72cef6","year":2021},"citing_paper":{"arxiv_id":"2604.07240","last_updated":"2026-04-08T16:06:43Z","snapshot_observed_at":"2026-08-03T11:26:08.010806Z","submitted_at":"2026-04-08T16:06:43Z","title":"$k$-server-bench: Automating Potential Discovery for the $k$-Server Conjecture","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-10T17:48:17.363568Z"},"links":{"cited_paper":"/paper/2104.14516","citing_paper":"/paper/2604.07240"},"observation_digest":"sha256:bcea7146dc9355a6d7e36abdc83d5ec637379dde932be8bd383d70afd6bffd8b","observation_id":"95e3724f-775f-492c-83d2-6f170646829d","resolution":{"observed_at":"2026-05-11T06:05:58.112559Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2512.24077","doi":"10.48550/arxiv.2512.24077","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Loongflow: Directed evolutionary search via a cognitive plan-execute-summarize paradigm","venue":"arXiv (Cornell University)","work_id":"75539853-160d-4d1c-89f4-8f0a41850048","year":2025},"citing_paper":{"arxiv_id":"2604.07240","last_updated":"2026-04-08T16:06:43Z","snapshot_observed_at":"2026-08-03T11:26:08.010806Z","submitted_at":"2026-04-08T16:06:43Z","title":"$k$-server-bench: Automating Potential Discovery for the $k$-Server Conjecture","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-10T17:48:17.363568Z"},"links":{"citing_paper":"/paper/2604.07240"},"observation_digest":"sha256:2b1c8c9dc77aaf6edf43e36e8352fbfeb306166f789a018af422a94c9da506dc","observation_id":"ac8e26b1-39cb-4d26-86ad-57273b3c8b90","resolution":{"observed_at":"2026-05-11T06:05:58.104969Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2511.23473","last_updated":"2025-11-28T18:58:14Z","snapshot_observed_at":"2026-08-04T17:31:45.294646Z","submitted_at":"2025-11-28T18:58:14Z","title":"ThetaEvolve: Test-time Learning on Open Problems","version":1},"cited_work":{"arxiv_id":"2511.23473","doi":"10.48550/arxiv.2511.23473","metadata_source":"pith","pith_arxiv_id":"2511.23473","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"ThetaEvolve: Test-time Learning on Open Problems","venue":"cs.LG","work_id":"0c9ee4af-c6aa-47e7-b1cc-863823529ecb","year":2025},"citing_paper":{"arxiv_id":"2604.07240","last_updated":"2026-04-08T16:06:43Z","snapshot_observed_at":"2026-08-03T11:26:08.010806Z","submitted_at":"2026-04-08T16:06:43Z","title":"$k$-server-bench: Automating Potential Discovery for the $k$-Server Conjecture","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-10T17:48:17.363568Z"},"links":{"cited_paper":"/paper/2511.23473","citing_paper":"/paper/2604.07240"},"observation_digest":"sha256:ebb7a0d9f68670183796d02bfb4df34bb4191275815436e854a7b375502646d8","observation_id":"2897c87d-055d-45e3-a706-ea95dfd78b8e","resolution":{"observed_at":"2026-05-16T13:16:27.444222Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Online Matching with Stochastic Rewards: Provable Better Bound via Adversarial Reinforcement Learning","venue":null,"work_id":"d67f970d-0f25-4491-9f3a-fc90aef1b914","year":2024},"citing_paper":{"arxiv_id":"2604.07240","last_updated":"2026-04-08T16:06:43Z","snapshot_observed_at":"2026-08-03T11:26:08.010806Z","submitted_at":"2026-04-08T16:06:43Z","title":"$k$-server-bench: Automating Potential Discovery for the $k$-Server Conjecture","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-05-10T17:48:17.363568Z"},"links":{"citing_paper":"/paper/2604.07240"},"observation_digest":"sha256:3bb94b85a430c6587ab63fbdb5601d578edca3ca3e7b9133c573f40a577a47b9","observation_id":"fa3419c3-0a44-4369-9b8b-041e3899768e","resolution":{"observed_at":"2026-05-17T08:54:20.040626Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2505.13259","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-04T13:29:51.417585Z","title":"arXiv preprint arXiv:2505.13259 , year =","venue":null,"work_id":"631dea7e-c36b-4852-a827-bf6b15ebf453","year":2025},"citing_paper":{"arxiv_id":"2604.07240","last_updated":"2026-04-08T16:06:43Z","snapshot_observed_at":"2026-08-03T11:26:08.010806Z","submitted_at":"2026-04-08T16:06:43Z","title":"$k$-server-bench: Automating Potential Discovery for the $k$-Server Conjecture","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-05-10T17:48:17.363568Z"},"links":{"citing_paper":"/paper/2604.07240"},"observation_digest":"sha256:fb21c5e04b9c777cc9f803d1bf9010a69db5f229bb6e20261842becc8cf7fd3b","observation_id":"d79f8a0b-6293-482f-8421-42589db83863","resolution":{"observed_at":"2026-05-11T06:05:58.269344Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"bcd0b663-a0bc-429f-935c-5da60eb13de1","year":null},"citing_paper":{"arxiv_id":"2604.07240","last_updated":"2026-04-08T16:06:43Z","snapshot_observed_at":"2026-08-03T11:26:08.010806Z","submitted_at":"2026-04-08T16:06:43Z","title":"$k$-server-bench: Automating Potential Discovery for the $k$-Server Conjecture","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-05-10T17:48:17.363568Z"},"links":{"citing_paper":"/paper/2604.07240"},"observation_digest":"sha256:00128d8dfca13833b196dd23944cd13b12a1895bce5d75b356c55c6e1b6e6bbd","observation_id":"8193bc31-ecab-4cf5-bfec-97eaad5bff8c","resolution":{"observed_at":"2026-05-17T08:54:20.035204Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"9160.9830","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"\"\" Maps ‘config‘ (a tuple of point indices) to its index in the work-function vector, i.e., w(C) = wf[idx] where config_to_idx(C) = idx","venue":null,"work_id":"9b0a2826-22d5-47ef-a1fe-338b2bc7cb27","year":2020},"citing_paper":{"arxiv_id":"2604.07240","last_updated":"2026-04-08T16:06:43Z","snapshot_observed_at":"2026-08-03T11:26:08.010806Z","submitted_at":"2026-04-08T16:06:43Z","title":"$k$-server-bench: Automating Potential Discovery for the $k$-Server Conjecture","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-05-10T17:48:17.363568Z"},"links":{"citing_paper":"/paper/2604.07240"},"observation_digest":"sha256:d6a03f058e01308d04b3bd07bfa864577dcca157cd4e7e15ad43b3bc624d54bd","observation_id":"c2778d67-d97e-44b3-9fb4-4a3901167c47","resolution":{"observed_at":"2026-05-11T06:05:58.305352Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2604.07240","last_updated":"2026-04-08T16:06:43Z","latest_version":1,"primary_category":"cs.MS","snapshot_observed_at":"2026-08-03T11:26:08.010806Z","submitted_at":"2026-04-08T16:06:43Z","title":"$k$-server-bench: Automating Potential Discovery for the $k$-Server Conjecture"},"reference_resolution":{"displayed":46,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":3,"verified_exact":29,"verified_fuzzy":13},"total_outbound_references":46},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 46 of 46 outbound references and 0 inbound Pith citation observations for arXiv:2604.07240."}