{"as_of":"2026-08-11T01:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d5de23b7a2c4da4c60fbeacea7262235509140139532ef4239595e27151a5113","coverage":[{"denominator":30,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":30,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:47:22.890118Z","state":"measured"},{"denominator":31,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":31,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-28T23:22:35.875578Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-06-28T23:22:46.537900Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.18300","last_updated":"2025-07-27T00:40:47Z","snapshot_observed_at":"2026-08-09T00:01:49.611995Z","submitted_at":"2025-05-23T18:46:10Z","title":"Beyond Self-Repellent Kernels: History-Driven Target Towards Efficient Nonlinear MCMC on General Graphs","version":3},"cited_work":{"arxiv_id":"2505.18300","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.18300","snapshot_observed_at":"2026-06-28T23:22:46.537900Z","title":"Beyond Self-Repellent Kernels: History- Driven Target Towards Efficient Nonlinear MCMC on General Graphs","venue":null,"work_id":"5ffcc627-9bc7-4acc-9ed6-ed8121de6d83","year":2025},"citing_paper":{"arxiv_id":"2605.30532","last_updated":"2026-05-28T20:09:36Z","snapshot_observed_at":"2026-07-06T23:39:48.531480Z","submitted_at":"2026-05-28T20:09:36Z","title":"True Self-Avoiding Walk for Accelerating Markov-Chain Monte Carlo Integration","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-28T23:22:35.875578Z"},"links":{"cited_paper":"/paper/2505.18300","citing_paper":"/paper/2605.30532"},"observation_digest":"sha256:f232966e7dc1df059fdd86c2bc419b7b85359cb8b01b8a1418e1b798f0c91037","observation_id":"2fd3cb88-ea04-4cfb-a12b-4babd3f7ab94","resolution":{"observed_at":"2026-06-28T23:22:46.539577Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2505.18300/citation-record","integrity":"/paper/2505.18300/integrity","json":"/paper/2505.18300/citation-record.json","paper":"/paper/2505.18300"},"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-07T14:47:27.429260Z","title":null,"venue":null,"work_id":"9a1076b1-0a23-4554-91ca-256c0d1c8c17","year":2022},"citing_paper":{"arxiv_id":"2505.18300","last_updated":"2025-07-27T00:40:47Z","snapshot_observed_at":"2026-08-09T00:01:49.611995Z","submitted_at":"2025-05-23T18:46:10Z","title":"Beyond Self-Repellent Kernels: History-Driven Target Towards Efficient Nonlinear MCMC on General Graphs","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T14:47:21.358907Z"},"links":{"citing_paper":"/paper/2505.18300"},"observation_digest":"sha256:bd372a54b9079c63e3481fbdb0aaa0657cfd527db18d31c1cdce941ddf810d63","observation_id":"3a02bcfb-5d58-460a-888a-9789e5bd213f","resolution":{"observed_at":"2026-08-07T14:47:27.539538Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T14:47:26.303205Z","title":"Name # of nodes","venue":null,"work_id":"7e322516-3ca6-44aa-b2f3-0d6540ef212d","year":2000},"citing_paper":{"arxiv_id":"2505.18300","last_updated":"2025-07-27T00:40:47Z","snapshot_observed_at":"2026-08-09T00:01:49.611995Z","submitted_at":"2025-05-23T18:46:10Z","title":"Beyond Self-Repellent Kernels: History-Driven Target Towards Efficient Nonlinear MCMC on General Graphs","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T14:47:21.893814Z"},"links":{"citing_paper":"/paper/2505.18300"},"observation_digest":"sha256:f03d8e444e857540d08302b40de29b903cce9e52a98eb54fd076b41c1ea258bf","observation_id":"4e973093-2c38-4878-967a-847a79476289","resolution":{"observed_at":"2026-08-07T14:47:26.417360Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T14:47:26.099032Z","title":null,"venue":null,"work_id":"08a7ec6d-dd87-4563-a391-6774cdb1766e","year":2000},"citing_paper":{"arxiv_id":"2505.18300","last_updated":"2025-07-27T00:40:47Z","snapshot_observed_at":"2026-08-09T00:01:49.611995Z","submitted_at":"2025-05-23T18:46:10Z","title":"Beyond Self-Repellent Kernels: History-Driven Target Towards Efficient Nonlinear MCMC on General Graphs","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T14:47:21.985506Z"},"links":{"citing_paper":"/paper/2505.18300"},"observation_digest":"sha256:e3ca3c346ed248f1a987767c6655c12c23404ef3e84fd824c4c7e48ddc7e7350","observation_id":"73f74b98-7e10-4b49-b5db-c1a30a508db0","resolution":{"observed_at":"2026-08-07T14:47:26.170877Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T14:47:25.644486Z","title":null,"venue":null,"work_id":"48ae94af-eeff-4304-96fa-29cde8d17f7f","year":2000},"citing_paper":{"arxiv_id":"2505.18300","last_updated":"2025-07-27T00:40:47Z","snapshot_observed_at":"2026-08-09T00:01:49.611995Z","submitted_at":"2025-05-23T18:46:10Z","title":"Beyond Self-Repellent Kernels: History-Driven Target Towards Efficient Nonlinear MCMC on General Graphs","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T14:47:22.195479Z"},"links":{"citing_paper":"/paper/2505.18300"},"observation_digest":"sha256:b870b3f1539337572f8db534689fa570511ea87687f46e9ec1cc391181043381","observation_id":"716d0e08-d3a9-4255-bca8-3aed17a2502f","resolution":{"observed_at":"2026-08-07T14:47:25.742406Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T14:47:28.545331Z","title":null,"venue":null,"work_id":"dfe65c46-1e4f-4ec0-b13f-6ba6561d937b","year":2019},"citing_paper":{"arxiv_id":"2505.18300","last_updated":"2025-07-27T00:40:47Z","snapshot_observed_at":"2026-08-09T00:01:49.611995Z","submitted_at":"2025-05-23T18:46:10Z","title":"Beyond Self-Repellent Kernels: History-Driven Target Towards Efficient Nonlinear MCMC on General Graphs","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T14:47:20.288361Z"},"links":{"citing_paper":"/paper/2505.18300"},"observation_digest":"sha256:3907e65564a484294fa1a9d2815ac40b00b52375fe2d9c1ddb9b6ab25d5d7ca9","observation_id":"32888924-1096-4106-96d3-186033192c63","resolution":{"observed_at":"2026-08-07T14:47:28.636789Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"math/0407281","last_updated":"2004-07-15T19:44:23Z","snapshot_observed_at":"2026-07-07T05:42:21.148360Z","submitted_at":"2004-07-15T19:44:23Z","title":"Improving Asymptotic Variance of MCMC Estimators: Non-reversible Chains are Better","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"math/0407281","snapshot_observed_at":"2026-08-07T14:47:20.667794Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.18300","last_updated":"2025-07-27T00:40:47Z","snapshot_observed_at":"2026-08-09T00:01:49.611995Z","submitted_at":"2025-05-23T18:46:10Z","title":"Beyond Self-Repellent Kernels: History-Driven Target Towards Efficient Nonlinear MCMC on General Graphs","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T14:47:20.667794Z"},"links":{"cited_paper":"/paper/math/0407281","citing_paper":"/paper/2505.18300"},"observation_digest":"sha256:8c5a4d7e67feb4df4bab74fc1c2cc0ec2290e954f24cc0b3d06172d92a672f98","observation_id":"dbf362bf-c10b-4b76-8eeb-6ae57319f327","resolution":{"observed_at":"2026-08-07T14:47:20.667794Z","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-07T14:47:28.314906Z","title":"N., and Zhang, R","venue":null,"work_id":"3f5343b6-a963-4ab5-9e55-b3f474195143","year":2024},"citing_paper":{"arxiv_id":"2505.18300","last_updated":"2025-07-27T00:40:47Z","snapshot_observed_at":"2026-08-09T00:01:49.611995Z","submitted_at":"2025-05-23T18:46:10Z","title":"Beyond Self-Repellent Kernels: History-Driven Target Towards Efficient Nonlinear MCMC on General Graphs","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T14:47:20.760627Z"},"links":{"citing_paper":"/paper/2505.18300"},"observation_digest":"sha256:f5584da0610e74e73bee3c8523b3f4f8a0ce2455019b9330a67b021c1f442deb","observation_id":"e3a3e5d8-6553-423e-a792-a5bab5a4ada8","resolution":{"observed_at":"2026-08-07T14:47:28.425645Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T14:47:27.831792Z","title":"Challenging the limits: Sampling online social networks with cost constraints","venue":null,"work_id":"ed4676c5-d636-4cad-aec7-63e3c2e4adbb","year":2017},"citing_paper":{"arxiv_id":"2505.18300","last_updated":"2025-07-27T00:40:47Z","snapshot_observed_at":"2026-08-09T00:01:49.611995Z","submitted_at":"2025-05-23T18:46:10Z","title":"Beyond Self-Repellent Kernels: History-Driven Target Towards Efficient Nonlinear MCMC on General Graphs","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T14:47:21.114311Z"},"links":{"citing_paper":"/paper/2505.18300"},"observation_digest":"sha256:f2a038d55bbeb3d437da3f070bbe10f817968d726fc23e673e994ebe2628ae9b","observation_id":"fb284262-244a-49a1-b11f-07a67d2b8a7b","resolution":{"observed_at":"2026-08-07T14:47:27.913858Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T14:47:27.219904Z","title":"Proof of Lemma 3.2 The proof consists of three parts: We first show that V (x) = X i∈X µi(xi/µi)−α (26) is the Lyapunov function of the ODE ˙x = π[x] − x","venue":null,"work_id":"f9eacfe3-781b-496c-a88e-ed3beb87cefc","year":2000},"citing_paper":{"arxiv_id":"2505.18300","last_updated":"2025-07-27T00:40:47Z","snapshot_observed_at":"2026-08-09T00:01:49.611995Z","submitted_at":"2025-05-23T18:46:10Z","title":"Beyond Self-Repellent Kernels: History-Driven Target Towards Efficient Nonlinear MCMC on General Graphs","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T14:47:21.474128Z"},"links":{"citing_paper":"/paper/2505.18300"},"observation_digest":"sha256:980261dd1af2fade4f0d486de4a0f55e7f940b77e844b8f31ad6694caadddd08","observation_id":"40c7843a-f2eb-458c-aea8-0dd247d20fe1","resolution":{"observed_at":"2026-08-07T14:47:27.306312Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T14:47:27.033668Z","title":"In our Algorithm 1, replacing the target of the base MCMC sampler from µ to π[x] results in an ergodic transition matrix P [x] parameterized by x, which is π[x]-invariant","venue":null,"work_id":"186f9a47-66fb-4186-94c0-325980a75c51","year":2013},"citing_paper":{"arxiv_id":"2505.18300","last_updated":"2025-07-27T00:40:47Z","snapshot_observed_at":"2026-08-09T00:01:49.611995Z","submitted_at":"2025-05-23T18:46:10Z","title":"Beyond Self-Repellent Kernels: History-Driven Target Towards Efficient Nonlinear MCMC on General Graphs","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T14:47:21.578424Z"},"links":{"citing_paper":"/paper/2505.18300"},"observation_digest":"sha256:6431d5a4b21e0e042cc53e1be44193581811b5162f85be56c74fa19b2cae1850","observation_id":"f808de21-24de-4051-bfa0-94741f3081c2","resolution":{"observed_at":"2026-08-07T14:47:27.124141Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T14:47:26.777214Z","title":"tX s=1 Φ(θ∗, Zs) #","venue":null,"work_id":"41ad1025-53e7-4205-bbe4-51eac8628d89","year":2010},"citing_paper":{"arxiv_id":"2505.18300","last_updated":"2025-07-27T00:40:47Z","snapshot_observed_at":"2026-08-09T00:01:49.611995Z","submitted_at":"2025-05-23T18:46:10Z","title":"Beyond Self-Repellent Kernels: History-Driven Target Towards Efficient Nonlinear MCMC on General Graphs","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T14:47:21.695924Z"},"links":{"citing_paper":"/paper/2505.18300"},"observation_digest":"sha256:3a12e48d71859e56afaee2be02115bdc06ee2afa0eed34062f153959d413b0b1","observation_id":"d1f6e60b-f0f4-432b-9a3f-46e472855b70","resolution":{"observed_at":"2026-08-07T14:47:26.890882Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T14:47:24.543126Z","title":"For simulation setting, We run 50 independent trials with 300,000 steps and set one-third of the number of steps as burn-in period before collecting samples","venue":null,"work_id":"1b9224ad-14fc-43d9-ada5-1c7ba582f1be","year":2014},"citing_paper":{"arxiv_id":"2505.18300","last_updated":"2025-07-27T00:40:47Z","snapshot_observed_at":"2026-08-09T00:01:49.611995Z","submitted_at":"2025-05-23T18:46:10Z","title":"Beyond Self-Repellent Kernels: History-Driven Target Towards Efficient Nonlinear MCMC on General Graphs","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T14:47:22.528025Z"},"links":{"citing_paper":"/paper/2505.18300"},"observation_digest":"sha256:c3e88bc46da8e9bdcbd3f650b5f31c1066cb433f99221d8503cdfd8ed4d233c1","observation_id":"48b48edb-2c04-463d-bc7c-37af196016ab","resolution":{"observed_at":"2026-08-07T14:47:24.676914Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T14:47:25.875807Z","title":"More results on HDT-MCMC in graph sampling In this section, we present more simulation results on the algorithm that utilizes HDT-MCMC framework for graph sampling in other graph","venue":null,"work_id":"2b95c847-1205-4d8c-9ca4-fa72e233dd4d","year":2000},"citing_paper":{"arxiv_id":"2505.18300","last_updated":"2025-07-27T00:40:47Z","snapshot_observed_at":"2026-08-09T00:01:49.611995Z","submitted_at":"2025-05-23T18:46:10Z","title":"Beyond Self-Repellent Kernels: History-Driven Target Towards Efficient Nonlinear MCMC on General Graphs","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T14:47:22.059831Z"},"links":{"citing_paper":"/paper/2505.18300"},"observation_digest":"sha256:519646a8f29d0b2718d4e7119f69b5cf2db51630cec007a571b8c72c830a5f74","observation_id":"755ef997-c82c-4770-b565-5d8582635895","resolution":{"observed_at":"2026-08-07T14:47:25.962688Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T14:47:25.330842Z","title":null,"venue":null,"work_id":"ffe8c07f-56a2-4492-96fb-16a53ecf4b3b","year":2000},"citing_paper":{"arxiv_id":"2505.18300","last_updated":"2025-07-27T00:40:47Z","snapshot_observed_at":"2026-08-09T00:01:49.611995Z","submitted_at":"2025-05-23T18:46:10Z","title":"Beyond Self-Repellent Kernels: History-Driven Target Towards Efficient Nonlinear MCMC on General Graphs","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T14:47:22.304122Z"},"links":{"citing_paper":"/paper/2505.18300"},"observation_digest":"sha256:b7fc1204bfc36f310bded146459ed476a896656cea34ad80610636c51d70b9a6","observation_id":"6e21f810-bbde-44f9-bc94-85c49cdf177a","resolution":{"observed_at":"2026-08-07T14:47:25.466335Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T14:47:25.100991Z","title":"Moreover, in p2p-Gnutella08 graph, we notice that the performance of LRU design is robust to the choice of the memory capacity","venue":null,"work_id":"e69665e6-181e-4651-b660-ca78102817a6","year":2000},"citing_paper":{"arxiv_id":"2505.18300","last_updated":"2025-07-27T00:40:47Z","snapshot_observed_at":"2026-08-09T00:01:49.611995Z","submitted_at":"2025-05-23T18:46:10Z","title":"Beyond Self-Repellent Kernels: History-Driven Target Towards Efficient Nonlinear MCMC on General Graphs","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T14:47:22.384146Z"},"links":{"citing_paper":"/paper/2505.18300"},"observation_digest":"sha256:1508ef5adafce0d86a9a948989f80b50ece7d53daf079495ff8e933a5c1bf496","observation_id":"ea8ae5ae-fd4a-4282-b833-1ec61b9f7545","resolution":{"observed_at":"2026-08-07T14:47:25.217080Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T14:47:24.816463Z","title":"500 1000 1500 2000 2500 3000 Steps 0.4 0.5 0.6 0.7 0.8 0.9 1.0TVD WikiVote Graph MHRW MHRW-HDT ( = 0.5) MHRW-HDT ( =","venue":null,"work_id":"e62a7ea0-dacf-436c-8a1c-02458b7d34f0","year":2000},"citing_paper":{"arxiv_id":"2505.18300","last_updated":"2025-07-27T00:40:47Z","snapshot_observed_at":"2026-08-09T00:01:49.611995Z","submitted_at":"2025-05-23T18:46:10Z","title":"Beyond Self-Repellent Kernels: History-Driven Target Towards Efficient Nonlinear MCMC on General Graphs","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T14:47:22.467656Z"},"links":{"citing_paper":"/paper/2505.18300"},"observation_digest":"sha256:be40f65c5532e14cead37860886a24cc60821f8ca740bdbd9ad71bf36eaa041c","observation_id":"1a328969-7a00-4f15-8cd2-6c1051be49ad","resolution":{"observed_at":"2026-08-07T14:47:24.935850Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T14:47:24.243690Z","title":null,"venue":null,"work_id":"37a2dd89-046a-4159-b61a-dbaab49c4930","year":2000},"citing_paper":{"arxiv_id":"2505.18300","last_updated":"2025-07-27T00:40:47Z","snapshot_observed_at":"2026-08-09T00:01:49.611995Z","submitted_at":"2025-05-23T18:46:10Z","title":"Beyond Self-Repellent Kernels: History-Driven Target Towards Efficient Nonlinear MCMC on General Graphs","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T14:47:22.629111Z"},"links":{"citing_paper":"/paper/2505.18300"},"observation_digest":"sha256:f48f73d1602bc9a4a889c103fbe115807bf5bc6a53b67294801aa53795d21b36","observation_id":"1d36ea98-f9ab-4c4a-b4e2-c6a7d3aafc46","resolution":{"observed_at":"2026-08-07T14:47:24.382418Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T14:47:23.925444Z","title":null,"venue":null,"work_id":"1eb2939e-0c03-4d16-bbba-076356a275d5","year":2000},"citing_paper":{"arxiv_id":"2505.18300","last_updated":"2025-07-27T00:40:47Z","snapshot_observed_at":"2026-08-09T00:01:49.611995Z","submitted_at":"2025-05-23T18:46:10Z","title":"Beyond Self-Repellent Kernels: History-Driven Target Towards Efficient Nonlinear MCMC on General Graphs","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T14:47:22.742705Z"},"links":{"citing_paper":"/paper/2505.18300"},"observation_digest":"sha256:d341f939d201128422f1dffb7e98648c33bcd0062bca98260ffaba1784014078","observation_id":"924e201b-7e32-432a-a2c2-6738242c1c04","resolution":{"observed_at":"2026-08-07T14:47:24.072460Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T14:47:23.722820Z","title":"µi ∝ di with α = 1 in HDT","venue":null,"work_id":"c44396df-9540-4a82-a78a-d25d90ec4016","year":2006},"citing_paper":{"arxiv_id":"2505.18300","last_updated":"2025-07-27T00:40:47Z","snapshot_observed_at":"2026-08-09T00:01:49.611995Z","submitted_at":"2025-05-23T18:46:10Z","title":"Beyond Self-Repellent Kernels: History-Driven Target Towards Efficient Nonlinear MCMC on General Graphs","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T14:47:22.890118Z"},"links":{"citing_paper":"/paper/2505.18300"},"observation_digest":"sha256:6195a06dc1c6caaa8b8d308a74b20f8279f5fb44537f75d34eb7b9fe92f74714","observation_id":"88c6f17a-f8cb-41e7-9032-494963c2d525","resolution":{"observed_at":"2026-08-07T14:47:23.812921Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T14:47:28.766298Z","title":"and Hwang, C.-R","venue":null,"work_id":"214e31eb-728e-4713-8294-7ab0598f24cd","year":1956},"citing_paper":{"arxiv_id":"2505.18300","last_updated":"2025-07-27T00:40:47Z","snapshot_observed_at":"2026-08-09T00:01:49.611995Z","submitted_at":"2025-05-23T18:46:10Z","title":"Beyond Self-Repellent Kernels: History-Driven Target Towards Efficient Nonlinear MCMC on General Graphs","version":3},"reference_index":1999,"source":"pdf_text","source_observed_at":"2026-08-07T14:47:19.754189Z"},"links":{"citing_paper":"/paper/2505.18300"},"observation_digest":"sha256:9e26f9a8789a72a6a9dcbcb5e288e19772433d651e8f20087387ac321031a8b7","observation_id":"73f7afe6-8bdb-41db-bdcb-8abb81bddadf","resolution":{"observed_at":"2026-08-07T14:47:28.853223Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1608.05973","last_updated":"2018-03-12T23:59:03Z","snapshot_observed_at":"2026-08-04T04:14:40.734516Z","submitted_at":"2016-08-21T17:40:09Z","title":"Irreversible Samplers from Jump and Continuous Markov Processes","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1608.05973","snapshot_observed_at":"2026-08-07T14:47:20.496664Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.18300","last_updated":"2025-07-27T00:40:47Z","snapshot_observed_at":"2026-08-09T00:01:49.611995Z","submitted_at":"2025-05-23T18:46:10Z","title":"Beyond Self-Repellent Kernels: History-Driven Target Towards Efficient Nonlinear MCMC on General Graphs","version":3},"reference_index":2000,"source":"pdf_text","source_observed_at":"2026-08-07T14:47:20.496664Z"},"links":{"cited_paper":"/paper/1608.05973","citing_paper":"/paper/2505.18300"},"observation_digest":"sha256:2e2ff84d1f902d94730e523721c13ca2c2653214eb6f750ad5dc92dad8ff2500","observation_id":"1dd23367-952b-4187-a045-545f447367a8","resolution":{"observed_at":"2026-08-07T14:47:20.496664Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.01214","last_updated":"2025-03-05T07:02:28Z","snapshot_observed_at":"2026-07-06T18:39:29.270369Z","submitted_at":"2024-07-01T11:59:59Z","title":"Revisiting Random Walks for Learning on Graphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.01214","snapshot_observed_at":"2026-08-07T14:47:19.900181Z","title":"Revisiting random walks for learning on graphs","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.18300","last_updated":"2025-07-27T00:40:47Z","snapshot_observed_at":"2026-08-09T00:01:49.611995Z","submitted_at":"2025-05-23T18:46:10Z","title":"Beyond Self-Repellent Kernels: History-Driven Target Towards Efficient Nonlinear MCMC on General Graphs","version":3},"reference_index":2002,"source":"pdf_text","source_observed_at":"2026-08-07T14:47:19.900181Z"},"links":{"cited_paper":"/paper/2407.01214","citing_paper":"/paper/2505.18300"},"observation_digest":"sha256:5a675d90bc2a6220771d97dcd82a6ebbcf657aeb1f250c6d62567e728c340199","observation_id":"841ba0c8-5812-4957-96df-6c7a0d0868b4","resolution":{"observed_at":"2026-08-07T14:47:19.900181Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.07690","last_updated":"2023-02-20T00:45:45Z","snapshot_observed_at":"2026-08-09T00:00:59.551810Z","submitted_at":"2023-02-15T14:31:11Z","title":"Online Statistical Inference for Nonlinear Stochastic Approximation with Markovian Data","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.07690","snapshot_observed_at":"2026-08-07T14:47:20.148987Z","title":"Online statistical inference for nonlinear stochastic approximation with markovian data","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.18300","last_updated":"2025-07-27T00:40:47Z","snapshot_observed_at":"2026-08-09T00:01:49.611995Z","submitted_at":"2025-05-23T18:46:10Z","title":"Beyond Self-Repellent Kernels: History-Driven Target Towards Efficient Nonlinear MCMC on General Graphs","version":3},"reference_index":2005,"source":"pdf_text","source_observed_at":"2026-08-07T14:47:20.148987Z"},"links":{"cited_paper":"/paper/2302.07690","citing_paper":"/paper/2505.18300"},"observation_digest":"sha256:26975db204c1f8ffa64df4354b4078a76a86fef14d95f47ed52b107c7ec8b8b6","observation_id":"b92ba2e3-de76-45ad-9e30-0db38ec8e9a6","resolution":{"observed_at":"2026-08-07T14:47:20.148987Z","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-07T14:47:28.996362Z","title":"and Livingstone, S","venue":null,"work_id":"45476317-12fd-4e9e-b78b-cdd700b1dd35","year":1958},"citing_paper":{"arxiv_id":"2505.18300","last_updated":"2025-07-27T00:40:47Z","snapshot_observed_at":"2026-08-09T00:01:49.611995Z","submitted_at":"2025-05-23T18:46:10Z","title":"Beyond Self-Repellent Kernels: History-Driven Target Towards Efficient Nonlinear MCMC on General Graphs","version":3},"reference_index":2007,"source":"pdf_text","source_observed_at":"2026-08-07T14:47:19.307274Z"},"links":{"citing_paper":"/paper/2505.18300"},"observation_digest":"sha256:06eb9f06402d6efe2667464003f7e0caaccbfffd83e2112d73f38d1808f625f1","observation_id":"f6cb2536-060c-44d4-a04e-2486a75bb3c8","resolution":{"observed_at":"2026-08-07T14:47:29.117009Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2012.15550","last_updated":"2021-03-29T12:30:47Z","snapshot_observed_at":"2026-07-06T10:29:01.682011Z","submitted_at":"2020-12-31T11:22:22Z","title":"Nonreversible MCMC from conditional invertible transforms: a complete recipe with convergence guarantees","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2012.15550","snapshot_observed_at":"2026-08-07T14:47:20.905930Z","title":"Nonreversible mcmc from conditional invertible transforms: a complete recipe with convergence guarantees","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2505.18300","last_updated":"2025-07-27T00:40:47Z","snapshot_observed_at":"2026-08-09T00:01:49.611995Z","submitted_at":"2025-05-23T18:46:10Z","title":"Beyond Self-Repellent Kernels: History-Driven Target Towards Efficient Nonlinear MCMC on General Graphs","version":3},"reference_index":2010,"source":"pdf_text","source_observed_at":"2026-08-07T14:47:20.905930Z"},"links":{"cited_paper":"/paper/2012.15550","citing_paper":"/paper/2505.18300"},"observation_digest":"sha256:4139e47edd6d29f2c1c901d18196b8a5f7f5f1be3763e1a2347e3a674c2bc20b","observation_id":"c6e64264-d29b-4b41-9dc5-47463a87cb87","resolution":{"observed_at":"2026-08-07T14:47:20.905930Z","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-07T14:47:26.564078Z","title":"Given a sequence of random variable θ1, θ2, · · ·with partial sum Sn ≜ Pn s=1 θs such that 1√n Sn n→∞ − − − − → dist","venue":null,"work_id":"e6c397a6-35ab-461d-aa4b-5546c05a8338","year":2000},"citing_paper":{"arxiv_id":"2505.18300","last_updated":"2025-07-27T00:40:47Z","snapshot_observed_at":"2026-08-09T00:01:49.611995Z","submitted_at":"2025-05-23T18:46:10Z","title":"Beyond Self-Repellent Kernels: History-Driven Target Towards Efficient Nonlinear MCMC on General Graphs","version":3},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-07T14:47:21.798897Z"},"links":{"citing_paper":"/paper/2505.18300"},"observation_digest":"sha256:0d7264bf24ed0194ed57c4dd825175461b8666f0a8327debcf28c057007eab60","observation_id":"118bb033-3d2b-4ce6-adf2-3da046b4c1c0","resolution":{"observed_at":"2026-08-07T14:47:26.670909Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T14:47:28.044137Z","title":"Decentralized learning with random walks and communication-efficient adaptive optimization","venue":null,"work_id":"de6fdee9-d775-49c5-8f1f-67616011ee41","year":2022},"citing_paper":{"arxiv_id":"2505.18300","last_updated":"2025-07-27T00:40:47Z","snapshot_observed_at":"2026-08-09T00:01:49.611995Z","submitted_at":"2025-05-23T18:46:10Z","title":"Beyond Self-Repellent Kernels: History-Driven Target Towards Efficient Nonlinear MCMC on General Graphs","version":3},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-07T14:47:21.001438Z"},"links":{"citing_paper":"/paper/2505.18300"},"observation_digest":"sha256:b0bbeeb4b9a1a06cfaeeb7a1f0d762f0edc6670d1f3421c48cb79628b793e52a","observation_id":"ed77960a-987a-49b6-894b-c6ebe57c179b","resolution":{"observed_at":"2026-08-07T14:47:28.150981Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1705.08253","last_updated":"2017-05-15T14:51:46Z","snapshot_observed_at":"2026-07-06T05:43:52.691426Z","submitted_at":"2017-05-15T14:51:46Z","title":"Lifting Markov Chains To Mix Faster: Limits and Opportunities","version":1},"cited_work":{"arxiv_id":"1705.08253","doi":null,"metadata_source":"pith","pith_arxiv_id":"1705.08253","snapshot_observed_at":"2026-08-07T14:47:23.517479Z","title":"Lifting Markov Chains To Mix Faster: Limits and Opportunities","venue":"math.OC","work_id":"3e42e9de-4417-42c3-b3f7-bf5c91c20460","year":2017},"citing_paper":{"arxiv_id":"2505.18300","last_updated":"2025-07-27T00:40:47Z","snapshot_observed_at":"2026-08-09T00:01:49.611995Z","submitted_at":"2025-05-23T18:46:10Z","title":"Beyond Self-Repellent Kernels: History-Driven Target Towards Efficient Nonlinear MCMC on General Graphs","version":3},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-07T14:47:19.441336Z"},"links":{"cited_paper":"/paper/1705.08253","citing_paper":"/paper/2505.18300"},"observation_digest":"sha256:d1ab0598e97d01cc63758a3589bd6186c0c8d864f83e0a977063a85d67f83290","observation_id":"eb4c6855-2b72-40f0-afb3-f2cce5da54db","resolution":{"observed_at":"2026-08-07T14:47:23.587362Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T14:47:27.639928Z","title":"Matrix Form of Covariance Matrix (4) The multivariate version of Br´emaud (2013, eq","venue":null,"work_id":"57d41a1b-cfe5-4ba4-bc81-1802437a3ff2","year":2013},"citing_paper":{"arxiv_id":"2505.18300","last_updated":"2025-07-27T00:40:47Z","snapshot_observed_at":"2026-08-09T00:01:49.611995Z","submitted_at":"2025-05-23T18:46:10Z","title":"Beyond Self-Repellent Kernels: History-Driven Target Towards Efficient Nonlinear MCMC on General Graphs","version":3},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-07T14:47:21.181057Z"},"links":{"citing_paper":"/paper/2505.18300"},"observation_digest":"sha256:1b48d6a0f753a031aca4aba94f0f48d422a99212ba595309a8f1dbf29aecc155","observation_id":"f399b553-03cb-4d0b-8c0c-2389563c8422","resolution":{"observed_at":"2026-08-07T14:47:27.724908Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.14925","last_updated":"2024-07-24T16:54:33Z","snapshot_observed_at":"2026-08-10T17:45:36.901435Z","submitted_at":"2024-02-22T19:15:50Z","title":"Efficient Unbiased Sparsification","version":2},"cited_work":{"arxiv_id":"2402.14925","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.14925","snapshot_observed_at":"2026-08-07T14:47:23.278746Z","title":"Efficient Unbiased Sparsification","venue":"cs.IT","work_id":"c47278ba-6e73-458b-9acb-f783bd0eca81","year":2024},"citing_paper":{"arxiv_id":"2505.18300","last_updated":"2025-07-27T00:40:47Z","snapshot_observed_at":"2026-08-09T00:01:49.611995Z","submitted_at":"2025-05-23T18:46:10Z","title":"Beyond Self-Repellent Kernels: History-Driven Target Towards Efficient Nonlinear MCMC on General Graphs","version":3},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-07T14:47:19.622145Z"},"links":{"cited_paper":"/paper/2402.14925","citing_paper":"/paper/2505.18300"},"observation_digest":"sha256:e6b8b71618fbf047e7133f8d6ca116edf7cf37aa78d3495f43db5d1e2ace3e44","observation_id":"33ea65b1-26cc-4c93-875b-3a4a39644406","resolution":{"observed_at":"2026-08-07T14:47:23.381639Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.18300","last_updated":"2025-07-27T00:40:47Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T00:01:49.611995Z","submitted_at":"2025-05-23T18:46:10Z","title":"Beyond Self-Repellent Kernels: History-Driven Target Towards Efficient Nonlinear MCMC on General Graphs"},"reference_resolution":{"displayed":30,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":12,"verified_exact":2,"verified_fuzzy":16},"total_outbound_references":30},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 30 of 30 outbound references and 1 inbound Pith citation observation for arXiv:2505.18300."}