{"as_of":"2026-08-16T15:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d6b3dd9eada274a0d78581fb1ad166b291fb5082815906777db30b42be5e17fb","coverage":[{"denominator":34,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":34,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T04:47:55.501385Z","state":"measured"},{"denominator":34,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":34,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2505.00915/citation-record","integrity":"/paper/2505.00915/integrity","json":"/paper/2505.00915/citation-record.json","paper":"/paper/2505.00915"},"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-16T04:47:56.136675Z","title":"Sp ace-Efficient Local Computation Algorithms","venue":null,"work_id":"f2202f6f-4edb-49ac-8ec6-5bb43e62bcb5","year":2012},"citing_paper":{"arxiv_id":"2505.00915","last_updated":"2025-05-01T23:26:31Z","snapshot_observed_at":"2026-08-16T04:29:19.637076Z","submitted_at":"2025-05-01T23:26:31Z","title":"Lower Bounds for Non-adaptive Local Computation Algorithms","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-16T04:47:55.385204Z"},"links":{"citing_paper":"/paper/2505.00915"},"observation_digest":"sha256:41067b758e052d7911d3a61f152b78a9fd6e82e0fedf69013deba8f5d4bafc5d","observation_id":"4ee5004d-5c2e-4e60-aaf7-c2ea29aa01bb","resolution":{"observed_at":"2026-08-16T04:47:56.140269Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T04:47:55.389862Z","title":"The stochast ic matching problem with (very) few queries","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.00915","last_updated":"2025-05-01T23:26:31Z","snapshot_observed_at":"2026-08-16T04:29:19.637076Z","submitted_at":"2025-05-01T23:26:31Z","title":"Lower Bounds for Non-adaptive Local Computation Algorithms","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-16T04:47:55.389862Z"},"links":{"citing_paper":"/paper/2505.00915"},"observation_digest":"sha256:7effc7e5f8e9b1e9d740945bcc2fcf7abd7d322a48513b34389461f3b2d20863","observation_id":"a5e50638-68d1-40e6-98df-3f740bdb9c21","resolution":{"observed_at":"2026-08-16T04:47:55.389862Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:47:56.126669Z","title":"Lower bounds for maximal matchings and maximal ind ependent sets","venue":null,"work_id":"5bc821bb-8993-45ff-b237-9b622dd81571","year":2021},"citing_paper":{"arxiv_id":"2505.00915","last_updated":"2025-05-01T23:26:31Z","snapshot_observed_at":"2026-08-16T04:29:19.637076Z","submitted_at":"2025-05-01T23:26:31Z","title":"Lower Bounds for Non-adaptive Local Computation Algorithms","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-16T04:47:55.393658Z"},"links":{"citing_paper":"/paper/2505.00915"},"observation_digest":"sha256:065b402aa9da4974e10893b5ea6189dbd71b642cc89b826c8c42398ae8586cb4","observation_id":"c258ea65-983a-4302-842e-430014f4703e","resolution":{"observed_at":"2026-08-16T04:47:56.130241Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T04:47:56.115774Z","title":"A distributed (2 + ε)- approximation for vertex cover in o(log ∆ / ε log log ∆) rounds","venue":null,"work_id":"86c1a882-5ca6-4ed9-9b84-8b6f5f65056d","year":null},"citing_paper":{"arxiv_id":"2505.00915","last_updated":"2025-05-01T23:26:31Z","snapshot_observed_at":"2026-08-16T04:29:19.637076Z","submitted_at":"2025-05-01T23:26:31Z","title":"Lower Bounds for Non-adaptive Local Computation Algorithms","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-16T04:47:55.397716Z"},"links":{"citing_paper":"/paper/2505.00915"},"observation_digest":"sha256:85a884b0df3a017c0010d322fdc3471849fe827dc9f25e8ac5e221de8c9b43a5","observation_id":"add5588d-4580-447f-850d-73ca01095999","resolution":{"observed_at":"2026-08-16T04:47:56.119983Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T04:47:55.405441Z","title":"The locality of dis- tributed symmetry breaking","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2505.00915","last_updated":"2025-05-01T23:26:31Z","snapshot_observed_at":"2026-08-16T04:29:19.637076Z","submitted_at":"2025-05-01T23:26:31Z","title":"Lower Bounds for Non-adaptive Local Computation Algorithms","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-16T04:47:55.405441Z"},"links":{"citing_paper":"/paper/2505.00915"},"observation_digest":"sha256:238ac3e6d9da8f6e4d5fe8ee9c5cdc5e1c3b093a75e0bb5f79740e4cdb877711","observation_id":"53048822-2dbb-4388-ac21-639929fa6a84","resolution":{"observed_at":"2026-08-16T04:47:55.405441Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:47:56.105380Z","title":"Time-Optimal Sublinear Algorithms f or Matching and Vertex Cover","venue":null,"work_id":"969c3488-d2b7-49ea-b59f-61d4cc74ba7d","year":2021},"citing_paper":{"arxiv_id":"2505.00915","last_updated":"2025-05-01T23:26:31Z","snapshot_observed_at":"2026-08-16T04:29:19.637076Z","submitted_at":"2025-05-01T23:26:31Z","title":"Lower Bounds for Non-adaptive Local Computation Algorithms","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-16T04:47:55.409274Z"},"links":{"citing_paper":"/paper/2505.00915"},"observation_digest":"sha256:9ea29a7fa0dee9f6aab33e61f1d122d5ebceec73b018500cdc109a0249add68f","observation_id":"0d220b86-bd0a-4028-9dc8-349fa53b3a06","resolution":{"observed_at":"2026-08-16T04:47:56.109106Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T04:47:55.412777Z","title":"Stochastic matching with few queries: (1- ε) approximation","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.00915","last_updated":"2025-05-01T23:26:31Z","snapshot_observed_at":"2026-08-16T04:29:19.637076Z","submitted_at":"2025-05-01T23:26:31Z","title":"Lower Bounds for Non-adaptive Local Computation Algorithms","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-16T04:47:55.412777Z"},"links":{"citing_paper":"/paper/2505.00915"},"observation_digest":"sha256:cbbfabcce103ee353e3d2dda26c99d7740179f8b325dfd5827e23b7bff17d177","observation_id":"f0785b92-a57b-4e15-8158-2f75dddcf744","resolution":{"observed_at":"2026-08-16T04:47:55.412777Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/356424","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:47:55.582728Z","title":"Sublinear time algorithms and complexity of approximate maximum matching","venue":null,"work_id":"e2218097-533c-4c30-ac5b-83568371132d","year":2023},"citing_paper":{"arxiv_id":"2505.00915","last_updated":"2025-05-01T23:26:31Z","snapshot_observed_at":"2026-08-16T04:29:19.637076Z","submitted_at":"2025-05-01T23:26:31Z","title":"Lower Bounds for Non-adaptive Local Computation Algorithms","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-16T04:47:55.416377Z"},"links":{"citing_paper":"/paper/2505.00915"},"observation_digest":"sha256:35332d28de377256a775c2474da44e406d8825081eab4db9452ac979ae27e2ec","observation_id":"7b5c6de3-bbc6-43ae-b1d8-44ea5edb5e3d","resolution":{"observed_at":"2026-08-16T04:47:55.587731Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T04:47:56.095881Z","title":"Local computation algorithms for maximum matching: New lower bounds","venue":null,"work_id":"50beb294-cc34-4f39-a24a-82392108ea5d","year":2023},"citing_paper":{"arxiv_id":"2505.00915","last_updated":"2025-05-01T23:26:31Z","snapshot_observed_at":"2026-08-16T04:29:19.637076Z","submitted_at":"2025-05-01T23:26:31Z","title":"Lower Bounds for Non-adaptive Local Computation Algorithms","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-16T04:47:55.420471Z"},"links":{"citing_paper":"/paper/2505.00915"},"observation_digest":"sha256:f5a97cdd7a31b30b30b74f4ac791cf8b153ff6f4214994998a41a7e1392cf3a8","observation_id":"40639ecd-8886-4e7b-91dc-a60fc39dec09","resolution":{"observed_at":"2026-08-16T04:47:56.099412Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T04:47:56.085012Z","title":"Approximating maximum matching requires almost quadratic time","venue":null,"work_id":"6fc8ee69-02a5-4847-9997-874ff561f1d3","year":2024},"citing_paper":{"arxiv_id":"2505.00915","last_updated":"2025-05-01T23:26:31Z","snapshot_observed_at":"2026-08-16T04:29:19.637076Z","submitted_at":"2025-05-01T23:26:31Z","title":"Lower Bounds for Non-adaptive Local Computation Algorithms","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-16T04:47:55.423653Z"},"links":{"citing_paper":"/paper/2505.00915"},"observation_digest":"sha256:22a15534804846c25c34b2a112bbdbed4525c18ebeb3fc722c1b07f2208506e7","observation_id":"fafec30a-a392-4394-aacc-73442482ffbd","resolution":{"observed_at":"2026-08-16T04:47:56.088905Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00037-018-0168-4","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:47:55.571746Z","title":"Canonne and Tom Gur","venue":null,"work_id":"266615f6-4569-444a-9682-4d3bbf754105","year":2018},"citing_paper":{"arxiv_id":"2505.00915","last_updated":"2025-05-01T23:26:31Z","snapshot_observed_at":"2026-08-16T04:29:19.637076Z","submitted_at":"2025-05-01T23:26:31Z","title":"Lower Bounds for Non-adaptive Local Computation Algorithms","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-16T04:47:55.427198Z"},"links":{"citing_paper":"/paper/2505.00915"},"observation_digest":"sha256:2fcc6b6521efa5fece2f2cbf8954d0a00f0d5368829fc64d4ca3fbbffa28207f","observation_id":"14994c94-ae2b-4c00-8048-c82d00b5b66b","resolution":{"observed_at":"2026-08-16T04:47:55.575443Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T04:47:55.430822Z","title":"Servedio, Li-Yang Tan, and Erik Wainga rten","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.00915","last_updated":"2025-05-01T23:26:31Z","snapshot_observed_at":"2026-08-16T04:29:19.637076Z","submitted_at":"2025-05-01T23:26:31Z","title":"Lower Bounds for Non-adaptive Local Computation Algorithms","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-16T04:47:55.430822Z"},"links":{"citing_paper":"/paper/2505.00915"},"observation_digest":"sha256:1f1a7b9094241dbb370a684812cc637f534b5f9fd2b043d22a3f63fcae3a30e5","observation_id":"60b9a7f1-1b18-4bd4-b894-e791e0f46cba","resolution":{"observed_at":"2026-08-16T04:47:55.430822Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611978322.13","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:47:55.553490Z","title":"Served io, and Erik Waingarten","venue":null,"work_id":"e28872ea-fa6b-4419-974c-bcff18afac68","year":2025},"citing_paper":{"arxiv_id":"2505.00915","last_updated":"2025-05-01T23:26:31Z","snapshot_observed_at":"2026-08-16T04:29:19.637076Z","submitted_at":"2025-05-01T23:26:31Z","title":"Lower Bounds for Non-adaptive Local Computation Algorithms","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-16T04:47:55.434463Z"},"links":{"citing_paper":"/paper/2505.00915"},"observation_digest":"sha256:bf3dd459ed38e70df8b908d187d60243eda275d8b34ab94783b0f6d2cb5e883c","observation_id":"2f48150d-ac1d-41a8-b3d9-8ae03406b174","resolution":{"observed_at":"2026-08-16T04:47:55.558070Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T04:47:55.437847Z","title":"Monotonicity testing over general poset do mains","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2505.00915","last_updated":"2025-05-01T23:26:31Z","snapshot_observed_at":"2026-08-16T04:29:19.637076Z","submitted_at":"2025-05-01T23:26:31Z","title":"Lower Bounds for Non-adaptive Local Computation Algorithms","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-16T04:47:55.437847Z"},"links":{"citing_paper":"/paper/2505.00915"},"observation_digest":"sha256:78fd3b957a9f7fe4f3ac9799ea85b9439487e435553c7982da8a0e9734d685df","observation_id":"1bc69e41-caa6-4aa1-9916-b2c3ee5525a3","resolution":{"observed_at":"2026-08-16T04:47:55.437847Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:47:56.074336Z","title":"Local computation of maximal independe nt set","venue":null,"work_id":"7ba3d44e-aa19-4661-98c3-443837dac742","year":2022},"citing_paper":{"arxiv_id":"2505.00915","last_updated":"2025-05-01T23:26:31Z","snapshot_observed_at":"2026-08-16T04:29:19.637076Z","submitted_at":"2025-05-01T23:26:31Z","title":"Lower Bounds for Non-adaptive Local Computation Algorithms","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-16T04:47:55.441134Z"},"links":{"citing_paper":"/paper/2505.00915"},"observation_digest":"sha256:df69a42a5e6439fee486f85a5e030ab49b4710f259b3c85c2780c1399a89af7e","observation_id":"0f8e9b9b-c137-4c10-ab07-a82c9be277db","resolution":{"observed_at":"2026-08-16T04:47:56.078163Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T04:47:55.444436Z","title":"Sparsifying distributed algorithms with ramifications in massively parallel computation and centralized local comp utation","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.00915","last_updated":"2025-05-01T23:26:31Z","snapshot_observed_at":"2026-08-16T04:29:19.637076Z","submitted_at":"2025-05-01T23:26:31Z","title":"Lower Bounds for Non-adaptive Local Computation Algorithms","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-16T04:47:55.444436Z"},"links":{"citing_paper":"/paper/2505.00915"},"observation_digest":"sha256:74a0da8449d167cd290b57acddf0bee100c0422d4cc01bc8a00f6b9577b776fa","observation_id":"dc230fb9-a28d-4780-beea-212f4c970ced","resolution":{"observed_at":"2026-08-16T04:47:55.444436Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:47:55.447791Z","title":"Th e power of adaptivity in quan- tum query algorithms","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.00915","last_updated":"2025-05-01T23:26:31Z","snapshot_observed_at":"2026-08-16T04:29:19.637076Z","submitted_at":"2025-05-01T23:26:31Z","title":"Lower Bounds for Non-adaptive Local Computation Algorithms","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-16T04:47:55.447791Z"},"links":{"citing_paper":"/paper/2505.00915"},"observation_digest":"sha256:eb916e89493bac77d0905f3fde6d9945d6c8136811c920d3a5074c5ac8857002","observation_id":"62f82284-7263-40c7-93e4-3fa1896913a2","resolution":{"observed_at":"2026-08-16T04:47:55.447791Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:47:55.451244Z","title":"Three theorems regar ding testing graph properties","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2505.00915","last_updated":"2025-05-01T23:26:31Z","snapshot_observed_at":"2026-08-16T04:29:19.637076Z","submitted_at":"2025-05-01T23:26:31Z","title":"Lower Bounds for Non-adaptive Local Computation Algorithms","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-16T04:47:55.451244Z"},"links":{"citing_paper":"/paper/2505.00915"},"observation_digest":"sha256:99d60cab05d01a795bb8ef28e3f12c6c186be7864b8f3c2ea5ceeb71efccb14a","observation_id":"713b1651-f985-4a01-9442-9c9fe1aa2750","resolution":{"observed_at":"2026-08-16T04:47:55.451244Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:47:56.062686Z","title":"On the benefits of adaptivity in p roperty testing of dense graphs","venue":null,"work_id":"6e1665c1-294e-4a04-8698-a4d8d6330224","year":2007},"citing_paper":{"arxiv_id":"2505.00915","last_updated":"2025-05-01T23:26:31Z","snapshot_observed_at":"2026-08-16T04:29:19.637076Z","submitted_at":"2025-05-01T23:26:31Z","title":"Lower Bounds for Non-adaptive Local Computation Algorithms","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-16T04:47:55.454734Z"},"links":{"citing_paper":"/paper/2505.00915"},"observation_digest":"sha256:852ae1d4cd842c53118a7bd8a8d81523bebf4865234fb3a3dff0273aba015a9c","observation_id":"6d335817-73e9-4765-a176-bb83c5475080","resolution":{"observed_at":"2026-08-16T04:47:56.066562Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T04:47:55.457960Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2505.00915","last_updated":"2025-05-01T23:26:31Z","snapshot_observed_at":"2026-08-16T04:29:19.637076Z","submitted_at":"2025-05-01T23:26:31Z","title":"Lower Bounds for Non-adaptive Local Computation Algorithms","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-16T04:47:55.457960Z"},"links":{"citing_paper":"/paper/2505.00915"},"observation_digest":"sha256:7ab30129a0be13f61032eaaaae152f988642ab05ca2f7db3769abaa14c37abba","observation_id":"006c9c8a-e631-4130-a58f-2c4fa6bc971c","resolution":{"observed_at":"2026-08-16T04:47:55.457960Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:47:56.049721Z","title":"Space Efficient Approximation to Maximum Matching Size from Uniform Edge Sa mples","venue":null,"work_id":"349a13a8-d9fd-4138-977d-1fa381744555","year":2020},"citing_paper":{"arxiv_id":"2505.00915","last_updated":"2025-05-01T23:26:31Z","snapshot_observed_at":"2026-08-16T04:29:19.637076Z","submitted_at":"2025-05-01T23:26:31Z","title":"Lower Bounds for Non-adaptive Local Computation Algorithms","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-16T04:47:55.461260Z"},"links":{"citing_paper":"/paper/2505.00915"},"observation_digest":"sha256:12d77b0028c73eb9ed507750053d441da6fb633586f22a9300d8ff0a58631dda","observation_id":"bd5d7661-febb-4f80-b0e0-90bafc077758","resolution":{"observed_at":"2026-08-16T04:47:56.053951Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T04:47:56.038392Z","title":"Karloff, Siddharth Suri, and Sergei Vassilvits kii","venue":null,"work_id":"8300125b-3e74-404a-b5b6-6269d74f92c3","year":2010},"citing_paper":{"arxiv_id":"2505.00915","last_updated":"2025-05-01T23:26:31Z","snapshot_observed_at":"2026-08-16T04:29:19.637076Z","submitted_at":"2025-05-01T23:26:31Z","title":"Lower Bounds for Non-adaptive Local Computation Algorithms","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-16T04:47:55.464512Z"},"links":{"citing_paper":"/paper/2505.00915"},"observation_digest":"sha256:39e4ebb462404069b120cd93c25e93b04204accdd17b750e79a6e074f2981c27","observation_id":"df4ef64a-c78a-4707-91cd-8926f2203fec","resolution":{"observed_at":"2026-08-16T04:47:56.042229Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T04:47:55.467746Z","title":"Local computation: Lower and upper bounds","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.00915","last_updated":"2025-05-01T23:26:31Z","snapshot_observed_at":"2026-08-16T04:29:19.637076Z","submitted_at":"2025-05-01T23:26:31Z","title":"Lower Bounds for Non-adaptive Local Computation Algorithms","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-16T04:47:55.467746Z"},"links":{"citing_paper":"/paper/2505.00915"},"observation_digest":"sha256:44db05e4adaa3612ee36f7aeda3e1aae80e2f6c0720a2649a37b0f92aeaa9481","observation_id":"5c680696-fbb0-46d0-b0f8-3d0f15a4dfdc","resolution":{"observed_at":"2026-08-16T04:47:55.467746Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:47:55.470977Z","title":"Prop erly learning monotone functions via local correction","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.00915","last_updated":"2025-05-01T23:26:31Z","snapshot_observed_at":"2026-08-16T04:29:19.637076Z","submitted_at":"2025-05-01T23:26:31Z","title":"Lower Bounds for Non-adaptive Local Computation Algorithms","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-16T04:47:55.470977Z"},"links":{"citing_paper":"/paper/2505.00915"},"observation_digest":"sha256:8d968bf7154e398330980c249b5a01227841628c952235ffda45c35bdd8bff36","observation_id":"104640df-1418-4657-817b-28762bf75453","resolution":{"observed_at":"2026-08-16T04:47:55.470977Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:47:56.026110Z","title":"Locality in distributed graph algorith ms","venue":null,"work_id":"735fe99f-d217-4f47-a520-413acca9a295","year":null},"citing_paper":{"arxiv_id":"2505.00915","last_updated":"2025-05-01T23:26:31Z","snapshot_observed_at":"2026-08-16T04:29:19.637076Z","submitted_at":"2025-05-01T23:26:31Z","title":"Lower Bounds for Non-adaptive Local Computation Algorithms","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-16T04:47:55.474275Z"},"links":{"citing_paper":"/paper/2505.00915"},"observation_digest":"sha256:47b614481142b726b4f15a5fe3b4e9b5b6671e72ecfed2802093f33e4f21a89c","observation_id":"cb707897-cd2b-4cc9-a4d0-2bd30de4c19a","resolution":{"observed_at":"2026-08-16T04:47:56.030226Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1807.08745","last_updated":"2018-07-23T17:49:03Z","snapshot_observed_at":"2026-08-16T12:13:37.496268Z","submitted_at":"2018-07-23T17:49:03Z","title":"Round Compression for Parallel Graph Algorithms in Strongly Sublinear Space","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1807.08745","snapshot_observed_at":"2026-08-16T04:47:55.481437Z","title":"Round Compression for Parallel Graph A lgorithms in Strongly Sublinear Space","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.00915","last_updated":"2025-05-01T23:26:31Z","snapshot_observed_at":"2026-08-16T04:29:19.637076Z","submitted_at":"2025-05-01T23:26:31Z","title":"Lower Bounds for Non-adaptive Local Computation Algorithms","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-16T04:47:55.481437Z"},"links":{"cited_paper":"/paper/1807.08745","citing_paper":"/paper/2505.00915"},"observation_digest":"sha256:6dceac090d0f3509276cfa6250f570248d4ac023a5a4c220e60c0bf12b5463bb","observation_id":"53ed5b4c-b653-4202-9b9c-bebe8450c073","resolution":{"observed_at":"2026-08-16T04:47:55.481437Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:47:56.014665Z","title":"Approximating the Minimum V ertex Cover in Sublinear Time and a Connection to Distributed Algorithms","venue":null,"work_id":"d50d44e9-5f47-4256-b744-4bb9033dbba1","year":2007},"citing_paper":{"arxiv_id":"2505.00915","last_updated":"2025-05-01T23:26:31Z","snapshot_observed_at":"2026-08-16T04:29:19.637076Z","submitted_at":"2025-05-01T23:26:31Z","title":"Lower Bounds for Non-adaptive Local Computation Algorithms","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-16T04:47:55.485058Z"},"links":{"citing_paper":"/paper/2505.00915"},"observation_digest":"sha256:c468d0f00e128f12a550621f8ce280d1c5045790a13375e6d3acef935da3c172","observation_id":"e7f95f39-15d3-4fa7-a39d-6c5a7d268430","resolution":{"observed_at":"2026-08-16T04:47:56.018962Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T04:47:56.003748Z","title":null,"venue":null,"work_id":"63d967b0-dd6d-4e77-b958-8a90b41450a5","year":2006},"citing_paper":{"arxiv_id":"2505.00915","last_updated":"2025-05-01T23:26:31Z","snapshot_observed_at":"2026-08-16T04:29:19.637076Z","submitted_at":"2025-05-01T23:26:31Z","title":"Lower Bounds for Non-adaptive Local Computation Algorithms","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-16T04:47:55.488508Z"},"links":{"citing_paper":"/paper/2505.00915"},"observation_digest":"sha256:1081d37dcb73a0d6df0728fd906a334054807304b85360602c7481ab6225644d","observation_id":"4fd9984c-8697-48e2-b288-ff34045fd6ba","resolution":{"observed_at":"2026-08-16T04:47:56.007322Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T04:47:55.991943Z","title":"F ast local computation algorithms","venue":null,"work_id":"e76c33aa-bf99-4d58-99e3-395be474cc1d","year":2011},"citing_paper":{"arxiv_id":"2505.00915","last_updated":"2025-05-01T23:26:31Z","snapshot_observed_at":"2026-08-16T04:29:19.637076Z","submitted_at":"2025-05-01T23:26:31Z","title":"Lower Bounds for Non-adaptive Local Computation Algorithms","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-16T04:47:55.491773Z"},"links":{"citing_paper":"/paper/2505.00915"},"observation_digest":"sha256:5ab01ff032d450d198ea0fdc88a4cc23c9f5072fd019ea1cc20bb257280bf411","observation_id":"c715fb33-7ca3-451d-baac-a29de409fd87","resolution":{"observed_at":"2026-08-16T04:47:55.995651Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T04:47:55.981240Z","title":"An impro ved constant-time approximation algorithm for maximum matchings","venue":null,"work_id":"00bc922d-55ba-44c2-8fe1-c896e5b44e43","year":2009},"citing_paper":{"arxiv_id":"2505.00915","last_updated":"2025-05-01T23:26:31Z","snapshot_observed_at":"2026-08-16T04:29:19.637076Z","submitted_at":"2025-05-01T23:26:31Z","title":"Lower Bounds for Non-adaptive Local Computation Algorithms","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-16T04:47:55.494922Z"},"links":{"citing_paper":"/paper/2505.00915"},"observation_digest":"sha256:a0fa9f0c59cef5ac1f31d8777bd39ecc86cb73cb7c6ccea9efe4e45017bdcf81","observation_id":"421e311a-9998-472d-a3f7-3daded1a3f19","resolution":{"observed_at":"2026-08-16T04:47:55.984956Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T04:47:55.970359Z","title":null,"venue":null,"work_id":"f7c0d55a-19c6-453a-8c97-173d76cd63e5","year":null},"citing_paper":{"arxiv_id":"2505.00915","last_updated":"2025-05-01T23:26:31Z","snapshot_observed_at":"2026-08-16T04:29:19.637076Z","submitted_at":"2025-05-01T23:26:31Z","title":"Lower Bounds for Non-adaptive Local Computation Algorithms","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-16T04:47:55.498206Z"},"links":{"citing_paper":"/paper/2505.00915"},"observation_digest":"sha256:576e0a8168a7b416ab4af4f23ca8e9bf43e3e531931591c94dd2b1cb6e8c3c4f","observation_id":"165933a9-502d-47ec-82d8-d7f66ff31bfd","resolution":{"observed_at":"2026-08-16T04:47:55.974174Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T04:47:55.959082Z","title":"Then, for every i ∈ {0, 1,","venue":null,"work_id":"02d6a292-1f2b-4e76-b5e1-ee0170662adc","year":null},"citing_paper":{"arxiv_id":"2505.00915","last_updated":"2025-05-01T23:26:31Z","snapshot_observed_at":"2026-08-16T04:29:19.637076Z","submitted_at":"2025-05-01T23:26:31Z","title":"Lower Bounds for Non-adaptive Local Computation Algorithms","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-16T04:47:55.501385Z"},"links":{"citing_paper":"/paper/2505.00915"},"observation_digest":"sha256:1d114205911dd782c3a90b577c326a5251d4ff321580cc094d68a24d47b54360","observation_id":"d5280a5e-a511-4783-bdc3-4941b819d0ed","resolution":{"observed_at":"2026-08-16T04:47:55.963137Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T04:47:55.477735Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.00915","last_updated":"2025-05-01T23:26:31Z","snapshot_observed_at":"2026-08-16T04:29:19.637076Z","submitted_at":"2025-05-01T23:26:31Z","title":"Lower Bounds for Non-adaptive Local Computation Algorithms","version":1},"reference_index":1992,"source":"pdf_text","source_observed_at":"2026-08-16T04:47:55.477735Z"},"links":{"citing_paper":"/paper/2505.00915"},"observation_digest":"sha256:b5ddc06156d3ba94d5f7b348bb1fb00fd098f74016a6adb229bbf23653d40e1d","observation_id":"9c8e69f6-903f-483c-a858-aecb28509e87","resolution":{"observed_at":"2026-08-16T04:47:55.477735Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:47:55.401599Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.00915","last_updated":"2025-05-01T23:26:31Z","snapshot_observed_at":"2026-08-16T04:29:19.637076Z","submitted_at":"2025-05-01T23:26:31Z","title":"Lower Bounds for Non-adaptive Local Computation Algorithms","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-16T04:47:55.401599Z"},"links":{"citing_paper":"/paper/2505.00915"},"observation_digest":"sha256:4c66a86147e3eadadf4d7de1a8663f211f475f9261a0e66fe287fb5ccf495008","observation_id":"4e96c1b3-fe34-49fb-a2bf-aacfcd5d9ffe","resolution":{"observed_at":"2026-08-16T04:47:55.401599Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.00915","last_updated":"2025-05-01T23:26:31Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-16T04:29:19.637076Z","submitted_at":"2025-05-01T23:26:31Z","title":"Lower Bounds for Non-adaptive Local Computation Algorithms"},"reference_resolution":{"displayed":34,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":15,"verified_exact":3,"verified_fuzzy":15},"total_outbound_references":34},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 34 of 34 outbound references and 0 inbound Pith citation observations for arXiv:2505.00915."}