Pith. sign in

Paper Citation Record · LEDGER

Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs

As of 23 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.

pith.paper-citation-record.v1
1908.09644 v5

Coverage vector

measured 36 of 36 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-14T12:19:43.691300Z

measured 36 of 36 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-23T06:30:58.430688+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

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.

Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs 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-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-14T12:19:43.534293Z digest=sha256:0f715fbc7b8a30ebcf71d02c43225052620d01ddc9150bc50f73b43cd94fa77d

Observation 836a3d07-0276-408e-9854-f027631b0f9e · outbound

This paper cites Fouss, A.

Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs 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.

source=pdf_text observed=2026-08-14T12:19:43.541012Z digest=sha256:69a3debffe444a6d7f96d6d299e661bff296152f5f3a487a3e129f89229088ea

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-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-14T12:19:43.529565Z digest=sha256:db8c23f7d26afeabbc312d1f044ac39265a21de9deefde28e500b8fd30726074

Observation 34409add-f94b-4123-94c3-8784908eda2f · outbound

This paper cites Jeh and J.

Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs 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-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-14T12:19:43.552138Z digest=sha256:3cfdf654a9417685137cb6e58d4451177f9f926a97cd71c4da5de7f2a739853a

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-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-14T12:19:43.546756Z digest=sha256:6ceef4ab86a9063afc3385a48a5dedf8b2ba9d2ed2b7779f5e6bffb47b783f57

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-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-14T12:19:43.561051Z digest=sha256:921192865439e7fd5c4cc2d287c817cc9b019ecb60b735ea19d02acb5dca7e94

Observation f785104e-9644-4cf1-81a3-dcd12e6f9237 · outbound

This paper cites Perozzi, R.

Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs 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-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-14T12:19:43.556743Z digest=sha256:ab910e30e36b99fc636557f118a8b95d54c3bf33b078c8c191b7d4f3408adeb8

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.

source=pdf_text observed=2026-08-14T12:19:43.570649Z digest=sha256:845805c01b5dde11a049f908b9758a3ac1ffe50e346e5eec5fb44009067f5636

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-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-14T12:19:43.565787Z digest=sha256:24808cedaa08752bb9bca1a4937169a9df4593b5e95cf037c4ce618a98f05f6e

Observation 8cb36c1a-9b70-4a3a-9622-296cfde3f286 · outbound

This paper cites Baesens, V.

Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs 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-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-14T12:19:43.579373Z digest=sha256:028b0254efad5026b194aa6062ae18aedf9a18a2b00dd3e1ed88510c5ecd1308

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-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-14T12:19:43.574640Z digest=sha256:ad3ae93b4692046c3f7f065cc2af5dc1f17aac85434f4a978edde817a03b3e1e

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-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-14T12:19:43.588017Z digest=sha256:73ae17cbd05d73319e1588daf653ac25999c3798221f845c74830d13d92c5498

Observation 2a24fce5-d86a-496e-bbca-534baefa8658 · outbound

This paper cites Mikolov, I.

Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs 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-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-14T12:19:43.583871Z digest=sha256:8670d88619b599196df09dbf772f4022dea07f99661933c4306d0ab97318b06a

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-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-14T12:19:43.596668Z digest=sha256:7f18c14626323c07e92912504f332254bece8965aeb8e5088799d63389ca3143

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-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-14T12:19:43.522552Z digest=sha256:d3935748ec37e2428ddfc413c5c19e66ddbf52ab423bd0df681ed902f78a070f

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-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-14T12:19:43.592471Z digest=sha256:09a574802ded9adf138e669e30ca9c5dd77527f570be02aa32b09e7024a0445c

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-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-14T12:19:43.601930Z digest=sha256:40c441c6db26bfda8004b59d7811a56f143a92a3d740438ffdbe2204ca96428d

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-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-14T12:19:43.606216Z digest=sha256:a69668a3755b54e8b9ce9b5b84b0ece1852e5a7680870ec4cfef1b9b7afeb2c7

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-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-14T12:19:43.611050Z digest=sha256:54185a67db8082e3a408975c059f951ee965bdc3b2fe2a47d8913d738bb8382a

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-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-14T12:19:43.615123Z digest=sha256:44aa119a5259507a8064592f0e13794fa7e05301d6249faaba26da7e5a3bacb9

Observation 3b566671-7253-4bad-9ea3-dadbc556f0dd · outbound

This paper cites Masuda, M.

Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs 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-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-14T12:19:43.619510Z digest=sha256:4c9cb36f60aeac02ece685b422c473cecb29dd61814fb9e0f07b2b1eb70a64ca

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-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-14T12:19:43.624073Z digest=sha256:9a0491f5d1d9321edd24b0986d16f6eb646cdb00d6502fce3e068b76ef5bf02b

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-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-14T12:19:43.628439Z digest=sha256:435a9d4ab072796758a4d28dd7190f689557bc94127ea17fd0d75ce61ff719e0

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-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-14T12:19:43.633558Z digest=sha256:a14aeac026385e80b65b36e55fee16b717030023771d23fecafcfcc2360f2c0b

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-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-14T12:19:43.637786Z digest=sha256:4e9363ec3c4bb6cb6290ddcfbf48122a696b8418f36e5a377cc2facd57e6e6f9

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-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-14T12:19:43.642515Z digest=sha256:2495ce29817d1183d2f556a74a39691d588cf63a8cdca37f203151430d1c1d1a

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-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-14T12:19:43.646645Z digest=sha256:48f682085b00dba43c0e090e61d564806dd93786b5f1ea1e71b31b415484a381

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.

source=pdf_text observed=2026-08-14T12:19:43.650643Z digest=sha256:2d1aa5600ddc852d83aec00534678ed19dd98eb1e8579959780e300e6b9515a4

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-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-14T12:19:43.657132Z digest=sha256:86159447277895665955671d127e2f6c0c5eeb2bb9cba890acf30a511c8e5475

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-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-14T12:19:43.663005Z digest=sha256:c7d827044deab2127df54db28a7c8b07304b69a27c57b2515dfee95b278f0981

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-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-14T12:19:43.667268Z digest=sha256:ab131ae618e4e044d63a9fbc3ce6cf205bc7c1653c49e6aeeb5d0331a355989c

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-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-14T12:19:43.671855Z digest=sha256:7e3a3abde733cbdd2426974f5602dea98c66c95041dffa84a02b53561c7b7738

Observation 51559cd2-cabc-4a5c-8c47-d4da2a8bbe1a · outbound

This paper cites Clauset, M.

Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs 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.

source=pdf_text observed=2026-08-14T12:19:43.676499Z digest=sha256:8ac57da391dd4a20e810d7d64bfdf128e500f719e0fe99d00718b57279a92028

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.

source=pdf_text observed=2026-08-14T12:19:43.681413Z digest=sha256:7b2af8ad17d39c4308ec9247bd6a122f4430aeb5e10167ad2e4bfc00efd2bd49

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-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-14T12:19:43.685593Z digest=sha256:75ff9632b1fd6c56edbdd6491810fed92c1c22f4810d913d9fb84126e56f02a2

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-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-14T12:19:43.691300Z digest=sha256:fde35a7548c5054e6360176a140956a13da64681020756bd1a19d2a852f28ced

Pith citing papers

No inbound Pith citation observations are available.