{"as_of":"2026-08-17T21:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b7adb9a94808d322a4551837d3874dc4bc2f2e3fbe1be6d62f987ed364257c7d","coverage":[{"denominator":65,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":65,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T23:46:09.205352Z","state":"measured"},{"denominator":65,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":65,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+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.04215/citation-record","integrity":"/paper/2505.04215/integrity","json":"/paper/2505.04215/citation-record.json","paper":"/paper/2505.04215"},"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-15T23:46:10.063630Z","title":"Modeling echo chambers and polarization dynamics in social networks,","venue":null,"work_id":"fcc58368-a21f-4fcd-a3ac-3cf3f56170e2","year":2020},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:08.916738Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:475a2a1d749c5babe25338e57d618616e4c4f76550d489729687f22f59a57ff2","observation_id":"130f4aa7-81b6-408b-a74e-9a19d3223a67","resolution":{"observed_at":"2026-08-15T23:46:10.068127Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:10.049305Z","title":"Transfer learning enables predictions in network biology,","venue":null,"work_id":"194b75ba-c21b-45e2-ba09-210ec54eeb5c","year":2023},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:08.922806Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:f06565dcdf4ffd0f8298e010f3b0babbea32e4cf30fdf2634edc183ca5bb2a8a","observation_id":"7411e5dd-c6fd-47cd-b509-a123cb715409","resolution":{"observed_at":"2026-08-15T23:46:10.053845Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:10.032730Z","title":"Data-driven analysis and forecasting of highway traffic dynamics,","venue":null,"work_id":"6e25b867-ba16-4229-8aef-5a78a05711e1","year":2020},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:08.927274Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:a673ac93d2a409b939826c81996f914fe70eed237c235cb40edc1ab61014d170","observation_id":"03527abb-1194-4620-97d5-6a5ecdfaa8d7","resolution":{"observed_at":"2026-08-15T23:46:10.036565Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:10.019251Z","title":"Understanding influence of fractal generative manner on structural properties of tree networks,","venue":null,"work_id":"3f24175a-7cb4-475b-8881-89b6d2170167","year":2024},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:08.931565Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:36684547a6f18a24068516ddc8d0b1975574b85e2b3334d34544e55ca58050e0","observation_id":"3a5cd23d-55cb-43a0-87bb-369b3d0b5c0b","resolution":{"observed_at":"2026-08-15T23:46:10.023398Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:10.006988Z","title":"What are higher-order networks?","venue":null,"work_id":"c5274cb7-e201-4727-bafb-75464c2469a4","year":2023},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:08.935590Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:f5d5c5043b30e361eff19304932e550bc302165d8f02f22626ee9f2173e84fdc","observation_id":"13fd6d73-5d3b-48c3-a384-5219d130fba6","resolution":{"observed_at":"2026-08-15T23:46:10.011151Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:09.993108Z","title":"The why, how, and when of representations for complex systems,","venue":null,"work_id":"4b9d57e4-d6b2-484c-acf8-6b944cbfbc96","year":2021},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:08.941830Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:76bcb670a0944f831443778d783a4c607ea662a71bcd7c648419f33d1241c360","observation_id":"55ff685c-4ded-4691-9627-bc4940ceb86f","resolution":{"observed_at":"2026-08-15T23:46:09.997344Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:46:08.947209Z","title":"Networks beyond pairwise interactions: Structure and dynamics,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:08.947209Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:82731b706d4a6dd2454ef13cbd7d9c5b64bd92fa44c1a638935c9bd99c9fabd7","observation_id":"e4243a5a-e539-4c0a-858a-b9b0d1ef2f97","resolution":{"observed_at":"2026-08-15T23:46:08.947209Z","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-15T23:46:09.972558Z","title":"Nonuniform hyper-network embedding with dual mechanism,","venue":null,"work_id":"384ef598-ce67-45cf-a9a6-788e89f5c131","year":2020},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:08.951148Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:5cbf24f17de0ff519a554d42fe4c6e08748e73c289973b3c1e321f63705ea239","observation_id":"c8ebe41f-e1c0-45ed-a9a1-85434bc0cc27","resolution":{"observed_at":"2026-08-15T23:46:09.976771Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:09.959366Z","title":"Species-specific segmentation clock periods are due to differential biochemical reaction speeds,","venue":null,"work_id":"9e57eed8-e306-4138-9fdd-85b87acb12aa","year":2020},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:08.955096Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:e528df2563e9a4cdb705ad073a977384e586b4148e00f11057c96b6530233a99","observation_id":"e363ba74-dc2c-4f05-a963-c17983eb5f94","resolution":{"observed_at":"2026-08-15T23:46:09.963621Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:09.945806Z","title":"A survey on hypergraph representation learning,","venue":null,"work_id":"8b77bba7-7edf-4c2c-8cbb-aabd5a27041f","year":2023},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:08.959663Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:1ade3c879739605d6f90953f8d61016472da8b05357dad7cae9bef7a2ed7b51f","observation_id":"f128ebdc-19e4-4be4-b355-0e064c10b76f","resolution":{"observed_at":"2026-08-15T23:46:09.950787Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:09.933330Z","title":"Statistical physics of social dynamics,","venue":null,"work_id":"2dd84cdf-caac-4fb1-88e5-cd7483ecd5d2","year":2009},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:08.963891Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:18bf375e41127dc742536393d3cb482ea64762d6846c13e7c20aeba24443b106","observation_id":"495274a1-8ef8-46b9-9af1-0c3b6423a42a","resolution":{"observed_at":"2026-08-15T23:46:09.937613Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:09.920599Z","title":"Synchronization in complex networks,","venue":null,"work_id":"4ea85ddc-3380-416c-a9e0-3a14ef7fdede","year":2008},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:08.968603Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:bef4f5367c78f568c0d54e03c0081bdf5b90c712b0dbc35d47ed899ad9123be2","observation_id":"ff8a43c1-200a-4fb6-a21e-4fbd667274c6","resolution":{"observed_at":"2026-08-15T23:46:09.924744Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:09.907295Z","title":"Random walks on a tree with applications,","venue":null,"work_id":"165c1c69-077b-4522-8c0b-24e9475833a9","year":2020},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:08.973884Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:04443e207ff93a0e5dffb2d99cca5649eba79b1a90fe35f26c1c2250acfe35a0","observation_id":"572bbe83-7aae-4ccb-8e50-c093de4aba82","resolution":{"observed_at":"2026-08-15T23:46:09.911889Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:09.894911Z","title":null,"venue":null,"work_id":"fcfa4533-c91c-4816-8043-08cce014ed85","year":2010},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:08.978193Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:aa5b49078e54655a94ad2a7277c5024e9997d29b919919cbc7c5173ec847dad8","observation_id":"177fa449-cd0b-4ac0-bdcf-24ca9c24d0f7","resolution":{"observed_at":"2026-08-15T23:46:09.899173Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:09.882684Z","title":"Structural properties on scale-free tree network with an ultra-large diameter,","venue":null,"work_id":"eb14aefe-e34c-4136-b2f2-0a262034bb11","year":2024},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:08.982822Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:9339516c3560c00f6f451920c7c3cee2bcf37acb61abeb99c5e1c1cb83d2fa63","observation_id":"d3b3363a-3216-4c54-81e4-074e5c37d568","resolution":{"observed_at":"2026-08-15T23:46:09.886806Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:09.870613Z","title":"Random walks on complex networks,","venue":null,"work_id":"a515db08-ec76-412f-ac9b-d78642621391","year":2004},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:08.987197Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:2c850e1bd8b98e277ead947610f60a638bda3acd985c53280f176cc6151091cd","observation_id":"85f1ad48-a754-495f-b068-e29d5d548c5c","resolution":{"observed_at":"2026-08-15T23:46:09.874512Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:09.858990Z","title":"Random walks on graphs,","venue":null,"work_id":"ae6d1f41-8902-4f89-a503-f1040649f1e5","year":1993},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:08.991345Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:bbf82b332283b5b771d6e2e8a0e3610a508e992ca1d7346f5ef8234b7ef10ab8","observation_id":"368c8245-0cc9-4af4-bbf2-0bdb74a12975","resolution":{"observed_at":"2026-08-15T23:46:09.862791Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:09.846636Z","title":"A measure of betweenness centrality based on random walks,","venue":null,"work_id":"02ba0dff-25df-476a-8755-d9fa9a1a6611","year":2005},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:08.995186Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:3a5a80707967615f4db59d1272acfbd0e746d8cacb6f5634f0493245df141cae","observation_id":"5ed3cdaa-7231-4220-896b-7b2319408cf2","resolution":{"observed_at":"2026-08-15T23:46:09.850954Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:09.835248Z","title":"Maps of random walks on complex networks reveal community structure,","venue":null,"work_id":"7622ebd7-1b4f-4b66-aef0-0161290bc44c","year":2008},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:09.000416Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:60a2dd93c3f5a2536e788318062a409bf41fd5d9d255825e374b3e7ee1cff7a8","observation_id":"082c6824-db30-4cfa-b5b9-72b71f28b0db","resolution":{"observed_at":"2026-08-15T23:46:09.839017Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:09.823673Z","title":"Characteristic exponents of complex networks,","venue":null,"work_id":"4f5d06e9-3a73-4456-be4a-276ed1fdd14e","year":2014},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:09.004567Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:92da552442e7e28149f9578cc8536b3bfc85220e78ecf7ded0b13b1a2f05d79b","observation_id":"584e358d-d824-4efa-ae9a-c52905294233","resolution":{"observed_at":"2026-08-15T23:46:09.827580Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:09.811782Z","title":"Hypergraph random walks, laplacians, and clustering,","venue":null,"work_id":"a46029c4-b15f-4175-870b-ba466efbaca5","year":2020},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:09.008458Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:753d6a4facead2e99aefd6f725f47cd87b757423ab773ff9a784fb0704db5146","observation_id":"b1b0cc2b-64e3-47b3-9ad2-20539173c0a2","resolution":{"observed_at":"2026-08-15T23:46:09.815651Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:09.799765Z","title":"Random walks on hypergraphs with edge-dependent vertex weights,","venue":null,"work_id":"7d44acc8-26e9-4767-9b95-22704b505bd2","year":2019},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:09.012716Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:0a5075a03a2008dec357caa98760e63a28f7cbccacf8ba81484e33bf33582799","observation_id":"020508ec-cebc-411d-84f4-02913c1f3037","resolution":{"observed_at":"2026-08-15T23:46:09.803796Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:09.787672Z","title":"Random walks on hypergraphs,","venue":null,"work_id":"67ec1c8a-9332-4b77-a107-e535b3a60a7a","year":2020},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:09.016947Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:fff39b257ced1ad00e114163e2f70e94105c364e1a214afa7c8bcd3425c8e05d","observation_id":"31743846-0bbf-47fd-a4fe-80fe3a2a9421","resolution":{"observed_at":"2026-08-15T23:46:09.791604Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:09.775794Z","title":"Dynamics of nonlinear random walks on complex networks,","venue":null,"work_id":"2056c9f6-16d1-4afc-9b99-f9ae25bd25a9","year":2019},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:09.021352Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:f1909380a5ef292e6f9bf0b5da65e302b1b8ae7ce8075b6edf914ea258f6dd19","observation_id":"05bf3c8c-41bf-47d4-a5b6-6cb6c8cdeac5","resolution":{"observed_at":"2026-08-15T23:46:09.779823Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:09.763936Z","title":"Structure diversity and mean hitting time for random walks on stochastic uniform growth tree networks,","venue":null,"work_id":"af2a7e86-44a1-47da-8961-6191e97f2b30","year":2023},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:09.026166Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:6068e36fa70c0c724949f7840feb1d672169f5a30bc17448f7548aee958e48dd","observation_id":"2decdce6-5c74-4e69-9734-fe604faf43ee","resolution":{"observed_at":"2026-08-15T23:46:09.768314Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:09.751070Z","title":"Reactive random walkers on complex networks,","venue":null,"work_id":"cc005520-8c83-433a-af77-bd53abd2eab4","year":2018},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:09.031974Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:eebf6838b56f9d8b3bbb21c79776756ee1e268b4ac9f13a92cd51f9477f22cf0","observation_id":"018197a9-7f0e-4cbe-a508-96e89f321ec4","resolution":{"observed_at":"2026-08-15T23:46:09.755781Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:09.739146Z","title":"Random walks on networks with stochastic resetting,","venue":null,"work_id":"90585fc7-c5ed-4056-8c74-f2b7690949cf","year":2020},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:09.037658Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:c5d535a38fc00e1abe7383ceb6e82aa675c810aac9975609152bc88472925474","observation_id":"48b56a2b-a6c9-4e5e-9129-6c50cda7d781","resolution":{"observed_at":"2026-08-15T23:46:09.743065Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:09.726291Z","title":"Random walk with restart: fast solutions and applications,","venue":null,"work_id":"d73073f5-d29a-4d56-b474-2929ef53c7af","year":2008},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:09.042804Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:53d4a99b89489b0b4f73930ff38b43b5af7cd09b37ef3fe510ae93f8b70c7d43","observation_id":"cfa3c14b-ac28-4a17-83de-fb867ea94e7e","resolution":{"observed_at":"2026-08-15T23:46:09.730505Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:09.713119Z","title":"Diffusion with stochastic resetting,","venue":null,"work_id":"af490585-1bda-4281-857f-3733b15e4c75","year":2011},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:09.046933Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:b4fb518846409f54b29b81cc8fc5af5cd12dd6c9bc0f723bd2d174c624882da4","observation_id":"faeeb519-f0b0-46df-955b-df0fd2b92e3e","resolution":{"observed_at":"2026-08-15T23:46:09.717154Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:09.701707Z","title":"Random walks on stochastic generalized vicsek fractal networks: Analytic solution and simulations,","venue":null,"work_id":"dd6f6409-baf9-4ae8-92d5-d12ea4176fb3","year":2022},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:09.051527Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:b4aae3c1f5ad05cf693a74c84d8d7b721644ecde026f4873e9c5e90859b15cf4","observation_id":"d8e1d665-93c8-427d-abc8-2fb0ddd6cad7","resolution":{"observed_at":"2026-08-15T23:46:09.705717Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:09.690119Z","title":"Optimal speedup of las vegas algorithms,","venue":null,"work_id":"d284aed3-e16f-4577-a66f-e96b26b22336","year":1993},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:09.055511Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:1a15858f10bbad341a158c0c59c77595021dd155d99299ba1a0725b1a232b606","observation_id":"11e6e982-f82b-4cf0-abe2-621f651c22fb","resolution":{"observed_at":"2026-08-15T23:46:09.694259Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:09.678074Z","title":"Optimizing searches via rare events,","venue":null,"work_id":"08d69dac-8a2f-4a5e-ac7f-d000fac4db43","year":2002},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:09.060395Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:71a5dfb44bb4da5fb336f7f0e6aa45a36217e997c686ee1a84e58607007ff057","observation_id":"231229f7-beea-42f6-b9c4-dc20d6665ecd","resolution":{"observed_at":"2026-08-15T23:46:09.682004Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:09.665632Z","title":"Random walks with preferential relocations to places visited in the past and their application to biology,","venue":null,"work_id":"b4003f5f-1f36-4097-bede-e8a76c244be3","year":2014},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:09.064551Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:c371f82fe234fa288fc0bc889bed64054cb97074e478301afd489ea95cbd3204","observation_id":"5c71ba56-404a-4606-ac7d-3e6b885d381b","resolution":{"observed_at":"2026-08-15T23:46:09.669908Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:09.653156Z","title":"Simrank: a measure of structural-context similarity,","venue":null,"work_id":"ae835b6f-5fa0-46d5-a21f-5162743ab0a8","year":2002},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:09.068561Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:7c1f3bb0db921f230fcf5d46544844725fdcad80900c017ec6c7f8e2779e2a2f","observation_id":"a6958929-9510-4126-82cf-185ab22484bb","resolution":{"observed_at":"2026-08-15T23:46:09.657643Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:09.640690Z","title":"Network-based recommendation algorithms: A review,","venue":null,"work_id":"b3a19e15-c0d2-42a2-9748-f62512042381","year":2016},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:09.072479Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:0c176050bf9bebcc44c98ebe67dce9d2da4f4455cc09fb810bf723804e97f27c","observation_id":"3489eea6-8f0c-41b8-8bcb-d5d86ed77aed","resolution":{"observed_at":"2026-08-15T23:46:09.645674Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:09.628773Z","title":"Dblp: some lessons learned,","venue":null,"work_id":"d6ee3bdf-1c74-430c-916d-3f1ab811d61d","year":2009},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:09.076050Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:6c8f828ffade3deb4f47f66efb2152a671eccd555bdfc81c45e714cf134e8767","observation_id":"36b9c538-8bdd-46b0-891d-01eb2478f7f6","resolution":{"observed_at":"2026-08-15T23:46:09.632510Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:09.615305Z","title":"Random walks on the generalized vicsek fractal,","venue":null,"work_id":"bd31b4de-5317-4d3e-8738-1f0bbb0c75d1","year":2021},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:09.080077Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:36a0ec4f6492369861b7deb48492702de7f0a868ee1b9dad5e880a14eb3c8875","observation_id":"a445f59b-b8f4-4776-800c-ef8d562fa753","resolution":{"observed_at":"2026-08-15T23:46:09.620478Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:09.603612Z","title":"Random walks on fibonacci treelike models,","venue":null,"work_id":"7e4d0070-7b77-4eac-98e5-4ebfa939da39","year":2021},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:09.084315Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:cc4312a684071120b9b4aac7947a746ae88e56922e380b1df2b3916daa740f06","observation_id":"4fd5ff95-f997-414e-9963-e72b5070cf6f","resolution":{"observed_at":"2026-08-15T23:46:09.607671Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:09.589800Z","title":null,"venue":null,"work_id":"07a8c6a8-7047-4eef-8598-7f0b4640dfcc","year":2018},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:09.088156Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:51d42d6d97ee89066f6164d70e9d88dbc5cebcd602b9ff843e6000cca845b910","observation_id":"8cbc9bcf-a218-44cb-9150-01bbb129f657","resolution":{"observed_at":"2026-08-15T23:46:09.594784Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:09.573252Z","title":"Community structure in social and biological networks,","venue":null,"work_id":"b2c044c0-21ba-45fb-8a5e-b1a83b7549ad","year":2002},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:09.091841Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:82bf7944b842c4bfde3f2ac1f2d867a8df230f6254cff03b01c140df046a9fe3","observation_id":"30f30ec6-9a8e-41c9-b433-008ac8b09af9","resolution":{"observed_at":"2026-08-15T23:46:09.580532Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:09.554734Z","title":"Centrality and network flow,","venue":null,"work_id":"e0c709b5-af7c-425a-81d6-7874a7ad222e","year":2005},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:09.096101Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:e6f4b4a4ea9f33776e4f6314574fb3c06ff92f388c3ec7baf20d0ab2f74a2653","observation_id":"ea4418db-58ac-457e-8f03-edba7d4f8542","resolution":{"observed_at":"2026-08-15T23:46:09.560292Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:09.540410Z","title":"Identifying influential and susceptible members of social networks,","venue":null,"work_id":"a8cb58c7-78d4-4a77-a53c-e4e8f8b2f8c2","year":2012},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:09.099788Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:63b8efc87d69835139d3efac771a6b98c9bb2756f8b4e9f702059b927ba1da7d","observation_id":"c03e371c-21e6-44c8-863a-a6d5c0cc78dd","resolution":{"observed_at":"2026-08-15T23:46:09.545270Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:09.527913Z","title":"Maximizing the spread of influence through a social network,","venue":null,"work_id":"c5680d2d-8247-4f2c-ad9b-5bdc5fb18c37","year":2003},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:09.103285Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:904d245865d2e5d300f1bab15deab2d7c4e46bdf344284ca2b7bc85c9e95db17","observation_id":"31b9b2c2-4281-48dc-a5a0-7b56cbb94cb6","resolution":{"observed_at":"2026-08-15T23:46:09.532006Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:09.515458Z","title":"Identification of influential spreaders in complex networks,","venue":null,"work_id":"f07dc007-23a9-48c3-975e-3838ee616553","year":2010},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:09.107113Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:5b50ff7406525ce0c6e6e3024e0fe4c2044ef4e556bf6ceba5b140d95d3e0cce","observation_id":"870e63bd-5d87-49d3-870f-e6e691e978e1","resolution":{"observed_at":"2026-08-15T23:46:09.519645Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:09.501700Z","title":"Catastrophic cascade of failures in interdependent networks,","venue":null,"work_id":"4155c031-ad62-45b1-8c99-a1ae55b365f3","year":2010},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:09.111169Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:a494cff7d55f6ec886d0864afc1eafc3b51555ff3c778e8ba8ced385f0f9e739","observation_id":"30dbddc5-2d8a-46cf-9061-2fa444267b69","resolution":{"observed_at":"2026-08-15T23:46:09.505997Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:46:09.116049Z","title":"The anatomy of a large-scale hypertextual web search engine,","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:09.116049Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:aabdefc5af9c938f3a3a16d21951f1ff7c9673748a1579664953b50d7d723a8f","observation_id":"83d02c94-1c02-4140-ba31-a3f2e693d71b","resolution":{"observed_at":"2026-08-15T23:46:09.116049Z","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-15T23:46:09.478363Z","title":"Authoritative sources in a hyperlinked environment,","venue":null,"work_id":"ca99ac3a-6318-4eb6-b75d-4eca5a737fe5","year":1999},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:09.120157Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:9e10462aaade1f5d984bb5416437745b1ee8da9d39343549da237b1a32505290","observation_id":"32dcb9da-3af1-447a-a5b2-4924618900cd","resolution":{"observed_at":"2026-08-15T23:46:09.483036Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:09.466590Z","title":"Topic-sensitive pagerank,","venue":null,"work_id":"7be9a93d-fee8-4bfb-9923-20933a47ce52","year":2002},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:09.124178Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:30013566c2ca96fa53a5d4e1e28e4e13d812b09677fbcdd56736fa0af2104058","observation_id":"0a811e00-73e0-4926-8f3d-69af0cc374d7","resolution":{"observed_at":"2026-08-15T23:46:09.470335Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:09.451950Z","title":"Graph convolutional neural networks for web-scale recommender systems,","venue":null,"work_id":"b302947d-194a-477c-98e2-ab6d00e046be","year":2018},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:09.127891Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:1ee968b2a6eab131955891789865bff8fea42a5a223a3a877cfa50bb9f1aa146","observation_id":"6723bd91-e0a6-4090-b1d6-35b5e634c152","resolution":{"observed_at":"2026-08-15T23:46:09.456255Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:09.438297Z","title":"Impact of human mobility on opportunistic forwarding algorithms,","venue":null,"work_id":"6e2a4af5-b434-4029-a2e1-072c4db49441","year":2007},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:09.131862Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:b8bc52b64aa2068011ce2004e6afa81360bd4e97f37c9c06342f03fc2c7268e9","observation_id":"2f49dfd6-7da5-42a0-926e-9d02b22ce2f1","resolution":{"observed_at":"2026-08-15T23:46:09.443783Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:09.425345Z","title":"Secure data collection in wireless sensor networks using randomized dispersive routes,","venue":null,"work_id":"99091a54-bc89-455d-a7c3-8a6572c2ede6","year":2010},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:09.135469Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:cebc3f1c3462719a1e73f034597d67d940ee80ca124b319474ba563eff399ae1","observation_id":"659db160-cdd8-429f-9392-2008f823e280","resolution":{"observed_at":"2026-08-15T23:46:09.430220Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:09.411885Z","title":"Cover times for brownian motion and random walks in two dimensions,","venue":null,"work_id":"42ab3b03-69bd-4e34-8576-f3aee16fe36d","year":2004},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:09.140001Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:d47d23f70658fc745e4a9888db43e4ad449a356f80e51e34dda97029c8d8f3e9","observation_id":"95451647-66a2-4aec-b37a-4c6ad2d94d63","resolution":{"observed_at":"2026-08-15T23:46:09.416857Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:09.398945Z","title":"Diffusion with optimal resetting,","venue":null,"work_id":"890ad1f0-6474-40a2-9111-572220d1c2bb","year":2011},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:09.143874Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:4954084ad867da8a6b5aeb05914ccde668d40a65d900277fb843214289c45dd6","observation_id":"ef956cc0-6fda-4c8b-808a-a5d65d55e081","resolution":{"observed_at":"2026-08-15T23:46:09.402839Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:09.386952Z","title":"Optimal stochastic restart renders fluctuations in first passage times universal,","venue":null,"work_id":"9501fa92-5e00-4475-9e4c-ba32cbaea848","year":2016},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:09.148839Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:b4849ecb9b89c3da818b1dee922ed15c1c47bca1c7c10888f2bec152e8477f51","observation_id":"cc62f8ba-a74a-45a0-bf80-6cc61f3a6a8e","resolution":{"observed_at":"2026-08-15T23:46:09.391077Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:09.373737Z","title":"Stochastic resetting and applications,","venue":null,"work_id":"f4a9bb38-2e16-4760-ad4a-9c8b58435768","year":2020},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:09.152813Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:8eb474bbdf3b580ec03636444e32249d028234c4154509cab162901049bf7895","observation_id":"a2f8c357-e487-41d0-a216-993f77a18b9c","resolution":{"observed_at":"2026-08-15T23:46:09.378416Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:09.360772Z","title":"The structure and function of complex networks,","venue":null,"work_id":"3076098f-fb10-4d43-86a1-0ad7b97b11b6","year":2003},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:09.156763Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:b06291fdd97e6d1b8df5a949d9a0424b98822e981fe1b5c17164ebf56537e56f","observation_id":"8d51e7b0-8152-43db-9fcf-0d979ee9a854","resolution":{"observed_at":"2026-08-15T23:46:09.364644Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:09.348817Z","title":"Determining mean first-passage time for random walks on stochastic uniform growth tree networks,","venue":null,"work_id":"12f91973-1171-44b0-b787-39991346426c","year":2024},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:09.164372Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:bc3ca4f0892acfc65b54b755f44878a3c307066db5ddca2429286ee323b960b4","observation_id":"a8bbafe7-0763-4ae0-81a0-1291db25d4d7","resolution":{"observed_at":"2026-08-15T23:46:09.352726Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:09.337438Z","title":"The cover time, the blanket time, and the matthews bound,","venue":null,"work_id":"77ba33f4-1228-480f-b2d9-1be41445e31a","year":2000},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:09.169509Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:94c39775882e0be8b7c61a6aa399368f170b0f45e72dbd8cfc331d2725b9b0bb","observation_id":"0fdb04f3-2968-4416-9f3a-85405d5cf01e","resolution":{"observed_at":"2026-08-15T23:46:09.341325Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:09.325817Z","title":"Learning with hypergraphs: Clustering, classification, and embedding,","venue":null,"work_id":"e6f9621a-7119-46a1-91b9-fc0fc6b9da1f","year":2006},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:09.174787Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:baffa430f0dff3fbb93945c2b9f95e7f777ce10bd9118b2d7f64c60eaf680bc3","observation_id":"5cb38098-2853-4033-9c02-07c7bdb24a26","resolution":{"observed_at":"2026-08-15T23:46:09.329770Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:09.313139Z","title":"Higher order learning with graphs,","venue":null,"work_id":"c1517880-3aa4-4646-8db4-e39ea8fa646b","year":2006},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:09.179412Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:2df6786fa443bddc1141fb1583b5ea8930829f6b69e3a4cee7384cc95c1d22dc","observation_id":"d33555ab-ea18-4962-9220-e2f348276c32","resolution":{"observed_at":"2026-08-15T23:46:09.317353Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:09.299147Z","title":"An inverse power method for nonlinear eigenproblems with applications in 1-spectral clustering and sparse pca,","venue":null,"work_id":"003c4d53-fb7a-4817-9d9a-17ae2be015ca","year":2010},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:09.185573Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:630500ac67c8314b59b62ccc61cde96b0eb73e9342d314386e5e9dcb541a7f5c","observation_id":"83848fed-1c11-443d-8937-5752c1966283","resolution":{"observed_at":"2026-08-15T23:46:09.303007Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:09.286744Z","title":"Beyond pairwise clustering,","venue":null,"work_id":"a35e6b40-aa96-4023-98c6-93a85c5debb7","year":2005},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:09.190314Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:bbe1b7377696cc661e89c955aed0c262ffd58753ad6efec598eaf3360243bc62","observation_id":"1fb6cc9f-d5c2-4f81-b958-d4c655ff7dbb","resolution":{"observed_at":"2026-08-15T23:46:09.290899Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:09.272393Z","title":"A fast and high quality multilevel scheme for partitioning irregular graphs,","venue":null,"work_id":"102fce05-0930-4e19-bde2-35aedb90894f","year":1998},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:09.196394Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:ebc22e7c7537afc490585e5a24710d99423c7f00476008850bc0111c2e7e419e","observation_id":"db9a9fe8-99f5-4261-a135-adff3427a799","resolution":{"observed_at":"2026-08-15T23:46:09.277056Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:09.259984Z","title":"Semi-supervised hypergraph node classification on hypergraph line expansion,","venue":null,"work_id":"7a29e532-e5ca-4b60-b658-b0509c74992b","year":2022},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:09.201051Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:b2022c36be62fe2ed414b091be632ff1000e0c84dd1451d44c4e3f8576c75836","observation_id":"63425b13-89df-41a6-aab0-d234daca11bc","resolution":{"observed_at":"2026-08-15T23:46:09.264231Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:46:09.242336Z","title":"Hypergraph attention isomorphism network by learning line graph expansion,","venue":null,"work_id":"cf7906c3-a5e7-4ed6-817d-4d4a223088e9","year":2020},"citing_paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-15T23:46:09.205352Z"},"links":{"citing_paper":"/paper/2505.04215"},"observation_digest":"sha256:ac54a8f1ee91685043c2af0dc3d84bb63bcd6340985f5a10cafbbbc10ad6499a","observation_id":"1d968b37-1b2c-4c47-89c7-87b573061282","resolution":{"observed_at":"2026-08-15T23:46:09.249662Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.04215","last_updated":"2025-05-07T08:09:16Z","latest_version":1,"primary_category":"cs.SI","snapshot_observed_at":"2026-08-15T23:32:12.769955Z","submitted_at":"2025-05-07T08:09:16Z","title":"Random walks with resetting on hypergraph"},"reference_resolution":{"displayed":65,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":0,"verified_fuzzy":61},"total_outbound_references":65},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 65 of 65 outbound references and 0 inbound Pith citation observations for arXiv:2505.04215."}