{"as_of":"2026-08-16T19:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e2cb37b52aa228d6c1a157197c21c1f61a848eed9ac058767342b6ec868eb245","coverage":[{"denominator":36,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":36,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T12:19:43.691300Z","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-16T06:30:59.297886+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/1908.09644/citation-record","integrity":"/paper/1908.09644/integrity","json":"/paper/1908.09644/citation-record.json","paper":"/paper/1908.09644"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:19:44.178094Z","title":"Zoidi, E","venue":null,"work_id":"ae556a7f-cf6e-4dc0-b2dd-563a78b8b7dd","year":2015},"citing_paper":{"arxiv_id":"1908.09644","last_updated":"2020-12-01T07:58:11Z","snapshot_observed_at":"2026-08-16T03:25:07.377210Z","submitted_at":"2019-08-20T21:19:04Z","title":"Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs","version":5},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:43.534293Z"},"links":{"citing_paper":"/paper/1908.09644"},"observation_digest":"sha256:cbdd06f105b5c57700c7bee4f2009c14be6573a48225984e1f7bb6c5e5fb5516","observation_id":"8e01c144-a921-490f-99e7-b1c5cfc3144a","resolution":{"observed_at":"2026-08-14T12:19:44.182529Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:19:43.541012Z","title":"Fouss, A","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"1908.09644","last_updated":"2020-12-01T07:58:11Z","snapshot_observed_at":"2026-08-16T03:25:07.377210Z","submitted_at":"2019-08-20T21:19:04Z","title":"Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs","version":5},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:43.541012Z"},"links":{"citing_paper":"/paper/1908.09644"},"observation_digest":"sha256:67bfe8e3b927b8aa0b8e108cbf617877c406feb7aa595099996e2419bff1539b","observation_id":"836a3d07-0276-408e-9854-f027631b0f9e","resolution":{"observed_at":"2026-08-14T12:19:43.541012Z","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-14T12:19:44.193079Z","title":null,"venue":null,"work_id":"2a4ce3e4-096e-4d55-8b12-01e8259b5c8c","year":null},"citing_paper":{"arxiv_id":"1908.09644","last_updated":"2020-12-01T07:58:11Z","snapshot_observed_at":"2026-08-16T03:25:07.377210Z","submitted_at":"2019-08-20T21:19:04Z","title":"Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs","version":5},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:43.529565Z"},"links":{"citing_paper":"/paper/1908.09644"},"observation_digest":"sha256:f0d7a939c4da6d8eab9a9fab02f914f638a2d6a32f2b6c5b439468fbe6c5885f","observation_id":"b5fd48c0-fe5d-4bb4-9105-546c8c19cdd4","resolution":{"observed_at":"2026-08-14T12:19:44.197315Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:19:44.142054Z","title":"Jeh and J","venue":null,"work_id":"a75c0e73-bc7b-46e3-b5c2-6f2727ef5397","year":2003},"citing_paper":{"arxiv_id":"1908.09644","last_updated":"2020-12-01T07:58:11Z","snapshot_observed_at":"2026-08-16T03:25:07.377210Z","submitted_at":"2019-08-20T21:19:04Z","title":"Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs","version":5},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:43.552138Z"},"links":{"citing_paper":"/paper/1908.09644"},"observation_digest":"sha256:f240513446674d3b61e257f883f179b9fbdcdcba30d106407775e99a2b962762","observation_id":"34409add-f94b-4123-94c3-8784908eda2f","resolution":{"observed_at":"2026-08-14T12:19:44.147215Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:19:44.155408Z","title":null,"venue":null,"work_id":"dd653fe6-a827-4648-abdc-8e2ef5e40723","year":2002},"citing_paper":{"arxiv_id":"1908.09644","last_updated":"2020-12-01T07:58:11Z","snapshot_observed_at":"2026-08-16T03:25:07.377210Z","submitted_at":"2019-08-20T21:19:04Z","title":"Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs","version":5},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:43.546756Z"},"links":{"citing_paper":"/paper/1908.09644"},"observation_digest":"sha256:f3a26abde3f3be6e5651b602696efc6831162a19093c70435a4bf49f8f503d45","observation_id":"faddc2d7-bafd-48d3-89b5-1bccd6044230","resolution":{"observed_at":"2026-08-14T12:19:44.159754Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:19:44.117174Z","title":"Grover and J","venue":null,"work_id":"22418aca-645d-4cf9-b490-2c6a925f8b3c","year":2016},"citing_paper":{"arxiv_id":"1908.09644","last_updated":"2020-12-01T07:58:11Z","snapshot_observed_at":"2026-08-16T03:25:07.377210Z","submitted_at":"2019-08-20T21:19:04Z","title":"Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs","version":5},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:43.561051Z"},"links":{"citing_paper":"/paper/1908.09644"},"observation_digest":"sha256:7f0a388ccf736a5474784f8ef21e3f48615d8738808d326ff17889b1237487a1","observation_id":"6fb9a0eb-4c8e-4c3e-92b3-cce86f8bb5a2","resolution":{"observed_at":"2026-08-14T12:19:44.121185Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:19:44.129380Z","title":"Perozzi, R","venue":null,"work_id":"56155f0c-2f14-4bf3-a2a3-a52d9b5681e7","year":2014},"citing_paper":{"arxiv_id":"1908.09644","last_updated":"2020-12-01T07:58:11Z","snapshot_observed_at":"2026-08-16T03:25:07.377210Z","submitted_at":"2019-08-20T21:19:04Z","title":"Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs","version":5},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:43.556743Z"},"links":{"citing_paper":"/paper/1908.09644"},"observation_digest":"sha256:47c6a5be57916391e063050cddab81f485bbe01163d99ef1743a90ce5ac5eb34","observation_id":"f785104e-9644-4cf1-81a3-dcd12e6f9237","resolution":{"observed_at":"2026-08-14T12:19:44.132738Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:19:43.570649Z","title":null,"venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"1908.09644","last_updated":"2020-12-01T07:58:11Z","snapshot_observed_at":"2026-08-16T03:25:07.377210Z","submitted_at":"2019-08-20T21:19:04Z","title":"Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs","version":5},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:43.570649Z"},"links":{"citing_paper":"/paper/1908.09644"},"observation_digest":"sha256:6bbb1c220f40fb2065ec26761212a75cb8b29eacbe0b99f6ece11624c7f4dc2e","observation_id":"ec609175-2f62-4b1f-b267-f84c02f6f9fb","resolution":{"observed_at":"2026-08-14T12:19:43.570649Z","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-14T12:19:44.104312Z","title":"Lov´ asz, Combinatorics, Paul erdos is eighty 2, 1 (1993)","venue":null,"work_id":"baaa2a7d-b14a-4055-9e7a-928b04f627aa","year":1993},"citing_paper":{"arxiv_id":"1908.09644","last_updated":"2020-12-01T07:58:11Z","snapshot_observed_at":"2026-08-16T03:25:07.377210Z","submitted_at":"2019-08-20T21:19:04Z","title":"Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs","version":5},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:43.565787Z"},"links":{"citing_paper":"/paper/1908.09644"},"observation_digest":"sha256:65a429e52adc6ffe6d11cbed770d84e4f5f6729f0c541117a43df9fb287dbc78","observation_id":"c3a96d2a-fc7c-46cc-b868-4035f28565bc","resolution":{"observed_at":"2026-08-14T12:19:44.108775Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:19:44.069340Z","title":"Baesens, V","venue":null,"work_id":"49e5e53b-ee16-421b-aee4-71c6df7c32b2","year":2015},"citing_paper":{"arxiv_id":"1908.09644","last_updated":"2020-12-01T07:58:11Z","snapshot_observed_at":"2026-08-16T03:25:07.377210Z","submitted_at":"2019-08-20T21:19:04Z","title":"Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs","version":5},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:43.579373Z"},"links":{"citing_paper":"/paper/1908.09644"},"observation_digest":"sha256:529d9e3337358be8e297f99ff16ba95fdda1cbb1e7ff6e71e4b8e1120cbf8789","observation_id":"8cb36c1a-9b70-4a3a-9622-296cfde3f286","resolution":{"observed_at":"2026-08-14T12:19:44.073544Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:19:44.082342Z","title":null,"venue":null,"work_id":"f920d8bb-5545-4344-bf20-d9d998e6dd38","year":1999},"citing_paper":{"arxiv_id":"1908.09644","last_updated":"2020-12-01T07:58:11Z","snapshot_observed_at":"2026-08-16T03:25:07.377210Z","submitted_at":"2019-08-20T21:19:04Z","title":"Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs","version":5},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:43.574640Z"},"links":{"citing_paper":"/paper/1908.09644"},"observation_digest":"sha256:d5b3c5c2d0279156350b924b9eb2cededfd4a09bbcc3ab9112acdde1d5a924f3","observation_id":"6df4a20b-8fd3-42a6-b19b-4ff3c479c662","resolution":{"observed_at":"2026-08-14T12:19:44.086387Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:19:44.044412Z","title":null,"venue":null,"work_id":"f475d2f2-528e-4eea-a564-4db617abd5f0","year":1996},"citing_paper":{"arxiv_id":"1908.09644","last_updated":"2020-12-01T07:58:11Z","snapshot_observed_at":"2026-08-16T03:25:07.377210Z","submitted_at":"2019-08-20T21:19:04Z","title":"Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs","version":5},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:43.588017Z"},"links":{"citing_paper":"/paper/1908.09644"},"observation_digest":"sha256:4bd93b1f52aff73712ef668bfd1371f0439d91a57ffd8114b88f8befd77b0d49","observation_id":"8d80e59d-08d7-4f2c-b8ac-25796b229c2e","resolution":{"observed_at":"2026-08-14T12:19:44.048389Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:19:44.056710Z","title":"Mikolov, I","venue":null,"work_id":"373d05db-5533-4fa0-af59-4895ade23f00","year":2013},"citing_paper":{"arxiv_id":"1908.09644","last_updated":"2020-12-01T07:58:11Z","snapshot_observed_at":"2026-08-16T03:25:07.377210Z","submitted_at":"2019-08-20T21:19:04Z","title":"Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs","version":5},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:43.583871Z"},"links":{"citing_paper":"/paper/1908.09644"},"observation_digest":"sha256:d64bed61e87526ef0e36b5d7ecf052e0684d32296fa05087616f659b28a4c528","observation_id":"2a24fce5-d86a-496e-bbca-534baefa8658","resolution":{"observed_at":"2026-08-14T12:19:44.061077Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:19:44.014528Z","title":null,"venue":null,"work_id":"6343ef71-645c-4af5-adb0-437083fa127f","year":2003},"citing_paper":{"arxiv_id":"1908.09644","last_updated":"2020-12-01T07:58:11Z","snapshot_observed_at":"2026-08-16T03:25:07.377210Z","submitted_at":"2019-08-20T21:19:04Z","title":"Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs","version":5},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:43.596668Z"},"links":{"citing_paper":"/paper/1908.09644"},"observation_digest":"sha256:d411150864fa19883df7421428eab01f2393f79861c2d8db8b3fbab9d38a2889","observation_id":"54d58af2-9169-4e20-8eef-1130ea32f7b2","resolution":{"observed_at":"2026-08-14T12:19:44.019500Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:19:44.206165Z","title":null,"venue":null,"work_id":"1ed56e74-6702-4173-a40f-020b2625ba4d","year":2010},"citing_paper":{"arxiv_id":"1908.09644","last_updated":"2020-12-01T07:58:11Z","snapshot_observed_at":"2026-08-16T03:25:07.377210Z","submitted_at":"2019-08-20T21:19:04Z","title":"Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs","version":5},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:43.522552Z"},"links":{"citing_paper":"/paper/1908.09644"},"observation_digest":"sha256:e6eed087c9575d61430e6ed3080643cbc9be9c4729e2b10ad7b707603395e612","observation_id":"490818dc-0b5c-405c-a25d-8f158a446c82","resolution":{"observed_at":"2026-08-14T12:19:44.210154Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:19:44.029755Z","title":"Chung and S.-T","venue":null,"work_id":"bce0ced9-cd38-4462-bb82-08e3299d34f1","year":2000},"citing_paper":{"arxiv_id":"1908.09644","last_updated":"2020-12-01T07:58:11Z","snapshot_observed_at":"2026-08-16T03:25:07.377210Z","submitted_at":"2019-08-20T21:19:04Z","title":"Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs","version":5},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:43.592471Z"},"links":{"citing_paper":"/paper/1908.09644"},"observation_digest":"sha256:4de0b78a4763d99768c186bc1041fb93243f2b4d295dbaff82d4981c1cbca104","observation_id":"43cc5267-62cd-4894-a009-ddfea74d5247","resolution":{"observed_at":"2026-08-14T12:19:44.034481Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:19:44.000249Z","title":null,"venue":null,"work_id":"b6d7e8c0-baa5-47ec-9f3c-eddd4bb45ffd","year":1984},"citing_paper":{"arxiv_id":"1908.09644","last_updated":"2020-12-01T07:58:11Z","snapshot_observed_at":"2026-08-16T03:25:07.377210Z","submitted_at":"2019-08-20T21:19:04Z","title":"Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs","version":5},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:43.601930Z"},"links":{"citing_paper":"/paper/1908.09644"},"observation_digest":"sha256:bf006fd21287c58fa8152cca0df8acc2e2921e27c4129074e75876feb68431a9","observation_id":"9290b42d-2892-4585-b433-62a3ea79c2b7","resolution":{"observed_at":"2026-08-14T12:19:44.005473Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:19:43.984464Z","title":null,"venue":null,"work_id":"6e3d8ab1-4280-4876-bd93-cbd1d236ebb0","year":null},"citing_paper":{"arxiv_id":"1908.09644","last_updated":"2020-12-01T07:58:11Z","snapshot_observed_at":"2026-08-16T03:25:07.377210Z","submitted_at":"2019-08-20T21:19:04Z","title":"Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs","version":5},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:43.606216Z"},"links":{"citing_paper":"/paper/1908.09644"},"observation_digest":"sha256:66bcd1ced34c78bdf88666689da25679fbbca1b2ef5f6cb2ddcc8d807b278253","observation_id":"c2dfc107-a679-4c72-8b7a-ce5565a18614","resolution":{"observed_at":"2026-08-14T12:19:43.990031Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:19:43.968684Z","title":null,"venue":null,"work_id":"f1cb48e4-75bb-4230-bce1-6f30f5638737","year":2000},"citing_paper":{"arxiv_id":"1908.09644","last_updated":"2020-12-01T07:58:11Z","snapshot_observed_at":"2026-08-16T03:25:07.377210Z","submitted_at":"2019-08-20T21:19:04Z","title":"Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs","version":5},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:43.611050Z"},"links":{"citing_paper":"/paper/1908.09644"},"observation_digest":"sha256:ad230dd3ebbdfcd3a986f4852f9cf3a87152968143a1b7d989c42dc53305c145","observation_id":"1d1dcbce-d7e7-4a77-86a8-3c0f49ca1d89","resolution":{"observed_at":"2026-08-14T12:19:43.973176Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:19:43.954183Z","title":"White and P","venue":null,"work_id":"dc6bd2d5-7b8b-4e22-b32a-1c4a5afb6b5b","year":2003},"citing_paper":{"arxiv_id":"1908.09644","last_updated":"2020-12-01T07:58:11Z","snapshot_observed_at":"2026-08-16T03:25:07.377210Z","submitted_at":"2019-08-20T21:19:04Z","title":"Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs","version":5},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:43.615123Z"},"links":{"citing_paper":"/paper/1908.09644"},"observation_digest":"sha256:f25602e2b6714bcc20c2d89ec407b7885cb9986563fadfe0117c7bf45921b351","observation_id":"1cedf47f-5e56-4c60-9b67-f3deca111bb1","resolution":{"observed_at":"2026-08-14T12:19:43.958779Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:19:43.940146Z","title":"Masuda, M","venue":null,"work_id":"3ce24782-ff2b-4b61-aaf7-1982ad2db24d","year":2017},"citing_paper":{"arxiv_id":"1908.09644","last_updated":"2020-12-01T07:58:11Z","snapshot_observed_at":"2026-08-16T03:25:07.377210Z","submitted_at":"2019-08-20T21:19:04Z","title":"Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs","version":5},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:43.619510Z"},"links":{"citing_paper":"/paper/1908.09644"},"observation_digest":"sha256:2859498669d6f91d8a5babd93c0989fc46cae3cb511b10e0a3e261dd43b576d7","observation_id":"3b566671-7253-4bad-9ea3-dadbc556f0dd","resolution":{"observed_at":"2026-08-14T12:19:43.944565Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:19:43.926587Z","title":null,"venue":null,"work_id":"8d7930b5-2ac9-43ef-ad0a-99dddd9be057","year":null},"citing_paper":{"arxiv_id":"1908.09644","last_updated":"2020-12-01T07:58:11Z","snapshot_observed_at":"2026-08-16T03:25:07.377210Z","submitted_at":"2019-08-20T21:19:04Z","title":"Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs","version":5},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:43.624073Z"},"links":{"citing_paper":"/paper/1908.09644"},"observation_digest":"sha256:63ea4da6051a0514bd8fccc3177f16f90e90bdff022745cec3e773edc4689ed2","observation_id":"23af202d-7bdd-433a-a7d9-d692dcb29d54","resolution":{"observed_at":"2026-08-14T12:19:43.930972Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:19:43.912416Z","title":null,"venue":null,"work_id":"2098cd66-48bd-406a-a3b0-eaf5b5c9b195","year":null},"citing_paper":{"arxiv_id":"1908.09644","last_updated":"2020-12-01T07:58:11Z","snapshot_observed_at":"2026-08-16T03:25:07.377210Z","submitted_at":"2019-08-20T21:19:04Z","title":"Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs","version":5},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:43.628439Z"},"links":{"citing_paper":"/paper/1908.09644"},"observation_digest":"sha256:acf648beea35769e449800353c1206b1cec1cddfac17bc02b3fce75610f629a8","observation_id":"ce200fee-05b4-4148-83af-1243f8edca98","resolution":{"observed_at":"2026-08-14T12:19:43.916617Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:19:43.898243Z","title":null,"venue":null,"work_id":"b093f221-1559-40c1-8ed2-df36581c8bcc","year":null},"citing_paper":{"arxiv_id":"1908.09644","last_updated":"2020-12-01T07:58:11Z","snapshot_observed_at":"2026-08-16T03:25:07.377210Z","submitted_at":"2019-08-20T21:19:04Z","title":"Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs","version":5},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:43.633558Z"},"links":{"citing_paper":"/paper/1908.09644"},"observation_digest":"sha256:4cb0abf8777c22e1e7ffb3c3b3ee596794ee6abf6448381177f7c9f6f9bb3963","observation_id":"98df46c2-d427-4182-9dae-7de21e811add","resolution":{"observed_at":"2026-08-14T12:19:43.902275Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:19:43.883602Z","title":null,"venue":null,"work_id":"313d8da6-d2be-4364-90c0-797530f8aa52","year":2015},"citing_paper":{"arxiv_id":"1908.09644","last_updated":"2020-12-01T07:58:11Z","snapshot_observed_at":"2026-08-16T03:25:07.377210Z","submitted_at":"2019-08-20T21:19:04Z","title":"Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs","version":5},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:43.637786Z"},"links":{"citing_paper":"/paper/1908.09644"},"observation_digest":"sha256:1121608044cbcf30408de0c3a9a0796b1cda6162e31e986bd39ad579caadc193","observation_id":"6cb47b2b-c4ef-401c-9fef-9f3ca722f380","resolution":{"observed_at":"2026-08-14T12:19:43.888834Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:19:43.868571Z","title":null,"venue":null,"work_id":"3e192084-9d00-40a2-99b4-2a6300ebebf8","year":2016},"citing_paper":{"arxiv_id":"1908.09644","last_updated":"2020-12-01T07:58:11Z","snapshot_observed_at":"2026-08-16T03:25:07.377210Z","submitted_at":"2019-08-20T21:19:04Z","title":"Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs","version":5},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:43.642515Z"},"links":{"citing_paper":"/paper/1908.09644"},"observation_digest":"sha256:fc469e9eddc6c118cb1e30e0f83624e10b734f087c54cedbab6cdd628b480803","observation_id":"586713a7-e9e9-4975-8c44-12433b0f80e2","resolution":{"observed_at":"2026-08-14T12:19:43.873995Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:19:43.850977Z","title":"Hamilton, Z","venue":null,"work_id":"5e02be7e-f5c3-4552-b6b3-c9b215fb6858","year":2017},"citing_paper":{"arxiv_id":"1908.09644","last_updated":"2020-12-01T07:58:11Z","snapshot_observed_at":"2026-08-16T03:25:07.377210Z","submitted_at":"2019-08-20T21:19:04Z","title":"Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs","version":5},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:43.646645Z"},"links":{"citing_paper":"/paper/1908.09644"},"observation_digest":"sha256:c03636909f1087a84b3e13d87c1f59a2d93c0043fc8ccbf061a761f6eaa80d86","observation_id":"ef2ce165-6d06-4c14-a699-543b0f79bbb8","resolution":{"observed_at":"2026-08-14T12:19:43.856121Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1709.05584","last_updated":"2018-04-10T15:26:32Z","snapshot_observed_at":"2026-08-14T20:32:30.604942Z","submitted_at":"2017-09-17T00:19:33Z","title":"Representation Learning on Graphs: Methods and Applications","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1709.05584","snapshot_observed_at":"2026-08-14T12:19:43.650643Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.09644","last_updated":"2020-12-01T07:58:11Z","snapshot_observed_at":"2026-08-16T03:25:07.377210Z","submitted_at":"2019-08-20T21:19:04Z","title":"Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs","version":5},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:43.650643Z"},"links":{"cited_paper":"/paper/1709.05584","citing_paper":"/paper/1908.09644"},"observation_digest":"sha256:7d63b3ceb4c4bf9706dd9bf6862e41fdb965b172bd965cfa6dcd084d26d8f152","observation_id":"95535a1d-d91e-440c-a52d-675d0bca3991","resolution":{"observed_at":"2026-08-14T12:19:43.650643Z","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-14T12:19:43.835127Z","title":"Abu-El-Haija, B","venue":null,"work_id":"74894340-d185-488d-aab2-8b9feb7ce687","year":2018},"citing_paper":{"arxiv_id":"1908.09644","last_updated":"2020-12-01T07:58:11Z","snapshot_observed_at":"2026-08-16T03:25:07.377210Z","submitted_at":"2019-08-20T21:19:04Z","title":"Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs","version":5},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:43.657132Z"},"links":{"citing_paper":"/paper/1908.09644"},"observation_digest":"sha256:16bd428760e428ea5945c2832f84ca79b5f67138197097d0832dc72002b82430","observation_id":"db7e9078-28f3-4f59-a74e-92156c2e768b","resolution":{"observed_at":"2026-08-14T12:19:43.839941Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:19:43.820289Z","title":"ˇReh˚ uˇ rek and P","venue":null,"work_id":"b5d3059d-3231-45b4-8ee1-dbddc06a822e","year":2010},"citing_paper":{"arxiv_id":"1908.09644","last_updated":"2020-12-01T07:58:11Z","snapshot_observed_at":"2026-08-16T03:25:07.377210Z","submitted_at":"2019-08-20T21:19:04Z","title":"Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs","version":5},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:43.663005Z"},"links":{"citing_paper":"/paper/1908.09644"},"observation_digest":"sha256:e97f555a4eb915a65c8fac796559b129584f6576211cb72ff8e8ec907044ca21","observation_id":"50651d99-05c8-4fca-a4e2-79182480962e","resolution":{"observed_at":"2026-08-14T12:19:43.824762Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:19:43.805858Z","title":"Fortunato, Physics reports 486, 75 (2010)","venue":null,"work_id":"1066de35-5918-409d-b68f-781e55bf12f5","year":2010},"citing_paper":{"arxiv_id":"1908.09644","last_updated":"2020-12-01T07:58:11Z","snapshot_observed_at":"2026-08-16T03:25:07.377210Z","submitted_at":"2019-08-20T21:19:04Z","title":"Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs","version":5},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:43.667268Z"},"links":{"citing_paper":"/paper/1908.09644"},"observation_digest":"sha256:f5be9963eb20bf7106c4afa8e0ea6e69f5ea3cf67ff53333bf36508c572b48e5","observation_id":"945e12ce-c30b-479a-9456-2458fffe981e","resolution":{"observed_at":"2026-08-14T12:19:43.810389Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:19:43.790004Z","title":null,"venue":null,"work_id":"c899b4f1-f5bb-4bce-b6b6-1d1d3679d007","year":2006},"citing_paper":{"arxiv_id":"1908.09644","last_updated":"2020-12-01T07:58:11Z","snapshot_observed_at":"2026-08-16T03:25:07.377210Z","submitted_at":"2019-08-20T21:19:04Z","title":"Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs","version":5},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:43.671855Z"},"links":{"citing_paper":"/paper/1908.09644"},"observation_digest":"sha256:de7884144039622a8b580564a224ad0528a788ee8a3a43b4e5f7c40723233b64","observation_id":"8f388906-054b-415d-8036-6b0e4fdcf166","resolution":{"observed_at":"2026-08-14T12:19:43.795640Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:19:43.676499Z","title":"Clauset, M","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"1908.09644","last_updated":"2020-12-01T07:58:11Z","snapshot_observed_at":"2026-08-16T03:25:07.377210Z","submitted_at":"2019-08-20T21:19:04Z","title":"Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs","version":5},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:43.676499Z"},"links":{"citing_paper":"/paper/1908.09644"},"observation_digest":"sha256:96f51d40865e08c1ece5f7a31525af78a4aa1f75cdc7e2f278a9a899ce427f81","observation_id":"51559cd2-cabc-4a5c-8c47-d4da2a8bbe1a","resolution":{"observed_at":"2026-08-14T12:19:43.676499Z","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-14T12:19:43.681413Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"1908.09644","last_updated":"2020-12-01T07:58:11Z","snapshot_observed_at":"2026-08-16T03:25:07.377210Z","submitted_at":"2019-08-20T21:19:04Z","title":"Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs","version":5},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:43.681413Z"},"links":{"citing_paper":"/paper/1908.09644"},"observation_digest":"sha256:47e2a435abff682f4f1b2c8651b0b4666fa7a1b2ec3ba6d61e27d6a5ff2355d9","observation_id":"f4aac455-4f11-4caa-81c9-1dfe8ba5bb65","resolution":{"observed_at":"2026-08-14T12:19:43.681413Z","resolver_source":null,"status":"malformed_identifier"},"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-14T12:19:43.772526Z","title":"The graph we are going to study contains five nodes, as shown in Fig","venue":null,"work_id":"b1258222-ebff-4028-8358-cf35393af607","year":null},"citing_paper":{"arxiv_id":"1908.09644","last_updated":"2020-12-01T07:58:11Z","snapshot_observed_at":"2026-08-16T03:25:07.377210Z","submitted_at":"2019-08-20T21:19:04Z","title":"Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs","version":5},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:43.685593Z"},"links":{"citing_paper":"/paper/1908.09644"},"observation_digest":"sha256:699d3d391ab8a46604c29b3ee9ce268c2c1922bafa7f3e13807e938970dfc108","observation_id":"86a546ca-9538-414d-8781-397213c1e7fc","resolution":{"observed_at":"2026-08-14T12:19:43.778096Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:19:43.756698Z","title":null,"venue":null,"work_id":"d6347c22-523c-40ff-9fde-293f1273b27a","year":null},"citing_paper":{"arxiv_id":"1908.09644","last_updated":"2020-12-01T07:58:11Z","snapshot_observed_at":"2026-08-16T03:25:07.377210Z","submitted_at":"2019-08-20T21:19:04Z","title":"Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs","version":5},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:43.691300Z"},"links":{"citing_paper":"/paper/1908.09644"},"observation_digest":"sha256:26317e4a11787ba4590c1d7a842c6bee6496f474902d5dc8d7a56ab313cd1e0c","observation_id":"bcafc31a-9fa1-497f-a952-bdd628721117","resolution":{"observed_at":"2026-08-14T12:19:43.762382Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.09644","last_updated":"2020-12-01T07:58:11Z","latest_version":5,"primary_category":"cs.DM","snapshot_observed_at":"2026-08-16T03:25:07.377210Z","submitted_at":"2019-08-20T21:19:04Z","title":"Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs"},"reference_resolution":{"displayed":36,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":20,"verified_exact":0,"verified_fuzzy":15},"total_outbound_references":36},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 36 of 36 outbound references and 0 inbound Pith citation observations for arXiv:1908.09644."}