{"as_of":"2026-08-12T23:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b206ad0fe6e8fa05efa5f35e2f9b996fb3aa9eb1fbc65118ba96df5faa6988a8","coverage":[{"denominator":77,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":77,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T16:51:31.749901Z","state":"measured"},{"denominator":77,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":77,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+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/2411.13334/citation-record","integrity":"/paper/2411.13334/integrity","json":"/paper/2411.13334/citation-record.json","paper":"/paper/2411.13334"},"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-12T16:51:32.517689Z","title":null,"venue":null,"work_id":"d4238774-565e-438a-8bd2-85806d1897a8","year":1990},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.482455Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:feb53f05bb08d2ab45ffebd6f055e98bc4fcb398c8cef83321c77009195eb398","observation_id":"2067b8cc-5bbf-4211-a684-881378ee452f","resolution":{"observed_at":"2026-08-12T16:51:32.521267Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:32.507899Z","title":"Karp, Richard J","venue":null,"work_id":"a0af8540-a021-463b-b509-31577b09fcda","year":1979},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.486724Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:4672813640f6d9b10ba55255936a8d50205d2eed5e4e1e3b1c15c64f84a064b9","observation_id":"8711ab98-086e-4f0e-9435-42f996d8bf1c","resolution":{"observed_at":"2026-08-12T16:51:32.511255Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:32.497924Z","title":"Sampling Arborescences in Parallel","venue":null,"work_id":"7d715094-851c-4986-989e-16985aa70c40","year":2021},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.490205Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:ce97c9f538adffe3cc94c5315ef2332138b083171eafd168e307633c504a2d8f","observation_id":"6ec4f131-3eea-42bc-8221-af50d7571e09","resolution":{"observed_at":"2026-08-12T16:51:32.501370Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:32.486006Z","title":"Log-concave polynomials iv: approximate exchange, tight mixing times, and near-optimal sam- pling of forests","venue":null,"work_id":"4c74ac84-87aa-45d3-8c9a-224cf8a8848f","year":2021},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.493673Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:82fb8d9bc5306e06330718980cf746eab79929b6052548dd4795f498dd296e88","observation_id":"09fc2b2a-8fda-43a6-a4e8-414c42945029","resolution":{"observed_at":"2026-08-12T16:51:32.490641Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:32.474824Z","title":"Parallel algorithms for geometric graph problems","venue":null,"work_id":"ee67e28d-0fce-4fff-a161-0638213de8aa","year":null},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.497316Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:0e41ff07996be4cb9afdff1d270784223fe83f4a2107e7d296b7ca3a18befe88","observation_id":"62443822-fa5b-48ce-80a7-b5de66fe0a44","resolution":{"observed_at":"2026-08-12T16:51:32.478580Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:32.458020Z","title":"Goemans, Aleksander Mądry, Shayan Oveis Gharan, and Amin Saberi","venue":null,"work_id":"2b79f742-833c-4973-86b2-1333a9d73268","year":2017},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.504290Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:85aa81c6a15be2227028a88a2b78d7978a5e4aff707edde02b87dc9957287a4e","observation_id":"832e71d4-7a0f-44f0-9907-4c0d5f242698","resolution":{"observed_at":"2026-08-12T16:51:32.461566Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:32.447935Z","title":"Fast personalized pagerank on mapre- duce","venue":null,"work_id":"1c852e47-5b78-46fc-8ce2-defdfdad9d08","year":2011},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.508033Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:8b42c13ea81bfc3ca03aa286a1de34154d7d5ef1aedce09d94149cb41cc6c34c","observation_id":"a03a9166-59cf-441d-a2e0-9e9888120d5f","resolution":{"observed_at":"2026-08-12T16:51:32.451462Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:32.438316Z","title":"Short random walks on graphs","venue":null,"work_id":"e7de00b5-ae60-4b09-9c58-0cfa9b1ab3d5","year":1996},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.511978Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:c7366ce325ef23227a588d5baf88aebfe62cd1007934869eb7170d556a0aefb1","observation_id":"52a75681-6def-4e2a-b54c-458d915443ad","resolution":{"observed_at":"2026-08-12T16:51:32.441516Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:32.428403Z","title":"Communication steps for parallel query processing","venue":null,"work_id":"021793ef-52d4-43e2-a2f5-7f18ebf6883e","year":2017},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.515468Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:40e977f101c24af87e769e987d59649084039ff9a51ee1c99877b013648dca9d","observation_id":"87e72667-b6fb-466c-84f9-629b0d410c40","resolution":{"observed_at":"2026-08-12T16:51:32.431628Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:32.418365Z","title":"Near-optimal approximate shortest paths and transshipment in distributed and streaming models.SIAM Journal on Computing, 50(3):815–856, 2021","venue":null,"work_id":"69774eaf-de8f-4674-b0a1-3ee616c3369d","year":2021},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.519012Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:be9276c1629c6b7a01ca5f47052fb906ba7f09a69f4b192c0e6ddbcdf2c0d852","observation_id":"1e871bbf-48dd-410e-8d0d-730f18a52c49","resolution":{"observed_at":"2026-08-12T16:51:32.421958Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:32.408940Z","title":"Randomness-efficient oblivious sampling","venue":null,"work_id":"4385d924-1726-4f23-b5f9-34dc4956e9e8","year":1994},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.522308Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:be67e36280d549e254b38de19ae13ee0ea5a558936522d34e849ccbe622697c1","observation_id":"02fc69b2-24d7-4505-8e98-79a50815b6ec","resolution":{"observed_at":"2026-08-12T16:51:32.412324Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:32.399338Z","title":"Generating random spanning trees","venue":null,"work_id":"85655255-49c9-41b6-84c8-6e7c340ebef9","year":1989},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.526022Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:dd587de7f977d1d62156517f8549c6f9d4b1c010cee56ce7dac91bba3ad4c5b4","observation_id":"d7098592-1648-40b2-ad75-bcd3d1fb52b0","resolution":{"observed_at":"2026-08-12T16:51:32.402913Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:32.389811Z","title":"Broder and Anna R","venue":null,"work_id":"8b58cf21-1a19-46d0-a17e-e003370b1fa4","year":1988},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.529468Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:d49e25a392d5cf5f311b3a088249f2e056339ba69ac560daf87b64e0713d98f3","observation_id":"1171db60-7b60-4cd4-aec3-410242e31d66","resolution":{"observed_at":"2026-08-12T16:51:32.393162Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:32.380066Z","title":"Time and space optimal massively parallel algorithm for the 2-ruling set problem","venue":null,"work_id":"ff424544-11e5-4571-9d3a-6d4950f1e126","year":2023},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.533201Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:bf8d8950edab003046153dbebb9a8717d814237fc8631e2dc921dfac5574bb4b","observation_id":"4b95e5fd-c031-439b-a491-417437b9a7d4","resolution":{"observed_at":"2026-08-12T16:51:32.383504Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:32.369499Z","title":"Improved Distributed Algorithms for Random Colorings","venue":null,"work_id":"e3ba707d-d165-413a-bfff-83b3de59a41f","year":2023},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.536996Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:3ca182b9f6c9de564542db1ee0aac9866fa981d89bf6e7485270c6569c6c97e3","observation_id":"a7051f6a-630f-4dac-8b7d-201231e1ed12","resolution":{"observed_at":"2026-08-12T16:51:32.373163Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:32.359776Z","title":"Distributed subgraph finding: Progress and challenges, 2024","venue":null,"work_id":"640afce9-168e-4ece-bc15-b0d78eb8a9ab","year":2024},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.540484Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:e2b0a8aaaf3476e603d847f5304d26b6185e06e4e2ef64eaf4d9fec1f2a376ff","observation_id":"6c3694e7-3450-41f5-9bc6-5bbbd63afa33","resolution":{"observed_at":"2026-08-12T16:51:32.362716Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:32.351513Z","title":"Korhonen, Christoph Lenzen, Ami Paz, and Jukka Suomela","venue":null,"work_id":"d657e044-3e05-472f-8570-81a43bd70a5f","year":2015},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.544074Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:7a1a99561e98172878392f6375a8eff04f2b4f1cb2a7f1f0893e611dea9c34c6","observation_id":"d73a8dce-9956-4b64-ba3b-881b25df0590","resolution":{"observed_at":"2026-08-12T16:51:32.354455Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:32.343262Z","title":null,"venue":null,"work_id":"1ff8da20-6e3a-4aa1-91fd-1d742fa0cdb8","year":1989},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.547568Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:02e9f049c69cf283cf4b1b4fc801df4ddd38b7f6ca53c42c8bc11768a3a98790","observation_id":"a6f28cdd-e15d-4ce9-82cf-592974d49df3","resolution":{"observed_at":"2026-08-12T16:51:32.346042Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:32.334722Z","title":"Colbourn, Wendy J","venue":null,"work_id":"aa324ba0-0b46-40dd-b5a6-03d8b58bef58","year":1996},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.551068Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:aa2c6f4a0621aadfcbf1233fceb408642726b75abfc06d80ca0ed76ec9bdac54","observation_id":"465279cd-e58e-4fc7-a948-d3ad32b45da4","resolution":{"observed_at":"2026-08-12T16:51:32.337829Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:32.325146Z","title":"Simple, deterministic, constant-round coloring in the congested clique","venue":null,"work_id":"9af8e6eb-10f9-4e39-bee6-f3c16099c50a","year":2020},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.554817Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:26b7b1873625a7562523f9593b860abae53fb6cc7b6c9d506b307322e39abbac","observation_id":"0a6c0986-7391-46c9-a91f-9cffbf7aaab8","resolution":{"observed_at":"2026-08-12T16:51:32.328905Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:32.315832Z","title":"Distributed random walks.J","venue":null,"work_id":"42f9ea83-399e-4b97-818f-200378535f58","year":2013},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.558295Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:30d09f3b56a31226308549c4485657a00b75cb6899283405cc474205822e6cbc","observation_id":"2e082830-2207-4759-9dfc-b85d8a0543ef","resolution":{"observed_at":"2026-08-12T16:51:32.319016Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:32.306861Z","title":"Tri, Tri Again","venue":null,"work_id":"8ff88cf8-4245-4a27-81b1-e5ba27b2ef0f","year":2012},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.561859Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:3a8f42c5b459d7ddf4c3c2c650a6f5a4b633e9160981b2fda9899608247440b3","observation_id":"02b08b15-2a27-430c-b89e-354097223ccd","resolution":{"observed_at":"2026-08-12T16:51:32.310061Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:32.297404Z","title":"Random spanning trees for expanders, sparsifiers, and virtual network security.Computer Communications, 212:21–34, 2023","venue":null,"work_id":"52e063ed-5f48-46e2-8f84-c4281981bde5","year":2023},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.565198Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:cc383aa1697eca02678bbc52f0eaa2605e4b0c79e8adfc71ef30394f25d3270f","observation_id":"39e2fe35-5689-4de5-bf13-a28b9d415d8b","resolution":{"observed_at":"2026-08-12T16:51:32.300615Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:32.288240Z","title":"Exponentially faster shortest paths in the congested clique.J","venue":null,"work_id":"9c2490cb-8843-43e1-9035-dbaf864c0ee9","year":2022},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.568625Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:1ed92a5feb6caa1114fdf9cebc9ce5f45eb794fe6fac1833b05b0af1443bc40d","observation_id":"aea2a4c6-e28a-4fdf-97ee-d6791719f3c0","resolution":{"observed_at":"2026-08-12T16:51:32.291615Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:32.279276Z","title":"On the power of the congested clique model","venue":null,"work_id":"c375c78c-a3f0-484e-9aac-76d9c212c5d0","year":2014},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.571646Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:356c68067e6c747f715fb901881a2115ff98dcf7fbcf2bc2e9f9239811f72b57","observation_id":"f83ddf83-0899-4bbf-ab68-74f5e4667d80","resolution":{"observed_at":"2026-08-12T16:51:32.282566Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:32.270378Z","title":null,"venue":null,"work_id":"6caf4e36-989b-4971-aa21-7e926d9b639d","year":2020},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.574699Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:5b6df2f5c22ec95a5245b90ce58ac7e6a901280c5cd179d4b516fedd4e5e4caa","observation_id":"73f3db33-d114-44a0-b46a-e997a3ec5f8d","resolution":{"observed_at":"2026-08-12T16:51:32.273465Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:32.261336Z","title":"Hayes, and Yitong Yin","venue":null,"work_id":"50e00080-17f1-4529-991a-299897d4ba07","year":2018},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.578056Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:73d56c3cb2a996ddbe06012a15be9ce6f0566991b64ea36ef6d63bc0660096de","observation_id":"6f78cb39-d1bc-40c0-9467-830c388976a0","resolution":{"observed_at":"2026-08-12T16:51:32.264607Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:32.252233Z","title":"Hayes, and Yitong Yin","venue":null,"work_id":"c9338c50-6e31-4be6-b598-a48adc8766b5","year":2021},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.581578Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:e80af627799503075482a06c6cb654367c3e6e802f00df9bb3e2a773496f6be6","observation_id":"79c6ee99-0c2b-46b9-9923-17373705f354","resolution":{"observed_at":"2026-08-12T16:51:32.255639Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:32.244079Z","title":"What can be sampled locally? InProceedings of the ACM Symposium on Principles of Distributed Computing, PODC ’17, page 121–130, New York, NY, USA, 2017","venue":null,"work_id":"271dc146-67b1-44ce-80a0-10c4587dedbf","year":2017},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.584764Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:9f0bc27d29f4e44aaf715ed472c9e8028bfd76c55aa10011398f8e97242060a9","observation_id":"f6ce09c4-e7bf-4e5a-9522-dac6cb8ee857","resolution":{"observed_at":"2026-08-12T16:51:32.247160Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:32.235764Z","title":"On local distributed sampling and counting","venue":null,"work_id":"b4090409-709b-4a0b-8532-d55df9ceabac","year":2018},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.588303Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:e6dfc20f84e00dc24539c61df2f4c41972a6ccd2a59d78e4795fe9bd3c1a63d8","observation_id":"6aa0ec1c-8340-4027-85ab-9bce01aa4bfa","resolution":{"observed_at":"2026-08-12T16:51:32.238575Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:32.226922Z","title":"A simple parallel and distributed sampling technique: Local glauber dynamics","venue":null,"work_id":"f8027797-9247-4850-be3d-2aa20453340a","year":2018},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.591348Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:1ce27857a465a5c006f8380ae5a2ef303ae9c703ea00a7188f92064d68aa43c7","observation_id":"2f438abd-6943-456e-b180-dc2f5caff79c","resolution":{"observed_at":"2026-08-12T16:51:32.230061Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:32.217944Z","title":"The laplacian paradigm in the broadcast congested clique","venue":null,"work_id":"02509448-b625-42d9-a1a5-aa6fdbe45b30","year":2022},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.594509Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:b1217423e00acca156a9048a7300c5761d2a3ba3c62fdb86a2c3d95f37d0f50d","observation_id":"477870e7-67bf-4fed-9f53-5af8c6923302","resolution":{"observed_at":"2026-08-12T16:51:32.221078Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:32.208986Z","title":"Harvey, and Debmalya Panigrahi","venue":null,"work_id":"606531d5-1b33-4c8d-9300-21e2e756d237","year":2011},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.598105Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:beb3725aacca391bb54efcdd6423a510c8b6e127989283c9f7d91436da6bb9e9","observation_id":"8bc7e6d5-63a5-464b-bc8d-cc794612a5a0","resolution":{"observed_at":"2026-08-12T16:51:32.212311Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:32.199529Z","title":"Distributed MIS via all-to-all communication","venue":null,"work_id":"ede29482-f0a8-4a7e-85c1-6c65286810e0","year":2017},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.601887Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:f534d570edd7472804d723cf4c4419b71aa2de416dbdfc2a179f628b4e338ed7","observation_id":"cd57737f-895f-4ab0-9164-3bc91a11a9f3","resolution":{"observed_at":"2026-08-12T16:51:32.202906Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:32.189960Z","title":"Improved massively parallel computation algorithms for mis, matching, and vertex cover","venue":null,"work_id":"9ea279db-9ae7-4921-938c-dbb7477d803e","year":2018},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.605546Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:0d752ffc1b0c5b7dae99cf33cf56fc7a7a3c19b19ef992ecd3884b1c0c33758d","observation_id":"f6a6a7c5-5672-4338-9dd4-3d0f247ee24f","resolution":{"observed_at":"2026-08-12T16:51:32.193481Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:32.180677Z","title":"Congested clique algorithms for the minimum cut problem","venue":null,"work_id":"f7f404fd-80f5-4256-867c-dd41d76ec810","year":2018},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.609378Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:42f69b5d36da18a1a39e5758bc94f28dda30c4a8f615b66024ca3d66950e1d2e","observation_id":"62919e89-3b4c-48fc-b282-130ff634492b","resolution":{"observed_at":"2026-08-12T16:51:32.184138Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:32.171320Z","title":"MST in Log-Star Rounds of Congested Clique","venue":null,"work_id":"3f5ec726-0c85-40d4-9263-fdc4988bbbc2","year":2016},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.613078Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:65a6e260568116afac8b1ed876a01c4639b4b7293846f012ea49a2146c364969","observation_id":"dd4c9241-62be-438f-8956-d84f4d576757","resolution":{"observed_at":"2026-08-12T16:51:32.174781Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:32.161806Z","title":"A randomized rounding approach to the traveling salesman problem","venue":null,"work_id":"b7cb6c2e-aafc-49ca-9d9a-80093148b795","year":2011},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.616854Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:d4196762509593f88894f712073746f2172c352d96e756e730a3cedb8056b3d3","observation_id":"6fdf2cce-70e3-497d-bb9c-ba2bead78654","resolution":{"observed_at":"2026-08-12T16:51:32.165210Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:32.152287Z","title":"Random minimum spanning trees, Oct 2018","venue":null,"work_id":"55949e3a-5f8b-447b-8e7b-4a569c938e42","year":2018},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.620641Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:cc38788f699d1ec689a62ec84a3ef414ccada39aaf642e5b31014049b2999c6e","observation_id":"5ce6dea6-7cfa-4304-9c81-a9799c70646a","resolution":{"observed_at":"2026-08-12T16:51:32.155233Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:32.144274Z","title":"Goodrich, Nodari Sitchinava, and Qin Zhang","venue":null,"work_id":"f00676b7-8482-4d76-8a6f-327ea578c7ee","year":2011},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.624216Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:628378b96e1a15547d6852c90f8d4cc190c25db30dc30d78d33c2435591efba1","observation_id":"912bf94c-5d9f-406d-aa38-8e696fada0df","resolution":{"observed_at":"2026-08-12T16:51:32.146945Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:32.135619Z","title":"Expanders via random spanning trees","venue":null,"work_id":"05229aae-1afb-4a3b-9ae6-c04e652fd9f3","year":2009},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.627873Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:6f98b7a9fc1dfe6960344d5f345c609f6b6a9b46cc3088106245cf8ae0d1cb91","observation_id":"9b93e7d4-42d0-4d77-8360-bce7d74ab14e","resolution":{"observed_at":"2026-08-12T16:51:32.138774Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:32.126439Z","title":"Uniform sampling through the lovász local lemma","venue":null,"work_id":"d0c794c0-5345-4ffd-a7ac-729affad48ca","year":2019},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.631388Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:df8476bcf30057d881688f43847f5c522d1481fce687ccbdd41be9ceedbfe55f","observation_id":"7f434112-949d-4acf-b3c9-74fe2f69430c","resolution":{"observed_at":"2026-08-12T16:51:32.129748Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:32.117347Z","title":null,"venue":null,"work_id":"94eef35e-f5b9-4bfe-83f9-b848e7298792","year":2016},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.635071Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:37dc7bd5413e13b08dfb96abf13bae40c7fa191240e8d693c58ae3ece36cd3d7","observation_id":"238dbb5e-2971-4f41-b726-854c1c4f0836","resolution":{"observed_at":"2026-08-12T16:51:32.120614Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:32.107215Z","title":"Hegeman, Gopal Pandurangan, Sriram V","venue":null,"work_id":"1d987db0-e22d-4f08-a268-468461d96405","year":2015},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.638903Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:b4c43d2623d22d7537747c83bc0076dc49ddde03bfe4ac8a3afeb694c653e687","observation_id":"52fae08c-71f2-481c-96b8-3be1e8830050","resolution":{"observed_at":"2026-08-12T16:51:32.111017Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:32.097511Z","title":"Hegeman, Sriram V","venue":null,"work_id":"3a34be5e-895a-4eba-8771-9fc4a7a826b2","year":2014},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.642885Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:b0b8a6a054534a92668fe433b553bca8fd29f66740594ed246d806734e3b9de9","observation_id":"ac157dfe-d20a-4fb9-8b23-6687ef1a1a91","resolution":{"observed_at":"2026-08-12T16:51:32.100691Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:32.087493Z","title":"A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.J","venue":null,"work_id":"0361e3b2-c9d6-47e8-a3cd-4cfe7d2b3dd5","year":2004},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.646572Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:bbba451c25a6630715b756e011c2e24422f061295bae45538993ada6b826db4d","observation_id":"5cc18eaf-0284-49e8-b84d-371837c43647","resolution":{"observed_at":"2026-08-12T16:51:32.091235Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:32.077361Z","title":"Valiant, and Vijay V","venue":null,"work_id":"30673128-c12a-4aff-838f-c6454a9c71aa","year":1986},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.650275Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:578e743d798d24435fef8d36677f3c7efb347d3bff24138c66a2947bf13bc3be","observation_id":"085a8b1a-266d-40f8-aa94-4ac76cd7edca","resolution":{"observed_at":"2026-08-12T16:51:32.080792Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:32.067853Z","title":"Mst in o(1) rounds of congested clique","venue":null,"work_id":"7939f4e3-8bd9-40a7-b85a-9c66284ec49f","year":2018},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.653919Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:1cf4846128522e323edbf9bcf63b0f0a94f6d39f0c8659150d9db545fd1d697a","observation_id":"734cc0fa-965c-4f76-a279-e2ed8152e758","resolution":{"observed_at":"2026-08-12T16:51:32.071071Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:32.057901Z","title":"Karlin, Nathan Klein, and Shayan Oveis Gharan","venue":null,"work_id":"d160da67-df2f-4683-b806-808e59fc09e4","year":2021},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.657445Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:f62fee961a043f84a891747bd6329495eeaa89a4d8ae7cb01f1f1758a1405db6","observation_id":"a27a4875-1132-48e3-aafc-284d3939c436","resolution":{"observed_at":"2026-08-12T16:51:32.061347Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:32.048132Z","title":"Karlin, Nathan Klein, Shayan Oveis Gharan, and Xinzhi Zhang","venue":null,"work_id":"013f6567-461a-464d-96a2-cea9b8954e00","year":2022},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.661126Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:58043a8418f4fdf32b36687ebb09a66315876974723a999628ca2c8663a62c61","observation_id":"a7484f95-a3cd-4e63-a16e-d5534d50d5c1","resolution":{"observed_at":"2026-08-12T16:51:32.051535Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:32.038256Z","title":"A model of computation for mapre- duce","venue":null,"work_id":"2c73372d-b3f1-4391-9157-e2b21ff91c3d","year":2010},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.664680Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:51fec69e3b4d5df4e69717795652fa429a02f100550dd2f83bc9832f39269c8f","observation_id":"ebd11990-ef79-4f4f-9849-eb76719a083c","resolution":{"observed_at":"2026-08-12T16:51:32.041848Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:32.029061Z","title":"Kelner and Aleksander Madry","venue":null,"work_id":"dc20a5fa-ac62-4251-8548-2bdeb576d95b","year":2009},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.668672Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:ce8850fe5bf4862307826f430db11aff00866c9f27bd01f6d0de4e5e51daacc1","observation_id":"81ab77d0-f88d-4f23-a226-46f405f49148","resolution":{"observed_at":"2026-08-12T16:51:32.032275Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:32.020357Z","title":"Kirby, Roger B","venue":null,"work_id":"6478ddb4-2e2a-49e6-a251-8f45211f427a","year":2016},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.672233Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:cc3157a506d70424b032515901272087dd19333c19fde29c6efd7ac10fa20a55","observation_id":"180600e4-fcc3-476e-b3d6-115c470d9234","resolution":{"observed_at":"2026-08-12T16:51:32.023517Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:32.010870Z","title":"Distributed Computation of Large-scale Graph Problems","venue":null,"work_id":"ba566e0b-502e-4afd-920c-2fa5dee08305","year":2015},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.675880Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:fab6f0dd742eb9e007fe8669c0c537fc84a7d8e3ac7d4089e228c82ded641fc5","observation_id":"0e2c822b-0c82-40e4-8688-a40f81ec7e98","resolution":{"observed_at":"2026-08-12T16:51:32.014258Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:32.001093Z","title":"Approximate Gaussian Elimination","venue":null,"work_id":"1e530315-33e6-489b-9cde-d2e926efe5bb","year":2017},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.679486Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:3913b534fc2744c12c0b0d5a2138c2f5838ecac1d9beed14080aa27b036a3d76","observation_id":"49eb0361-6534-4a55-8dba-072c53ce8f9e","resolution":{"observed_at":"2026-08-12T16:51:32.004320Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:31.991665Z","title":"Optimal deterministic routing and sorting on the congested clique","venue":null,"work_id":"4f2040cd-ad7a-4359-9e9b-05f6920e8a7f","year":2013},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.683043Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:6173895707eaa6aac296ac92992b26928794f6469b2829662f8b3a2572061d62","observation_id":"0d7379ea-d5f3-41e0-b299-3126b9616157","resolution":{"observed_at":"2026-08-12T16:51:31.995004Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:31.982277Z","title":"Walking randomly, massively, and efficiently","venue":null,"work_id":"36f1b24a-0b3d-45d5-936b-904d0a2f9d51","year":2020},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.686601Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:c08faa636ad4921599e97814a8d979bb0200be5ce9484502172ba2714c065279","observation_id":"363cbafa-4aa7-4a96-b4d8-adc5e02bbe1b","resolution":{"observed_at":"2026-08-12T16:51:31.985573Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:31.972997Z","title":"Mst construction in o(log log n) communication rounds","venue":null,"work_id":"6ad81a82-79c3-4c1c-b9a3-04d38acd38ba","year":2003},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.690097Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:6621e70bb12862eb54108bc3f92b153c0999ec45b921dbee5ddd5300023395f1","observation_id":"a0d24579-b442-4713-83c1-f9b0c4ac58c7","resolution":{"observed_at":"2026-08-12T16:51:31.976145Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:31.963820Z","title":"Random walks on graphs: A survey","venue":null,"work_id":"db21ddbd-3b76-42b1-9145-36357ec1129d","year":1993},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.693308Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:38593301af72052469a5eab4f73b2e5a1a2848092b45445cd67e11cd08a80501","observation_id":"b25a278c-438b-4205-b978-652e1919897c","resolution":{"observed_at":"2026-08-12T16:51:31.967177Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:31.954546Z","title":"Distributed pagerank computation: an improved theoretical study","venue":null,"work_id":"e4fb806c-6636-470d-9266-04c1b06be52f","year":2019},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.696615Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:da95cbd19a5d0b422978fc15eb45fe34880d8afbd0d3d7ea56dc067ae740c83b","observation_id":"94772428-bdc7-4a49-9fec-92bc5fca2ee8","resolution":{"observed_at":"2026-08-12T16:51:31.957926Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:31.944817Z","title":"Distributed pagerank computation with improved round complexities","venue":null,"work_id":"d2176414-6d68-4983-b9ad-103b5e7ee433","year":2022},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.699602Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:63716f747e8a10a6ed0cb59fbf053b1103349aab4573418b4df145eccb0fd514","observation_id":"850c5d3f-68bc-422d-b49b-56fed2dce82c","resolution":{"observed_at":"2026-08-12T16:51:31.948277Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:31.934915Z","title":"Sharp Bounds on Random Walk Eigenvalues via Spectral Embedding","venue":null,"work_id":"f351c1f8-02d2-4a23-897c-cbe27733284e","year":2018},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.702724Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:0a98e0f04038083c2cb5888870ce14a7cfabb9caf60f43adcaced789dcf7eb4d","observation_id":"f57b9f5a-a698-4eb8-b40c-073e47edae01","resolution":{"observed_at":"2026-08-12T16:51:31.938615Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:31.926341Z","title":"From graphs to matrices, and back: new techniques for graph algorithms","venue":null,"work_id":"7580c559-9512-4f9d-8c04-c652bfc87751","year":2011},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.705782Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:f11d32542f17870d81d2d4212cb4ba8ec61e4d5a1fccfb9edb08f6a436ddf37d","observation_id":"4c50f4ec-a1d5-4d74-9375-bf278341df36","resolution":{"observed_at":"2026-08-12T16:51:31.929139Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:31.917370Z","title":"Fast generation of random span- ning trees and the effective resistance metric","venue":null,"work_id":"370fd951-03e8-4b16-8b02-c1006b968455","year":2019},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.708823Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:285b1cad14ad34a9eae745897ca114a4a18cf4719656a700b3dc46d048e01747","observation_id":"acdde8b9-ad79-4856-9de2-ceac16b44c6e","resolution":{"observed_at":"2026-08-12T16:51:31.920722Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:31.906813Z","title":"A deterministic algorithm for the mst problem in constant rounds of con- gested clique","venue":null,"work_id":"f8d60b65-b751-4460-9bd0-537d0be9d020","year":2021},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.711747Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:7fbdcbe64c0981246bf9f97a5af708af81eb46b5dad0ce8e82aa56631c9d8c55","observation_id":"89c45fa5-d852-424d-9285-0527e9035384","resolution":{"observed_at":"2026-08-12T16:51:31.910393Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:31.895580Z","title":"Congested clique algorithms for graph spanners","venue":null,"work_id":"e0946e09-27ee-475a-896c-fc1eb162fd9f","year":2018},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.714600Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:e0accbe44dd07962ea3feb8396d0a9356b6f2012a2c034530bb49ffe103f133b","observation_id":"f707863c-a9a5-480b-a989-a3ae12b7f94b","resolution":{"observed_at":"2026-08-12T16:51:31.899351Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:31.884063Z","title":"Pemmaraju and Vivek B","venue":null,"work_id":"d1c2d3a2-5c96-473a-bbb0-bdade103f9c5","year":2016},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.718078Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:5b14674eb7393a89d0c88f5d608436d9a13873de1e47b573d3fd11795cee1200","observation_id":"37d10693-060b-4666-be55-e789a91925f7","resolution":{"observed_at":"2026-08-12T16:51:31.887920Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:31.871865Z","title":"Pemmaraju and Joshua Z","venue":null,"work_id":"3738a90c-d81e-4df7-add4-a3d9724cf0a7","year":2023},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.721806Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:4e31b5f3f9ae574e69e29b14fd9f0df3c025bd1f9bb2b799ed6caa4d87ee9ccc","observation_id":"a30ceb4f-74a8-452d-a617-45b2fcf1b1ac","resolution":{"observed_at":"2026-08-12T16:51:31.876151Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:31.860272Z","title":"An almost-linear time algorithm for uniform random spanning tree generation","venue":null,"work_id":"48530259-cfed-48ad-bacc-f76794f6b832","year":2018},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.725184Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:b48a0b6683bbf987ace55ad105abcbfa104a9daddb05bb38f81afe9a25d21291","observation_id":"bf16fb4a-4fe1-4901-bc25-56fa56142daa","resolution":{"observed_at":"2026-08-12T16:51:31.864300Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:31.849738Z","title":"Independent sets versus perfect matchings.Theoretical Computer Science, 145(1):381–390, 1995","venue":null,"work_id":"df7641ac-9669-43d0-a9d8-b255a828108b","year":1995},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.728742Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:68a3d75fe5d101bc91813cbf41fd00f4ceacc4d6c676e2dd7017d7d4a1ffc3d8","observation_id":"bb242825-afa0-4f46-879c-9b5b5ea420a2","resolution":{"observed_at":"2026-08-12T16:51:31.853232Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:31.838893Z","title":"Pseudorandomness.Foundations and Trends® in Theoretical Computer Sci- ence, 7(1–3):1–336, 2012","venue":null,"work_id":"084dbefa-33b3-4a7d-a818-c2f35f99f0e9","year":2012},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.732193Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:63e4dfc35b92f8f98ccd4d8dc6687c32d0fa9e87a0ced0762568ee413ebb0880","observation_id":"0fd8e053-e69e-43b4-9d2f-f85465d1c12b","resolution":{"observed_at":"2026-08-12T16:51:31.842560Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:31.827687Z","title":"New bounds for ma- trix multiplication: from alpha to omega","venue":null,"work_id":"a36e2bf2-c7bb-45b9-b813-997c3adfb0c8","year":2023},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.735418Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:33f88d350dd883d2273ddc59829cd30d288eecbccd398b2f42bd1a5b9481c5d9","observation_id":"e358c11e-a2bc-4901-ae2e-71dd4b07f9fe","resolution":{"observed_at":"2026-08-12T16:51:31.831189Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:31.816583Z","title":"Generating random spanning trees more quickly than the cover time","venue":null,"work_id":"35cdd444-1919-4db2-b068-7cf34024678d","year":1996},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.738807Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:f1940cca93dc82b48606ea769f529614617f420bf390c8187c9b8f903f846219","observation_id":"57211856-1a5b-4b71-8cc7-2c6c26fc9e3d","resolution":{"observed_at":"2026-08-12T16:51:31.820968Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:31.805642Z","title":"This results in an arbitrary spanning tree being returned","venue":null,"work_id":"848b5910-d302-4ffc-9e27-a6f694109356","year":null},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.742230Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:25e07865ed88364dae1404df58bee3b81cb786bfb2e63bfae5183b4c45c4470b","observation_id":"af1be608-9fd5-496a-8ccb-ba01b2edd598","resolution":{"observed_at":"2026-08-12T16:51:31.809235Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:31.793594Z","title":null,"venue":null,"work_id":"d07a0c5b-89bd-4457-bcad-bac3d0ae852b","year":null},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.745851Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:0c8639e09b0af8b242df21967f23360396e1516ab5289597d3223b1a49cc7bce","observation_id":"bca3ac6a-17e2-444d-a9f3-ba77ff2c2c44","resolution":{"observed_at":"2026-08-12T16:51:31.797444Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:51:31.778647Z","title":"5.1 Solving Problem 1 The clear solution to the first problem is to convert the algorithm from a Monte Carlo to Las Vegas approach","venue":null,"work_id":"c641f24e-2c2e-453e-bf9a-de7829a1c419","year":null},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.749901Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:f90280153083abe2dacb8be48d32c68b5e35b635b1cec0171fd1de22916652ef","observation_id":"b8c47c86-5330-46e7-81c0-cc753f64603e","resolution":{"observed_at":"2026-08-12T16:51:31.784659Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T16:51:31.500286Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique","version":2},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-12T16:51:31.500286Z"},"links":{"citing_paper":"/paper/2411.13334"},"observation_digest":"sha256:43d47318889c34c105daea89ef58909488799d67a9e78dfd32e0eeaeff55496e","observation_id":"7716daeb-fe4e-4a21-907e-36838d84959b","resolution":{"observed_at":"2026-08-12T16:51:31.500286Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2411.13334","last_updated":"2025-05-09T05:38:11Z","latest_version":2,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-12T16:30:16.777479Z","submitted_at":"2024-11-20T14:07:23Z","title":"Sublinear-Time Sampling of Spanning Trees in the Congested Clique"},"reference_resolution":{"displayed":77,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":0,"verified_fuzzy":71},"total_outbound_references":77},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 77 of 77 outbound references and 0 inbound Pith citation observations for arXiv:2411.13334."}