{"as_of":"2026-08-11T16:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6f0ddef58072a4aa809e88b968a35fa57f4c156b1260eaa1f3c5eefcec926b38","coverage":[{"denominator":60,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":60,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T13:47:19.414647Z","state":"measured"},{"denominator":60,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":60,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+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/2501.16130/citation-record","integrity":"/paper/2501.16130/integrity","json":"/paper/2501.16130/citation-record.json","paper":"/paper/2501.16130"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1611.03199","last_updated":"2016-11-10T07:00:43Z","snapshot_observed_at":"2026-07-06T05:18:06.069149Z","submitted_at":"2016-11-10T07:00:43Z","title":"Low Data Drug Discovery with One-shot Learning","version":1},"cited_work":{"arxiv_id":"1611.03199","doi":null,"metadata_source":"pith","pith_arxiv_id":"1611.03199","snapshot_observed_at":"2026-08-10T13:47:19.704971Z","title":"Low Data Drug Discovery with One-shot Learning","venue":"cs.LG","work_id":"cc446ef2-2221-4bf9-8bea-1baedb8a6022","year":2016},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.041249Z"},"links":{"cited_paper":"/paper/1611.03199","citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:37ed23235b8343c2bb42951e59c44f4d92ca0e231d08bfc56d6aa9f414c32c31","observation_id":"3efa0f25-12c8-4c37-9792-523fa961c227","resolution":{"observed_at":"2026-08-10T13:47:19.711443Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T13:47:20.612520Z","title":"Amestoy, Timothy A","venue":null,"work_id":"52032c02-88e1-498d-b701-e99afdb84365","year":1996},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.048532Z"},"links":{"citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:706777096d1f195e2b927330df7942fcb14f4fff205bba2006e82096e54d3c75","observation_id":"2701a711-0efb-468f-acc1-b6ed0db7c7fa","resolution":{"observed_at":"2026-08-10T13:47:20.617739Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.16976","last_updated":"2023-06-29T14:31:07Z","snapshot_observed_at":"2026-08-11T05:25:00.712944Z","submitted_at":"2023-06-29T14:31:07Z","title":"Diffusion-Jump GNNs: Homophiliation via Learnable Metric Filters","version":1},"cited_work":{"arxiv_id":"2306.16976","doi":null,"metadata_source":"pith","pith_arxiv_id":"2306.16976","snapshot_observed_at":"2026-08-10T13:47:19.666807Z","title":"Diffusion-Jump GNNs: Homophiliation via Learnable Metric Filters","venue":"cs.LG","work_id":"d88772eb-00f9-4abd-8813-a85d87b2dc59","year":2023},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.054499Z"},"links":{"cited_paper":"/paper/2306.16976","citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:566ff2ed75d4996fcba724209c566e37a83d0f19f0e34409f82c6b3f85c62e61","observation_id":"d4365d53-8873-4f8c-a1b2-b8038ee7f282","resolution":{"observed_at":"2026-08-10T13:47:19.675020Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T13:47:20.588935Z","title":"Machine learning for combinatorial optimization: A methodological tour d’horizon","venue":null,"work_id":"405bb8c8-c599-4ee2-83bc-82ce0f6c6584","year":2021},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.066937Z"},"links":{"citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:39009112d1e2ecf3854ab2040cd9e191e77a882a5156c6dd15b9448b2236b37f","observation_id":"c3b73a1e-fd24-4bc4-8e17-c1033ae01318","resolution":{"observed_at":"2026-08-10T13:47:20.595911Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T13:47:20.568297Z","title":"Lower bounds for the parameterized complexity of minimum fill-in and other completion problems","venue":null,"work_id":"37ef0200-3956-49e3-980e-e26546917dc4","year":2020},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.072641Z"},"links":{"citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:eb9b4843277563ac17d6cf60496141099ac710f0b31305c3acfcb9b07668e9c0","observation_id":"e819e234-4b97-4231-a168-88c8135871bc","resolution":{"observed_at":"2026-08-10T13:47:20.575053Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T13:47:20.547583Z","title":"Boisvert, Roldan Pozo, Karin Remington, Richard F","venue":null,"work_id":"f9fba54e-0f11-4f1c-ab96-b48b0a2b5a74","year":1997},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.078630Z"},"links":{"citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:2ca34f886903e0f4330b93b00bb3beee82ef600c640a3ee38964cce1ed9a395c","observation_id":"2c415c71-359c-427d-8e63-b0b199832bb8","resolution":{"observed_at":"2026-08-10T13:47:20.555202Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T13:47:20.525732Z","title":"State-of-the-art sparse direct solvers","venue":null,"work_id":"4b04d7cc-fce5-4927-a758-81a3a4444a23","year":2020},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.085177Z"},"links":{"citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:60c547b62e4c098c0287f7b30e887c93c081387fa8ff34621d41da14ac91423d","observation_id":"edc84346-af9d-4edf-bda3-185692e16bcf","resolution":{"observed_at":"2026-08-10T13:47:20.532109Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T13:47:20.499881Z","title":"A Journey through the History of Numerical Linear Algebra","venue":null,"work_id":"435ccb3d-2530-4bfa-8d13-78a8f077f864","year":2022},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.092110Z"},"links":{"citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:a1fbf8064a85ac20100cd5bc58fba494889b84abfa0c4322f27fbec49dfc68a6","observation_id":"5aa679b8-c00f-46ae-bde2-f70567a06898","resolution":{"observed_at":"2026-08-10T13:47:20.508579Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T13:47:20.478648Z","title":null,"venue":null,"work_id":"018d6a6f-ec8e-4bdd-9582-faf6bcd429c2","year":2020},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.098827Z"},"links":{"citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:bdf519f87ba51ae35ee034f81a5733c7829f48f0d81c0eaec5481fee890935bf","observation_id":"9a75f58f-dbad-42e5-afb2-bfbd466530d2","resolution":{"observed_at":"2026-08-10T13:47:20.485025Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T13:47:20.460401Z","title":"Simple and deep graph convolutional networks","venue":null,"work_id":"4f2c09d2-b691-4898-8d6c-77e5b064cb87","year":2020},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.104496Z"},"links":{"citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:4d35379ade16ca7c066b2b3ba70b4e3e1255897dd89f1947851c2098ed450c56","observation_id":"a227df07-a0ac-4f5a-9d34-b6bc9746ccb8","resolution":{"observed_at":"2026-08-10T13:47:20.466281Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T13:47:20.440913Z","title":"Supervised community detection with line graph neural networks","venue":null,"work_id":"1e746c73-6c16-4f13-9a91-3a0c90b3aca5","year":2019},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.119642Z"},"links":{"citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:2ec28d301888a65cf7a99e4d4445813cf49501685b3cecdc57d74773be5d6be5","observation_id":"1bdabbf1-70ca-4ee3-8808-2e0252c7acc3","resolution":{"observed_at":"2026-08-10T13:47:20.446245Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T13:47:20.421894Z","title":"A survey of parameterized algorithms and the complexity of edge modification","venue":null,"work_id":"18396e60-fa6e-4d2b-8c8f-008ff8fc968b","year":2023},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.129404Z"},"links":{"citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:175e2307a8ea15c54334cc40a4ff61854e230db23e0e63a8f27be71b324c8867","observation_id":"ac17c307-d46b-4e5f-9cd2-a00e7ffa2ed7","resolution":{"observed_at":"2026-08-10T13:47:20.427682Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T13:47:20.405045Z","title":"A fast minimum degree algorithm and matching lower bound","venue":null,"work_id":"24ab07f6-f712-44da-b396-63610d8e94b2","year":2021},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.137879Z"},"links":{"citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:986855317e802de7766443ccf9227977ce77e3dec3b47cd4cadf5cdc336d4bf2","observation_id":"61d55f4f-a411-4e59-93e8-6eb3df41be83","resolution":{"observed_at":"2026-08-10T13:47:20.410674Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T13:47:20.387290Z","title":"Graph reinforcement learning for combinatorial optimization: A survey and unifying perspective, 2024","venue":null,"work_id":"c227ea72-ac14-4cc1-bf7b-329a604ef94d","year":2024},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.145361Z"},"links":{"citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:f9f8199200b47854b9c1202a5d7286e87dcf29406e0b9e455976aa1c5b57e94d","observation_id":"cdc200fb-d6c6-4355-ba4a-b8fd951c5f2f","resolution":{"observed_at":"2026-08-10T13:47:20.393119Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T13:47:20.365604Z","title":"The PACE 2017 Parameterized Algorithms and Computational Experiments Challenge: The Second Iteration","venue":null,"work_id":"0dbc818c-0218-4d4d-a708-58f4c0c18454","year":2017},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.150859Z"},"links":{"citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:93a2baa0004239993c6276284b9f926770d342260ab3ff149e13d4b8a65fe90a","observation_id":"bdbd0dfc-862f-4148-936b-7080b3fbad2a","resolution":{"observed_at":"2026-08-10T13:47:20.373021Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2003.00982","last_updated":"2022-12-28T04:57:24Z","snapshot_observed_at":"2026-08-10T00:17:51.124629Z","submitted_at":"2020-03-02T15:58:46Z","title":"Benchmarking Graph Neural Networks","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2003.00982","snapshot_observed_at":"2026-08-10T13:47:19.158998Z","title":"Joshi, Thomas Laurent, Yoshua Bengio, and Xavier Bresson","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.158998Z"},"links":{"cited_paper":"/paper/2003.00982","citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:b511a2eae4a479bf27abd4352fd7308e07747a863dc58881748cb2e837d13903","observation_id":"4152b5b1-76c3-440e-9649-febe1ffea7b2","resolution":{"observed_at":"2026-08-10T13:47:19.158998Z","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-10T13:47:20.345856Z","title":"Nested dissection of a regular finite element mesh","venue":null,"work_id":"f78b4eb8-2102-45b8-9488-8ea7218ead19","year":1973},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.164683Z"},"links":{"citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:06664b4a0eeba92e036159e141cfbc6cf46b4b6b7beebcdc4f49728d3a32bc48","observation_id":"d729b191-fef2-41a0-b359-c69334c9e510","resolution":{"observed_at":"2026-08-10T13:47:20.351134Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T13:47:20.329581Z","title":"Pande, and Jure Leskovec","venue":null,"work_id":"6557e1d0-b977-4fc6-a80e-dacbc45b261c","year":2020},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.170258Z"},"links":{"citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:cdc5c717c336de37c5db29f919e946e79b6d63cbf47e653b68457a758d9304b2","observation_id":"974b8e71-4997-4b9a-97b3-a98e62cc767e","resolution":{"observed_at":"2026-08-10T13:47:20.334876Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T13:47:20.309409Z","title":"A closer look at invalid action masking in policy gradient algorithms","venue":null,"work_id":"e193fe46-19ef-44e1-a3c0-e65aefd2f5dd","year":2020},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.175543Z"},"links":{"citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:27bf62fe7f4f132098eae6b6c1ddb4756180b8a20d2d349fdaf7128123e0ee8a","observation_id":"12003577-09a1-4c29-bc20-14a511a02bac","resolution":{"observed_at":"2026-08-10T13:47:20.317371Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T13:47:20.292322Z","title":"Optimization of graph neural networks with natural gradient descent","venue":null,"work_id":"5a6028af-27d9-4996-a1e9-51e2546722ca","year":2020},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.181955Z"},"links":{"citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:85a7a4906e7cce1596be41f5b343c0a944e3c7ca014497d8c35b363a5e173c1a","observation_id":"aa792eb5-35aa-4d41-b635-8955766c5f64","resolution":{"observed_at":"2026-08-10T13:47:20.297661Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1906.01227","last_updated":"2019-10-14T11:31:45Z","snapshot_observed_at":"2026-08-06T10:54:26.264740Z","submitted_at":"2019-06-04T06:51:45Z","title":"An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.01227","snapshot_observed_at":"2026-08-10T13:47:19.187472Z","title":"An efficient graph convolutional network technique for the travelling salesman problem","venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.187472Z"},"links":{"cited_paper":"/paper/1906.01227","citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:a17ad491695bff556f665b0d1fae91c41d38d4e7fb18c29bc55632a1d536dfd2","observation_id":"2d52ba68-c024-4bcd-98f6-fd169585def1","resolution":{"observed_at":"2026-08-10T13:47:19.187472Z","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-10T13:47:20.274441Z","title":"Learning combinatorial optimization algorithms over graphs","venue":null,"work_id":"873c0087-0286-4876-b55c-68b68c50f023","year":2017},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.193628Z"},"links":{"citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:55e73fb40535152acd604512642aa98303e6d8d33629a076d6f5ded7ce33b0bf","observation_id":"dc460c18-689d-4533-8370-186ea8ef6276","resolution":{"observed_at":"2026-08-10T13:47:20.279977Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1611.07308","last_updated":"2016-11-21T11:37:17Z","snapshot_observed_at":"2026-08-06T06:17:37.090691Z","submitted_at":"2016-11-21T11:37:17Z","title":"Variational Graph Auto-Encoders","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.07308","snapshot_observed_at":"2026-08-10T13:47:19.198641Z","title":"Kipf and Max Welling","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.198641Z"},"links":{"cited_paper":"/paper/1611.07308","citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:88c0fe72a26e855695c1a9c23c137a60cffde91296d6f835f47f7fc5b91da18a","observation_id":"354f6319-cd4a-4169-9f64-8177ac879179","resolution":{"observed_at":"2026-08-10T13:47:19.198641Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T13:47:19.204483Z","title":"Kipf and Max Welling","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.204483Z"},"links":{"citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:ae4d45f2ca4acaad72be851a03bf4f1e6fa836b858390f1c90c73f172eb1caae","observation_id":"b803f33e-0c51-4a10-bc70-54111c150bc4","resolution":{"observed_at":"2026-08-10T13:47:19.204483Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1803.08475","last_updated":"2019-02-07T09:10:08Z","snapshot_observed_at":"2026-07-06T06:29:42.428021Z","submitted_at":"2018-03-22T17:22:24Z","title":"Attention, Learn to Solve Routing Problems!","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.08475","snapshot_observed_at":"2026-08-10T13:47:19.209548Z","title":"Attention, learn to solve routing problems! arXiv preprint arXiv:1803.08475, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.209548Z"},"links":{"cited_paper":"/paper/1803.08475","citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:913bc6c79fd8e12ef4022c6849b3c48bcbfbfc1f74254a3e8ffd6eaf927612ba","observation_id":"19ebb620-7c73-4556-9a43-c5d5eeea6886","resolution":{"observed_at":"2026-08-10T13:47:19.209548Z","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-10T13:47:20.246475Z","title":"Bronstein","venue":null,"work_id":"39f1a06d-5465-409d-af1b-4f3063b702fd","year":2019},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.214739Z"},"links":{"citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:e8e1a04443d4889d5f4dd8459899d0419837ea6a179ec6d097735b3959221568","observation_id":"b2cbb67a-9e26-4d63-8ca4-f3d500c35440","resolution":{"observed_at":"2026-08-10T13:47:20.251529Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T13:47:20.227284Z","title":null,"venue":null,"work_id":"049cb108-3c2f-4a10-87dd-ab0ac2d4d927","year":2016},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.219839Z"},"links":{"citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:5e6e0e326285b6d9d2454683bc9bce8fe86a4cdb51aabe53b4dd87b344456ad7","observation_id":"d6219de6-247c-42ee-a4ee-f26372eef381","resolution":{"observed_at":"2026-08-10T13:47:20.232655Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T13:47:20.210942Z","title":null,"venue":null,"work_id":"c233a407-c6ef-4b11-97f0-42ae06619e49","year":1985},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.230622Z"},"links":{"citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:f839cd6589419f46b2b59e9dd6dc921589b23da560ba7abf008897f25e3a3505","observation_id":"cd6d801c-76e9-4f31-b7a1-74d75e4716dd","resolution":{"observed_at":"2026-08-10T13:47:20.215836Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2109.05641","last_updated":"2021-09-12T23:57:05Z","snapshot_observed_at":"2026-08-06T17:45:44.000243Z","submitted_at":"2021-09-12T23:57:05Z","title":"Is Heterophily A Real Nightmare For Graph Neural Networks To Do Node Classification?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2109.05641","snapshot_observed_at":"2026-08-10T13:47:19.236692Z","title":"Is heterophily A real nightmare for graph neural networks to do node classification? CoRR, abs/2109.05641, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.236692Z"},"links":{"cited_paper":"/paper/2109.05641","citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:73f1a20f0984905a8276beb9639e716b607cc8622f7063c018626fa751428138","observation_id":"742977bc-e0c3-41d2-98da-55618f68c68a","resolution":{"observed_at":"2026-08-10T13:47:19.236692Z","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-10T13:47:20.194057Z","title":"Streaming graph neural networks","venue":null,"work_id":"03d08b9e-eee3-4b13-ad08-2acaaec33538","year":2020},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.243101Z"},"links":{"citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:20145384c5e4c2d11d8007c2b6df1dbbf1c72e1e5cac99eeeed6676c5d054470","observation_id":"52d9f180-8360-45b1-bb3d-dc7114e2c852","resolution":{"observed_at":"2026-08-10T13:47:20.199605Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T13:47:20.168592Z","title":"Markowitz","venue":null,"work_id":"14b2a358-0c93-4f66-b326-e85fab2cce97","year":1957},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.248994Z"},"links":{"citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:9b45a48d5c25af997d7d3fe9463e7e058acb72e9f0e39ab57631bbcffdf78bf8","observation_id":"3d325fe4-ab33-4dbc-924a-1a41c2d8575c","resolution":{"observed_at":"2026-08-10T13:47:20.175257Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T13:47:20.146943Z","title":"Reinforcement learning for combinatorial optimization: A survey","venue":null,"work_id":"f554412e-f793-49c5-8903-ebeff1abec26","year":2021},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.255225Z"},"links":{"citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:7a3ac6fd5395d0c68b23431194f19b541e41883ec342216fe5399ddf98137e46","observation_id":"40f669d4-e7ad-4c48-aee7-30768bffcba3","resolution":{"observed_at":"2026-08-10T13:47:20.154127Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T13:47:20.126296Z","title":"Finding increasingly large extremal graphs with alphazero and tabu search, 2023","venue":null,"work_id":"61357094-adf7-4bef-a864-cb248a213da2","year":2023},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.260929Z"},"links":{"citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:e5d400840d0e96859ddf8c1068a27d0d166a50f80dc63b94818296a465cc3da9","observation_id":"87c3296b-69d1-4452-ac6f-aeab9904562d","resolution":{"observed_at":"2026-08-10T13:47:20.132164Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T13:47:20.109181Z","title":"Rusu, Joel Veness, Marc G","venue":null,"work_id":"fd04309a-7b5b-47ca-860a-30b3adc3d998","year":2015},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.266645Z"},"links":{"citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:537b36593c6c9c5ef77c0a32f61c59bda20bc83f7dedb7bcb05a30c20c4727ac","observation_id":"78271e3a-9342-49f3-96ce-c55875e01d90","resolution":{"observed_at":"2026-08-10T13:47:20.114460Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T13:47:20.092169Z","title":"Maximum matchings in planar graphs via gaussian elimination","venue":null,"work_id":"8ab38ff8-3a02-49ef-b0d8-433f6cb5e65c","year":2006},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.274337Z"},"links":{"citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:475b923abdd01046c584a2ba907143ccc7530b0096840481461ce0a9ef446c04","observation_id":"b261ab0e-d955-4b3c-a275-8c77b20b4d37","resolution":{"observed_at":"2026-08-10T13:47:20.098002Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.04181","last_updated":"2024-03-28T19:35:01Z","snapshot_observed_at":"2026-08-04T16:31:37.156891Z","submitted_at":"2023-02-08T16:40:11Z","title":"Attending to Graph Transformers","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.04181","snapshot_observed_at":"2026-08-10T13:47:19.279915Z","title":"Attending to graph trans- formers","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.279915Z"},"links":{"cited_paper":"/paper/2302.04181","citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:969ab5da7914ca22f27561d657e491178c52913841715f2129aeb3f2b8d2f64a","observation_id":"1a7bc871-53d8-4933-a3fc-b9ecbba111d2","resolution":{"observed_at":"2026-08-10T13:47:19.279915Z","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-10T13:47:20.075220Z","title":"Recurrent space-time graph neural networks","venue":null,"work_id":"d33838cc-2c14-409a-acab-7cab4e6bcf5d","year":2019},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.287458Z"},"links":{"citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:1849a53f9653bc1acb3faacbfcf15271a95e52eded5aad34eddb1132e143af4e","observation_id":"2f7399fb-038d-482b-acf0-e6d176f5d91c","resolution":{"observed_at":"2026-08-10T13:47:20.080922Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T13:47:19.294741Z","title":"Stable-baselines3: Reliable reinforcement learning implementations","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.294741Z"},"links":{"citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:bdf5a9548455b9d9030b3df08110c2cd7a843119ffd4aeb3324b4abb16977e23","observation_id":"408504a9-ad34-41cd-8ccc-44ddf6c3167a","resolution":{"observed_at":"2026-08-10T13:47:19.294741Z","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-10T13:47:20.043105Z","title":"Self- supervised graph transformer on large-scale molecular data","venue":null,"work_id":"640cc947-10b0-4780-8c1b-a522e7cecc9d","year":2020},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.300196Z"},"links":{"citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:ce657f9eff9f1dfbcae16403f50a2dbf32a9f83ed8e0433af73f41d94c574640","observation_id":"f37aa726-8716-4414-b745-1f933ac3ed08","resolution":{"observed_at":"2026-08-10T13:47:20.048584Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T13:47:20.026130Z","title":"Triangulated graphs and the elimination process","venue":null,"work_id":"b3750832-9489-48bc-ab8e-77f09a09c6e1","year":1970},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.305369Z"},"links":{"citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:a8c9f94b8db7b940f4e4ab4cd219809446fad844f8955e59571db7c994da2967","observation_id":"1e1811e0-75c7-4472-9018-2e251f9230bc","resolution":{"observed_at":"2026-08-10T13:47:20.031170Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T13:47:20.006661Z","title":null,"venue":null,"work_id":"86773f68-e497-4733-a171-62ff7ecadf9c","year":1972},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.310214Z"},"links":{"citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:faff01a2fdb1bfecfa011e09d2f208290d46729077e3b494e9720ce5dc3234ec","observation_id":"e6b62795-40b9-4e74-afa3-a3ab9633afab","resolution":{"observed_at":"2026-08-10T13:47:20.012805Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T13:47:19.986725Z","title":null,"venue":null,"work_id":"76771588-ecaf-4952-98b2-eccb04155707","year":1976},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.315154Z"},"links":{"citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:07dfdf60bc5e771e9c1ae4d93d2a0bfca71497dcc45d11147afb01c1daef3587","observation_id":"90ef99b8-abcd-4308-896a-c1eedf96ae3c","resolution":{"observed_at":"2026-08-10T13:47:19.992367Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T13:47:19.969582Z","title":"Rossi and Nesreen K","venue":null,"work_id":"020d59e4-af7f-4612-ade6-491b5482f4ea","year":2014},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.320021Z"},"links":{"citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:4e8761d5aad80768ade265b539955569a10805c276b79688f2ac3fe343608892","observation_id":"0d1a3e96-0790-45dc-afe0-385db3186ddf","resolution":{"observed_at":"2026-08-10T13:47:19.974817Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T13:47:19.953169Z","title":"The graph neural network model","venue":null,"work_id":"8653c406-8a0d-42ab-87d4-a173c2184a67","year":2008},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.325389Z"},"links":{"citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:7aa6d9042eb9e219e2285ced9bdfec35fc88ad45f4c3803cf540d30c17d7fa0e","observation_id":"84266c60-4413-4ae9-a335-d9a663866640","resolution":{"observed_at":"2026-08-10T13:47:19.958536Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1707.06347","last_updated":"2017-08-28T09:20:06Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2017-07-20T02:32:33Z","title":"Proximal Policy Optimization Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.06347","snapshot_observed_at":"2026-08-10T13:47:19.330535Z","title":"Proximal policy optimization algorithms","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.330535Z"},"links":{"cited_paper":"/paper/1707.06347","citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:3a295f44c364cd2afa8d07ae87964e27b101e8bed05630318169168ec7183771","observation_id":"abed9191-884a-444d-9e46-ca16bec4f6c5","resolution":{"observed_at":"2026-08-10T13:47:19.330535Z","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-10T13:47:19.934153Z","title":"Sutherland, and Ali Kemal Sinop","venue":null,"work_id":"1b92f160-fef8-4c65-9d71-07e1e8438f36","year":2023},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.336081Z"},"links":{"citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:90b7457283bb488767e3ebc96ddb4265692d50d886fbd31d4ae94569533f345b","observation_id":"6ab3bc73-0e2e-415d-8e84-2754dd6c53b4","resolution":{"observed_at":"2026-08-10T13:47:19.939801Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T13:47:19.917753Z","title":"Maddison, Arthur Guez, Laurent Sifre, George Van Den Driessche, Julian Schrittwieser, Ioannis Antonoglou, Veda Panneershelvam, Marc Lanctot, et al","venue":null,"work_id":"62b0cb87-003c-4f63-b06a-d92a466026f2","year":2016},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.344262Z"},"links":{"citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:b75f9658993e35489860a84c2f595e3925494cfa622fac4e0e446929a8e21bc8","observation_id":"1048b6b2-4d03-4041-ae45-dc03a100fc87","resolution":{"observed_at":"2026-08-10T13:47:19.922768Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T13:47:19.349820Z","title":"Mastering the game of go without human knowledge","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.349820Z"},"links":{"citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:ef3304c87755d713bd6b07f4fa4afb6a41bfdc4325db1ea05e9ea64b42f9cd10","observation_id":"dd350f3a-8676-491f-8a92-c5deb3db5a2a","resolution":{"observed_at":"2026-08-10T13:47:19.349820Z","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-10T13:47:19.889566Z","title":"Smit, Jianan Zhou, Robbert Reijnen, Yaoxin Wu, Jian Chen, Cong Zhang, Zaharah Bukhsh, Yingqian Zhang, and Wim Nuijten","venue":null,"work_id":"b4b2feb1-b7e4-424d-97a3-665d2a05addf","year":2024},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.355356Z"},"links":{"citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:ebb5a37eec4ab3b765045667d77f9e5ba24c40179e5a8e6af4c731ccd52d783b","observation_id":"769df483-2c46-4b3e-80ff-830304614db1","resolution":{"observed_at":"2026-08-10T13:47:19.894951Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T13:47:19.872354Z","title":"Attention-based graph neural networks: a survey","venue":null,"work_id":"f73bf35a-55ba-401b-9e32-8f83f7f9a9b5","year":2023},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.360429Z"},"links":{"citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:4c2aca182f9652d1f093c29ba8dc5f4d08dc8f5fe77996c92aafd16490ece250","observation_id":"554a5f53-a006-4b8e-a812-ba58f9637fdd","resolution":{"observed_at":"2026-08-10T13:47:19.877884Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T13:47:19.366791Z","title":"Sutton and Andrew G","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.366791Z"},"links":{"citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:eec0f0db17c33cb8d4344f2fba3bf7977fe229850584b1e4a07ffa4fc1811729","observation_id":"865f571b-c39a-4f52-be9e-86518d84d8b3","resolution":{"observed_at":"2026-08-10T13:47:19.366791Z","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-10T13:47:19.842665Z","title":"Or-gym: A reinforcement learning library for operations research problems","venue":null,"work_id":"11395533-7cbe-4cb2-8d00-d81c3e5298e4","year":2021},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.372389Z"},"links":{"citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:7316816705c96d41463e274ba9620a01292c6ee51edf51107733dd8538f8a46f","observation_id":"fc7b8a0b-fd80-4756-a2ca-fdeec1c1d9ca","resolution":{"observed_at":"2026-08-10T13:47:19.850026Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1710.10903","last_updated":"2018-02-04T19:13:29Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2017-10-30T12:41:12Z","title":"Graph Attention Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1710.10903","snapshot_observed_at":"2026-08-10T13:47:19.377505Z","title":"Graph attention networks","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.377505Z"},"links":{"cited_paper":"/paper/1710.10903","citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:9e045351fecd00798df235ca4e59c7fbb9dac9c9d3eb92a2009cd01c1c9297ef","observation_id":"f98f7d98-4cb9-4b6e-a4a7-a4d392a48b0d","resolution":{"observed_at":"2026-08-10T13:47:19.377505Z","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-10T13:47:19.823117Z","title":null,"venue":null,"work_id":"6ef91da8-c656-452d-b162-ab368dc5f126","year":2021},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.382691Z"},"links":{"citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:98d7d54cfb9cec28bcfda8fde2979f7af1015cd5a7ee0311b17612823eb8edae","observation_id":"63572b06-38fe-4929-abce-b2df12a63f76","resolution":{"observed_at":"2026-08-10T13:47:19.828882Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T13:47:19.804510Z","title":"Computing the minimum fill-in is np-complete","venue":null,"work_id":"00c1cc68-4c6c-47ef-8ea5-3676d865b332","year":1981},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.387359Z"},"links":{"citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:e01b546994689b67564e9e0c39562f09cf8b980ae5ae9cdcb20389e57dcbfc77","observation_id":"187a2d81-2386-4e7b-be1b-2ed904940985","resolution":{"observed_at":"2026-08-10T13:47:19.810210Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1802.08773","last_updated":"2018-06-23T15:22:19Z","snapshot_observed_at":"2026-08-03T07:07:38.913377Z","submitted_at":"2018-02-24T00:39:09Z","title":"GraphRNN: Generating Realistic Graphs with Deep Auto-regressive Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1802.08773","snapshot_observed_at":"2026-08-10T13:47:19.392403Z","title":"Hamilton, and Jure Leskovec","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.392403Z"},"links":{"cited_paper":"/paper/1802.08773","citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:b5bd8b9aea78e76285f3d6e22aad7b6c4975291f278901e2277ad3c695e03a1d","observation_id":"c5218661-8e52-4886-9408-8cee7f7458e8","resolution":{"observed_at":"2026-08-10T13:47:19.392403Z","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-10T13:47:19.784510Z","title":null,"venue":null,"work_id":"c26d64b9-433d-4d86-9151-a1308146cf1f","year":2019},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.398225Z"},"links":{"citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:41d73464bc3f28b64ac017bc736c58caeec9882804a1ca6eadd0ba83d7dbc484","observation_id":"60a03f2a-ce12-4420-8bc6-0eb8936ea313","resolution":{"observed_at":"2026-08-10T13:47:19.790912Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T13:47:19.765384Z","title":"Graph convolutional networks: Algorithms, applications and open challenges","venue":null,"work_id":"23e8fb69-e612-43c0-b2e3-762c0839bb98","year":2018},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.403855Z"},"links":{"citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:fc1bffb5164ffefe9f294e33c1927262f58dde6c3023b4bb8619248c43ad75f6","observation_id":"13070272-b555-4808-aedb-55e7119155e9","resolution":{"observed_at":"2026-08-10T13:47:19.771253Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T13:47:19.745721Z","title":"Deep learning on graphs: A survey","venue":null,"work_id":"7547d7a0-706d-461d-8980-6c09ee913689","year":2022},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.409085Z"},"links":{"citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:4f7063081bd2156e70c11d0b15167c90319aceb21c9c6a63aaaa67f782a1782c","observation_id":"3f5584bb-2b79-44fa-a722-b07ac045197c","resolution":{"observed_at":"2026-08-10T13:47:19.752333Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T13:47:19.725847Z","title":null,"venue":null,"work_id":"7fa5feb1-b70d-46c2-865d-aaf48670174a","year":2021},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.414647Z"},"links":{"citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:240e87dca3655565e8373c093027ae765eabe0eebe168a3e899fef28753ff845","observation_id":"8cd9ab56-cf08-4d2d-83c4-4c6de5aa88a0","resolution":{"observed_at":"2026-08-10T13:47:19.732112Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization"},"reference_resolution":{"displayed":60,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":21,"verified_exact":2,"verified_fuzzy":37},"total_outbound_references":60},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 60 of 60 outbound references and 0 inbound Pith citation observations for arXiv:2501.16130."}