{"as_of":"2026-08-22T20:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b9e600875e4ff17af1141bbb180f365ae8c49b758bd538a08705994a63490a4c","coverage":[{"denominator":29,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":29,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T10:52:50.416822Z","state":"measured"},{"denominator":29,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":29,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+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/2506.04524/citation-record","integrity":"/paper/2506.04524/integrity","json":"/paper/2506.04524/citation-record.json","paper":"/paper/2506.04524"},"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-07T10:52:50.703988Z","title":"Coresets meet edcs: algorithms for matching and vertex cover on massive graphs","venue":null,"work_id":"4e3de7cf-1bd4-4157-a09b-c1ba2efa6afc","year":2019},"citing_paper":{"arxiv_id":"2506.04524","last_updated":"2025-06-05T00:13:25Z","snapshot_observed_at":"2026-08-17T17:58:07.967581Z","submitted_at":"2025-06-05T00:13:25Z","title":"Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:50.333130Z"},"links":{"citing_paper":"/paper/2506.04524"},"observation_digest":"sha256:ace37358e20bce528aeaaf45b8913ab31961722c509a91e9809078e90103f1b6","observation_id":"3a713d28-08a3-44c6-9d86-2662f51fd33c","resolution":{"observed_at":"2026-08-07T10:52:50.707025Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T10:52:50.695242Z","title":"Distributed load balancing: A new framework and improved guarantees","venue":null,"work_id":"9be3118b-5238-4bce-94d7-efcc58738b26","year":2021},"citing_paper":{"arxiv_id":"2506.04524","last_updated":"2025-06-05T00:13:25Z","snapshot_observed_at":"2026-08-17T17:58:07.967581Z","submitted_at":"2025-06-05T00:13:25Z","title":"Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:50.336801Z"},"links":{"citing_paper":"/paper/2506.04524"},"observation_digest":"sha256:509bb05cf62f2d5912023bb84eb32a22d30b0c085d42ce78b1d092ebca6d2a74","observation_id":"b96465d0-bd55-4304-948c-b6b82a7b3076","resolution":{"observed_at":"2026-08-07T10:52:50.698171Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T10:52:50.686576Z","title":"Online ad allocation in bounded-degree graphs","venue":null,"work_id":"e74df37d-6b7e-4cf6-8af7-4a44f2bb520b","year":2022},"citing_paper":{"arxiv_id":"2506.04524","last_updated":"2025-06-05T00:13:25Z","snapshot_observed_at":"2026-08-17T17:58:07.967581Z","submitted_at":"2025-06-05T00:13:25Z","title":"Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:50.340106Z"},"links":{"citing_paper":"/paper/2506.04524"},"observation_digest":"sha256:1b49358d9c101e35233ac10d2802b2679e48ba341e1620a9208e918422e963c6","observation_id":"e0c97053-57a3-4581-a61f-3fdcf5a70db0","resolution":{"observed_at":"2026-08-07T10:52:50.689428Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T10:52:50.678032Z","title":"Mirrokni","venue":null,"work_id":"1bde2b28-927a-4752-853b-016227ca24e9","year":2018},"citing_paper":{"arxiv_id":"2506.04524","last_updated":"2025-06-05T00:13:25Z","snapshot_observed_at":"2026-08-17T17:58:07.967581Z","submitted_at":"2025-06-05T00:13:25Z","title":"Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:50.343284Z"},"links":{"citing_paper":"/paper/2506.04524"},"observation_digest":"sha256:f77e5937625b3828fc7ad65c877946eb62d670d8afc42fe480a490560393083a","observation_id":"e15f2855-5180-4fce-b275-ad18d2d170d0","resolution":{"observed_at":"2026-08-07T10:52:50.681099Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T10:52:50.669210Z","title":"Karp, and Jara Uitto","venue":null,"work_id":"773394c7-2ab8-400c-9f8a-f1bf88fb3339","year":2019},"citing_paper":{"arxiv_id":"2506.04524","last_updated":"2025-06-05T00:13:25Z","snapshot_observed_at":"2026-08-17T17:58:07.967581Z","submitted_at":"2025-06-05T00:13:25Z","title":"Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:50.346770Z"},"links":{"citing_paper":"/paper/2506.04524"},"observation_digest":"sha256:2000a7e53f04c5cd327301c50b4400f0f7e83450b775ab6dd398caf2cad864e9","observation_id":"4843e840-4743-4b3a-9abf-536ccc9d5ee4","resolution":{"observed_at":"2026-08-07T10:52:50.672384Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T10:52:50.660480Z","title":"Exponentially faster massively parallel maximal matching","venue":null,"work_id":"4264ed0f-d438-4157-bad7-b002feb4f312","year":2019},"citing_paper":{"arxiv_id":"2506.04524","last_updated":"2025-06-05T00:13:25Z","snapshot_observed_at":"2026-08-17T17:58:07.967581Z","submitted_at":"2025-06-05T00:13:25Z","title":"Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:50.350146Z"},"links":{"citing_paper":"/paper/2506.04524"},"observation_digest":"sha256:6c96ec8a315a06ac67cab86589a66f472c243b7545bcabccc0fb29891aea3798","observation_id":"b5de92fa-2973-4543-94e7-74e2e2522176","resolution":{"observed_at":"2026-08-07T10:52:50.663379Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T10:52:50.652341Z","title":"Balseiro, Haihao Lu, and Vahab Mirrokni","venue":null,"work_id":"9e1ace6f-4bd2-4dca-a4e2-fbbd7e6e0844","year":2023},"citing_paper":{"arxiv_id":"2506.04524","last_updated":"2025-06-05T00:13:25Z","snapshot_observed_at":"2026-08-17T17:58:07.967581Z","submitted_at":"2025-06-05T00:13:25Z","title":"Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:50.353897Z"},"links":{"citing_paper":"/paper/2506.04524"},"observation_digest":"sha256:c03b2fb6f949e910a2705c29b8cc027883179d87772a9daf972618c14619f204","observation_id":"1ba20167-ff41-4e43-b957-7f53106e6040","resolution":{"observed_at":"2026-08-07T10:52:50.655073Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T10:52:50.643391Z","title":"Component stability in low-space massively parallel computation","venue":null,"work_id":"051bd388-cd5c-4e8c-a869-21456099223d","year":2021},"citing_paper":{"arxiv_id":"2506.04524","last_updated":"2025-06-05T00:13:25Z","snapshot_observed_at":"2026-08-17T17:58:07.967581Z","submitted_at":"2025-06-05T00:13:25Z","title":"Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:50.356911Z"},"links":{"citing_paper":"/paper/2506.04524"},"observation_digest":"sha256:50bed4b82d9c0b36c84004af140cb97cc0d07cabc69916fa6ab468149f0c1e56","observation_id":"3eeb4e95-f9f0-4cb3-8b25-4a4a4e755364","resolution":{"observed_at":"2026-08-07T10:52:50.646555Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T10:52:50.634998Z","title":"Round compression for parallel matching algorithms","venue":null,"work_id":"ce878e02-6491-4f34-8769-226179b3f858","year":2018},"citing_paper":{"arxiv_id":"2506.04524","last_updated":"2025-06-05T00:13:25Z","snapshot_observed_at":"2026-08-17T17:58:07.967581Z","submitted_at":"2025-06-05T00:13:25Z","title":"Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:50.359846Z"},"links":{"citing_paper":"/paper/2506.04524"},"observation_digest":"sha256:c63efc73dc29d6fee3cac5d01eb5996d802f6efd2f9eaed2bcb581ee2b2398a5","observation_id":"644fa4b4-8bf9-492a-90a0-76e3839c32b7","resolution":{"observed_at":"2026-08-07T10:52:50.637839Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T10:52:50.626537Z","title":"Parallel set cover and hypergraph matching via uniform random sampling","venue":null,"work_id":"ac1e7b3d-5036-4791-8b5c-46a7d0f53d3f","year":2024},"citing_paper":{"arxiv_id":"2506.04524","last_updated":"2025-06-05T00:13:25Z","snapshot_observed_at":"2026-08-17T17:58:07.967581Z","submitted_at":"2025-06-05T00:13:25Z","title":"Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:50.362596Z"},"links":{"citing_paper":"/paper/2506.04524"},"observation_digest":"sha256:fc143024aeffba129ea1ba75de61a6e8a502c0ee00ea71570ef778f57e955942","observation_id":"a5f7013c-4b1a-42d9-b9e4-524da8a0b341","resolution":{"observed_at":"2026-08-07T10:52:50.629479Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T10:52:50.617810Z","title":"Mapreduce: simplified data processing on large clusters","venue":null,"work_id":"61d9bbc2-7a4a-4827-829d-77cbd8981ced","year":2008},"citing_paper":{"arxiv_id":"2506.04524","last_updated":"2025-06-05T00:13:25Z","snapshot_observed_at":"2026-08-17T17:58:07.967581Z","submitted_at":"2025-06-05T00:13:25Z","title":"Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:50.365580Z"},"links":{"citing_paper":"/paper/2506.04524"},"observation_digest":"sha256:da0faf3cbd4072450e4d62b91dc1e7297260adaf3551f8e2744a796009762013","observation_id":"e6e596e1-c2d9-4b01-9acd-f1e3c24cbbc7","resolution":{"observed_at":"2026-08-07T10:52:50.620707Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T10:52:50.608651Z","title":"Devanur, Kamal Jain, Balasubramanian Sivan, and Christopher A","venue":null,"work_id":"4d9a143f-8865-4995-818d-e6ac274d9aae","year":2019},"citing_paper":{"arxiv_id":"2506.04524","last_updated":"2025-06-05T00:13:25Z","snapshot_observed_at":"2026-08-17T17:58:07.967581Z","submitted_at":"2025-06-05T00:13:25Z","title":"Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:50.368519Z"},"links":{"citing_paper":"/paper/2506.04524"},"observation_digest":"sha256:fa7d46ea3d6b707c2fdce1e08312276710e89a6cf1e6ebd301ede9bf7e55cf82","observation_id":"305e2234-7cf3-407a-aa88-e6fdaff38cd6","resolution":{"observed_at":"2026-08-07T10:52:50.611842Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T10:52:50.599491Z","title":"Dickerson, Karthik A","venue":null,"work_id":"3c345187-94e2-4a4b-9fb6-0b5196403ac4","year":2021},"citing_paper":{"arxiv_id":"2506.04524","last_updated":"2025-06-05T00:13:25Z","snapshot_observed_at":"2026-08-17T17:58:07.967581Z","submitted_at":"2025-06-05T00:13:25Z","title":"Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:50.371446Z"},"links":{"citing_paper":"/paper/2506.04524"},"observation_digest":"sha256:de9d6812cb3770db55a05d44668f0aa331cf2d9b48f4bd1eac82f7daa73b0ce3","observation_id":"69e4e3d8-c825-4185-a648-ea67dfb2346c","resolution":{"observed_at":"2026-08-07T10:52:50.602738Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T10:52:50.590809Z","title":"Online ad assignment with free disposal","venue":null,"work_id":"72f03040-7722-4125-9a7f-a7ac1e9709d1","year":2009},"citing_paper":{"arxiv_id":"2506.04524","last_updated":"2025-06-05T00:13:25Z","snapshot_observed_at":"2026-08-17T17:58:07.967581Z","submitted_at":"2025-06-05T00:13:25Z","title":"Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:50.374261Z"},"links":{"citing_paper":"/paper/2506.04524"},"observation_digest":"sha256:951ad749f415c99abc5df8ade9d103183b5258aa1252c4116c43aceff2405bf3","observation_id":"333a4d0c-5da0-4d3f-a63e-f8723e883e94","resolution":{"observed_at":"2026-08-07T10:52:50.593674Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T10:52:50.581540Z","title":"Improved MPC Algorithms for MIS, Matching, and Coloring on Trees and Beyond","venue":null,"work_id":"1aaa6072-2a30-4167-9275-603f1f5001fd","year":2020},"citing_paper":{"arxiv_id":"2506.04524","last_updated":"2025-06-05T00:13:25Z","snapshot_observed_at":"2026-08-17T17:58:07.967581Z","submitted_at":"2025-06-05T00:13:25Z","title":"Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:50.377061Z"},"links":{"citing_paper":"/paper/2506.04524"},"observation_digest":"sha256:6df109fc9cb21853b5110b4b932d5401c6587590673e072c4836f107c4c8ec41","observation_id":"2a9a3230-909a-4edd-9584-52ebe1d3cede","resolution":{"observed_at":"2026-08-07T10:52:50.584616Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T10:52:50.573001Z","title":"Improved massively parallel computation algorithms for mis, matching, and vertex cover","venue":null,"work_id":"eead4274-4d5d-4fdc-88eb-1943400c4179","year":2018},"citing_paper":{"arxiv_id":"2506.04524","last_updated":"2025-06-05T00:13:25Z","snapshot_observed_at":"2026-08-17T17:58:07.967581Z","submitted_at":"2025-06-05T00:13:25Z","title":"Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:50.379684Z"},"links":{"citing_paper":"/paper/2506.04524"},"observation_digest":"sha256:259f1ec9f7df8490668fac7b5882d89ca8660427ffed7edbe1a9302a4ff06326","observation_id":"3c2dd6b4-a028-45eb-a7aa-111847d0c1a0","resolution":{"observed_at":"2026-08-07T10:52:50.575769Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T10:52:50.563897Z","title":"Massively parallel algorithms for b-matching","venue":null,"work_id":"ebeda8df-f890-4e09-870b-df07442ddf73","year":2022},"citing_paper":{"arxiv_id":"2506.04524","last_updated":"2025-06-05T00:13:25Z","snapshot_observed_at":"2026-08-17T17:58:07.967581Z","submitted_at":"2025-06-05T00:13:25Z","title":"Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:50.382307Z"},"links":{"citing_paper":"/paper/2506.04524"},"observation_digest":"sha256:1a680548d13c98f505c25f277ac5c05a5408d8951bc7ac6951c8c15a4bf55dac","observation_id":"da087578-fa0b-44ff-8f4e-4ed74a07f251","resolution":{"observed_at":"2026-08-07T10:52:50.567141Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T10:52:50.554436Z","title":"Conditional hardness results for massively parallel computation from distributed lower bounds","venue":null,"work_id":"790fb79e-8518-4874-aa1b-802384a79f7d","year":2019},"citing_paper":{"arxiv_id":"2506.04524","last_updated":"2025-06-05T00:13:25Z","snapshot_observed_at":"2026-08-17T17:58:07.967581Z","submitted_at":"2025-06-05T00:13:25Z","title":"Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:50.384979Z"},"links":{"citing_paper":"/paper/2506.04524"},"observation_digest":"sha256:42c8045c468c4593839ea62f0798efc486394030f4611c00beb9ddebd18f5838","observation_id":"8f6664d6-f26f-44f1-b48e-73c283e92970","resolution":{"observed_at":"2026-08-07T10:52:50.557680Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T10:52:50.545192Z","title":"Sorting, searching, and simulation in the mapreduce framework","venue":null,"work_id":"b15c7a27-df4e-42ab-9393-5aac13e40724","year":2011},"citing_paper":{"arxiv_id":"2506.04524","last_updated":"2025-06-05T00:13:25Z","snapshot_observed_at":"2026-08-17T17:58:07.967581Z","submitted_at":"2025-06-05T00:13:25Z","title":"Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:50.387685Z"},"links":{"citing_paper":"/paper/2506.04524"},"observation_digest":"sha256:6cc58e9c3630be620e1502108e141afb8fa3facce52e5997e347ea389f2beb8b","observation_id":"35459f69-c667-453a-aa7d-3cefaafa8d18","resolution":{"observed_at":"2026-08-07T10:52:50.548336Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T10:52:50.536111Z","title":"Sparsifying distributed algorithms with ramifications in massively parallel computation and centralized local computation","venue":null,"work_id":"3389d893-42dd-4c93-96c7-e64feafa90db","year":2019},"citing_paper":{"arxiv_id":"2506.04524","last_updated":"2025-06-05T00:13:25Z","snapshot_observed_at":"2026-08-17T17:58:07.967581Z","submitted_at":"2025-06-05T00:13:25Z","title":"Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:50.390265Z"},"links":{"citing_paper":"/paper/2506.04524"},"observation_digest":"sha256:b232c4d24d3648fd808384ba20a8693fb0b39354ea43e76f39e6a759055266a9","observation_id":"c6f3d01e-8512-49d3-82c6-f7c5d4aff6ce","resolution":{"observed_at":"2026-08-07T10:52:50.539199Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T10:52:50.526397Z","title":"Mirrokni, and Morteza Zadimoghaddam","venue":null,"work_id":"cb762a3c-8cf3-41f4-b966-ca42367e5557","year":2011},"citing_paper":{"arxiv_id":"2506.04524","last_updated":"2025-06-05T00:13:25Z","snapshot_observed_at":"2026-08-17T17:58:07.967581Z","submitted_at":"2025-06-05T00:13:25Z","title":"Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:50.393244Z"},"links":{"citing_paper":"/paper/2506.04524"},"observation_digest":"sha256:63315435c9a1ea048ea87d4cbe64ceed803c2b1129e9382e731ce15f4ecfef87","observation_id":"1dbf4d45-75fa-4e99-9d45-858dc5145526","resolution":{"observed_at":"2026-08-07T10:52:50.530087Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T10:52:50.517476Z","title":"A model of computation for mapreduce","venue":null,"work_id":"428cac26-83a2-47c9-b625-a0c9b1493010","year":2010},"citing_paper":{"arxiv_id":"2506.04524","last_updated":"2025-06-05T00:13:25Z","snapshot_observed_at":"2026-08-17T17:58:07.967581Z","submitted_at":"2025-06-05T00:13:25Z","title":"Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:50.396079Z"},"links":{"citing_paper":"/paper/2506.04524"},"observation_digest":"sha256:a1b33ad236d7e17aa7467f20c2422fbfae8e7a34f2186cc9614c92b55c8bfc3a","observation_id":"9e617132-6eab-4f5a-a785-bbcc389a5da0","resolution":{"observed_at":"2026-08-07T10:52:50.520477Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.08979","last_updated":"2023-07-18T05:25:32Z","snapshot_observed_at":"2026-08-16T15:15:28.679171Z","submitted_at":"2023-07-18T05:25:32Z","title":"Scalable Auction Algorithms for Bipartite Maximum Matching Problems","version":1},"cited_work":{"arxiv_id":"2307.08979","doi":null,"metadata_source":"pith","pith_arxiv_id":"2307.08979","snapshot_observed_at":"2026-08-07T10:52:50.461260Z","title":"Scalable Auction Algorithms for Bipartite Maximum Matching Problems","venue":"cs.DS","work_id":"acae06d7-c033-4a43-b575-c2090f556ab5","year":2023},"citing_paper":{"arxiv_id":"2506.04524","last_updated":"2025-06-05T00:13:25Z","snapshot_observed_at":"2026-08-17T17:58:07.967581Z","submitted_at":"2025-06-05T00:13:25Z","title":"Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:50.398844Z"},"links":{"cited_paper":"/paper/2307.08979","citing_paper":"/paper/2506.04524"},"observation_digest":"sha256:96913fc23b386acff97f30e482de048c0882b2d56c93800be6917b1b24dcaefa","observation_id":"63c0f1ae-1905-410e-9f2e-c80027c6086c","resolution":{"observed_at":"2026-08-07T10:52:50.465034Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T10:52:50.508487Z","title":"Filtering: a method for solving graph problems in mapreduce","venue":null,"work_id":"a9c51254-7238-427e-b8e0-0d85a41da662","year":2011},"citing_paper":{"arxiv_id":"2506.04524","last_updated":"2025-06-05T00:13:25Z","snapshot_observed_at":"2026-08-17T17:58:07.967581Z","submitted_at":"2025-06-05T00:13:25Z","title":"Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:50.402128Z"},"links":{"citing_paper":"/paper/2506.04524"},"observation_digest":"sha256:92f52e12f558699c33e7fa411f9519b4d67a6f2d3664654d79525fb9ecb57254","observation_id":"30f13389-d7ba-4175-ab25-387b7f689966","resolution":{"observed_at":"2026-08-07T10:52:50.511384Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T10:52:50.499011Z","title":"Brief announcement: Exponential speed-up of local algorithms using non-local communication","venue":null,"work_id":"b524744c-81bd-46f1-a4bf-76420eaa7da3","year":2010},"citing_paper":{"arxiv_id":"2506.04524","last_updated":"2025-06-05T00:13:25Z","snapshot_observed_at":"2026-08-17T17:58:07.967581Z","submitted_at":"2025-06-05T00:13:25Z","title":"Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:50.404976Z"},"links":{"citing_paper":"/paper/2506.04524"},"observation_digest":"sha256:f44199d6841e0f641958838cdab3ab01e32c296d5b0d17f01d21ca3d8945e8c0","observation_id":"12f73375-61e4-422b-b52b-438ebd3a4d4b","resolution":{"observed_at":"2026-08-07T10:52:50.502231Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T10:52:50.490042Z","title":"Adwords and generalized online matching","venue":null,"work_id":"211f4faa-4f20-4537-a4ea-aac08ab5b95a","year":2007},"citing_paper":{"arxiv_id":"2506.04524","last_updated":"2025-06-05T00:13:25Z","snapshot_observed_at":"2026-08-17T17:58:07.967581Z","submitted_at":"2025-06-05T00:13:25Z","title":"Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:50.407484Z"},"links":{"citing_paper":"/paper/2506.04524"},"observation_digest":"sha256:f5336596b719f64a28d616016712ef1561e010dd8df4d33ea1b0db3615a16c20","observation_id":"c761bf3b-cbe0-49e5-b4b7-ee59f3890e4e","resolution":{"observed_at":"2026-08-07T10:52:50.493122Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T10:52:50.480605Z","title":"Optimal online assignment with forecasts","venue":null,"work_id":"c7dac22d-c5d2-4f91-aa81-21237f50b640","year":2010},"citing_paper":{"arxiv_id":"2506.04524","last_updated":"2025-06-05T00:13:25Z","snapshot_observed_at":"2026-08-17T17:58:07.967581Z","submitted_at":"2025-06-05T00:13:25Z","title":"Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:50.410463Z"},"links":{"citing_paper":"/paper/2506.04524"},"observation_digest":"sha256:1c527a46a37b4c720e284e8b5c94177dea43b2712e0ce5766c5c4ef41defb729","observation_id":"0bedf720-cf2e-4c03-8ba9-4e9fb8dcab1e","resolution":{"observed_at":"2026-08-07T10:52:50.483781Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T10:52:50.471346Z","title":"Socially enabled wireless networks: Resource allocation via bipartite graph matching","venue":null,"work_id":"7796945c-04d5-444a-845e-850a9fe3e697","year":2015},"citing_paper":{"arxiv_id":"2506.04524","last_updated":"2025-06-05T00:13:25Z","snapshot_observed_at":"2026-08-17T17:58:07.967581Z","submitted_at":"2025-06-05T00:13:25Z","title":"Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:50.413484Z"},"links":{"citing_paper":"/paper/2506.04524"},"observation_digest":"sha256:1a26b74bcdcfcac51545e2c1e8ef709f7e37fdcdb2cc0066996fd4848c4a2ca8","observation_id":"8a5098b1-a7aa-47ee-abf8-c7e675ff5b5e","resolution":{"observed_at":"2026-08-07T10:52:50.474445Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2010.08418","last_updated":"2020-10-16T14:33:11Z","snapshot_observed_at":"2026-08-16T19:12:57.664045Z","submitted_at":"2020-10-16T14:33:11Z","title":"Learning Robust Algorithms for Online Allocation Problems Using Adversarial Training","version":1},"cited_work":{"arxiv_id":"2010.08418","doi":null,"metadata_source":"pith","pith_arxiv_id":"2010.08418","snapshot_observed_at":"2026-08-07T10:52:50.445004Z","title":"Learning Robust Algorithms for Online Allocation Problems Using Adversarial Training","venue":"cs.LG","work_id":"f5e0beec-2232-4778-a03a-f43925a4047f","year":2020},"citing_paper":{"arxiv_id":"2506.04524","last_updated":"2025-06-05T00:13:25Z","snapshot_observed_at":"2026-08-17T17:58:07.967581Z","submitted_at":"2025-06-05T00:13:25Z","title":"Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:50.416822Z"},"links":{"cited_paper":"/paper/2010.08418","citing_paper":"/paper/2506.04524"},"observation_digest":"sha256:b78f3985d5edb1dc3d1ffca4065ac399ced2ccfdcb18fad5b8755523ed28cd9f","observation_id":"4109daae-dfab-4670-82f3-cd1228246363","resolution":{"observed_at":"2026-08-07T10:52:50.450204Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.04524","last_updated":"2025-06-05T00:13:25Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-17T17:58:07.967581Z","submitted_at":"2025-06-05T00:13:25Z","title":"Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs"},"reference_resolution":{"displayed":29,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":2,"verified_fuzzy":27},"total_outbound_references":29},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 29 of 29 outbound references and 0 inbound Pith citation observations for arXiv:2506.04524."}