{"as_of":"2026-08-04T11:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:83af008e9bf968ac9d2e88ffab58c901a6d9f0531aced66dbaf3a8e79fd0ed5e","coverage":[{"denominator":25,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":25,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-20T14:30:41.426236Z","state":"measured"},{"denominator":26,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":26,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-04T06:34:03.388597+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-20T14:30:41.426236Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-05-20T14:33:21.503657Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2605.17362","last_updated":"2026-05-17T10:07:23Z","snapshot_observed_at":"2026-08-02T17:50:24.634276Z","submitted_at":"2026-05-17T10:07:23Z","title":"Learning Fill-in Reduction Ordering via Graph Policy Optimization for Sparse Matrices","version":1},"cited_work":{"arxiv_id":"2605.17362","doi":null,"metadata_source":"pith","pith_arxiv_id":"2605.17362","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Learning Fill-in Reduction Ordering via Graph Policy Optimization for Sparse Matrices","venue":"cs.LG","work_id":"ad537cac-4b03-4a98-b0f9-9fc239b147c7","year":2026},"citing_paper":{"arxiv_id":"2605.17362","last_updated":"2026-05-17T10:07:23Z","snapshot_observed_at":"2026-08-02T17:50:24.634276Z","submitted_at":"2026-05-17T10:07:23Z","title":"Learning Fill-in Reduction Ordering via Graph Policy Optimization for Sparse Matrices","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-20T14:30:41.426236Z"},"links":{"cited_paper":"/paper/2605.17362","citing_paper":"/paper/2605.17362"},"observation_digest":"sha256:78ed708c418f1af88b0a18681d6db2372524d35d2f0e10ebb5a814634fdb0b2a","observation_id":"afb37db3-99c3-42d4-b155-c4fa4fa93589","resolution":{"observed_at":"2026-05-20T14:33:21.505187Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2605.17362/citation-record","integrity":"/paper/2605.17362/integrity","json":"/paper/2605.17362/citation-record.json","paper":"/paper/2605.17362"},"outbound":[{"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":"Many large-scale scien- tific simulations—such as structural engineering and computational fluid dynamics—lead to large sparse linear systemsAx=b","venue":null,"work_id":"0d16c219-fcc8-4b53-88ca-f409f4ae9245","year":null},"citing_paper":{"arxiv_id":"2605.17362","last_updated":"2026-05-17T10:07:23Z","snapshot_observed_at":"2026-08-02T17:50:24.634276Z","submitted_at":"2026-05-17T10:07:23Z","title":"Learning Fill-in Reduction Ordering via Graph Policy Optimization for Sparse Matrices","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-20T14:30:41.426236Z"},"links":{"citing_paper":"/paper/2605.17362"},"observation_digest":"sha256:6e741d1b187bfbbe3ce86197fe34971ee33aeb4694c044fbf663a2d8ce7aec89","observation_id":"08bcfb83-d12f-4596-bc85-4d0892e4c4d2","resolution":{"observed_at":"2026-05-20T14:33:21.959815Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2605.17362","last_updated":"2026-05-17T10:07:23Z","snapshot_observed_at":"2026-08-02T17:50:24.634276Z","submitted_at":"2026-05-17T10:07:23Z","title":"Learning Fill-in Reduction Ordering via Graph Policy Optimization for Sparse Matrices","version":1},"cited_work":{"arxiv_id":"2605.17362","doi":null,"metadata_source":"pith","pith_arxiv_id":"2605.17362","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Learning Fill-in Reduction Ordering via Graph Policy Optimization for Sparse Matrices","venue":"cs.LG","work_id":"ad537cac-4b03-4a98-b0f9-9fc239b147c7","year":2026},"citing_paper":{"arxiv_id":"2605.17362","last_updated":"2026-05-17T10:07:23Z","snapshot_observed_at":"2026-08-02T17:50:24.634276Z","submitted_at":"2026-05-17T10:07:23Z","title":"Learning Fill-in Reduction Ordering via Graph Policy Optimization for Sparse Matrices","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-20T14:30:41.426236Z"},"links":{"cited_paper":"/paper/2605.17362","citing_paper":"/paper/2605.17362"},"observation_digest":"sha256:78ed708c418f1af88b0a18681d6db2372524d35d2f0e10ebb5a814634fdb0b2a","observation_id":"afb37db3-99c3-42d4-b155-c4fa4fa93589","resolution":{"observed_at":"2026-05-20T14:33:21.505187Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1153.2885","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Experimental Settings As training data, we generate 10,000 symmetric matrices via Delau- nay triangulation [10, 9, 8] with sizesn∈[60,200]","venue":null,"work_id":"972bf49c-13c1-4b15-83c3-492ffe57b3fe","year":2052},"citing_paper":{"arxiv_id":"2605.17362","last_updated":"2026-05-17T10:07:23Z","snapshot_observed_at":"2026-08-02T17:50:24.634276Z","submitted_at":"2026-05-17T10:07:23Z","title":"Learning Fill-in Reduction Ordering via Graph Policy Optimization for Sparse Matrices","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-20T14:30:41.426236Z"},"links":{"citing_paper":"/paper/2605.17362"},"observation_digest":"sha256:fd06710b847c726ce1126e7f89cfa4faf85f67a6d3f804a4b8fed39a4ccce48e","observation_id":"1eba3f8b-5c8e-47f2-8a21-175e3de86dea","resolution":{"observed_at":"2026-05-20T14:33:21.502115Z","resolver_source":"arxiv_id","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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":"6e7af84e-797e-4ea0-b206-abc7e381376d","year":null},"citing_paper":{"arxiv_id":"2605.17362","last_updated":"2026-05-17T10:07:23Z","snapshot_observed_at":"2026-08-02T17:50:24.634276Z","submitted_at":"2026-05-17T10:07:23Z","title":"Learning Fill-in Reduction Ordering via Graph Policy Optimization for Sparse Matrices","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-20T14:30:41.426236Z"},"links":{"citing_paper":"/paper/2605.17362"},"observation_digest":"sha256:d6c45da8e9856b464c859e3d29da0100ca514c208a37d4c947677ce6fbfe881d","observation_id":"9ff21056-6239-49f5-82b9-3b355a3c88ad","resolution":{"observed_at":"2026-05-20T14:33:21.952269Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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":"2021YFB0300203","venue":null,"work_id":"bb2e9366-e847-43b0-9788-bbaf76ee8ecc","year":null},"citing_paper":{"arxiv_id":"2605.17362","last_updated":"2026-05-17T10:07:23Z","snapshot_observed_at":"2026-08-02T17:50:24.634276Z","submitted_at":"2026-05-17T10:07:23Z","title":"Learning Fill-in Reduction Ordering via Graph Policy Optimization for Sparse Matrices","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-20T14:30:41.426236Z"},"links":{"citing_paper":"/paper/2605.17362"},"observation_digest":"sha256:8984e4e1683143f2969f2fc0f9ac2e09fb0788c8311d60e02ff65646ce075ad8","observation_id":"90343d10-5d8c-4e44-bde4-c905911d6d00","resolution":{"observed_at":"2026-05-20T14:33:21.954035Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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":"Wilkinson and C","venue":null,"work_id":"962d66ca-d53d-4d78-9771-edc6683ab6e9","year":1971},"citing_paper":{"arxiv_id":"2605.17362","last_updated":"2026-05-17T10:07:23Z","snapshot_observed_at":"2026-08-02T17:50:24.634276Z","submitted_at":"2026-05-17T10:07:23Z","title":"Learning Fill-in Reduction Ordering via Graph Policy Optimization for Sparse Matrices","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-20T14:30:41.426236Z"},"links":{"citing_paper":"/paper/2605.17362"},"observation_digest":"sha256:adfab4e314f1da6989e5644c0e84874d0a35042153b02b8bd18b56cba9e1c519","observation_id":"552e2d2a-cb8d-4001-8434-a91b1478d647","resolution":{"observed_at":"2026-05-20T14:33:21.946625Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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":"Al- gorithmic aspects of vertex elimination","venue":null,"work_id":"77208b59-12fd-45bc-bf83-4faa28e862b4","year":1976},"citing_paper":{"arxiv_id":"2605.17362","last_updated":"2026-05-17T10:07:23Z","snapshot_observed_at":"2026-08-02T17:50:24.634276Z","submitted_at":"2026-05-17T10:07:23Z","title":"Learning Fill-in Reduction Ordering via Graph Policy Optimization for Sparse Matrices","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-20T14:30:41.426236Z"},"links":{"citing_paper":"/paper/2605.17362"},"observation_digest":"sha256:013a4f42afbb8e8f9e8175da223ecf9bfc7d870e0f3f4d71e146963c28a15e00","observation_id":"91681fde-6261-43fc-8fd1-8cbea33087bb","resolution":{"observed_at":"2026-05-20T14:33:21.948563Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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":"Computing the minimum fill-in is np- complete","venue":null,"work_id":"3ae453d6-1bf9-406e-a301-c840325a5ec1","year":1981},"citing_paper":{"arxiv_id":"2605.17362","last_updated":"2026-05-17T10:07:23Z","snapshot_observed_at":"2026-08-02T17:50:24.634276Z","submitted_at":"2026-05-17T10:07:23Z","title":"Learning Fill-in Reduction Ordering via Graph Policy Optimization for Sparse Matrices","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-20T14:30:41.426236Z"},"links":{"citing_paper":"/paper/2605.17362"},"observation_digest":"sha256:f19c7dbeefb73965dcc03f2b8ce2f277879a2ada2bfb39ea04d0dfb05e62aadd","observation_id":"6cf3b2b6-b9b2-4f20-8e3b-7cd4ad9d7437","resolution":{"observed_at":"2026-05-20T14:33:21.943011Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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":"A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations","venue":null,"work_id":"b5d3e68d-ade8-4455-ad88-7ca79b0f615b","year":1972},"citing_paper":{"arxiv_id":"2605.17362","last_updated":"2026-05-17T10:07:23Z","snapshot_observed_at":"2026-08-02T17:50:24.634276Z","submitted_at":"2026-05-17T10:07:23Z","title":"Learning Fill-in Reduction Ordering via Graph Policy Optimization for Sparse Matrices","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-20T14:30:41.426236Z"},"links":{"citing_paper":"/paper/2605.17362"},"observation_digest":"sha256:ec3adb1cbd381b557590a7e529f25f74ca6201ac0d41a534d1c38787f4abaf7e","observation_id":"e187d442-24a5-4877-a148-d892743e4873","resolution":{"observed_at":"2026-05-20T14:33:21.941341Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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 approximate minimum degree ordering algorithm","venue":null,"work_id":"7669187a-5e13-41b8-aa22-b079d331c855","year":1996},"citing_paper":{"arxiv_id":"2605.17362","last_updated":"2026-05-17T10:07:23Z","snapshot_observed_at":"2026-08-02T17:50:24.634276Z","submitted_at":"2026-05-17T10:07:23Z","title":"Learning Fill-in Reduction Ordering via Graph Policy Optimization for Sparse Matrices","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-20T14:30:41.426236Z"},"links":{"citing_paper":"/paper/2605.17362"},"observation_digest":"sha256:27d0f643b9910f8349b1c8b0ef3b872a6e827c301e020bde6b6bb563632e6dfd","observation_id":"78ec59f3-0bf8-4878-affa-c1bb0382e770","resolution":{"observed_at":"2026-05-20T14:33:21.944660Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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":"A column approximate minimum degree order- ing algorithm","venue":null,"work_id":"5da07524-cea1-4fbd-859c-28375fc0de56","year":2004},"citing_paper":{"arxiv_id":"2605.17362","last_updated":"2026-05-17T10:07:23Z","snapshot_observed_at":"2026-08-02T17:50:24.634276Z","submitted_at":"2026-05-17T10:07:23Z","title":"Learning Fill-in Reduction Ordering via Graph Policy Optimization for Sparse Matrices","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-20T14:30:41.426236Z"},"links":{"citing_paper":"/paper/2605.17362"},"observation_digest":"sha256:a763f81cc4c4eec588578268b431a1266fb147faa20639b896ef336b8e964d51","observation_id":"d9a4e4be-404a-48eb-971e-2abe99be58cf","resolution":{"observed_at":"2026-05-20T14:33:21.950468Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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":"Nested dissection of a regular finite element mesh","venue":null,"work_id":"dc3578ab-8263-4a03-a1a7-bba7738450a6","year":1973},"citing_paper":{"arxiv_id":"2605.17362","last_updated":"2026-05-17T10:07:23Z","snapshot_observed_at":"2026-08-02T17:50:24.634276Z","submitted_at":"2026-05-17T10:07:23Z","title":"Learning Fill-in Reduction Ordering via Graph Policy Optimization for Sparse Matrices","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-20T14:30:41.426236Z"},"links":{"citing_paper":"/paper/2605.17362"},"observation_digest":"sha256:145b02c5e42dc33d92b248b8327cb3885ec0366192aa174c3809253fd3ccd32e","observation_id":"c1ccbded-9666-49f7-a6fc-4bcc00034491","resolution":{"observed_at":"2026-05-20T14:33:21.955724Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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":"Graph partitioning and sparse matrix ordering using reinforcement learning and graph neural networks","venue":null,"work_id":"6406b590-e473-4ca5-96cb-f1fd1b1aab7a","year":2022},"citing_paper":{"arxiv_id":"2605.17362","last_updated":"2026-05-17T10:07:23Z","snapshot_observed_at":"2026-08-02T17:50:24.634276Z","submitted_at":"2026-05-17T10:07:23Z","title":"Learning Fill-in Reduction Ordering via Graph Policy Optimization for Sparse Matrices","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-20T14:30:41.426236Z"},"links":{"citing_paper":"/paper/2605.17362"},"observation_digest":"sha256:38225eda46df4a401cae303719e2c5978b967dbd512fe5d0cbdf9ba8113fecd9","observation_id":"6993f1d2-e15b-4c5a-880b-bc4e098537b1","resolution":{"observed_at":"2026-05-20T14:33:21.922022Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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":"Alpha elimination: Us- ing deep reinforcement learning to reduce fill-in during sparse matrix decomposition","venue":null,"work_id":"24c2eb9b-367a-45ae-b546-885d1ea9d433","year":2023},"citing_paper":{"arxiv_id":"2605.17362","last_updated":"2026-05-17T10:07:23Z","snapshot_observed_at":"2026-08-02T17:50:24.634276Z","submitted_at":"2026-05-17T10:07:23Z","title":"Learning Fill-in Reduction Ordering via Graph Policy Optimization for Sparse Matrices","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-20T14:30:41.426236Z"},"links":{"citing_paper":"/paper/2605.17362"},"observation_digest":"sha256:005e4e56498ae02f8a1990d587d0ec9ece142a35bff55ca005bff7d5e349d5b2","observation_id":"953ea782-f91b-4eed-aa82-32c09e5523dc","resolution":{"observed_at":"2026-05-20T14:33:21.924038Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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":"Learning algebraic multigrid using graph neural net- works","venue":null,"work_id":"694bd82d-f489-4edd-8046-0045ddbb2c76","year":2020},"citing_paper":{"arxiv_id":"2605.17362","last_updated":"2026-05-17T10:07:23Z","snapshot_observed_at":"2026-08-02T17:50:24.634276Z","submitted_at":"2026-05-17T10:07:23Z","title":"Learning Fill-in Reduction Ordering via Graph Policy Optimization for Sparse Matrices","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-20T14:30:41.426236Z"},"links":{"citing_paper":"/paper/2605.17362"},"observation_digest":"sha256:35b5da12292474022432977652dea619662baeb801cfeaf0d2183edb5a426037","observation_id":"f7f658c7-1878-4f88-be25-bd669a977a16","resolution":{"observed_at":"2026-05-20T14:33:21.957765Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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 university of florida sparse matrix collection","venue":null,"work_id":"c034e195-1036-4f6a-b549-c212b8310ebd","year":2011},"citing_paper":{"arxiv_id":"2605.17362","last_updated":"2026-05-17T10:07:23Z","snapshot_observed_at":"2026-08-02T17:50:24.634276Z","submitted_at":"2026-05-17T10:07:23Z","title":"Learning Fill-in Reduction Ordering via Graph Policy Optimization for Sparse Matrices","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-20T14:30:41.426236Z"},"links":{"citing_paper":"/paper/2605.17362"},"observation_digest":"sha256:9f97dc7250a2ad72aa01d480062f82ec4472774d63242adb0c5b02f0a1048613","observation_id":"6f8158d2-35b8-44f2-a43a-7b21da13746f","resolution":{"observed_at":"2026-05-20T14:33:21.939182Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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":"Liu,Computer Solution of Large Sparse Positive Definite, Prentice-Hall","venue":null,"work_id":"21eaf7a4-c34f-4984-82ae-0dbaee245872","year":1981},"citing_paper":{"arxiv_id":"2605.17362","last_updated":"2026-05-17T10:07:23Z","snapshot_observed_at":"2026-08-02T17:50:24.634276Z","submitted_at":"2026-05-17T10:07:23Z","title":"Learning Fill-in Reduction Ordering via Graph Policy Optimization for Sparse Matrices","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-20T14:30:41.426236Z"},"links":{"citing_paper":"/paper/2605.17362"},"observation_digest":"sha256:ee8703c28e02a623b1cdbeed9fedb58af65b9cf6d589781206162cfc17c488cc","observation_id":"1f928a30-dde9-4585-9195-c688bba5d11d","resolution":{"observed_at":"2026-05-20T14:33:21.925811Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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":"Duff, Albert M","venue":null,"work_id":"cae3b9df-f6d7-401f-b923-1254e953fc35","year":1986},"citing_paper":{"arxiv_id":"2605.17362","last_updated":"2026-05-17T10:07:23Z","snapshot_observed_at":"2026-08-02T17:50:24.634276Z","submitted_at":"2026-05-17T10:07:23Z","title":"Learning Fill-in Reduction Ordering via Graph Policy Optimization for Sparse Matrices","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-20T14:30:41.426236Z"},"links":{"citing_paper":"/paper/2605.17362"},"observation_digest":"sha256:002e155bba8c302f3b99c0b926c42f09131d8aa6eea6f4e961facd51242caf7f","observation_id":"1cf6cdc5-11fb-496a-95d2-57943445851f","resolution":{"observed_at":"2026-05-20T14:33:21.931691Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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":"Davis, Sivasankaran Rajamanickam, and Wis- sam M","venue":null,"work_id":"ad96a4ec-8089-40d0-987f-283943ee080d","year":2016},"citing_paper":{"arxiv_id":"2605.17362","last_updated":"2026-05-17T10:07:23Z","snapshot_observed_at":"2026-08-02T17:50:24.634276Z","submitted_at":"2026-05-17T10:07:23Z","title":"Learning Fill-in Reduction Ordering via Graph Policy Optimization for Sparse Matrices","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-20T14:30:41.426236Z"},"links":{"citing_paper":"/paper/2605.17362"},"observation_digest":"sha256:2c65342219cba8d2d7ea48a2cc12936b88fc1a180309af90e28f513bd8868179","observation_id":"101599be-cb74-499f-9d39-7ed5840df437","resolution":{"observed_at":"2026-05-20T14:33:21.963655Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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 role of elimination trees in sparse factoriza- tion","venue":null,"work_id":"e6e877db-a3d5-4e37-935b-723104d9927a","year":1990},"citing_paper":{"arxiv_id":"2605.17362","last_updated":"2026-05-17T10:07:23Z","snapshot_observed_at":"2026-08-02T17:50:24.634276Z","submitted_at":"2026-05-17T10:07:23Z","title":"Learning Fill-in Reduction Ordering via Graph Policy Optimization for Sparse Matrices","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-20T14:30:41.426236Z"},"links":{"citing_paper":"/paper/2605.17362"},"observation_digest":"sha256:0d62c87160f8f579debd188d82e9ff0012a3d5a69a7344ee7f5b56c5bb12faae","observation_id":"175f636d-730b-48a0-8014-b0f4a9eee4cf","resolution":{"observed_at":"2026-05-20T14:33:21.961829Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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":"Collec- tive influence algorithm to find influencers via optimal perco- lation in massively large social media","venue":null,"work_id":"8cfc223e-d042-4ed7-8361-cdd9da016923","year":2016},"citing_paper":{"arxiv_id":"2605.17362","last_updated":"2026-05-17T10:07:23Z","snapshot_observed_at":"2026-08-02T17:50:24.634276Z","submitted_at":"2026-05-17T10:07:23Z","title":"Learning Fill-in Reduction Ordering via Graph Policy Optimization for Sparse Matrices","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-20T14:30:41.426236Z"},"links":{"citing_paper":"/paper/2605.17362"},"observation_digest":"sha256:b3c405cd6a0d387466a8bc1e561a5c9ec10337337228a647560cd73204ad5661","observation_id":"84f6c334-0b18-45c5-ab12-8d56805e051f","resolution":{"observed_at":"2026-05-20T14:33:21.933478Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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":"Mixhop: Higher-order graph con- volutional architectures via sparsified neighborhood mixing","venue":null,"work_id":"e66c8df4-1bca-4a86-af7b-cb5587960d25","year":2019},"citing_paper":{"arxiv_id":"2605.17362","last_updated":"2026-05-17T10:07:23Z","snapshot_observed_at":"2026-08-02T17:50:24.634276Z","submitted_at":"2026-05-17T10:07:23Z","title":"Learning Fill-in Reduction Ordering via Graph Policy Optimization for Sparse Matrices","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-20T14:30:41.426236Z"},"links":{"citing_paper":"/paper/2605.17362"},"observation_digest":"sha256:06925c0c5b2d5065d4ae3c018a980f987219f9102e3a981cf94191e4b9b14e2b","observation_id":"894b4004-1cef-4d46-840b-afdbd8b84adc","resolution":{"observed_at":"2026-05-20T14:33:21.929517Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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":"Metis, a software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reduced orderings of sparse matrices","venue":null,"work_id":"a6ee3259-eacf-4a53-b8af-4fbb6087753f","year":1998},"citing_paper":{"arxiv_id":"2605.17362","last_updated":"2026-05-17T10:07:23Z","snapshot_observed_at":"2026-08-02T17:50:24.634276Z","submitted_at":"2026-05-17T10:07:23Z","title":"Learning Fill-in Reduction Ordering via Graph Policy Optimization for Sparse Matrices","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-20T14:30:41.426236Z"},"links":{"citing_paper":"/paper/2605.17362"},"observation_digest":"sha256:7234f0766d1e6fe01999b4dab8390feb3c8c90883ed6c571cb40cc1c6219482f","observation_id":"490566fb-7593-4497-ba65-0909bf62f2a3","resolution":{"observed_at":"2026-05-20T14:33:21.927680Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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 overview of superlu: Algorithms, implementa- tion, and user interface","venue":null,"work_id":"00b97471-bc15-4f62-b036-8de7f721e848","year":2005},"citing_paper":{"arxiv_id":"2605.17362","last_updated":"2026-05-17T10:07:23Z","snapshot_observed_at":"2026-08-02T17:50:24.634276Z","submitted_at":"2026-05-17T10:07:23Z","title":"Learning Fill-in Reduction Ordering via Graph Policy Optimization for Sparse Matrices","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-20T14:30:41.426236Z"},"links":{"citing_paper":"/paper/2605.17362"},"observation_digest":"sha256:4eca5d6702d3f232beff92d86dea8aafd9875015fae2bafd56a0286b408c770f","observation_id":"24196a18-858e-4a52-a88a-ed8856177819","resolution":{"observed_at":"2026-05-20T14:33:21.935301Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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":"Inductive representa- tion learning on large graphs","venue":null,"work_id":"2fea8ff0-cb93-455d-96d7-a8bc5f4612be","year":2017},"citing_paper":{"arxiv_id":"2605.17362","last_updated":"2026-05-17T10:07:23Z","snapshot_observed_at":"2026-08-02T17:50:24.634276Z","submitted_at":"2026-05-17T10:07:23Z","title":"Learning Fill-in Reduction Ordering via Graph Policy Optimization for Sparse Matrices","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-20T14:30:41.426236Z"},"links":{"citing_paper":"/paper/2605.17362"},"observation_digest":"sha256:96c808eb1e57580c25a05e79086815d56bd3efe7c2ecbba474b5444feaa660cc","observation_id":"8096fedb-ac2a-411a-94fa-cc13510a4f0b","resolution":{"observed_at":"2026-05-20T14:33:21.937119Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2605.17362","last_updated":"2026-05-17T10:07:23Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-02T17:50:24.634276Z","submitted_at":"2026-05-17T10:07:23Z","title":"Learning Fill-in Reduction Ordering via Graph Policy Optimization for Sparse Matrices"},"reference_resolution":{"displayed":25,"state_counts":{"malformed_identifier":1,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":1,"verified_exact":0,"verified_fuzzy":22},"total_outbound_references":25},"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-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"thesis":"As of 4 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 1 inbound Pith citation observation for arXiv:2605.17362."}