{"as_of":"2026-08-21T20:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8c2974b47965f0c410bd0d5b7646e9df8e5a279670683d3edd990d79d30c724b","coverage":[{"denominator":25,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":25,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T22:29:43.172626Z","state":"measured"},{"denominator":25,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":25,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+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/2501.02136/citation-record","integrity":"/paper/2501.02136/integrity","json":"/paper/2501.02136/citation-record.json","paper":"/paper/2501.02136"},"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-10T22:29:43.525375Z","title":"In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing , pages 471–480,","venue":null,"work_id":"419ff6a5-841c-40cc-be53-9d25b721c69d","year":2019},"citing_paper":{"arxiv_id":"2501.02136","last_updated":"2025-01-03T23:03:29Z","snapshot_observed_at":"2026-08-11T12:07:03.048901Z","submitted_at":"2025-01-03T23:03:29Z","title":"Locally computing edge orientations","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T22:29:43.098679Z"},"links":{"citing_paper":"/paper/2501.02136"},"observation_digest":"sha256:398afb7a2631ff8ab7f888ac35a6d145b91196187c42f6fc594ba649b1dc0037","observation_id":"a2eb2dc4-b02f-4b66-a966-dda709b4c549","resolution":{"observed_at":"2026-08-10T22:29:43.529491Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T22:29:43.463827Z","title":"D eterministic distributed edge- coloring via hypergraph maximal matching","venue":null,"work_id":"6a838807-39bd-4670-a81b-b3aba724f2a1","year":2017},"citing_paper":{"arxiv_id":"2501.02136","last_updated":"2025-01-03T23:03:29Z","snapshot_observed_at":"2026-08-11T12:07:03.048901Z","submitted_at":"2025-01-03T23:03:29Z","title":"Locally computing edge orientations","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T22:29:43.121481Z"},"links":{"citing_paper":"/paper/2501.02136"},"observation_digest":"sha256:17f1a522cd96e6eccd66d847d5ebb9c3d4c58682c3807265079a832784f278a6","observation_id":"34f43f4e-d7af-44bb-959b-cdc0890458ac","resolution":{"observed_at":"2026-08-10T22:29:43.468877Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T22:29:43.451479Z","title":"Local computation of maximal indep endent set","venue":null,"work_id":"749cd31e-81f1-47b3-8085-ca83fb4f5cdd","year":2022},"citing_paper":{"arxiv_id":"2501.02136","last_updated":"2025-01-03T23:03:29Z","snapshot_observed_at":"2026-08-11T12:07:03.048901Z","submitted_at":"2025-01-03T23:03:29Z","title":"Locally computing edge orientations","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T22:29:43.125175Z"},"links":{"citing_paper":"/paper/2501.02136"},"observation_digest":"sha256:51329f4ab64a19c746dd8efa8b9eed42d27e42bd3fb988873f81b6b48da7d0bc","observation_id":"36f8d48c-1c8b-4a8d-849f-aa0b1921e38b","resolution":{"observed_at":"2026-08-10T22:29:43.455837Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T22:29:43.435771Z","title":"On d erandomizing local distributed algorithms","venue":null,"work_id":"4db41cbd-5ef3-4316-93cd-ff0e35427fd7","year":2018},"citing_paper":{"arxiv_id":"2501.02136","last_updated":"2025-01-03T23:03:29Z","snapshot_observed_at":"2026-08-11T12:07:03.048901Z","submitted_at":"2025-01-03T23:03:29Z","title":"Locally computing edge orientations","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T22:29:43.128771Z"},"links":{"citing_paper":"/paper/2501.02136"},"observation_digest":"sha256:9dc752d8a3e3f3ede7a3ba3d4e171ad0725dd5d4cf787503369e301de0b17899","observation_id":"36be74ed-2841-497d-8f3a-6507210cfe97","resolution":{"observed_at":"2026-08-10T22:29:43.441832Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T22:29:43.408723Z","title":"Distributed local approximation al gorithms for maximum matching in graphs and hypergraphs","venue":null,"work_id":"09be2832-8774-4bd0-b962-7c1dd20e3e6e","year":2019},"citing_paper":{"arxiv_id":"2501.02136","last_updated":"2025-01-03T23:03:29Z","snapshot_observed_at":"2026-08-11T12:07:03.048901Z","submitted_at":"2025-01-03T23:03:29Z","title":"Locally computing edge orientations","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T22:29:43.140540Z"},"links":{"citing_paper":"/paper/2501.02136"},"observation_digest":"sha256:ef6bb13c08384c8d934748adf29a9f736e85242366797bd43fdca22802ad6359","observation_id":"a9d8d41a-1002-4c97-9a3d-3ebc87029bb3","resolution":{"observed_at":"2026-08-10T22:29:43.413623Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T22:29:43.395175Z","title":"Polynomial lower bound for distributed graph coloring in a weak local model","venue":null,"work_id":"312f9622-423e-4f0d-b817-312b6e5b207b","year":2016},"citing_paper":{"arxiv_id":"2501.02136","last_updated":"2025-01-03T23:03:29Z","snapshot_observed_at":"2026-08-11T12:07:03.048901Z","submitted_at":"2025-01-03T23:03:29Z","title":"Locally computing edge orientations","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T22:29:43.144397Z"},"links":{"citing_paper":"/paper/2501.02136"},"observation_digest":"sha256:431567eef985ff6f5a15a528edf1610fba611bfab389438c31890f7aa2036426","observation_id":"559f6cef-9ddd-4c61-8352-5c18ffd4c802","resolution":{"observed_at":"2026-08-10T22:29:43.400456Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T22:29:43.380779Z","title":"Local graph partitions for approximation and testing","venue":null,"work_id":"c5492eaa-25e9-4691-94ef-f65d71072b63","year":2009},"citing_paper":{"arxiv_id":"2501.02136","last_updated":"2025-01-03T23:03:29Z","snapshot_observed_at":"2026-08-11T12:07:03.048901Z","submitted_at":"2025-01-03T23:03:29Z","title":"Locally computing edge orientations","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T22:29:43.148651Z"},"links":{"citing_paper":"/paper/2501.02136"},"observation_digest":"sha256:59e8dcf5bf4fc27a5a884fc19dc302a10f63faeaf7e4a633bf7c5847b1e475e5","observation_id":"f2a68378-0599-4144-ab9c-6bcb1985bc38","resolution":{"observed_at":"2026-08-10T22:29:43.385440Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T22:29:43.368321Z","title":"On the local ity of nash-williams forest decomposition and star-forest decomposition","venue":null,"work_id":"db23cee0-8086-42ad-9056-1657f5d81599","year":2021},"citing_paper":{"arxiv_id":"2501.02136","last_updated":"2025-01-03T23:03:29Z","snapshot_observed_at":"2026-08-11T12:07:03.048901Z","submitted_at":"2025-01-03T23:03:29Z","title":"Locally computing edge orientations","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T22:29:43.152770Z"},"links":{"citing_paper":"/paper/2501.02136"},"observation_digest":"sha256:2ef1fcb35f8c545d10abe37e16c3e8d2f45835625dae6f795864010c727a3b6f","observation_id":"50b3b411-f3fb-4c83-a1aa-d29e88ff19e5","resolution":{"observed_at":"2026-08-10T22:29:43.372663Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T22:29:43.352026Z","title":"Orienting dy namic graphs, with applications to maximal matchings and adjacency queries","venue":null,"work_id":"e1fa5593-c65e-4dea-a848-82dc3a633a02","year":2014},"citing_paper":{"arxiv_id":"2501.02136","last_updated":"2025-01-03T23:03:29Z","snapshot_observed_at":"2026-08-11T12:07:03.048901Z","submitted_at":"2025-01-03T23:03:29Z","title":"Locally computing edge orientations","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T22:29:43.156790Z"},"links":{"citing_paper":"/paper/2501.02136"},"observation_digest":"sha256:45c0407f2359042f467d5bcff2b959c9b9c5f669e35ecffafa4b2c397aa4a5fa","observation_id":"d150f572-4466-4119-8ceb-3d04fac02b92","resolution":{"observed_at":"2026-08-10T22:29:43.357401Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1104.1377","last_updated":"2011-04-07T16:55:23Z","snapshot_observed_at":"2026-08-15T04:49:57.298963Z","submitted_at":"2011-04-07T16:55:23Z","title":"Fast Local Computation Algorithms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1104.1377","snapshot_observed_at":"2026-08-10T22:29:43.172626Z","title":"Fast local computation algorithms","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.02136","last_updated":"2025-01-03T23:03:29Z","snapshot_observed_at":"2026-08-11T12:07:03.048901Z","submitted_at":"2025-01-03T23:03:29Z","title":"Locally computing edge orientations","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-10T22:29:43.172626Z"},"links":{"cited_paper":"/paper/1104.1377","citing_paper":"/paper/2501.02136"},"observation_digest":"sha256:15adfb1e56505e75c54fe9622e414298fd29b85d551b291ef60cc3e1b3c483c1","observation_id":"2010ae7f-f134-4648-8afb-16a841678d94","resolution":{"observed_at":"2026-08-10T22:29:43.172626Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.10990","last_updated":"2021-03-19T19:17:14Z","snapshot_observed_at":"2026-08-16T18:37:41.102573Z","submitted_at":"2021-03-19T19:17:14Z","title":"Local Computation Algorithms for Coloring of Uniform Hypergraphs","version":1},"cited_work":{"arxiv_id":"2103.10990","doi":null,"metadata_source":"pith","pith_arxiv_id":"2103.10990","snapshot_observed_at":"2026-08-10T22:29:43.276692Z","title":"Local Computation Algorithms for Coloring of Uniform Hypergraphs","venue":"cs.DS","work_id":"3f7662c6-3135-406e-b914-4b296892d403","year":2021},"citing_paper":{"arxiv_id":"2501.02136","last_updated":"2025-01-03T23:03:29Z","snapshot_observed_at":"2026-08-11T12:07:03.048901Z","submitted_at":"2025-01-03T23:03:29Z","title":"Locally computing edge orientations","version":1},"reference_index":1986,"source":"pdf_text","source_observed_at":"2026-08-10T22:29:43.106208Z"},"links":{"cited_paper":"/paper/2103.10990","citing_paper":"/paper/2501.02136"},"observation_digest":"sha256:4e0635afb5695a928ed1e93565cab1d6434754a5702c59c238f5e5048c811446","observation_id":"56a60a7d-5fd9-441c-88ba-27af634276bd","resolution":{"observed_at":"2026-08-10T22:29:43.280654Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T22:29:43.570850Z","title":"Massively parallel algorithms for small subg raph counting","venue":null,"work_id":"f1b9c5a1-806c-477c-908b-cca9e5d1aa0a","year":2022},"citing_paper":{"arxiv_id":"2501.02136","last_updated":"2025-01-03T23:03:29Z","snapshot_observed_at":"2026-08-11T12:07:03.048901Z","submitted_at":"2025-01-03T23:03:29Z","title":"Locally computing edge orientations","version":1},"reference_index":1991,"source":"pdf_text","source_observed_at":"2026-08-10T22:29:43.074102Z"},"links":{"citing_paper":"/paper/2501.02136"},"observation_digest":"sha256:9ee8ad9781d557b10eb2a4f617b084b3a6bc584226e62c07ceb3e36b3069ad14","observation_id":"2b3efaab-6131-4ff6-af1b-26a7a496e015","resolution":{"observed_at":"2026-08-10T22:29:43.576505Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1705.04840","last_updated":"2017-05-16T09:08:27Z","snapshot_observed_at":"2026-08-16T06:24:30.054665Z","submitted_at":"2017-05-13T14:49:23Z","title":"Sublogarithmic Distributed Algorithms for Lov\\'asz Local lemma, and the Complexity Hierarchy","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1705.04840","snapshot_observed_at":"2026-08-10T22:29:43.117554Z","title":"Sublogarithmic distributed algorithms for lov \\’asz local lemma, and the complexity hierarchy","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.02136","last_updated":"2025-01-03T23:03:29Z","snapshot_observed_at":"2026-08-11T12:07:03.048901Z","submitted_at":"2025-01-03T23:03:29Z","title":"Locally computing edge orientations","version":1},"reference_index":1993,"source":"pdf_text","source_observed_at":"2026-08-10T22:29:43.117554Z"},"links":{"cited_paper":"/paper/1705.04840","citing_paper":"/paper/2501.02136"},"observation_digest":"sha256:298279ed410176c75a4775b828fd1091787b828fb55b598b16704487e229113a","observation_id":"c91c1a52-a880-4af7-b0df-844f19044785","resolution":{"observed_at":"2026-08-10T22:29:43.117554Z","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-10T22:29:43.421950Z","title":"The landscape of distributed complexities on trees and beyond","venue":null,"work_id":"db281bba-ab3e-4e8c-a538-25d4915a2dff","year":2022},"citing_paper":{"arxiv_id":"2501.02136","last_updated":"2025-01-03T23:03:29Z","snapshot_observed_at":"2026-08-11T12:07:03.048901Z","submitted_at":"2025-01-03T23:03:29Z","title":"Locally computing edge orientations","version":1},"reference_index":2006,"source":"pdf_text","source_observed_at":"2026-08-10T22:29:43.136551Z"},"links":{"citing_paper":"/paper/2501.02136"},"observation_digest":"sha256:e47f7ffd6ac0a88b51a84834f3d376db153f4f62c0aae156268dd4eb290eea95","observation_id":"3b208f14-fd47-4d9b-9be4-c8ed075132e3","resolution":{"observed_at":"2026-08-10T22:29:43.426398Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T22:29:43.323211Z","title":"Muthukrishnan, M","venue":null,"work_id":"834f7aa8-0dda-403a-83f4-e4e0f0409359","year":2005},"citing_paper":{"arxiv_id":"2501.02136","last_updated":"2025-01-03T23:03:29Z","snapshot_observed_at":"2026-08-11T12:07:03.048901Z","submitted_at":"2025-01-03T23:03:29Z","title":"Locally computing edge orientations","version":1},"reference_index":2011,"source":"pdf_text","source_observed_at":"2026-08-10T22:29:43.168657Z"},"links":{"citing_paper":"/paper/2501.02136"},"observation_digest":"sha256:9f9de663895902087db6b47dc0b3ba6199255701ed48402349985a9d3610d444","observation_id":"51f98b29-e093-4849-b577-ece2c08ad73e","resolution":{"observed_at":"2026-08-10T22:29:43.328629Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T22:29:43.492366Z","title":"Sub linear random access generators for preferential attachment graphs","venue":null,"work_id":"8bbac822-6165-4e59-bc2e-15f08aea2af6","year":2017},"citing_paper":{"arxiv_id":"2501.02136","last_updated":"2025-01-03T23:03:29Z","snapshot_observed_at":"2026-08-11T12:07:03.048901Z","submitted_at":"2025-01-03T23:03:29Z","title":"Locally computing edge orientations","version":1},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-10T22:29:43.110745Z"},"links":{"citing_paper":"/paper/2501.02136"},"observation_digest":"sha256:afe749e6e3553ce97df08be6fea50c4334b34cca99912f017afc69816b44fbc7","observation_id":"d10a7c6c-bc6f-4f8d-b374-a8feeccea8bf","resolution":{"observed_at":"2026-08-10T22:29:43.498002Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T22:29:43.539315Z","title":"The randomized local compu- tation complexity of the lovász local lemma","venue":null,"work_id":"ca3bf2e6-e86f-461e-835c-7313379b15e1","year":2021},"citing_paper":{"arxiv_id":"2501.02136","last_updated":"2025-01-03T23:03:29Z","snapshot_observed_at":"2026-08-11T12:07:03.048901Z","submitted_at":"2025-01-03T23:03:29Z","title":"Locally computing edge orientations","version":1},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-10T22:29:43.083484Z"},"links":{"citing_paper":"/paper/2501.02136"},"observation_digest":"sha256:f2595651a7dd376847dfb2ec61b27dbcf2538f9c564a5ec9d6b9a78be844fca4","observation_id":"8d07b6cc-c47a-47d9-8538-8192d8461cc5","resolution":{"observed_at":"2026-08-10T22:29:43.546062Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T22:29:43.338639Z","title":"P roperly learning monotone functions via local reconstruction","venue":null,"work_id":"9e7030c3-9b8b-49b3-9782-afca7effe93e","year":2022},"citing_paper":{"arxiv_id":"2501.02136","last_updated":"2025-01-03T23:03:29Z","snapshot_observed_at":"2026-08-11T12:07:03.048901Z","submitted_at":"2025-01-03T23:03:29Z","title":"Locally computing edge orientations","version":1},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-10T22:29:43.164879Z"},"links":{"citing_paper":"/paper/2501.02136"},"observation_digest":"sha256:68f8bb5771478921d7a737f3b2a53546a1b57db1edc81b26a9cc31a36e993359","observation_id":"5a990046-97e0-4a74-8586-a4e886ed5e9a","resolution":{"observed_at":"2026-08-10T22:29:43.343006Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T22:29:43.555929Z","title":"Dynamic re presentations of sparse graphs","venue":null,"work_id":"27476f9a-7257-4423-9ef5-482549ddebbc","year":1999},"citing_paper":{"arxiv_id":"2501.02136","last_updated":"2025-01-03T23:03:29Z","snapshot_observed_at":"2026-08-11T12:07:03.048901Z","submitted_at":"2025-01-03T23:03:29Z","title":"Locally computing edge orientations","version":1},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-10T22:29:43.079333Z"},"links":{"citing_paper":"/paper/2501.02136"},"observation_digest":"sha256:ec6bd0ba58ab7f00e3f4b69714bfd62cda82b86c6d245393e3e7541d8edcb001","observation_id":"f981a35b-df5c-4b29-83a8-b21ec6b56c96","resolution":{"observed_at":"2026-08-10T22:29:43.561219Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T22:29:43.477304Z","title":"Deterministic s tateless centralized local algorithms for bounded degree graphs","venue":null,"work_id":"e7140a6a-b238-4901-84b4-c3d732aa36cf","year":2014},"citing_paper":{"arxiv_id":"2501.02136","last_updated":"2025-01-03T23:03:29Z","snapshot_observed_at":"2026-08-11T12:07:03.048901Z","submitted_at":"2025-01-03T23:03:29Z","title":"Locally computing edge orientations","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-10T22:29:43.114107Z"},"links":{"citing_paper":"/paper/2501.02136"},"observation_digest":"sha256:62bf4c33de412cca2489c1871b825179afba1350aa0114b9b1e02daaca5f668c","observation_id":"29a8adad-144a-42a2-97ea-25642a62988b","resolution":{"observed_at":"2026-08-10T22:29:43.482258Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1512.05411","last_updated":"2015-12-16T23:31:25Z","snapshot_observed_at":"2026-08-14T22:18:10.153123Z","submitted_at":"2015-12-16T23:31:25Z","title":"Non-Local Probes Do Not Help with Graph Problems","version":1},"cited_work":{"arxiv_id":"1512.05411","doi":null,"metadata_source":"pith","pith_arxiv_id":"1512.05411","snapshot_observed_at":"2026-08-10T22:29:43.244999Z","title":"Non-Local Probes Do Not Help with Graph Problems","venue":"cs.DS","work_id":"6b85f2a7-ffad-42b7-aafa-47b941c1c24c","year":2015},"citing_paper":{"arxiv_id":"2501.02136","last_updated":"2025-01-03T23:03:29Z","snapshot_observed_at":"2026-08-11T12:07:03.048901Z","submitted_at":"2025-01-03T23:03:29Z","title":"Locally computing edge orientations","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-10T22:29:43.132227Z"},"links":{"cited_paper":"/paper/1512.05411","citing_paper":"/paper/2501.02136"},"observation_digest":"sha256:a5068110f29dbb320c0a0fd74f2b76e4eec0ec5c220c7c6718c71b08f005feca","observation_id":"6e55eec0-9e83-4feb-92eb-233dd228f795","resolution":{"observed_at":"2026-08-10T22:29:43.250583Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T22:29:43.507280Z","title":"On dynamic α+ 1 arboricity decomposition and out-orientation","venue":null,"work_id":"28a4b818-6542-404e-8c70-d59a41a6f9a7","year":2022},"citing_paper":{"arxiv_id":"2501.02136","last_updated":"2025-01-03T23:03:29Z","snapshot_observed_at":"2026-08-11T12:07:03.048901Z","submitted_at":"2025-01-03T23:03:29Z","title":"Locally computing edge orientations","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-10T22:29:43.102354Z"},"links":{"citing_paper":"/paper/2501.02136"},"observation_digest":"sha256:da6093de05168973ddcf59d70954d8aaa5c67a312e1c1ef0a8cc6fb2d78571fe","observation_id":"359c6f75-8c52-4a00-9659-068eb46c8a95","resolution":{"observed_at":"2026-08-10T22:29:43.516787Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1907.05725","last_updated":"2019-07-12T13:12:45Z","snapshot_observed_at":"2026-08-10T04:06:12.922988Z","submitted_at":"2019-07-12T13:12:45Z","title":"Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples","version":1},"cited_work":{"arxiv_id":"1907.05725","doi":null,"metadata_source":"pith","pith_arxiv_id":"1907.05725","snapshot_observed_at":"2026-08-10T22:29:43.224337Z","title":"Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples","venue":"cs.DS","work_id":"a82437b3-03b5-48d4-9d24-eb4dcb461d8d","year":2019},"citing_paper":{"arxiv_id":"2501.02136","last_updated":"2025-01-03T23:03:29Z","snapshot_observed_at":"2026-08-11T12:07:03.048901Z","submitted_at":"2025-01-03T23:03:29Z","title":"Locally computing edge orientations","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-10T22:29:43.160501Z"},"links":{"cited_paper":"/paper/1907.05725","citing_paper":"/paper/2501.02136"},"observation_digest":"sha256:846a880daed45b9201422cb2739e287c6c5bc280ea12bf279693850bf7a2dc7f","observation_id":"29f12c0b-d0a3-4134-87e4-27e0ac8f1e72","resolution":{"observed_at":"2026-08-10T22:29:43.230985Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1606.07864","last_updated":"2016-06-25T01:40:09Z","snapshot_observed_at":"2026-08-14T21:51:12.767916Z","submitted_at":"2016-06-25T01:40:09Z","title":"Fully Dynamic Spanners with Worst-Case Update Time","version":1},"cited_work":{"arxiv_id":"1606.07864","doi":null,"metadata_source":"pith","pith_arxiv_id":"1606.07864","snapshot_observed_at":"2026-08-10T22:29:43.310066Z","title":"Fully Dynamic Spanners with Worst-Case Update Time","venue":"cs.DS","work_id":"ed82367e-c6f8-4c85-9bb8-02202fe43169","year":2016},"citing_paper":{"arxiv_id":"2501.02136","last_updated":"2025-01-03T23:03:29Z","snapshot_observed_at":"2026-08-11T12:07:03.048901Z","submitted_at":"2025-01-03T23:03:29Z","title":"Locally computing edge orientations","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-10T22:29:43.088787Z"},"links":{"cited_paper":"/paper/1606.07864","citing_paper":"/paper/2501.02136"},"observation_digest":"sha256:9e93d7e3dfbeb7b34492d8d4afbaa89fef360284be4aa17a73fcd8728b4aa052","observation_id":"24457060-2953-4f36-9cd9-52c64a780956","resolution":{"observed_at":"2026-08-10T22:29:43.314044Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1911.05896","last_updated":"2019-11-27T21:10:53Z","snapshot_observed_at":"2026-08-14T06:26:14.806558Z","submitted_at":"2019-11-14T02:15:15Z","title":"Linear Time Subgraph Counting, Graph Degeneracy, and the Chasm at Size Six","version":2},"cited_work":{"arxiv_id":"1911.05896","doi":null,"metadata_source":"pith","pith_arxiv_id":"1911.05896","snapshot_observed_at":"2026-08-10T22:29:43.293794Z","title":"Linear Time Subgraph Counting, Graph Degeneracy, and the Chasm at Size Six","venue":"cs.DS","work_id":"c337e0e9-4485-4b20-82a8-9fb77658b34d","year":2019},"citing_paper":{"arxiv_id":"2501.02136","last_updated":"2025-01-03T23:03:29Z","snapshot_observed_at":"2026-08-11T12:07:03.048901Z","submitted_at":"2025-01-03T23:03:29Z","title":"Locally computing edge orientations","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-10T22:29:43.093552Z"},"links":{"cited_paper":"/paper/1911.05896","citing_paper":"/paper/2501.02136"},"observation_digest":"sha256:42de89ba2cc31ec60e92bea9572b7a15dd7eb9d9def23a0bd7f5b2b5c80dcbcb","observation_id":"25f1243c-f918-46cd-a559-b17a6d42d984","resolution":{"observed_at":"2026-08-10T22:29:43.297531Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.02136","last_updated":"2025-01-03T23:03:29Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-11T12:07:03.048901Z","submitted_at":"2025-01-03T23:03:29Z","title":"Locally computing edge orientations"},"reference_resolution":{"displayed":25,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":5,"verified_fuzzy":18},"total_outbound_references":25},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 0 inbound Pith citation observations for arXiv:2501.02136."}