{"as_of":"2026-08-09T12:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8bc75ac0953063dd650bcc5638e1036d8ddffbc90a7f64bb0e2a47146981331e","coverage":[{"denominator":34,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":34,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T05:42:59.912661Z","state":"measured"},{"denominator":36,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":36,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T16:17:41.215727Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-02T15:17:07.328863Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2508.01557","last_updated":"2025-08-03T03:03:05Z","snapshot_observed_at":"2026-08-07T22:45:43.378325Z","submitted_at":"2025-08-03T03:03:05Z","title":"Unsupervised Learning for the Elementary Shortest Path Problem","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.01557","snapshot_observed_at":"2026-08-04T16:17:41.215727Z","title":"Unsupervised learning for the ele- mentary shortest path problem, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.15486","last_updated":"2026-06-25T03:17:34Z","snapshot_observed_at":"2026-08-07T22:45:33.203139Z","submitted_at":"2025-09-18T23:23:36Z","title":"Discrete Flow-Based Generative Models for Measurement Optimization in Quantum Computing","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-04T16:17:41.215727Z"},"links":{"cited_paper":"/paper/2508.01557","citing_paper":"/paper/2509.15486"},"observation_digest":"sha256:dcd16057aac8eb7a0c17dc76c47b4a806771370e090d53cfe9f3348ff4cc4713","observation_id":"f2c088b5-4d7e-4f8e-a5f1-8b017d2912a3","resolution":{"observed_at":"2026-08-04T16:17:41.215727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2508.01557","last_updated":"2025-08-03T03:03:05Z","snapshot_observed_at":"2026-08-07T22:45:43.378325Z","submitted_at":"2025-08-03T03:03:05Z","title":"Unsupervised Learning for the Elementary Shortest Path Problem","version":1},"cited_work":{"arxiv_id":"2508.01557","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.01557","snapshot_observed_at":"2026-07-02T15:17:07.328863Z","title":"Unsupervised learning for the elementary shortest path problem.arXiv preprint arXiv:2508.01557, 2025","venue":null,"work_id":"f91eda17-feeb-4478-8c4b-cebb1510613b","year":2025},"citing_paper":{"arxiv_id":"2607.01185","last_updated":"2026-07-01T17:17:55Z","snapshot_observed_at":"2026-08-07T15:00:43.360697Z","submitted_at":"2026-07-01T17:17:55Z","title":"Neural Certificate Pricing for Combinatorial Optimization Problems","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-02T15:11:43.912523Z"},"links":{"cited_paper":"/paper/2508.01557","citing_paper":"/paper/2607.01185"},"observation_digest":"sha256:eb45af0fd45fc3d91f4aa3d3368f0612237eee452bf27230a9c76cb9b23147fe","observation_id":"42b4bade-1f35-4c81-b59d-fd68ccc5f5e4","resolution":{"observed_at":"2026-07-02T15:17:07.330326Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2508.01557/citation-record","integrity":"/paper/2508.01557/integrity","json":"/paper/2508.01557/citation-record.json","paper":"/paper/2508.01557"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:42:59.803246Z","title":", \" * write output.state after.block = add.period write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.01557","last_updated":"2025-08-03T03:03:05Z","snapshot_observed_at":"2026-08-07T22:45:43.378325Z","submitted_at":"2025-08-03T03:03:05Z","title":"Unsupervised Learning for the Elementary Shortest Path Problem","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-06T05:42:59.803246Z"},"links":{"citing_paper":"/paper/2508.01557"},"observation_digest":"sha256:66f966ee2d5bb2cef51678131e279565450eddfc71640de09539751a531babde","observation_id":"0feeefcf-7a60-467d-90b9-152c2b982c5f","resolution":{"observed_at":"2026-08-06T05:42:59.803246Z","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-06T05:42:59.806970Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.01557","last_updated":"2025-08-03T03:03:05Z","snapshot_observed_at":"2026-08-07T22:45:43.378325Z","submitted_at":"2025-08-03T03:03:05Z","title":"Unsupervised Learning for the Elementary Shortest Path Problem","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-06T05:42:59.806970Z"},"links":{"citing_paper":"/paper/2508.01557"},"observation_digest":"sha256:411607d5dec986b65243b1183512242fe69dcfd1750f14d69138b9a969d61c2a","observation_id":"a5ed1978-cfd3-4feb-96ce-38e3152b5f0d","resolution":{"observed_at":"2026-08-06T05:42:59.806970Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.08401","last_updated":"2025-04-17T09:01:57Z","snapshot_observed_at":"2026-08-07T22:45:43.897106Z","submitted_at":"2025-04-11T10:08:38Z","title":"Graph Reduction with Unsupervised Learning in Column Generation: A Routing Application","version":2},"cited_work":{"arxiv_id":"2504.08401","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.08401","snapshot_observed_at":"2026-08-06T05:42:59.955157Z","title":"Graph Reduction with Unsupervised Learning in Column Generation: A Routing Application","venue":"cs.LG","work_id":"898d54ac-088d-4fa1-bb40-1ad4bb390ff2","year":2025},"citing_paper":{"arxiv_id":"2508.01557","last_updated":"2025-08-03T03:03:05Z","snapshot_observed_at":"2026-08-07T22:45:43.378325Z","submitted_at":"2025-08-03T03:03:05Z","title":"Unsupervised Learning for the Elementary Shortest Path Problem","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-06T05:42:59.810710Z"},"links":{"cited_paper":"/paper/2504.08401","citing_paper":"/paper/2508.01557"},"observation_digest":"sha256:2b161e34f973322e55bb36d6275d08538ca7cc00282204fa3a89bda745da615e","observation_id":"f1b3e53b-4549-4b98-9a41-54afdf22430d","resolution":{"observed_at":"2026-08-06T05:42:59.960653Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T05:43:00.218285Z","title":null,"venue":null,"work_id":"757a948c-1999-4485-963e-1b23bfea811e","year":2002},"citing_paper":{"arxiv_id":"2508.01557","last_updated":"2025-08-03T03:03:05Z","snapshot_observed_at":"2026-08-07T22:45:43.378325Z","submitted_at":"2025-08-03T03:03:05Z","title":"Unsupervised Learning for the Elementary Shortest Path Problem","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-06T05:42:59.814438Z"},"links":{"citing_paper":"/paper/2508.01557"},"observation_digest":"sha256:50ce71c559015302395c025af0b07f07c1657546cc35b37f4d3ef3e609ed9c25","observation_id":"b530e56e-1569-44d5-a10d-8b122b7f1e46","resolution":{"observed_at":"2026-08-06T05:43:00.221415Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T05:43:00.209028Z","title":null,"venue":null,"work_id":"1abc8133-c241-4643-b679-dcb67d137696","year":2016},"citing_paper":{"arxiv_id":"2508.01557","last_updated":"2025-08-03T03:03:05Z","snapshot_observed_at":"2026-08-07T22:45:43.378325Z","submitted_at":"2025-08-03T03:03:05Z","title":"Unsupervised Learning for the Elementary Shortest Path Problem","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-06T05:42:59.817979Z"},"links":{"citing_paper":"/paper/2508.01557"},"observation_digest":"sha256:c20bfc67a824dba96d443f045e9c761c9638a05590b8e35cf1d3c85285563aef","observation_id":"4ac47b56-c81b-44d7-951f-805e07147e1e","resolution":{"observed_at":"2026-08-06T05:43:00.212079Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T05:43:00.199687Z","title":null,"venue":null,"work_id":"4885b886-215c-4536-8e6c-f8121fc8e6e2","year":2014},"citing_paper":{"arxiv_id":"2508.01557","last_updated":"2025-08-03T03:03:05Z","snapshot_observed_at":"2026-08-07T22:45:43.378325Z","submitted_at":"2025-08-03T03:03:05Z","title":"Unsupervised Learning for the Elementary Shortest Path Problem","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-06T05:42:59.821268Z"},"links":{"citing_paper":"/paper/2508.01557"},"observation_digest":"sha256:ef23919c292fd99e8cba407fb8cc2c28d2446d5402709af8f73f992decfd51e3","observation_id":"76a7100a-81d9-488e-9250-ffd1e8ace11d","resolution":{"observed_at":"2026-08-06T05:43:00.203193Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T05:43:00.190173Z","title":null,"venue":null,"work_id":"de0a2654-397b-4c82-949b-3066ea4db19c","year":1958},"citing_paper":{"arxiv_id":"2508.01557","last_updated":"2025-08-03T03:03:05Z","snapshot_observed_at":"2026-08-07T22:45:43.378325Z","submitted_at":"2025-08-03T03:03:05Z","title":"Unsupervised Learning for the Elementary Shortest Path Problem","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-06T05:42:59.824436Z"},"links":{"citing_paper":"/paper/2508.01557"},"observation_digest":"sha256:781556b85911664ebcaf0396ff3a699c5c80b25d8625043121afe35cfbe4dafe","observation_id":"35f7c701-908e-4368-93b3-3991607cc176","resolution":{"observed_at":"2026-08-06T05:43:00.193509Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T05:42:59.827592Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.01557","last_updated":"2025-08-03T03:03:05Z","snapshot_observed_at":"2026-08-07T22:45:43.378325Z","submitted_at":"2025-08-03T03:03:05Z","title":"Unsupervised Learning for the Elementary Shortest Path Problem","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-06T05:42:59.827592Z"},"links":{"citing_paper":"/paper/2508.01557"},"observation_digest":"sha256:10706a4e468454fea24ce46660b946f01d64321e23f0e9c07bcae398d9dc395d","observation_id":"0de97e88-6de8-401f-92b1-83fde583857d","resolution":{"observed_at":"2026-08-06T05:42:59.827592Z","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-06T05:43:00.176168Z","title":"B.; Lodi, A.; Morris, C.; and Veli c kovi \\'c , P","venue":null,"work_id":"793b45ce-9bf5-4ee1-925f-802ac8ec88f2","year":2023},"citing_paper":{"arxiv_id":"2508.01557","last_updated":"2025-08-03T03:03:05Z","snapshot_observed_at":"2026-08-07T22:45:43.378325Z","submitted_at":"2025-08-03T03:03:05Z","title":"Unsupervised Learning for the Elementary Shortest Path Problem","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-06T05:42:59.830799Z"},"links":{"citing_paper":"/paper/2508.01557"},"observation_digest":"sha256:b1c7d26d253d6086e0207ec46f401edd6ebf2848c1725493bcc49e9107f0d9f1","observation_id":"c73325cd-2635-4af1-a828-0197d1790c9f","resolution":{"observed_at":"2026-08-06T05:43:00.179536Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T05:43:00.167354Z","title":null,"venue":null,"work_id":"052fbb51-e53a-49dd-a499-4c308710481c","year":2006},"citing_paper":{"arxiv_id":"2508.01557","last_updated":"2025-08-03T03:03:05Z","snapshot_observed_at":"2026-08-07T22:45:43.378325Z","submitted_at":"2025-08-03T03:03:05Z","title":"Unsupervised Learning for the Elementary Shortest Path Problem","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-06T05:42:59.834397Z"},"links":{"citing_paper":"/paper/2508.01557"},"observation_digest":"sha256:3f1945a8376d3b4092a0c043e13cd74152b700d9b5e8cf3aa5b37ae3e3c3ca80","observation_id":"625bcc0f-4859-4a55-86f9-19da12304626","resolution":{"observed_at":"2026-08-06T05:43:00.170315Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T05:43:00.158689Z","title":null,"venue":null,"work_id":"1fab7d91-384e-4725-b2bd-0d2a4f8f1d1a","year":2023},"citing_paper":{"arxiv_id":"2508.01557","last_updated":"2025-08-03T03:03:05Z","snapshot_observed_at":"2026-08-07T22:45:43.378325Z","submitted_at":"2025-08-03T03:03:05Z","title":"Unsupervised Learning for the Elementary Shortest Path Problem","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-06T05:42:59.837446Z"},"links":{"citing_paper":"/paper/2508.01557"},"observation_digest":"sha256:4e60012b9e99309f000a96ac14c9b67b1504774e4fb49893037c8fa4f9708381","observation_id":"591b4376-eb78-48b4-8b27-2812fb812c6e","resolution":{"observed_at":"2026-08-06T05:43:00.161707Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T05:43:00.149625Z","title":null,"venue":null,"work_id":"d9c0eaf8-d4ad-4179-8aef-2ce589ba7bbb","year":2014},"citing_paper":{"arxiv_id":"2508.01557","last_updated":"2025-08-03T03:03:05Z","snapshot_observed_at":"2026-08-07T22:45:43.378325Z","submitted_at":"2025-08-03T03:03:05Z","title":"Unsupervised Learning for the Elementary Shortest Path Problem","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-06T05:42:59.840357Z"},"links":{"citing_paper":"/paper/2508.01557"},"observation_digest":"sha256:ae802090659f974cbd0a41e800f5fbcfbb5d9341869c34a4f9f11636dd0e968d","observation_id":"5478a5c3-1855-435b-8ec0-f99d840018c2","resolution":{"observed_at":"2026-08-06T05:43:00.153215Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T05:43:00.141030Z","title":null,"venue":null,"work_id":"0cab01c4-1197-453f-a4dd-ca95dd4c517b","year":1959},"citing_paper":{"arxiv_id":"2508.01557","last_updated":"2025-08-03T03:03:05Z","snapshot_observed_at":"2026-08-07T22:45:43.378325Z","submitted_at":"2025-08-03T03:03:05Z","title":"Unsupervised Learning for the Elementary Shortest Path Problem","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-06T05:42:59.843398Z"},"links":{"citing_paper":"/paper/2508.01557"},"observation_digest":"sha256:8e59d0bcaf0238caac5b0602ab629aef77860b41f87e1f5646751fdaf6bd3069","observation_id":"0858e96f-88e4-4c88-b30a-86cfd73fd69a","resolution":{"observed_at":"2026-08-06T05:43:00.144011Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T05:43:00.132677Z","title":null,"venue":null,"work_id":"4cc516c9-349f-4c86-8094-c52b604eb758","year":2005},"citing_paper":{"arxiv_id":"2508.01557","last_updated":"2025-08-03T03:03:05Z","snapshot_observed_at":"2026-08-07T22:45:43.378325Z","submitted_at":"2025-08-03T03:03:05Z","title":"Unsupervised Learning for the Elementary Shortest Path Problem","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-06T05:42:59.846440Z"},"links":{"citing_paper":"/paper/2508.01557"},"observation_digest":"sha256:bdc41a3da92e3106a100e45f550367a08fff3181da1d2c64658d6c4947329179","observation_id":"dd0ced03-2108-4c28-9ae9-90d18d2c4a80","resolution":{"observed_at":"2026-08-06T05:43:00.135681Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T05:43:00.124048Z","title":null,"venue":null,"work_id":"a1cb4f84-8c02-4258-9f10-450deef6c513","year":2004},"citing_paper":{"arxiv_id":"2508.01557","last_updated":"2025-08-03T03:03:05Z","snapshot_observed_at":"2026-08-07T22:45:43.378325Z","submitted_at":"2025-08-03T03:03:05Z","title":"Unsupervised Learning for the Elementary Shortest Path Problem","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-06T05:42:59.849435Z"},"links":{"citing_paper":"/paper/2508.01557"},"observation_digest":"sha256:605680bc7cb768bd1df72103b65dfb0ba1e4a924ec8247a90c6f0a5432af09ee","observation_id":"677d58af-b574-4367-8ba2-90648d2927e7","resolution":{"observed_at":"2026-08-06T05:43:00.127274Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T05:43:00.115644Z","title":null,"venue":null,"work_id":"04ba53ae-4ea5-4ee3-8125-b089d9e2d8ac","year":1956},"citing_paper":{"arxiv_id":"2508.01557","last_updated":"2025-08-03T03:03:05Z","snapshot_observed_at":"2026-08-07T22:45:43.378325Z","submitted_at":"2025-08-03T03:03:05Z","title":"Unsupervised Learning for the Elementary Shortest Path Problem","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-06T05:42:59.852407Z"},"links":{"citing_paper":"/paper/2508.01557"},"observation_digest":"sha256:68ff64ef79b616cf6560900974734abea72c26a27656bcbf6ef1da061af16fb8","observation_id":"23e019e7-94c9-47b6-a72d-5c44c4fdd844","resolution":{"observed_at":"2026-08-06T05:43:00.118662Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T05:43:00.107324Z","title":null,"venue":null,"work_id":"70e3a878-d18a-4e7d-b1ca-bee95d3ac07c","year":2021},"citing_paper":{"arxiv_id":"2508.01557","last_updated":"2025-08-03T03:03:05Z","snapshot_observed_at":"2026-08-07T22:45:43.378325Z","submitted_at":"2025-08-03T03:03:05Z","title":"Unsupervised Learning for the Elementary Shortest Path Problem","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-06T05:42:59.855063Z"},"links":{"citing_paper":"/paper/2508.01557"},"observation_digest":"sha256:26315f45feff3d80a9784a688f1abf7397fcc332aaac6e5c9d58bff685b70320","observation_id":"b80c5392-d096-4733-bc6d-bef108daf625","resolution":{"observed_at":"2026-08-06T05:43:00.110280Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T05:43:00.097994Z","title":"M.; et al","venue":null,"work_id":"dcf44bd5-4142-45bd-96fa-20b647f31805","year":2022},"citing_paper":{"arxiv_id":"2508.01557","last_updated":"2025-08-03T03:03:05Z","snapshot_observed_at":"2026-08-07T22:45:43.378325Z","submitted_at":"2025-08-03T03:03:05Z","title":"Unsupervised Learning for the Elementary Shortest Path Problem","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-06T05:42:59.858209Z"},"links":{"citing_paper":"/paper/2508.01557"},"observation_digest":"sha256:0fdf8636557abc71752f00cf3fd3311371484533a497f0b2f8e55b69fe443469","observation_id":"6b0549f8-32ea-4176-bdd7-996fe5ba70fd","resolution":{"observed_at":"2026-08-06T05:43:00.101664Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T05:43:00.088783Z","title":null,"venue":null,"work_id":"5b059054-6b64-4264-a211-717ab1805735","year":2024},"citing_paper":{"arxiv_id":"2508.01557","last_updated":"2025-08-03T03:03:05Z","snapshot_observed_at":"2026-08-07T22:45:43.378325Z","submitted_at":"2025-08-03T03:03:05Z","title":"Unsupervised Learning for the Elementary Shortest Path Problem","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-06T05:42:59.861216Z"},"links":{"citing_paper":"/paper/2508.01557"},"observation_digest":"sha256:f36940e0c39e61278ee891617d53e9b711f5fddf62fcd367c8a478ee81a2ed56","observation_id":"c12b190a-4edd-47da-b000-593557b8fa83","resolution":{"observed_at":"2026-08-06T05:43:00.092388Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.05834","last_updated":"2024-11-06T09:12:31Z","snapshot_observed_at":"2026-07-06T19:47:38.708013Z","submitted_at":"2024-11-06T09:12:31Z","title":"Assessing and Enhancing Graph Neural Networks for Combinatorial Optimization: Novel Approaches and Application in Maximum Independent Set Problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.05834","snapshot_observed_at":"2026-08-06T05:42:59.864295Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.01557","last_updated":"2025-08-03T03:03:05Z","snapshot_observed_at":"2026-08-07T22:45:43.378325Z","submitted_at":"2025-08-03T03:03:05Z","title":"Unsupervised Learning for the Elementary Shortest Path Problem","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-06T05:42:59.864295Z"},"links":{"cited_paper":"/paper/2411.05834","citing_paper":"/paper/2508.01557"},"observation_digest":"sha256:60677e1ffa40c5c86e124508fe14a7b8e55b2a62452d5fbc6845564f05b44b0e","observation_id":"83fc7577-ad7b-4bfd-9a7f-e98849989cf8","resolution":{"observed_at":"2026-08-06T05:42:59.864295Z","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-06T05:43:00.079669Z","title":null,"venue":null,"work_id":"8d7f8e8d-b3d2-46d5-a9b7-c74e41904f4e","year":2021},"citing_paper":{"arxiv_id":"2508.01557","last_updated":"2025-08-03T03:03:05Z","snapshot_observed_at":"2026-08-07T22:45:43.378325Z","submitted_at":"2025-08-03T03:03:05Z","title":"Unsupervised Learning for the Elementary Shortest Path Problem","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-06T05:42:59.868738Z"},"links":{"citing_paper":"/paper/2508.01557"},"observation_digest":"sha256:530e9c96e25e1f0c95b2b4729ffe6fc42dc4fb5bdeba11e2044ae982fc369bae","observation_id":"ffd92b5f-42ea-4845-b9c6-efe869aab975","resolution":{"observed_at":"2026-08-06T05:43:00.082944Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T05:43:00.070167Z","title":"K.; Cappart, Q.; Rousseau, L.-M.; and Laurent, T","venue":null,"work_id":"11075cb5-aa01-49b2-b3ac-1e115c0f9545","year":2022},"citing_paper":{"arxiv_id":"2508.01557","last_updated":"2025-08-03T03:03:05Z","snapshot_observed_at":"2026-08-07T22:45:43.378325Z","submitted_at":"2025-08-03T03:03:05Z","title":"Unsupervised Learning for the Elementary Shortest Path Problem","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-06T05:42:59.872708Z"},"links":{"citing_paper":"/paper/2508.01557"},"observation_digest":"sha256:60ac049af5ba854ac53d75be2e11717e0a30ccc2cdc7b4b6e43b50c625e7d8a2","observation_id":"8917723f-5b0a-45bb-98d0-826999e1e9a3","resolution":{"observed_at":"2026-08-06T05:43:00.073223Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T05:43:00.061640Z","title":null,"venue":null,"work_id":"ddfbbea8-bb97-4cf4-9454-b03e14e08ca3","year":2020},"citing_paper":{"arxiv_id":"2508.01557","last_updated":"2025-08-03T03:03:05Z","snapshot_observed_at":"2026-08-07T22:45:43.378325Z","submitted_at":"2025-08-03T03:03:05Z","title":"Unsupervised Learning for the Elementary Shortest Path Problem","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-06T05:42:59.876542Z"},"links":{"citing_paper":"/paper/2508.01557"},"observation_digest":"sha256:c76f325dd00e70454ae6fb94df9fbc66136bca868246a34fa8753eac1532a4bc","observation_id":"feeb66df-6b7f-44eb-a5dc-fb61d40fc09a","resolution":{"observed_at":"2026-08-06T05:43:00.064630Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T05:43:00.052083Z","title":"B.; Morris, C.; and Lodi, A","venue":null,"work_id":"0be12b58-d4fa-48f7-8fc6-bb8888446379","year":2022},"citing_paper":{"arxiv_id":"2508.01557","last_updated":"2025-08-03T03:03:05Z","snapshot_observed_at":"2026-08-07T22:45:43.378325Z","submitted_at":"2025-08-03T03:03:05Z","title":"Unsupervised Learning for the Elementary Shortest Path Problem","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-06T05:42:59.879671Z"},"links":{"citing_paper":"/paper/2508.01557"},"observation_digest":"sha256:784ca8a9e84c1124e3dd29deffb4b8ca8d75a41b5ac532d9a0a6682b54d99cf2","observation_id":"cb6cbafa-98b1-4b50-9c92-5acf3ddbf74e","resolution":{"observed_at":"2026-08-06T05:43:00.056063Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T05:43:00.043453Z","title":null,"venue":null,"work_id":"3fe5036d-f057-41d0-b6fa-6e383e2bb175","year":2018},"citing_paper":{"arxiv_id":"2508.01557","last_updated":"2025-08-03T03:03:05Z","snapshot_observed_at":"2026-08-07T22:45:43.378325Z","submitted_at":"2025-08-03T03:03:05Z","title":"Unsupervised Learning for the Elementary Shortest Path Problem","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-06T05:42:59.883002Z"},"links":{"citing_paper":"/paper/2508.01557"},"observation_digest":"sha256:1abd9f920123926142160aee42e309c8fa45f289a04e291669db9cd9697e676f","observation_id":"a86920ab-2d23-4ecc-a807-c511076d4ddf","resolution":{"observed_at":"2026-08-06T05:43:00.046558Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T05:43:00.034584Z","title":null,"venue":null,"work_id":"40e6ae65-b954-4d5b-8b51-28581c4a0530","year":1976},"citing_paper":{"arxiv_id":"2508.01557","last_updated":"2025-08-03T03:03:05Z","snapshot_observed_at":"2026-08-07T22:45:43.378325Z","submitted_at":"2025-08-03T03:03:05Z","title":"Unsupervised Learning for the Elementary Shortest Path Problem","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-06T05:42:59.886052Z"},"links":{"citing_paper":"/paper/2508.01557"},"observation_digest":"sha256:b15be00b52888084fef6565c07bf494d7fe2640da9090c00bd049f2c9b0e3837","observation_id":"9702e1b8-33cc-4fc2-87de-fe453d2c05ba","resolution":{"observed_at":"2026-08-06T05:43:00.037866Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T05:43:00.025455Z","title":null,"venue":null,"work_id":"b0850c35-0c90-42d6-9576-b585b9f41dc0","year":2023},"citing_paper":{"arxiv_id":"2508.01557","last_updated":"2025-08-03T03:03:05Z","snapshot_observed_at":"2026-08-07T22:45:43.378325Z","submitted_at":"2025-08-03T03:03:05Z","title":"Unsupervised Learning for the Elementary Shortest Path Problem","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-06T05:42:59.889071Z"},"links":{"citing_paper":"/paper/2508.01557"},"observation_digest":"sha256:20ffc6221a50017e098ab7f4c71fa95a438469351a19ac9bafb25925dc67707f","observation_id":"22428c19-ea5e-4191-8642-efafa6ae76b8","resolution":{"observed_at":"2026-08-06T05:43:00.028685Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T05:43:00.016480Z","title":null,"venue":null,"work_id":"8e43f97c-291c-4bad-96c5-a5fbeee7194a","year":2023},"citing_paper":{"arxiv_id":"2508.01557","last_updated":"2025-08-03T03:03:05Z","snapshot_observed_at":"2026-08-07T22:45:43.378325Z","submitted_at":"2025-08-03T03:03:05Z","title":"Unsupervised Learning for the Elementary Shortest Path Problem","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-06T05:42:59.892060Z"},"links":{"citing_paper":"/paper/2508.01557"},"observation_digest":"sha256:5fd3be9141509ad73723806bb3da21f01b61298eba57ba29b20efd50327e7f23","observation_id":"1ec5d352-6e60-47b7-a9a0-e377479fcb8c","resolution":{"observed_at":"2026-08-06T05:43:00.019586Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T05:43:00.006161Z","title":null,"venue":null,"work_id":"edddbc43-73d1-4c0b-b1cd-7d0debd3f022","year":1999},"citing_paper":{"arxiv_id":"2508.01557","last_updated":"2025-08-03T03:03:05Z","snapshot_observed_at":"2026-08-07T22:45:43.378325Z","submitted_at":"2025-08-03T03:03:05Z","title":"Unsupervised Learning for the Elementary Shortest Path Problem","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-06T05:42:59.896094Z"},"links":{"citing_paper":"/paper/2508.01557"},"observation_digest":"sha256:4ce817ea0697681245e4a9b5f7ef019471ac7ce441cabd71f7d5badab90e07ea","observation_id":"4ccc39bd-fc50-43fb-a9eb-3244fb178eff","resolution":{"observed_at":"2026-08-06T05:43:00.009509Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T05:42:59.996458Z","title":null,"venue":null,"work_id":"78ddcbfb-a3ab-4b73-bb25-231bceb489b5","year":2016},"citing_paper":{"arxiv_id":"2508.01557","last_updated":"2025-08-03T03:03:05Z","snapshot_observed_at":"2026-08-07T22:45:43.378325Z","submitted_at":"2025-08-03T03:03:05Z","title":"Unsupervised Learning for the Elementary Shortest Path Problem","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-06T05:42:59.899994Z"},"links":{"citing_paper":"/paper/2508.01557"},"observation_digest":"sha256:9f6a27658f1b1f97af30be52c50ede9802401e6e920935362968b64a3733395b","observation_id":"a82a21c3-30ff-42e9-853e-cb4e938cb54b","resolution":{"observed_at":"2026-08-06T05:42:59.999943Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T05:42:59.987180Z","title":null,"venue":null,"work_id":"521c6e26-155a-4ec4-9976-5642797d1e4f","year":2016},"citing_paper":{"arxiv_id":"2508.01557","last_updated":"2025-08-03T03:03:05Z","snapshot_observed_at":"2026-08-07T22:45:43.378325Z","submitted_at":"2025-08-03T03:03:05Z","title":"Unsupervised Learning for the Elementary Shortest Path Problem","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-06T05:42:59.902984Z"},"links":{"citing_paper":"/paper/2508.01557"},"observation_digest":"sha256:743c8d171bee4ab6b974dd6606b93c5e7a63b2a30555adc093ebef3c169832c0","observation_id":"466f9813-ac2e-41e8-8b14-506747c4a742","resolution":{"observed_at":"2026-08-06T05:42:59.990440Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T05:42:59.976535Z","title":"S.; Kawarabayashi, K.-i.; and Jegelka, S","venue":null,"work_id":"da0df3cd-2ed8-49d8-b113-290cd3a34318","year":2019},"citing_paper":{"arxiv_id":"2508.01557","last_updated":"2025-08-03T03:03:05Z","snapshot_observed_at":"2026-08-07T22:45:43.378325Z","submitted_at":"2025-08-03T03:03:05Z","title":"Unsupervised Learning for the Elementary Shortest Path Problem","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-06T05:42:59.906146Z"},"links":{"citing_paper":"/paper/2508.01557"},"observation_digest":"sha256:c4653b5218d9443729b562b599e6a2fb9458a66e67dc3dce50d4926128e9b7c5","observation_id":"282ce3b6-ffc3-4940-9b41-9d668c2e24b9","resolution":{"observed_at":"2026-08-06T05:42:59.980789Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.00539","last_updated":"2025-06-04T13:39:54Z","snapshot_observed_at":"2026-08-08T09:04:37.435563Z","submitted_at":"2025-05-31T12:54:49Z","title":"ARIA: Training Language Agents with Intention-Driven Reward Aggregation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.00539","snapshot_observed_at":"2026-08-06T05:42:59.909229Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.01557","last_updated":"2025-08-03T03:03:05Z","snapshot_observed_at":"2026-08-07T22:45:43.378325Z","submitted_at":"2025-08-03T03:03:05Z","title":"Unsupervised Learning for the Elementary Shortest Path Problem","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-06T05:42:59.909229Z"},"links":{"cited_paper":"/paper/2506.00539","citing_paper":"/paper/2508.01557"},"observation_digest":"sha256:59c6995e4684da2e7bedb677f998101c51113ece492cf1f62c62d609ee07dd2b","observation_id":"c3128c10-4099-4755-8cb2-2203ceb52e11","resolution":{"observed_at":"2026-08-06T05:42:59.909229Z","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-06T05:42:59.967238Z","title":null,"venue":null,"work_id":"b364372b-a075-46e9-8276-af585bb15560","year":2021},"citing_paper":{"arxiv_id":"2508.01557","last_updated":"2025-08-03T03:03:05Z","snapshot_observed_at":"2026-08-07T22:45:43.378325Z","submitted_at":"2025-08-03T03:03:05Z","title":"Unsupervised Learning for the Elementary Shortest Path Problem","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-06T05:42:59.912661Z"},"links":{"citing_paper":"/paper/2508.01557"},"observation_digest":"sha256:e8cbc9525797b33dea75506d315c14aa59cd7dfea802f97df3548cc25ac95e37","observation_id":"30b9f06d-e4ba-496d-aa0d-b4ae97c2f442","resolution":{"observed_at":"2026-08-06T05:42:59.970599Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2508.01557","last_updated":"2025-08-03T03:03:05Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T22:45:43.378325Z","submitted_at":"2025-08-03T03:03:05Z","title":"Unsupervised Learning for the Elementary Shortest Path Problem"},"reference_resolution":{"displayed":34,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":28,"verified_exact":0,"verified_fuzzy":5},"total_outbound_references":34},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 34 of 34 outbound references and 2 inbound Pith citation observations for arXiv:2508.01557."}