Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-14T12:19:43.691300Z
Paper Citation Record · LEDGER
Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs
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.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-16T06:30:59.297886+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links
A source-named dated measurement, never combined with another source.
Source: cited_works
Reference resolution
36 of 36 outbound references displayed
- verified exact0
- verified fuzzy15
- unresolved20
- parse uncertain0
- malformed identifier1
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation 8e01c144-a921-490f-99e7-b1c5cfc3144a · outbound
This paper cites Zoidi, E.
Reference 1
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:19:44.182529Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 836a3d07-0276-408e-9854-f027631b0f9e · outbound
This paper cites Fouss, A.
Reference 2
- Resolution
- unresolved
- no resolver link, observed 2026-08-14T12:19:43.541012Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation b5fd48c0-fe5d-4bb4-9105-546c8c19cdd4 · outbound
This paper cites an unresolved cited work.
Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs Unresolved cited work
Reference 3
- Resolution
- unresolved
- raw_fallback, observed 2026-08-14T12:19:44.197315Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 34409add-f94b-4123-94c3-8784908eda2f · outbound
This paper cites Jeh and J.
Reference 4
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:19:44.147215Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation faddc2d7-bafd-48d3-89b5-1bccd6044230 · outbound
This paper cites an unresolved cited work.
Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs Unresolved cited work
Reference 5
- Resolution
- unresolved
- raw_fallback, observed 2026-08-14T12:19:44.159754Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 6fb9a0eb-4c8e-4c3e-92b3-cce86f8bb5a2 · outbound
This paper cites Grover and J.
Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs Grover and J
Reference 6
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:19:44.121185Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation f785104e-9644-4cf1-81a3-dcd12e6f9237 · outbound
This paper cites Perozzi, R.
Reference 7
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:19:44.132738Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation ec609175-2f62-4b1f-b267-f84c02f6f9fb · outbound
This paper cites an unresolved cited work.
Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs Unresolved cited work
Reference 8
- Resolution
- unresolved
- no resolver link, observed 2026-08-14T12:19:43.570649Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation c3a96d2a-fc7c-46cc-b868-4035f28565bc · outbound
This paper cites Lov´ asz, Combinatorics, Paul erdos is eighty 2, 1 (1993).
Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs Lov´ asz, Combinatorics, Paul erdos is eighty 2, 1 (1993)
Reference 9
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:19:44.108775Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 8cb36c1a-9b70-4a3a-9622-296cfde3f286 · outbound
This paper cites Baesens, V.
Reference 10
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:19:44.073544Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 6df4a20b-8fd3-42a6-b19b-4ff3c479c662 · outbound
This paper cites an unresolved cited work.
Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs Unresolved cited work
Reference 11
- Resolution
- unresolved
- raw_fallback, observed 2026-08-14T12:19:44.086387Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 8d80e59d-08d7-4f2c-b8ac-25796b229c2e · outbound
This paper cites an unresolved cited work.
Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs Unresolved cited work
Reference 12
- Resolution
- unresolved
- raw_fallback, observed 2026-08-14T12:19:44.048389Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 2a24fce5-d86a-496e-bbca-534baefa8658 · outbound
This paper cites Mikolov, I.
Reference 13
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:19:44.061077Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 54d58af2-9169-4e20-8eef-1130ea32f7b2 · outbound
This paper cites an unresolved cited work.
Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs Unresolved cited work
Reference 14
- Resolution
- unresolved
- raw_fallback, observed 2026-08-14T12:19:44.019500Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 490818dc-0b5c-405c-a25d-8f158a446c82 · outbound
This paper cites an unresolved cited work.
Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs Unresolved cited work
Reference 15
- Resolution
- unresolved
- raw_fallback, observed 2026-08-14T12:19:44.210154Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 43cc5267-62cd-4894-a009-ddfea74d5247 · outbound
This paper cites Chung and S.-T.
Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs Chung and S.-T
Reference 16
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:19:44.034481Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 9290b42d-2892-4585-b433-62a3ea79c2b7 · outbound
This paper cites an unresolved cited work.
Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs Unresolved cited work
Reference 17
- Resolution
- unresolved
- raw_fallback, observed 2026-08-14T12:19:44.005473Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation c2dfc107-a679-4c72-8b7a-ce5565a18614 · outbound
This paper cites an unresolved cited work.
Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs Unresolved cited work
Reference 18
- Resolution
- unresolved
- raw_fallback, observed 2026-08-14T12:19:43.990031Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 1d1dcbce-d7e7-4a77-86a8-3c0f49ca1d89 · outbound
This paper cites an unresolved cited work.
Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs Unresolved cited work
Reference 19
- Resolution
- unresolved
- raw_fallback, observed 2026-08-14T12:19:43.973176Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 1cedf47f-5e56-4c60-9b67-f3deca111bb1 · outbound
This paper cites White and P.
Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs White and P
Reference 20
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:19:43.958779Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 3b566671-7253-4bad-9ea3-dadbc556f0dd · outbound
This paper cites Masuda, M.
Reference 21
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:19:43.944565Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 23af202d-7bdd-433a-a7d9-d692dcb29d54 · outbound
This paper cites an unresolved cited work.
Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs Unresolved cited work
Reference 22
- Resolution
- unresolved
- raw_fallback, observed 2026-08-14T12:19:43.930972Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation ce200fee-05b4-4148-83af-1243f8edca98 · outbound
This paper cites an unresolved cited work.
Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs Unresolved cited work
Reference 23
- Resolution
- unresolved
- raw_fallback, observed 2026-08-14T12:19:43.916617Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 98df46c2-d427-4182-9dae-7de21e811add · outbound
This paper cites an unresolved cited work.
Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs Unresolved cited work
Reference 24
- Resolution
- unresolved
- raw_fallback, observed 2026-08-14T12:19:43.902275Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 6cb47b2b-c4ef-401c-9fef-9f3ca722f380 · outbound
This paper cites an unresolved cited work.
Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs Unresolved cited work
Reference 25
- Resolution
- unresolved
- raw_fallback, observed 2026-08-14T12:19:43.888834Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 586713a7-e9e9-4975-8c44-12433b0f80e2 · outbound
This paper cites an unresolved cited work.
Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs Unresolved cited work
Reference 26
- Resolution
- unresolved
- raw_fallback, observed 2026-08-14T12:19:43.873995Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation ef2ce165-6d06-4c14-a699-543b0f79bbb8 · outbound
This paper cites Hamilton, Z.
Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs Hamilton, Z
Reference 27
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:19:43.856121Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 95535a1d-d91e-440c-a52d-675d0bca3991 · outbound
This paper cites Representation Learning on Graphs: Methods and Applications.
Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs Representation Learning on Graphs: Methods and Applications
Reference 28
- Resolution
- unresolved
- no resolver link, observed 2026-08-14T12:19:43.650643Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation db7e9078-28f3-4f59-a74e-92156c2e768b · outbound
This paper cites Abu-El-Haija, B.
Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs Abu-El-Haija, B
Reference 29
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:19:43.839941Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 50651d99-05c8-4fca-a4e2-79182480962e · outbound
This paper cites ˇReh˚ uˇ rek and P.
Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs ˇReh˚ uˇ rek and P
Reference 30
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:19:43.824762Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 945e12ce-c30b-479a-9456-2458fffe981e · outbound
This paper cites Fortunato, Physics reports 486, 75 (2010).
Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs Fortunato, Physics reports 486, 75 (2010)
Reference 31
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:19:43.810389Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 8f388906-054b-415d-8036-6b0e4fdcf166 · outbound
This paper cites an unresolved cited work.
Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs Unresolved cited work
Reference 32
- Resolution
- unresolved
- raw_fallback, observed 2026-08-14T12:19:43.795640Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 51559cd2-cabc-4a5c-8c47-d4da2a8bbe1a · outbound
This paper cites Clauset, M.
Reference 33
- Resolution
- unresolved
- no resolver link, observed 2026-08-14T12:19:43.676499Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation f4aac455-4f11-4caa-81c9-1dfe8ba5bb65 · outbound
This paper cites an unresolved cited work.
Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs Unresolved cited work
Reference 34
- Resolution
- malformed identifier
- no resolver link, observed 2026-08-14T12:19:43.681413Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 86a546ca-9538-414d-8781-397213c1e7fc · outbound
This paper cites The graph we are going to study contains five nodes, as shown in Fig.
Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs The graph we are going to study contains five nodes, as shown in Fig
Reference 35
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:19:43.778096Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation bcafc31a-9fa1-497f-a952-bdd628721117 · outbound
This paper cites an unresolved cited work.
Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs Unresolved cited work
Reference 36
- Resolution
- unresolved
- raw_fallback, observed 2026-08-14T12:19:43.762382Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Pith citing papers
No inbound Pith citation observations are available.