{"as_of":"2026-08-21T03:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e3b0fa9f3a60d0b5fdba51dacf89c0be228d7b64674093180b2bef0ef0af1ce5","coverage":[{"denominator":43,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":43,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T11:08:13.591293Z","state":"measured"},{"denominator":43,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":43,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+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/2601.07674/citation-record","integrity":"/paper/2601.07674/integrity","json":"/paper/2601.07674/citation-record.json","paper":"/paper/2601.07674"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T11:08:09.408119Z","title":"Random walks on graphs,","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2601.07674","last_updated":"2026-07-12T03:58:59Z","snapshot_observed_at":"2026-08-20T11:44:49.369735Z","submitted_at":"2026-01-12T16:00:21Z","title":"Self-Creating Random Walks for Decentralized Learning under Pac-Man Attacks","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T11:08:09.408119Z"},"links":{"citing_paper":"/paper/2601.07674"},"observation_digest":"sha256:eb7d83c5bce9929be7667f3c591f83e061f40c4904b86eea5e81d257a33e32b3","observation_id":"1b7d7790-2464-4a30-9723-62b739fce797","resolution":{"observed_at":"2026-08-03T11:08:09.408119Z","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-03T11:08:09.460457Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2601.07674","last_updated":"2026-07-12T03:58:59Z","snapshot_observed_at":"2026-08-20T11:44:49.369735Z","submitted_at":"2026-01-12T16:00:21Z","title":"Self-Creating Random Walks for Decentralized Learning under Pac-Man Attacks","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T11:08:09.460457Z"},"links":{"citing_paper":"/paper/2601.07674"},"observation_digest":"sha256:bfdfd524cfbe932f8ce8818e5989c3c346fd55a77d89873ceaf48bfcd3621bd5","observation_id":"7c15ced3-806f-4ced-a928-cc3e19e0c630","resolution":{"observed_at":"2026-08-03T11:08:09.460457Z","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-03T11:08:09.541840Z","title":"Distributed asynchronous optimal routing in data networks,","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2601.07674","last_updated":"2026-07-12T03:58:59Z","snapshot_observed_at":"2026-08-20T11:44:49.369735Z","submitted_at":"2026-01-12T16:00:21Z","title":"Self-Creating Random Walks for Decentralized Learning under Pac-Man Attacks","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T11:08:09.541840Z"},"links":{"citing_paper":"/paper/2601.07674"},"observation_digest":"sha256:99b007733514446cc2ec1d7897286ca64ff2070e4287bf8ab793525f4ce45b3b","observation_id":"b0dc8963-8c22-4888-a617-a21d218c6872","resolution":{"observed_at":"2026-08-03T11:08:09.541840Z","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-03T11:08:09.600600Z","title":"A unified theory of decentralized SGD with changing topology and local updates,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2601.07674","last_updated":"2026-07-12T03:58:59Z","snapshot_observed_at":"2026-08-20T11:44:49.369735Z","submitted_at":"2026-01-12T16:00:21Z","title":"Self-Creating Random Walks for Decentralized Learning under Pac-Man Attacks","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T11:08:09.600600Z"},"links":{"citing_paper":"/paper/2601.07674"},"observation_digest":"sha256:6fd6939ec653e76ceef604be68ddc2642ba6074dc9f4130475707feed13ef3eb","observation_id":"4191b4a6-dd3d-4987-b698-9577c730622f","resolution":{"observed_at":"2026-08-03T11:08:09.600600Z","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-03T11:08:09.753568Z","title":"The pagerank citation ranking: Bringing order to the web,","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2601.07674","last_updated":"2026-07-12T03:58:59Z","snapshot_observed_at":"2026-08-20T11:44:49.369735Z","submitted_at":"2026-01-12T16:00:21Z","title":"Self-Creating Random Walks for Decentralized Learning under Pac-Man Attacks","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T11:08:09.753568Z"},"links":{"citing_paper":"/paper/2601.07674"},"observation_digest":"sha256:f57959198299a374227d3f5dd9187116e464a2451585c404a4a9e3ec2389e7f8","observation_id":"151e6895-c87f-4849-9caf-7e80b88dfca8","resolution":{"observed_at":"2026-08-03T11:08:09.753568Z","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-03T11:08:09.836428Z","title":"Random-walk com- putation of similarities between nodes of a graph with application to collaborative recommendation,","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2601.07674","last_updated":"2026-07-12T03:58:59Z","snapshot_observed_at":"2026-08-20T11:44:49.369735Z","submitted_at":"2026-01-12T16:00:21Z","title":"Self-Creating Random Walks for Decentralized Learning under Pac-Man Attacks","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T11:08:09.836428Z"},"links":{"citing_paper":"/paper/2601.07674"},"observation_digest":"sha256:879dfd0ec8b09f456edf08d3df5e5939c670e9189811b4b58cc3621ef7838a37","observation_id":"338984a8-bf00-4249-ba88-fdef0b17d2a3","resolution":{"observed_at":"2026-08-03T11:08:09.836428Z","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-03T11:08:09.899479Z","title":"Smartwalk: Enhancing social network security via adaptive random walks,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2601.07674","last_updated":"2026-07-12T03:58:59Z","snapshot_observed_at":"2026-08-20T11:44:49.369735Z","submitted_at":"2026-01-12T16:00:21Z","title":"Self-Creating Random Walks for Decentralized Learning under Pac-Man Attacks","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T11:08:09.899479Z"},"links":{"citing_paper":"/paper/2601.07674"},"observation_digest":"sha256:69c5b39249d415c96aa6451934ec1f9380e07e2dd32fbeccb32d002d99c96f60","observation_id":"a22c78b7-121e-4738-a5af-c2288ede67a2","resolution":{"observed_at":"2026-08-03T11:08:09.899479Z","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-03T11:08:09.971866Z","title":"Supervised random walks: predicting and recommending links in social networks,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2601.07674","last_updated":"2026-07-12T03:58:59Z","snapshot_observed_at":"2026-08-20T11:44:49.369735Z","submitted_at":"2026-01-12T16:00:21Z","title":"Self-Creating Random Walks for Decentralized Learning under Pac-Man Attacks","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T11:08:09.971866Z"},"links":{"citing_paper":"/paper/2601.07674"},"observation_digest":"sha256:94ba3f45ca5de08e118a3f8b869c6338693331cef86e7f1846696180cf40a5e8","observation_id":"94684869-35e2-4557-a843-c403c8d78bc6","resolution":{"observed_at":"2026-08-03T11:08:09.971866Z","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-03T11:08:10.070540Z","title":"Heteroge- neous graph neural network,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2601.07674","last_updated":"2026-07-12T03:58:59Z","snapshot_observed_at":"2026-08-20T11:44:49.369735Z","submitted_at":"2026-01-12T16:00:21Z","title":"Self-Creating Random Walks for Decentralized Learning under Pac-Man Attacks","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T11:08:10.070540Z"},"links":{"citing_paper":"/paper/2601.07674"},"observation_digest":"sha256:cf0b1ec226d27d302e1e022ea394026cb3edf76844151a57a18240b549c13c51","observation_id":"e796fb06-826d-442d-8e23-9d184de1fa8e","resolution":{"observed_at":"2026-08-03T11:08:10.070540Z","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-03T11:08:10.172551Z","title":"A simple peer-to-peer algorithm for distributed optimization in sensor networks,","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2601.07674","last_updated":"2026-07-12T03:58:59Z","snapshot_observed_at":"2026-08-20T11:44:49.369735Z","submitted_at":"2026-01-12T16:00:21Z","title":"Self-Creating Random Walks for Decentralized Learning under Pac-Man Attacks","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T11:08:10.172551Z"},"links":{"citing_paper":"/paper/2601.07674"},"observation_digest":"sha256:5338b0b75b037eab398623669862d67970e3c19ea2fdcb5dadd5694973a4bdaf","observation_id":"091f72b1-d4e1-4945-8d23-303d17ae43f9","resolution":{"observed_at":"2026-08-03T11:08:10.172551Z","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-03T11:08:10.332558Z","title":"Walk for learning: A random walk approach for federated learning from heterogeneous data,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2601.07674","last_updated":"2026-07-12T03:58:59Z","snapshot_observed_at":"2026-08-20T11:44:49.369735Z","submitted_at":"2026-01-12T16:00:21Z","title":"Self-Creating Random Walks for Decentralized Learning under Pac-Man Attacks","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T11:08:10.332558Z"},"links":{"citing_paper":"/paper/2601.07674"},"observation_digest":"sha256:80df1f82d90961f027d96e44f9af48c013208f64d7d306f8d6ceb3676764367c","observation_id":"9ad303e1-0127-4159-9e6e-c4a9280215dc","resolution":{"observed_at":"2026-08-03T11:08:10.332558Z","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-03T11:08:10.429674Z","title":"Coupled-space attacks against random-walk-based anomaly detection,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.07674","last_updated":"2026-07-12T03:58:59Z","snapshot_observed_at":"2026-08-20T11:44:49.369735Z","submitted_at":"2026-01-12T16:00:21Z","title":"Self-Creating Random Walks for Decentralized Learning under Pac-Man Attacks","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T11:08:10.429674Z"},"links":{"citing_paper":"/paper/2601.07674"},"observation_digest":"sha256:8af4488c50643e0bc2f39599473081dac0353e89dea44eb357e37663147792fe","observation_id":"bab1cfe5-47a9-4a54-9109-a486a53c16fb","resolution":{"observed_at":"2026-08-03T11:08:10.429674Z","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-03T11:08:10.498081Z","title":"Enhancing sybil detection via social-activity networks: A random walk approach,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2601.07674","last_updated":"2026-07-12T03:58:59Z","snapshot_observed_at":"2026-08-20T11:44:49.369735Z","submitted_at":"2026-01-12T16:00:21Z","title":"Self-Creating Random Walks for Decentralized Learning under Pac-Man Attacks","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-03T11:08:10.498081Z"},"links":{"citing_paper":"/paper/2601.07674"},"observation_digest":"sha256:855e742396d9d04f3dd56be8095fde0f97b7eafb3a8fa0978c4e7b2f69c344a8","observation_id":"521bea70-8fae-4462-b840-8b429d02dc03","resolution":{"observed_at":"2026-08-03T11:08:10.498081Z","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-03T11:08:10.575380Z","title":"Robustness of random walk on a graph against adversary attacks,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.07674","last_updated":"2026-07-12T03:58:59Z","snapshot_observed_at":"2026-08-20T11:44:49.369735Z","submitted_at":"2026-01-12T16:00:21Z","title":"Self-Creating Random Walks for Decentralized Learning under Pac-Man Attacks","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T11:08:10.575380Z"},"links":{"citing_paper":"/paper/2601.07674"},"observation_digest":"sha256:453bc8339fdbcdbef12149928622a363bd5c7e153fcc83a9c573afdcc0197fd4","observation_id":"55de1410-9271-4e58-9b14-f1e368374472","resolution":{"observed_at":"2026-08-03T11:08:10.575380Z","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-03T11:08:10.650315Z","title":"Self-duplicating random walks for resilient decentralized learning on graphs,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.07674","last_updated":"2026-07-12T03:58:59Z","snapshot_observed_at":"2026-08-20T11:44:49.369735Z","submitted_at":"2026-01-12T16:00:21Z","title":"Self-Creating Random Walks for Decentralized Learning under Pac-Man Attacks","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-03T11:08:10.650315Z"},"links":{"citing_paper":"/paper/2601.07674"},"observation_digest":"sha256:ad3d56afc42e55bb875cf0946b9f1125f19ef78758b2c90d9379e5f56927a02e","observation_id":"702fb34b-7142-4c51-9608-feeac07701b5","resolution":{"observed_at":"2026-08-03T11:08:10.650315Z","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-03T11:08:10.724850Z","title":"Implementing fault-tolerant services using the state ma- chine approach: A tutorial,","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2601.07674","last_updated":"2026-07-12T03:58:59Z","snapshot_observed_at":"2026-08-20T11:44:49.369735Z","submitted_at":"2026-01-12T16:00:21Z","title":"Self-Creating Random Walks for Decentralized Learning under Pac-Man Attacks","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-03T11:08:10.724850Z"},"links":{"citing_paper":"/paper/2601.07674"},"observation_digest":"sha256:bdef5681aab93bc217d8570c0acbcfb85c61fe2a37d07d716d0b020058b64c07","observation_id":"801dfb5d-6fdf-47ea-86c2-c7850deeea02","resolution":{"observed_at":"2026-08-03T11:08:10.724850Z","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-03T11:08:10.763063Z","title":"The part-time parliament,","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2601.07674","last_updated":"2026-07-12T03:58:59Z","snapshot_observed_at":"2026-08-20T11:44:49.369735Z","submitted_at":"2026-01-12T16:00:21Z","title":"Self-Creating Random Walks for Decentralized Learning under Pac-Man Attacks","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-03T11:08:10.763063Z"},"links":{"citing_paper":"/paper/2601.07674"},"observation_digest":"sha256:d9b7bc0a9824837666462642c92fde50a601e8e3313c8ce5e2ac9ef0bfaf7cf2","observation_id":"cb22d868-dd33-46f6-9738-49ca1926d2cc","resolution":{"observed_at":"2026-08-03T11:08:10.763063Z","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-03T11:08:10.820784Z","title":"The byzantine generals prob- lem,","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2601.07674","last_updated":"2026-07-12T03:58:59Z","snapshot_observed_at":"2026-08-20T11:44:49.369735Z","submitted_at":"2026-01-12T16:00:21Z","title":"Self-Creating Random Walks for Decentralized Learning under Pac-Man Attacks","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-03T11:08:10.820784Z"},"links":{"citing_paper":"/paper/2601.07674"},"observation_digest":"sha256:083c077d2b80af200e1f2df6f940f5158ea2bdd7336eefd6cb81266f20a81322","observation_id":"0fbd8ff8-6e0b-43b7-aba9-5d0756253c90","resolution":{"observed_at":"2026-08-03T11:08:10.820784Z","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-03T11:08:10.989120Z","title":"A survey of rollback-recovery protocols in message-passing systems,","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2601.07674","last_updated":"2026-07-12T03:58:59Z","snapshot_observed_at":"2026-08-20T11:44:49.369735Z","submitted_at":"2026-01-12T16:00:21Z","title":"Self-Creating Random Walks for Decentralized Learning under Pac-Man Attacks","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-03T11:08:10.989120Z"},"links":{"citing_paper":"/paper/2601.07674"},"observation_digest":"sha256:8bd68566b45d7caa3ec315ae128fdc95c860a8282d2b1b7737be8c70b134997f","observation_id":"08b5cb47-ae7e-434f-a9dd-c4ba8d5cd2b0","resolution":{"observed_at":"2026-08-03T11:08:10.989120Z","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-03T11:08:11.220503Z","title":"Unreliable failure detectors for reliable distributed systems,","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2601.07674","last_updated":"2026-07-12T03:58:59Z","snapshot_observed_at":"2026-08-20T11:44:49.369735Z","submitted_at":"2026-01-12T16:00:21Z","title":"Self-Creating Random Walks for Decentralized Learning under Pac-Man Attacks","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-03T11:08:11.220503Z"},"links":{"citing_paper":"/paper/2601.07674"},"observation_digest":"sha256:f029cf18a730bb3b83c0ee8adc676f07e824eabad593e8e24009e9636ca0d6d9","observation_id":"cfc77729-9745-41b4-bbb8-903363cc6374","resolution":{"observed_at":"2026-08-03T11:08:11.220503Z","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-03T11:08:11.427090Z","title":"Walrand and P","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2601.07674","last_updated":"2026-07-12T03:58:59Z","snapshot_observed_at":"2026-08-20T11:44:49.369735Z","submitted_at":"2026-01-12T16:00:21Z","title":"Self-Creating Random Walks for Decentralized Learning under Pac-Man Attacks","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-03T11:08:11.427090Z"},"links":{"citing_paper":"/paper/2601.07674"},"observation_digest":"sha256:62e3f4a177ab11807abe94ae047ba00f7cfbdd095af6bdc65711a99358eb8641","observation_id":"51da5b98-eda6-4539-904b-1f988d111dff","resolution":{"observed_at":"2026-08-03T11:08:11.427090Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.11762","last_updated":"2025-02-10T11:06:43Z","snapshot_observed_at":"2026-08-20T20:28:59.955282Z","submitted_at":"2024-07-16T14:22:22Z","title":"Self-Regulating Random Walks for Resilient Decentralized Learning on Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.11762","snapshot_observed_at":"2026-08-03T11:08:11.515230Z","title":"Self-regulating random walks for resilient decentralized learning on graphs,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.07674","last_updated":"2026-07-12T03:58:59Z","snapshot_observed_at":"2026-08-20T11:44:49.369735Z","submitted_at":"2026-01-12T16:00:21Z","title":"Self-Creating Random Walks for Decentralized Learning under Pac-Man Attacks","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-03T11:08:11.515230Z"},"links":{"cited_paper":"/paper/2407.11762","citing_paper":"/paper/2601.07674"},"observation_digest":"sha256:45ab00e2744f6da8a3b71cf77fb828589e4da302b7ced5a78faf726091835253","observation_id":"b63b6052-ba83-41ef-bc19-d761408ce40c","resolution":{"observed_at":"2026-08-03T11:08:11.515230Z","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-03T11:08:11.585734Z","title":null,"venue":null,"work_id":null,"year":1964},"citing_paper":{"arxiv_id":"2601.07674","last_updated":"2026-07-12T03:58:59Z","snapshot_observed_at":"2026-08-20T11:44:49.369735Z","submitted_at":"2026-01-12T16:00:21Z","title":"Self-Creating Random Walks for Decentralized Learning under Pac-Man Attacks","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-03T11:08:11.585734Z"},"links":{"citing_paper":"/paper/2601.07674"},"observation_digest":"sha256:c6d570b370fe60fae3e822e693f1c051bd63e6d6817ff85e02300e7a39528026","observation_id":"f0841291-3c9c-427f-b1d5-ca342e176432","resolution":{"observed_at":"2026-08-03T11:08:11.585734Z","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-03T11:08:11.660193Z","title":"On markov chain gradient descent,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2601.07674","last_updated":"2026-07-12T03:58:59Z","snapshot_observed_at":"2026-08-20T11:44:49.369735Z","submitted_at":"2026-01-12T16:00:21Z","title":"Self-Creating Random Walks for Decentralized Learning under Pac-Man Attacks","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-03T11:08:11.660193Z"},"links":{"citing_paper":"/paper/2601.07674"},"observation_digest":"sha256:4e4bd6c0c16996b77d3f8b89a31d3b0829bd7ed0f18f3c8fb00aa16f40037e03","observation_id":"95e6e557-26ac-4983-94b4-40564b484e84","resolution":{"observed_at":"2026-08-03T11:08:11.660193Z","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-03T11:08:11.749885Z","title":"Walkman: A communication-efficient random-walk algorithm for decentralized optimization,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2601.07674","last_updated":"2026-07-12T03:58:59Z","snapshot_observed_at":"2026-08-20T11:44:49.369735Z","submitted_at":"2026-01-12T16:00:21Z","title":"Self-Creating Random Walks for Decentralized Learning under Pac-Man Attacks","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-03T11:08:11.749885Z"},"links":{"citing_paper":"/paper/2601.07674"},"observation_digest":"sha256:0772491ce54c04bb6891602ef4e1d416f6410b1d42b29f8312cf7dbfb792acf3","observation_id":"9391d690-1fd7-45c3-8388-be64b8407f66","resolution":{"observed_at":"2026-08-03T11:08:11.749885Z","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-03T11:08:11.798104Z","title":"Coulouris, J","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2601.07674","last_updated":"2026-07-12T03:58:59Z","snapshot_observed_at":"2026-08-20T11:44:49.369735Z","submitted_at":"2026-01-12T16:00:21Z","title":"Self-Creating Random Walks for Decentralized Learning under Pac-Man Attacks","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-03T11:08:11.798104Z"},"links":{"citing_paper":"/paper/2601.07674"},"observation_digest":"sha256:61c291b52aa87193a46fff4e10f36880e2439fed28dc4caa23e8e5d0d99cc895","observation_id":"ff9c2a96-de17-4ee8-bbe7-e7c205d3443c","resolution":{"observed_at":"2026-08-03T11:08:11.798104Z","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-03T11:08:11.830106Z","title":"Stochastic gradient descent under markovian sampling schemes,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2601.07674","last_updated":"2026-07-12T03:58:59Z","snapshot_observed_at":"2026-08-20T11:44:49.369735Z","submitted_at":"2026-01-12T16:00:21Z","title":"Self-Creating Random Walks for Decentralized Learning under Pac-Man Attacks","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-03T11:08:11.830106Z"},"links":{"citing_paper":"/paper/2601.07674"},"observation_digest":"sha256:075976440a3c2963faa5b6028ce0c60804a3ef7744776ef7480337028cf6ec25","observation_id":"9a5f0cab-135b-452f-8652-8a684dc35400","resolution":{"observed_at":"2026-08-03T11:08:11.830106Z","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-03T11:08:11.864564Z","title":"A randomized incremental subgradient method for distributed optimization in networked systems,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2601.07674","last_updated":"2026-07-12T03:58:59Z","snapshot_observed_at":"2026-08-20T11:44:49.369735Z","submitted_at":"2026-01-12T16:00:21Z","title":"Self-Creating Random Walks for Decentralized Learning under Pac-Man Attacks","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-03T11:08:11.864564Z"},"links":{"citing_paper":"/paper/2601.07674"},"observation_digest":"sha256:3209a2c112a536db8e9dc06f1e11602b71450eebd5fe18770db211546a1d0db7","observation_id":"85352bf5-de1b-4cd0-83db-13281a159baa","resolution":{"observed_at":"2026-08-03T11:08:11.864564Z","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-03T11:08:11.909283Z","title":"On markov chain gradient descent,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2601.07674","last_updated":"2026-07-12T03:58:59Z","snapshot_observed_at":"2026-08-20T11:44:49.369735Z","submitted_at":"2026-01-12T16:00:21Z","title":"Self-Creating Random Walks for Decentralized Learning under Pac-Man Attacks","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-03T11:08:11.909283Z"},"links":{"citing_paper":"/paper/2601.07674"},"observation_digest":"sha256:f649d2dac9e3d0cf96340b4de69877e694d89255d022add658e4a7e8ccc74c0d","observation_id":"9566b4b1-078a-4cd0-810b-a1e4bbe07ab2","resolution":{"observed_at":"2026-08-03T11:08:11.909283Z","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-03T11:08:12.094218Z","title":"Distributed asynchronous optimal routing in data networks,","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2601.07674","last_updated":"2026-07-12T03:58:59Z","snapshot_observed_at":"2026-08-20T11:44:49.369735Z","submitted_at":"2026-01-12T16:00:21Z","title":"Self-Creating Random Walks for Decentralized Learning under Pac-Man Attacks","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-03T11:08:12.094218Z"},"links":{"citing_paper":"/paper/2601.07674"},"observation_digest":"sha256:cc9563d5d6acbf599e47545798bcb245b26e53c66800fe1dd4879f5f60d8a086","observation_id":"b2f2ea60-b39c-4006-b324-2e881cd626c3","resolution":{"observed_at":"2026-08-03T11:08:12.094218Z","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-03T11:08:12.202032Z","title":"Collet, S","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2601.07674","last_updated":"2026-07-12T03:58:59Z","snapshot_observed_at":"2026-08-20T11:44:49.369735Z","submitted_at":"2026-01-12T16:00:21Z","title":"Self-Creating Random Walks for Decentralized Learning under Pac-Man Attacks","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-03T11:08:12.202032Z"},"links":{"citing_paper":"/paper/2601.07674"},"observation_digest":"sha256:d7b3cb31a8be12b56d7e6c797fbb23e76beea9d48212e2850df56c068821ebf2","observation_id":"884b4e16-212c-4a05-bb56-95c0aaaaacc8","resolution":{"observed_at":"2026-08-03T11:08:12.202032Z","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-03T11:08:12.334758Z","title":"On quasi-stationary distributions in absorbing discrete-time finite markov chains,","venue":null,"work_id":null,"year":1965},"citing_paper":{"arxiv_id":"2601.07674","last_updated":"2026-07-12T03:58:59Z","snapshot_observed_at":"2026-08-20T11:44:49.369735Z","submitted_at":"2026-01-12T16:00:21Z","title":"Self-Creating Random Walks for Decentralized Learning under Pac-Man Attacks","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-03T11:08:12.334758Z"},"links":{"citing_paper":"/paper/2601.07674"},"observation_digest":"sha256:5b5be6499268077200c8d841868f8d27eba2de0e5ebb913ec4d64a4158b08df5","observation_id":"8fdc8c0b-a4d3-4516-86c7-85aa47e8631a","resolution":{"observed_at":"2026-08-03T11:08:12.334758Z","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-03T11:08:12.435454Z","title":"Expander graphs and their applications,","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2601.07674","last_updated":"2026-07-12T03:58:59Z","snapshot_observed_at":"2026-08-20T11:44:49.369735Z","submitted_at":"2026-01-12T16:00:21Z","title":"Self-Creating Random Walks for Decentralized Learning under Pac-Man Attacks","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-03T11:08:12.435454Z"},"links":{"citing_paper":"/paper/2601.07674"},"observation_digest":"sha256:fecb3015383c5706c9d96dc848e44702261217549c11d02247c2afd47690a1a4","observation_id":"0f196ce7-cf3f-4c64-8bcf-51dd1940a911","resolution":{"observed_at":"2026-08-03T11:08:12.435454Z","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-03T11:08:12.518889Z","title":"The mnist database of handwritten digit images for machine learning research,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2601.07674","last_updated":"2026-07-12T03:58:59Z","snapshot_observed_at":"2026-08-20T11:44:49.369735Z","submitted_at":"2026-01-12T16:00:21Z","title":"Self-Creating Random Walks for Decentralized Learning under Pac-Man Attacks","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-03T11:08:12.518889Z"},"links":{"citing_paper":"/paper/2601.07674"},"observation_digest":"sha256:b321976b0b8532fbb3c1e0db661c0d788cf0b0b739bada7f9a0f8cc43680285d","observation_id":"44e514cd-6c7a-4912-b629-a30790fec8b3","resolution":{"observed_at":"2026-08-03T11:08:12.518889Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.06335","last_updated":"2019-09-13T17:26:20Z","snapshot_observed_at":"2026-08-16T05:00:17.345539Z","submitted_at":"2019-09-13T17:26:20Z","title":"Measuring the Effects of Non-Identical Data Distribution for Federated Visual Classification","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.06335","snapshot_observed_at":"2026-08-03T11:08:12.648411Z","title":"Measuring the effects of non- identical data distribution for federated visual classification,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2601.07674","last_updated":"2026-07-12T03:58:59Z","snapshot_observed_at":"2026-08-20T11:44:49.369735Z","submitted_at":"2026-01-12T16:00:21Z","title":"Self-Creating Random Walks for Decentralized Learning under Pac-Man Attacks","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-03T11:08:12.648411Z"},"links":{"cited_paper":"/paper/1909.06335","citing_paper":"/paper/2601.07674"},"observation_digest":"sha256:e2e75f9f192ed12810cf0b680ade9ee70756dae56ff2fe60aa393183e23aecba","observation_id":"7c458823-8ad2-404a-8724-1f6e37937e33","resolution":{"observed_at":"2026-08-03T11:08:12.648411Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2508.05663","last_updated":"2026-07-06T03:36:42Z","snapshot_observed_at":"2026-08-14T09:31:10.427713Z","submitted_at":"2025-08-01T02:27:02Z","title":"Random Walk Learning and the Pac-Man Attack","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.05663","snapshot_observed_at":"2026-08-03T11:08:12.793512Z","title":"Random walk learning and the pac-man attack,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.07674","last_updated":"2026-07-12T03:58:59Z","snapshot_observed_at":"2026-08-20T11:44:49.369735Z","submitted_at":"2026-01-12T16:00:21Z","title":"Self-Creating Random Walks for Decentralized Learning under Pac-Man Attacks","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-03T11:08:12.793512Z"},"links":{"cited_paper":"/paper/2508.05663","citing_paper":"/paper/2601.07674"},"observation_digest":"sha256:1dc6ea76e10bfa3e01182033bf9dd20463d288f37e17ffb63ebc11d45c7b3626","observation_id":"bf677934-f440-4d6f-8511-04753a1320d4","resolution":{"observed_at":"2026-08-03T11:08:12.793512Z","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-03T11:08:12.912230Z","title":"Durrett,Probability: Theory and Examples","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2601.07674","last_updated":"2026-07-12T03:58:59Z","snapshot_observed_at":"2026-08-20T11:44:49.369735Z","submitted_at":"2026-01-12T16:00:21Z","title":"Self-Creating Random Walks for Decentralized Learning under Pac-Man Attacks","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-03T11:08:12.912230Z"},"links":{"citing_paper":"/paper/2601.07674"},"observation_digest":"sha256:901cce285de7219b36126165c098333d432f3dbe9928635c4bb5166de378ab42","observation_id":"5f3e0692-06bd-4cc0-ba5d-09e10fe38abb","resolution":{"observed_at":"2026-08-03T11:08:12.912230Z","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-03T11:08:13.039708Z","title":"Yaglom limits can depend on the starting state,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2601.07674","last_updated":"2026-07-12T03:58:59Z","snapshot_observed_at":"2026-08-20T11:44:49.369735Z","submitted_at":"2026-01-12T16:00:21Z","title":"Self-Creating Random Walks for Decentralized Learning under Pac-Man Attacks","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-03T11:08:13.039708Z"},"links":{"citing_paper":"/paper/2601.07674"},"observation_digest":"sha256:160da027bb0ff218f84f650a4abb7bddb1bdb9e5a6a118ffe1872848d563d6ee","observation_id":"22d330a6-d4fa-440a-a32e-23b98c409495","resolution":{"observed_at":"2026-08-03T11:08:13.039708Z","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-03T11:08:13.163643Z","title":"Billingsley,Probability and Measure, 3rd ed., ser","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2601.07674","last_updated":"2026-07-12T03:58:59Z","snapshot_observed_at":"2026-08-20T11:44:49.369735Z","submitted_at":"2026-01-12T16:00:21Z","title":"Self-Creating Random Walks for Decentralized Learning under Pac-Man Attacks","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-03T11:08:13.163643Z"},"links":{"citing_paper":"/paper/2601.07674"},"observation_digest":"sha256:229e7d47d315e3994bba8ffd21d528ba3f47e374fb5e0064c90aadfead976572","observation_id":"ed837bf4-13a0-40a8-acc6-4bec12f26232","resolution":{"observed_at":"2026-08-03T11:08:13.163643Z","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-03T11:08:13.283912Z","title":"Boyd and L","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2601.07674","last_updated":"2026-07-12T03:58:59Z","snapshot_observed_at":"2026-08-20T11:44:49.369735Z","submitted_at":"2026-01-12T16:00:21Z","title":"Self-Creating Random Walks for Decentralized Learning under Pac-Man Attacks","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-03T11:08:13.283912Z"},"links":{"citing_paper":"/paper/2601.07674"},"observation_digest":"sha256:94132d9f42a804c5df4cd2df9036d40be3f2f1c8203222aa4c4a9b29bc017a8e","observation_id":"9260b416-600d-4e2c-9148-f5c6b50e5583","resolution":{"observed_at":"2026-08-03T11:08:13.283912Z","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-03T11:08:13.368713Z","title":"The entrapment problem in random walk decentralized learning,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.07674","last_updated":"2026-07-12T03:58:59Z","snapshot_observed_at":"2026-08-20T11:44:49.369735Z","submitted_at":"2026-01-12T16:00:21Z","title":"Self-Creating Random Walks for Decentralized Learning under Pac-Man Attacks","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-03T11:08:13.368713Z"},"links":{"citing_paper":"/paper/2601.07674"},"observation_digest":"sha256:a3e6ce44b93e191617cd98f9e3b7fc78e173904db1722f5111f1e71b44d1d246","observation_id":"80100efa-7ed9-4909-8c44-c40f028359c9","resolution":{"observed_at":"2026-08-03T11:08:13.368713Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T11:08:13.479618Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.07674","last_updated":"2026-07-12T03:58:59Z","snapshot_observed_at":"2026-08-20T11:44:49.369735Z","submitted_at":"2026-01-12T16:00:21Z","title":"Self-Creating Random Walks for Decentralized Learning under Pac-Man Attacks","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-03T11:08:13.479618Z"},"links":{"citing_paper":"/paper/2601.07674"},"observation_digest":"sha256:f5d091b1e0928b8ab024b9eb3ccc34dcd8a42e99e6d958a5e03c164cb72be710","observation_id":"94c27196-87dc-467e-952d-68f05f25db06","resolution":{"observed_at":"2026-08-03T11:08:13.479618Z","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-03T11:08:13.591293Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.07674","last_updated":"2026-07-12T03:58:59Z","snapshot_observed_at":"2026-08-20T11:44:49.369735Z","submitted_at":"2026-01-12T16:00:21Z","title":"Self-Creating Random Walks for Decentralized Learning under Pac-Man Attacks","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-03T11:08:13.591293Z"},"links":{"citing_paper":"/paper/2601.07674"},"observation_digest":"sha256:2c5aede2bfaa1d3fda512d9fd35b4a59d8610856b6527b91d7c95ad2cd88d37f","observation_id":"33e2c2e9-74b9-47f0-b712-e55de7e8daa0","resolution":{"observed_at":"2026-08-03T11:08:13.591293Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2601.07674","last_updated":"2026-07-12T03:58:59Z","latest_version":2,"primary_category":"cs.MA","snapshot_observed_at":"2026-08-20T11:44:49.369735Z","submitted_at":"2026-01-12T16:00:21Z","title":"Self-Creating Random Walks for Decentralized Learning under Pac-Man Attacks"},"reference_resolution":{"displayed":43,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":42,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":43},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 43 of 43 outbound references and 0 inbound Pith citation observations for arXiv:2601.07674."}