{"as_of":"2026-08-08T02:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:682f19992173da796b3f118df061409e0ef5d924317c4d8f29e694532eef7cf7","coverage":[{"denominator":53,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":53,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T13:28:02.641948Z","state":"measured"},{"denominator":53,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":53,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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/2505.21706/citation-record","integrity":"/paper/2505.21706/integrity","json":"/paper/2505.21706/citation-record.json","paper":"/paper/2505.21706"},"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-07T13:28:10.806578Z","title":"Costa, Osvaldo N","venue":null,"work_id":"ad9e671e-1f66-4630-ab01-fae5b15ac6af","year":2011},"citing_paper":{"arxiv_id":"2505.21706","last_updated":"2025-05-27T19:43:32Z","snapshot_observed_at":"2026-08-07T13:22:21.810724Z","submitted_at":"2025-05-27T19:43:32Z","title":"Network classification through random walks","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T13:27:58.372894Z"},"links":{"citing_paper":"/paper/2505.21706"},"observation_digest":"sha256:c14ad3bdd392f3c819e7b017a1759040497f4aa1e229aae632daf7c416712d04","observation_id":"dc16e5d2-bd39-46ea-8278-98aaec3268ab","resolution":{"observed_at":"2026-08-07T13:28:10.894714Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:28:10.610028Z","title":"Costa, Francisco A","venue":null,"work_id":"b3609068-c04a-42d2-8ed0-67a929dea745","year":2007},"citing_paper":{"arxiv_id":"2505.21706","last_updated":"2025-05-27T19:43:32Z","snapshot_observed_at":"2026-08-07T13:22:21.810724Z","submitted_at":"2025-05-27T19:43:32Z","title":"Network classification through random walks","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T13:27:58.443915Z"},"links":{"citing_paper":"/paper/2505.21706"},"observation_digest":"sha256:b700eb0c654ea69a769990778375a16efb8119f229d324dd9064e256250b1963","observation_id":"fb8e49f5-e272-4af3-83b3-01350ace1a36","resolution":{"observed_at":"2026-08-07T13:28:10.717640Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:28:10.408538Z","title":"Neiva and Odemir M","venue":null,"work_id":"94d6a3da-ed3f-48f1-8ac1-ce066cd16eeb","year":2023},"citing_paper":{"arxiv_id":"2505.21706","last_updated":"2025-05-27T19:43:32Z","snapshot_observed_at":"2026-08-07T13:22:21.810724Z","submitted_at":"2025-05-27T19:43:32Z","title":"Network classification through random walks","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T13:27:58.602814Z"},"links":{"citing_paper":"/paper/2505.21706"},"observation_digest":"sha256:cfeef4fb35f0fba82a55eade8590afeec3d8dbfa33d2c5d5f57ca8e5fe4e0732","observation_id":"d22c3122-3d56-4aa2-b2a4-9a8913dd13e8","resolution":{"observed_at":"2026-08-07T13:28:10.505834Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:28:10.255580Z","title":"Complex network classification with convolutional neural network","venue":null,"work_id":"d5731420-3b9b-4e6e-96eb-0f34d459ec3f","year":2020},"citing_paper":{"arxiv_id":"2505.21706","last_updated":"2025-05-27T19:43:32Z","snapshot_observed_at":"2026-08-07T13:22:21.810724Z","submitted_at":"2025-05-27T19:43:32Z","title":"Network classification through random walks","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T13:27:58.717881Z"},"links":{"citing_paper":"/paper/2505.21706"},"observation_digest":"sha256:605bc01927040c8d870d192e806eeec43f535756ebc32f2c646203496752225f","observation_id":"06293749-a1e4-4bb3-834e-c881709693bb","resolution":{"observed_at":"2026-08-07T13:28:10.328862Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:28:10.086778Z","title":"A graph convolutional neural network for classification of building patterns using spatial vector data.ISPRS Journal of Photogrammetry and Remote Sensing, 150:259– 273, 2019","venue":null,"work_id":"efa4caa1-c4f3-45a2-9a60-2ee84e10d673","year":2019},"citing_paper":{"arxiv_id":"2505.21706","last_updated":"2025-05-27T19:43:32Z","snapshot_observed_at":"2026-08-07T13:22:21.810724Z","submitted_at":"2025-05-27T19:43:32Z","title":"Network classification through random walks","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T13:27:58.794967Z"},"links":{"citing_paper":"/paper/2505.21706"},"observation_digest":"sha256:003697a84b72e1b41d9403c95a8b804b0fba2b0a0267c14c79fdace28f2ec9aa","observation_id":"871c1eb9-24d7-42f9-b78f-496e23909189","resolution":{"observed_at":"2026-08-07T13:28:10.157996Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:28:09.865246Z","title":"A deep graph convolutional neural network architecture for graph classification.PLoS ONE, 18(3):e0279604, 2023","venue":null,"work_id":"5a963465-a798-4e1b-8207-4f95ba979aa1","year":2023},"citing_paper":{"arxiv_id":"2505.21706","last_updated":"2025-05-27T19:43:32Z","snapshot_observed_at":"2026-08-07T13:22:21.810724Z","submitted_at":"2025-05-27T19:43:32Z","title":"Network classification through random walks","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T13:27:58.881402Z"},"links":{"citing_paper":"/paper/2505.21706"},"observation_digest":"sha256:60621a7199902ad95c0011a14a77adc02ba222d245d959fc41f2255b3c6766d1","observation_id":"eef52b16-7230-4cf7-9469-ffdb557adae6","resolution":{"observed_at":"2026-08-07T13:28:09.953229Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:28:09.635448Z","title":null,"venue":null,"work_id":"e8136f6a-cd07-4409-9ece-ca7734746b53","year":2016},"citing_paper":{"arxiv_id":"2505.21706","last_updated":"2025-05-27T19:43:32Z","snapshot_observed_at":"2026-08-07T13:22:21.810724Z","submitted_at":"2025-05-27T19:43:32Z","title":"Network classification through random walks","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T13:27:58.978097Z"},"links":{"citing_paper":"/paper/2505.21706"},"observation_digest":"sha256:3f4ad18dc24253a95529fd88e9ce35bc04be5cb17e56cc23a996682fa8adfa0a","observation_id":"e59c42e2-a2a5-49db-b22d-73b12f62bdc0","resolution":{"observed_at":"2026-08-07T13:28:09.712943Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:28:09.458592Z","title":"Ribas, Jeaneth Machicao, and Odemir M","venue":null,"work_id":"feca3987-a263-4b93-b8fb-e5ffee681f38","year":2020},"citing_paper":{"arxiv_id":"2505.21706","last_updated":"2025-05-27T19:43:32Z","snapshot_observed_at":"2026-08-07T13:22:21.810724Z","submitted_at":"2025-05-27T19:43:32Z","title":"Network classification through random walks","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T13:27:59.076722Z"},"links":{"citing_paper":"/paper/2505.21706"},"observation_digest":"sha256:506f2fb31761fef46006a9ef8b75119c33fee273e78753b941073bec0402b36f","observation_id":"9d6ef2eb-1d43-4a52-819a-fafc488f60dc","resolution":{"observed_at":"2026-08-07T13:28:09.546002Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:28:09.239588Z","title":null,"venue":null,"work_id":"11c6b0c9-cda1-4e8b-8010-95af0e90d13e","year":2024},"citing_paper":{"arxiv_id":"2505.21706","last_updated":"2025-05-27T19:43:32Z","snapshot_observed_at":"2026-08-07T13:22:21.810724Z","submitted_at":"2025-05-27T19:43:32Z","title":"Network classification through random walks","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T13:27:59.149539Z"},"links":{"citing_paper":"/paper/2505.21706"},"observation_digest":"sha256:bf30243df3db5eaa139757e2f65d22c0c6cf3778589bc0047b32e832b32a6172","observation_id":"d235cdc9-0e95-491b-b027-f4413145078f","resolution":{"observed_at":"2026-08-07T13:28:09.313224Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:28:09.017160Z","title":"Supervised random walks: predicting and recommending links in social networks","venue":null,"work_id":"d7374011-fdb3-4aa1-8842-2b269357e6f6","year":2011},"citing_paper":{"arxiv_id":"2505.21706","last_updated":"2025-05-27T19:43:32Z","snapshot_observed_at":"2026-08-07T13:22:21.810724Z","submitted_at":"2025-05-27T19:43:32Z","title":"Network classification through random walks","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T13:27:59.224107Z"},"links":{"citing_paper":"/paper/2505.21706"},"observation_digest":"sha256:136c25990d5015f6efabeeb8f7da609b29119bf9c5c892f4d4e528408b9a71c9","observation_id":"ec04ffdd-6bf5-4f95-97f9-08048d1a1a9d","resolution":{"observed_at":"2026-08-07T13:28:09.131764Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:28:08.823943Z","title":"Silva and Liang Zhao","venue":null,"work_id":"dede46c3-3578-48f8-98f3-046659722804","year":2015},"citing_paper":{"arxiv_id":"2505.21706","last_updated":"2025-05-27T19:43:32Z","snapshot_observed_at":"2026-08-07T13:22:21.810724Z","submitted_at":"2025-05-27T19:43:32Z","title":"Network classification through random walks","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T13:27:59.316824Z"},"links":{"citing_paper":"/paper/2505.21706"},"observation_digest":"sha256:f0bca7061b490ab6543daa2aa6b36cc9b955a1e5a34843930017f42017b34a4e","observation_id":"94a6b75d-2b56-4c90-a1a7-564ec4c319dd","resolution":{"observed_at":"2026-08-07T13:28:08.931705Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:28:08.617241Z","title":"Gonçalves, André R","venue":null,"work_id":"7900977b-197b-4e0f-bebb-576d350b7029","year":2012},"citing_paper":{"arxiv_id":"2505.21706","last_updated":"2025-05-27T19:43:32Z","snapshot_observed_at":"2026-08-07T13:22:21.810724Z","submitted_at":"2025-05-27T19:43:32Z","title":"Network classification through random walks","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T13:27:59.424862Z"},"links":{"citing_paper":"/paper/2505.21706"},"observation_digest":"sha256:428b3fa5285b130a8e5ee3b348d2a4a14ae784e8390e74ed72da4715b159a274","observation_id":"889cd179-7307-41e5-88e5-0e8886f6ee5e","resolution":{"observed_at":"2026-08-07T13:28:08.726478Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:28:08.420293Z","title":"Gonçalves, Alexandre S","venue":null,"work_id":"16864e8e-0415-4741-856a-54f54fbb754c","year":2012},"citing_paper":{"arxiv_id":"2505.21706","last_updated":"2025-05-27T19:43:32Z","snapshot_observed_at":"2026-08-07T13:22:21.810724Z","submitted_at":"2025-05-27T19:43:32Z","title":"Network classification through random walks","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T13:27:59.516976Z"},"links":{"citing_paper":"/paper/2505.21706"},"observation_digest":"sha256:36cf3167b1bbfcfaed541496f18c98af3d419c2acb087c746c0e3b0a7e38963a","observation_id":"aee3d1ae-aed2-4728-a437-abe9d0a18df6","resolution":{"observed_at":"2026-08-07T13:28:08.528422Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:28:08.203804Z","title":null,"venue":null,"work_id":"f0fba258-4f4e-4513-b3d6-1da71994e164","year":1995},"citing_paper":{"arxiv_id":"2505.21706","last_updated":"2025-05-27T19:43:32Z","snapshot_observed_at":"2026-08-07T13:22:21.810724Z","submitted_at":"2025-05-27T19:43:32Z","title":"Network classification through random walks","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T13:27:59.594917Z"},"links":{"citing_paper":"/paper/2505.21706"},"observation_digest":"sha256:c7ed1d069f5a5d03614429b2323c2d6ff83590c75ae794c258c3ba3dc6763e22","observation_id":"d48645ec-6aaf-46d3-b578-4b5b57792923","resolution":{"observed_at":"2026-08-07T13:28:08.318303Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:28:07.950927Z","title":"John Wiley & Sons, 2013","venue":null,"work_id":"9bc7de5d-81f6-4cbe-a84a-9f0f6b6de672","year":2013},"citing_paper":{"arxiv_id":"2505.21706","last_updated":"2025-05-27T19:43:32Z","snapshot_observed_at":"2026-08-07T13:22:21.810724Z","submitted_at":"2025-05-27T19:43:32Z","title":"Network classification through random walks","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T13:27:59.662402Z"},"links":{"citing_paper":"/paper/2505.21706"},"observation_digest":"sha256:61447965b83f53af0e582f508b828d4910427da9ad0881b9823407c438b3f9b9","observation_id":"8147bab1-7008-4856-ab35-bfa0b6b36137","resolution":{"observed_at":"2026-08-07T13:28:08.091052Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:28:07.839942Z","title":"Foraging and movement paths of female reindeer: insights from fractal analysis, correlated random walks, and lévy flights.Canadian Journal of Zoology, 80(5):854–865, 2002","venue":null,"work_id":"cd00bd9a-7a11-454f-afcf-f56560cd4a62","year":2002},"citing_paper":{"arxiv_id":"2505.21706","last_updated":"2025-05-27T19:43:32Z","snapshot_observed_at":"2026-08-07T13:22:21.810724Z","submitted_at":"2025-05-27T19:43:32Z","title":"Network classification through random walks","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T13:27:59.711751Z"},"links":{"citing_paper":"/paper/2505.21706"},"observation_digest":"sha256:699a35643eb2ef7424684c9e1825c0218465c47143fd2edfb21d7b81a229fc19","observation_id":"7ce58cfa-4135-457c-80f8-32480e925cd3","resolution":{"observed_at":"2026-08-07T13:28:07.880874Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:28:07.745427Z","title":"Random walks: A review of algorithms and applications.IEEE Transactions on Emerging Topics in Computational Intelligence, 4(2):95–107, 2019","venue":null,"work_id":"86715135-0ed2-426b-93ac-d4cb49b33685","year":2019},"citing_paper":{"arxiv_id":"2505.21706","last_updated":"2025-05-27T19:43:32Z","snapshot_observed_at":"2026-08-07T13:22:21.810724Z","submitted_at":"2025-05-27T19:43:32Z","title":"Network classification through random walks","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T13:27:59.787092Z"},"links":{"citing_paper":"/paper/2505.21706"},"observation_digest":"sha256:5d0f5e02b5b40e046fecae20c2f8fd6d098ddfcee535072c88fcd8672a8d9e20","observation_id":"3dbb94ec-f9e6-4c69-b77d-eca7736f1f3f","resolution":{"observed_at":"2026-08-07T13:28:07.793127Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:28:07.607050Z","title":"Random-walk model of chain-polymer adsorption at a surface.The Journal of Chemical Physics, 43(7):2392–2407, 1965","venue":null,"work_id":"4d68aada-e2ab-45ff-964c-3c2e7e735b8d","year":1965},"citing_paper":{"arxiv_id":"2505.21706","last_updated":"2025-05-27T19:43:32Z","snapshot_observed_at":"2026-08-07T13:22:21.810724Z","submitted_at":"2025-05-27T19:43:32Z","title":"Network classification through random walks","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T13:27:59.897762Z"},"links":{"citing_paper":"/paper/2505.21706"},"observation_digest":"sha256:5e35815d0671dd4a78d6c24d4465f7053b60b70f3a8e9284b3bb937cfbab6fa8","observation_id":"3f8b4a5d-8a13-4bb3-b1ce-e10b2b6dbe1e","resolution":{"observed_at":"2026-08-07T13:28:07.660633Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:28:07.477325Z","title":"Porter, and Renaud Lambiotte","venue":null,"work_id":"124bb953-9f69-4b0e-b7d2-f570b95e882f","year":2017},"citing_paper":{"arxiv_id":"2505.21706","last_updated":"2025-05-27T19:43:32Z","snapshot_observed_at":"2026-08-07T13:22:21.810724Z","submitted_at":"2025-05-27T19:43:32Z","title":"Network classification through random walks","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T13:28:00.003780Z"},"links":{"citing_paper":"/paper/2505.21706"},"observation_digest":"sha256:9dc42328ef5c8ec57ad7dd11a4beb491d04bd86447f196dbcffa8c18b9a617ad","observation_id":"c6c1ca85-e76c-4bd6-b766-5705d1d2487e","resolution":{"observed_at":"2026-08-07T13:28:07.543038Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:28:07.359279Z","title":"Random Walks on Complex Networks.Physical Review Letters, 92(11):118701, March 2004","venue":null,"work_id":"e42beb4a-6c14-4291-b695-5aadfb265782","year":2004},"citing_paper":{"arxiv_id":"2505.21706","last_updated":"2025-05-27T19:43:32Z","snapshot_observed_at":"2026-08-07T13:22:21.810724Z","submitted_at":"2025-05-27T19:43:32Z","title":"Network classification through random walks","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T13:28:00.101846Z"},"links":{"citing_paper":"/paper/2505.21706"},"observation_digest":"sha256:37f60fe6b7b26b84a89ce83a5c574aaacb984c810121c78b59d8c906fb3311fb","observation_id":"271d4f86-e1bb-4edf-8566-16dad26e0125","resolution":{"observed_at":"2026-08-07T13:28:07.398187Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:28:07.276240Z","title":"Exploring complex networks through random walks.Physical Review E, 75(1):016102, January 2007","venue":null,"work_id":"1568e122-1534-4ba6-9c7a-f7f68262c60d","year":2007},"citing_paper":{"arxiv_id":"2505.21706","last_updated":"2025-05-27T19:43:32Z","snapshot_observed_at":"2026-08-07T13:22:21.810724Z","submitted_at":"2025-05-27T19:43:32Z","title":"Network classification through random walks","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T13:28:00.189702Z"},"links":{"citing_paper":"/paper/2505.21706"},"observation_digest":"sha256:38d50e5f9d1b174a1cba3ea71f623ceecf8ac70526d7d8554dd9b649d83edd49","observation_id":"a6ece50a-dec0-44d0-b5a2-e7a39178fa0b","resolution":{"observed_at":"2026-08-07T13:28:07.306121Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:28:07.098474Z","title":"Biased random walks in complex networks: The role of local navigation rules.Physical Review E, 80(1):016107, July 2009","venue":null,"work_id":"c8916027-e33a-4aeb-91b6-3ca4837a12f9","year":2009},"citing_paper":{"arxiv_id":"2505.21706","last_updated":"2025-05-27T19:43:32Z","snapshot_observed_at":"2026-08-07T13:22:21.810724Z","submitted_at":"2025-05-27T19:43:32Z","title":"Network classification through random walks","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T13:28:00.232043Z"},"links":{"citing_paper":"/paper/2505.21706"},"observation_digest":"sha256:6446be5e1f570a65a7291cad4059d275931e1a90edb7b3140943f3a2b88ab2ff","observation_id":"1124d51a-25bd-4aa7-80bc-336f508d8461","resolution":{"observed_at":"2026-08-07T13:28:07.161216Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:28:06.980363Z","title":null,"venue":null,"work_id":"e07b1c6f-69e2-44ca-9864-0dd521451779","year":2005},"citing_paper":{"arxiv_id":"2505.21706","last_updated":"2025-05-27T19:43:32Z","snapshot_observed_at":"2026-08-07T13:22:21.810724Z","submitted_at":"2025-05-27T19:43:32Z","title":"Network classification through random walks","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T13:28:00.287581Z"},"links":{"citing_paper":"/paper/2505.21706"},"observation_digest":"sha256:474b23479f041d3b7be753f2c905f4573e5bb3d86b147cd832dca35542d50f11","observation_id":"9bf5a0ee-e704-49f5-bc1c-f0af0b8e18e6","resolution":{"observed_at":"2026-08-07T13:28:07.034867Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:28:06.896366Z","title":"Complex network comparison using random walks","venue":null,"work_id":"c0630736-5586-4b7d-9138-35a5b1cd1266","year":2014},"citing_paper":{"arxiv_id":"2505.21706","last_updated":"2025-05-27T19:43:32Z","snapshot_observed_at":"2026-08-07T13:22:21.810724Z","submitted_at":"2025-05-27T19:43:32Z","title":"Network classification through random walks","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T13:28:00.348077Z"},"links":{"citing_paper":"/paper/2505.21706"},"observation_digest":"sha256:9c875343754a36ee8bc3b8fd80e1f32c42419474b9172898a3cc4e78c6442de4","observation_id":"e13d9ec2-b79a-4372-bd9e-cac9db2fd512","resolution":{"observed_at":"2026-08-07T13:28:06.924918Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:28:06.810557Z","title":"Random walks on complex trees.Physical Review E, 78(1):011114, July 2008","venue":null,"work_id":"ce714f0a-85fa-444b-91ef-77fc76e99fcd","year":2008},"citing_paper":{"arxiv_id":"2505.21706","last_updated":"2025-05-27T19:43:32Z","snapshot_observed_at":"2026-08-07T13:22:21.810724Z","submitted_at":"2025-05-27T19:43:32Z","title":"Network classification through random walks","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T13:28:00.452008Z"},"links":{"citing_paper":"/paper/2505.21706"},"observation_digest":"sha256:0e6fe06490eb8799fdffbf4795cb8e7867c8555a45604620e60c1a7835b9d8a4","observation_id":"2b2816da-b2ca-493a-b344-64841c60b762","resolution":{"observed_at":"2026-08-07T13:28:06.869859Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:28:06.681461Z","title":"Random Walks and Search in Time-Varying Networks.Physical Review Letters, 109(23):238701, December 2012","venue":null,"work_id":"f0445ee1-c936-4655-a134-1d5ededb6363","year":2012},"citing_paper":{"arxiv_id":"2505.21706","last_updated":"2025-05-27T19:43:32Z","snapshot_observed_at":"2026-08-07T13:22:21.810724Z","submitted_at":"2025-05-27T19:43:32Z","title":"Network classification through random walks","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T13:28:00.534990Z"},"links":{"citing_paper":"/paper/2505.21706"},"observation_digest":"sha256:4aba7ae5eff68051e066e4c9af03ae13e7cb63ed2df79c89764e9122c84ccef4","observation_id":"d309bc32-fc6f-44db-95bb-ecd527b37928","resolution":{"observed_at":"2026-08-07T13:28:06.730902Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:28:06.566149Z","title":"Random walks on temporal networks.Physical Review E, 85(5):056115, May 2012","venue":null,"work_id":"b70a6bff-ed0d-465a-9f7c-5474345fadba","year":2012},"citing_paper":{"arxiv_id":"2505.21706","last_updated":"2025-05-27T19:43:32Z","snapshot_observed_at":"2026-08-07T13:22:21.810724Z","submitted_at":"2025-05-27T19:43:32Z","title":"Network classification through random walks","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T13:28:00.609643Z"},"links":{"citing_paper":"/paper/2505.21706"},"observation_digest":"sha256:d297850288da97da81ac924d8ab8b623b86e0e123c1b0a1e7ef19e09f7a5f844","observation_id":"9d1f807c-7743-43d4-8187-2d5eff06fe42","resolution":{"observed_at":"2026-08-07T13:28:06.607599Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:28:06.466386Z","title":"Random walks on weighted networks.Physical Review E, 87(1):012112, January 2013","venue":null,"work_id":"de835d7f-25f7-4e16-b067-cf3e7ff2dbb7","year":2013},"citing_paper":{"arxiv_id":"2505.21706","last_updated":"2025-05-27T19:43:32Z","snapshot_observed_at":"2026-08-07T13:22:21.810724Z","submitted_at":"2025-05-27T19:43:32Z","title":"Network classification through random walks","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T13:28:00.661671Z"},"links":{"citing_paper":"/paper/2505.21706"},"observation_digest":"sha256:47f9800c41dbeda1da4a64959ed438b9aabd3cc1b17ff7f802da1b37ec4874ca","observation_id":"5b2dffbc-663b-4d6b-9343-d391ebb0492d","resolution":{"observed_at":"2026-08-07T13:28:06.518067Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:28:06.360214Z","title":"Random walks on weighted networks: A survey of local and non-local dynamics","venue":null,"work_id":"453e5fff-f92c-4ac2-b368-ec99f3d46141","year":2021},"citing_paper":{"arxiv_id":"2505.21706","last_updated":"2025-05-27T19:43:32Z","snapshot_observed_at":"2026-08-07T13:22:21.810724Z","submitted_at":"2025-05-27T19:43:32Z","title":"Network classification through random walks","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T13:28:00.756251Z"},"links":{"citing_paper":"/paper/2505.21706"},"observation_digest":"sha256:56ab9e5b7257661c51e175defd9768506c158ab4e37a3730ad146202c51117dd","observation_id":"ae1a65d5-655b-4e24-ab45-286fd457a1c8","resolution":{"observed_at":"2026-08-07T13:28:06.418354Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:28:06.266442Z","title":"Random walk centrality in interconnected multilayer networks.Physica D: Nonlinear Phenomena, 323–324:73–79, June 2016","venue":null,"work_id":"0d01d180-a883-4783-ae9d-5f17e0827b83","year":2016},"citing_paper":{"arxiv_id":"2505.21706","last_updated":"2025-05-27T19:43:32Z","snapshot_observed_at":"2026-08-07T13:22:21.810724Z","submitted_at":"2025-05-27T19:43:32Z","title":"Network classification through random walks","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T13:28:00.865262Z"},"links":{"citing_paper":"/paper/2505.21706"},"observation_digest":"sha256:9c9cae46da224439a9cc95dfef3be0df7c7a75666b9088fa409cfc903bf79c94","observation_id":"754a8236-a27b-4760-8af3-6184efddce3e","resolution":{"observed_at":"2026-08-07T13:28:06.308299Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:28:06.158522Z","title":"Random walks on hypergraphs.Physical Review E, 101(2):022308, February 2020","venue":null,"work_id":"20fb9025-148a-41d4-a7b5-42d9aeb56b82","year":2020},"citing_paper":{"arxiv_id":"2505.21706","last_updated":"2025-05-27T19:43:32Z","snapshot_observed_at":"2026-08-07T13:22:21.810724Z","submitted_at":"2025-05-27T19:43:32Z","title":"Network classification through random walks","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T13:28:00.926736Z"},"links":{"citing_paper":"/paper/2505.21706"},"observation_digest":"sha256:66f686413112596071b301a0d6395f8a95845a17cdc49bf26cc4f442d944b880","observation_id":"49faf222-4eeb-4a5e-9626-cb76a711b29e","resolution":{"observed_at":"2026-08-07T13:28:06.211842Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:28:05.975358Z","title":"Self-avoiding walks on irregular networks.Journal of Physics A: Mathematical and General, 10(2):197–204, February 1977","venue":null,"work_id":"3e1ac356-2256-457e-a1f8-fcbada240e58","year":1977},"citing_paper":{"arxiv_id":"2505.21706","last_updated":"2025-05-27T19:43:32Z","snapshot_observed_at":"2026-08-07T13:22:21.810724Z","submitted_at":"2025-05-27T19:43:32Z","title":"Network classification through random walks","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T13:28:00.990902Z"},"links":{"citing_paper":"/paper/2505.21706"},"observation_digest":"sha256:31cfb4cf399169bcda4ffbc6ce05b8a112bf80054492268b8c5b88e448fc6d17","observation_id":"3013e255-ae84-474d-bd46-2232429d606e","resolution":{"observed_at":"2026-08-07T13:28:06.093077Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:28:05.817966Z","title":"Diffusion on self-avoiding walk networks.Journal of Physics A: Mathematical and General, 22(17):3621–3627, September 1989","venue":null,"work_id":"345c7d3f-caa5-4525-ae51-43d3bc87eccd","year":1989},"citing_paper":{"arxiv_id":"2505.21706","last_updated":"2025-05-27T19:43:32Z","snapshot_observed_at":"2026-08-07T13:22:21.810724Z","submitted_at":"2025-05-27T19:43:32Z","title":"Network classification through random walks","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T13:28:01.073270Z"},"links":{"citing_paper":"/paper/2505.21706"},"observation_digest":"sha256:d70e2a26b6a21895e3d00d5648968e9a02516d62735086a435500b64d1f8b0a2","observation_id":"0bc895a2-d8a2-4f37-9b91-ba190885c17f","resolution":{"observed_at":"2026-08-07T13:28:05.884812Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:28:05.710200Z","title":"Herrero and Martha Saboyá","venue":null,"work_id":"56b77a9d-4a7b-44e3-b409-16ea47960013","year":2003},"citing_paper":{"arxiv_id":"2505.21706","last_updated":"2025-05-27T19:43:32Z","snapshot_observed_at":"2026-08-07T13:22:21.810724Z","submitted_at":"2025-05-27T19:43:32Z","title":"Network classification through random walks","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T13:28:01.142540Z"},"links":{"citing_paper":"/paper/2505.21706"},"observation_digest":"sha256:1a80be1f95b5f2dfba96810ce2d27159c0e198e3485ecd3a62515863cb543e62","observation_id":"207e0da9-bcc1-4bf2-9c75-689709569aa7","resolution":{"observed_at":"2026-08-07T13:28:05.762589Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:28:05.497112Z","title":null,"venue":null,"work_id":"1fb64c75-fab0-4c5c-b4f6-12e3fef1cc74","year":2005},"citing_paper":{"arxiv_id":"2505.21706","last_updated":"2025-05-27T19:43:32Z","snapshot_observed_at":"2026-08-07T13:22:21.810724Z","submitted_at":"2025-05-27T19:43:32Z","title":"Network classification through random walks","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T13:28:01.190901Z"},"links":{"citing_paper":"/paper/2505.21706"},"observation_digest":"sha256:b280c91ebe6f4cfc6cc21912b8c39a1f05a45a55ac1dbb1a5c752b1200703f43","observation_id":"646c50ea-d8e4-4888-b0f6-3bc4d893b84e","resolution":{"observed_at":"2026-08-07T13:28:05.582943Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:28:05.355592Z","title":"Exploring complex networks by walking on them.Physical Review E, 71(1):016107, January 2005","venue":null,"work_id":"9e1f55d6-0e59-4871-bd7f-e5b95ee8a9e9","year":2005},"citing_paper":{"arxiv_id":"2505.21706","last_updated":"2025-05-27T19:43:32Z","snapshot_observed_at":"2026-08-07T13:22:21.810724Z","submitted_at":"2025-05-27T19:43:32Z","title":"Network classification through random walks","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T13:28:01.280550Z"},"links":{"citing_paper":"/paper/2505.21706"},"observation_digest":"sha256:d3de39e26005d105eb3ffd51ee28cb0e2d8e9c85d021e5689f15c04d0fa230ca","observation_id":"88a3f646-29c2-4df0-ab9c-1850d1012458","resolution":{"observed_at":"2026-08-07T13:28:05.422689Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:28:05.202049Z","title":"López Millán, Vicent Cholvi, Luis López, and Antonio Fernández Anta","venue":null,"work_id":"24ffc20d-efbe-4c37-8d01-bab5303cdaa5","year":2012},"citing_paper":{"arxiv_id":"2505.21706","last_updated":"2025-05-27T19:43:32Z","snapshot_observed_at":"2026-08-07T13:22:21.810724Z","submitted_at":"2025-05-27T19:43:32Z","title":"Network classification through random walks","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T13:28:01.376765Z"},"links":{"citing_paper":"/paper/2505.21706"},"observation_digest":"sha256:96edfd1ef55d19781ae3e7b7e6c445bd4ac96552090699c8cb633d1cc475b4b4","observation_id":"8cb75559-1051-4ffe-b6d6-3ded8e779b6d","resolution":{"observed_at":"2026-08-07T13:28:05.286037Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:28:05.043134Z","title":"Network exploration using true self-avoiding walks.Physical Review E, 94(4):042309, October 2016","venue":null,"work_id":"e84bdda6-e383-4578-9338-3deb39db1c8c","year":2016},"citing_paper":{"arxiv_id":"2505.21706","last_updated":"2025-05-27T19:43:32Z","snapshot_observed_at":"2026-08-07T13:22:21.810724Z","submitted_at":"2025-05-27T19:43:32Z","title":"Network classification through random walks","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T13:28:01.464270Z"},"links":{"citing_paper":"/paper/2505.21706"},"observation_digest":"sha256:94c7f0a0884db725169ad6a49b7452ba53f13ab75d5e9162942c43141cd64d2e","observation_id":"c8b73871-c652-4ae0-99cf-534a661afee5","resolution":{"observed_at":"2026-08-07T13:28:05.137245Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:28:04.848434Z","title":"Characteristic times of biased random walks on complex networks.Physical Review E, 89(1):012803, January 2014","venue":null,"work_id":"ab7753ef-d548-41cc-b6d9-c18ea1e114a8","year":2014},"citing_paper":{"arxiv_id":"2505.21706","last_updated":"2025-05-27T19:43:32Z","snapshot_observed_at":"2026-08-07T13:22:21.810724Z","submitted_at":"2025-05-27T19:43:32Z","title":"Network classification through random walks","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T13:28:01.545426Z"},"links":{"citing_paper":"/paper/2505.21706"},"observation_digest":"sha256:a530255e83391918954c8849b666ad004350afecc288dfba2e3c070d264ec2f7","observation_id":"048e5670-30c0-43c1-9cb5-de39dcf0c61d","resolution":{"observed_at":"2026-08-07T13:28:04.966886Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:28:04.607410Z","title":"Maximal-entropy random walks in complex networks with limited information.Physical Review E, 83(3):030103, March 2011","venue":null,"work_id":"5d545905-08a3-4eb0-be52-a98bbfca3f50","year":2011},"citing_paper":{"arxiv_id":"2505.21706","last_updated":"2025-05-27T19:43:32Z","snapshot_observed_at":"2026-08-07T13:22:21.810724Z","submitted_at":"2025-05-27T19:43:32Z","title":"Network classification through random walks","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T13:28:01.635459Z"},"links":{"citing_paper":"/paper/2505.21706"},"observation_digest":"sha256:73fabc66d7ecf54cfe7933eed22d3051eeb2debed8158163b4ccc5fa6503da31","observation_id":"d5debf5d-aa55-4628-a167-8e870731efa3","resolution":{"observed_at":"2026-08-07T13:28:04.706120Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:28:04.348455Z","title":"Reactive random walkers on complex networks.Physical Review E, 98(5):52302, 2018","venue":null,"work_id":"23e0220c-43f6-4b9e-b81d-8847f7dae6c5","year":2018},"citing_paper":{"arxiv_id":"2505.21706","last_updated":"2025-05-27T19:43:32Z","snapshot_observed_at":"2026-08-07T13:22:21.810724Z","submitted_at":"2025-05-27T19:43:32Z","title":"Network classification through random walks","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T13:28:01.722457Z"},"links":{"citing_paper":"/paper/2505.21706"},"observation_digest":"sha256:c556265f49b958c12ccbb17cc1ab57e2a89a749360952c018367f7b66d0b320c","observation_id":"01b288c1-6f9b-42e6-8831-df09af383919","resolution":{"observed_at":"2026-08-07T13:28:04.466611Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:28:04.210114Z","title":"Hierarchical characterization of complex networks","venue":null,"work_id":"3bbcb06b-2ebb-4b25-859f-a027a5e84fc1","year":2006},"citing_paper":{"arxiv_id":"2505.21706","last_updated":"2025-05-27T19:43:32Z","snapshot_observed_at":"2026-08-07T13:22:21.810724Z","submitted_at":"2025-05-27T19:43:32Z","title":"Network classification through random walks","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T13:28:01.763544Z"},"links":{"citing_paper":"/paper/2505.21706"},"observation_digest":"sha256:279f92dd07817fb4dacdb5d28d0de8b81d6d42dab9b99caa1ce8532e446a2941","observation_id":"ca995191-f480-4410-8c35-14243d84caf1","resolution":{"observed_at":"2026-08-07T13:28:04.277351Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:28:04.013480Z","title":"Campiteli, Pablo D","venue":null,"work_id":"2961919c-8f68-4192-8500-f6e8bb2be5e6","year":2006},"citing_paper":{"arxiv_id":"2505.21706","last_updated":"2025-05-27T19:43:32Z","snapshot_observed_at":"2026-08-07T13:22:21.810724Z","submitted_at":"2025-05-27T19:43:32Z","title":"Network classification through random walks","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T13:28:01.830458Z"},"links":{"citing_paper":"/paper/2505.21706"},"observation_digest":"sha256:5070e859725742ed5da436114c0cc0a9160c05a5647a5e762aeb9bf768fc45ea","observation_id":"abcb51f7-14db-4211-a12c-c27011e3754c","resolution":{"observed_at":"2026-08-07T13:28:04.111683Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:28:03.868262Z","title":"Backes, Wesley N","venue":null,"work_id":"e36f1626-a54c-4fed-8917-d32d1fd0135b","year":2010},"citing_paper":{"arxiv_id":"2505.21706","last_updated":"2025-05-27T19:43:32Z","snapshot_observed_at":"2026-08-07T13:22:21.810724Z","submitted_at":"2025-05-27T19:43:32Z","title":"Network classification through random walks","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T13:28:01.896605Z"},"links":{"citing_paper":"/paper/2505.21706"},"observation_digest":"sha256:8fd414ce750881ad4a6d4251adf8adc6a78991db24a5619cb25f6b23e36c2095","observation_id":"bbeec516-5fa5-4239-aaa4-253105d2231a","resolution":{"observed_at":"2026-08-07T13:28:03.959147Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1611.08624","last_updated":"2016-11-25T22:21:05Z","snapshot_observed_at":"2026-07-06T05:20:11.209777Z","submitted_at":"2016-11-25T22:21:05Z","title":"Fast deterministic tourist walk for texture analysis","version":1},"cited_work":{"arxiv_id":"1611.08624","doi":null,"metadata_source":"pith","pith_arxiv_id":"1611.08624","snapshot_observed_at":"2026-08-07T13:28:02.751032Z","title":"Fast deterministic tourist walk for texture analysis","venue":"cs.CV","work_id":"b6a395ca-1e89-4a6b-b545-9850731ad697","year":2016},"citing_paper":{"arxiv_id":"2505.21706","last_updated":"2025-05-27T19:43:32Z","snapshot_observed_at":"2026-08-07T13:22:21.810724Z","submitted_at":"2025-05-27T19:43:32Z","title":"Network classification through random walks","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T13:28:01.970723Z"},"links":{"cited_paper":"/paper/1611.08624","citing_paper":"/paper/2505.21706"},"observation_digest":"sha256:c7e5d041cf8face0cc91b9610de6de7d3c0bd1a160a42e2d65a389ed05a07b0b","observation_id":"ce325cd8-497a-467e-a054-be2055f685c5","resolution":{"observed_at":"2026-08-07T13:28:02.826264Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:28:03.704037Z","title":null,"venue":null,"work_id":"5b544664-5144-49fc-b112-a8ff57ad3293","year":2023},"citing_paper":{"arxiv_id":"2505.21706","last_updated":"2025-05-27T19:43:32Z","snapshot_observed_at":"2026-08-07T13:22:21.810724Z","submitted_at":"2025-05-27T19:43:32Z","title":"Network classification through random walks","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T13:28:02.080767Z"},"links":{"citing_paper":"/paper/2505.21706"},"observation_digest":"sha256:26d18a856ce88cd414ed3f0dd8ad990fcdf88c0a1ef52334059b80a291df729d","observation_id":"d2ab97c1-98bb-47bc-a324-dc79d87dfab2","resolution":{"observed_at":"2026-08-07T13:28:03.778180Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1707.05005","last_updated":"2017-07-17T05:09:03Z","snapshot_observed_at":"2026-08-01T15:10:58.723106Z","submitted_at":"2017-07-17T05:09:03Z","title":"graph2vec: Learning Distributed Representations of Graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.05005","snapshot_observed_at":"2026-08-07T13:28:02.151664Z","title":"graph2vec: Learning distributed representations of graphs.arXiv preprint arXiv:1707.05005, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.21706","last_updated":"2025-05-27T19:43:32Z","snapshot_observed_at":"2026-08-07T13:22:21.810724Z","submitted_at":"2025-05-27T19:43:32Z","title":"Network classification through random walks","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T13:28:02.151664Z"},"links":{"cited_paper":"/paper/1707.05005","citing_paper":"/paper/2505.21706"},"observation_digest":"sha256:1fdd1601cc3682595d3e92552c7297450710712154172f9c5a3093d9c59d3958","observation_id":"330bfba6-d08b-4d45-874f-31c4afb5ce9e","resolution":{"observed_at":"2026-08-07T13:28:02.151664Z","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-07T13:28:02.231250Z","title":"Weisfeiler-lehman graph kernels.Journal of Machine Learning Research, 12(9), 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2505.21706","last_updated":"2025-05-27T19:43:32Z","snapshot_observed_at":"2026-08-07T13:22:21.810724Z","submitted_at":"2025-05-27T19:43:32Z","title":"Network classification through random walks","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T13:28:02.231250Z"},"links":{"citing_paper":"/paper/2505.21706"},"observation_digest":"sha256:b5f8eeff1ed2c2110f174e86df3afb6340fa3505bd319f6c4f573b4d5ac2b620","observation_id":"59ebffea-eebf-4ced-bad1-f31efc29cfdb","resolution":{"observed_at":"2026-08-07T13:28:02.231250Z","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-07T13:28:03.549516Z","title":"Pardalos, and Theodore B","venue":null,"work_id":"c5a37eb6-3104-4899-a262-0f28e6adafbc","year":2013},"citing_paper":{"arxiv_id":"2505.21706","last_updated":"2025-05-27T19:43:32Z","snapshot_observed_at":"2026-08-07T13:22:21.810724Z","submitted_at":"2025-05-27T19:43:32Z","title":"Network classification through random walks","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T13:28:02.318383Z"},"links":{"citing_paper":"/paper/2505.21706"},"observation_digest":"sha256:9b0ca6151e04d3f3bd5d0236c54707cc7629051a08ff7a810b20b580580b57a2","observation_id":"f617c3ee-92a6-4f87-98b2-a90d49b3783b","resolution":{"observed_at":"2026-08-07T13:28:03.611992Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:28:03.387119Z","title":"Performance evaluation of classification algorithms by k-fold and leave-one-out cross validation","venue":null,"work_id":"ef1b4202-e21f-4a55-8a69-ee77c9380dad","year":2015},"citing_paper":{"arxiv_id":"2505.21706","last_updated":"2025-05-27T19:43:32Z","snapshot_observed_at":"2026-08-07T13:22:21.810724Z","submitted_at":"2025-05-27T19:43:32Z","title":"Network classification through random walks","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T13:28:02.402079Z"},"links":{"citing_paper":"/paper/2505.21706"},"observation_digest":"sha256:50d0adf12ef4e181a18de3bc201e931d0676ceee47ee0404460f1e4b92899dfc","observation_id":"4dd6c55c-e0cf-4bfa-b3c3-37394657799f","resolution":{"observed_at":"2026-08-07T13:28:03.456418Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:28:03.199762Z","title":"Kegg.Nucleic Acids Research, 28(1):27–30, 2000","venue":null,"work_id":"bd9ad2d5-4445-4b88-a94a-d8a9a61a70a7","year":2000},"citing_paper":{"arxiv_id":"2505.21706","last_updated":"2025-05-27T19:43:32Z","snapshot_observed_at":"2026-08-07T13:22:21.810724Z","submitted_at":"2025-05-27T19:43:32Z","title":"Network classification through random walks","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-07T13:28:02.449476Z"},"links":{"citing_paper":"/paper/2505.21706"},"observation_digest":"sha256:a6f2b5822c3cef41cb7b19f3ff571e400ebf69b53a7d27764c116cc0f238098a","observation_id":"354bcbd0-cfd2-4252-bbfe-2c8b84447ce9","resolution":{"observed_at":"2026-08-07T13:28:03.272541Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:28:03.007833Z","title":"Kegg as a reference resource for gene and protein annotation.Nucleic acids research, 44(D1):D457–D462, 2016","venue":null,"work_id":"a47c53e5-3746-4635-a472-f78fb3fad1d8","year":2016},"citing_paper":{"arxiv_id":"2505.21706","last_updated":"2025-05-27T19:43:32Z","snapshot_observed_at":"2026-08-07T13:22:21.810724Z","submitted_at":"2025-05-27T19:43:32Z","title":"Network classification through random walks","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-07T13:28:02.521257Z"},"links":{"citing_paper":"/paper/2505.21706"},"observation_digest":"sha256:59208a975b887a6d7ce8fd5e07cfa32a424f8fb559bb78a854825880a7d2f8b5","observation_id":"c0e46fae-ebb2-4a61-9467-06ec4c36b16f","resolution":{"observed_at":"2026-08-07T13:28:03.114294Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:28:02.882153Z","title":"Kriege, Franka Bause, Kristian Kersting, Petra Mutzel, and Marion Neumann","venue":null,"work_id":"bf7244c1-fd10-4b41-91e1-9225e5b7ac96","year":2020},"citing_paper":{"arxiv_id":"2505.21706","last_updated":"2025-05-27T19:43:32Z","snapshot_observed_at":"2026-08-07T13:22:21.810724Z","submitted_at":"2025-05-27T19:43:32Z","title":"Network classification through random walks","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-07T13:28:02.641948Z"},"links":{"citing_paper":"/paper/2505.21706"},"observation_digest":"sha256:b3935c0f22cfcbe7014bdc11d1277f3ddccebd44f1f73a8f7d59bcc80529dd0f","observation_id":"3ec6997d-9942-4046-ab5a-2650bf46ea03","resolution":{"observed_at":"2026-08-07T13:28:02.922535Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.21706","last_updated":"2025-05-27T19:43:32Z","latest_version":1,"primary_category":"cs.SI","snapshot_observed_at":"2026-08-07T13:22:21.810724Z","submitted_at":"2025-05-27T19:43:32Z","title":"Network classification through random walks"},"reference_resolution":{"displayed":53,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":1,"verified_fuzzy":44},"total_outbound_references":53},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 53 of 53 outbound references and 0 inbound Pith citation observations for arXiv:2505.21706."}