Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-10T22:29:43.172626Z
Paper Citation Record · LEDGER
As of 11 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 0 inbound Pith citation observations for arXiv:2501.02136.
A citation records a reference. It does not transfer a finding from one paper to another.
Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-10T22:29:43.172626Z
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-11T06:34:44.6726+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links
A source-named dated measurement, never combined with another source.
Source: cited_works
25 of 25 outbound references displayed
External citation measurements
No source-named external measurement is stored.
Observation a2eb2dc4-b02f-4b66-a966-dda709b4c549 · outbound
Locally computing edge orientations In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing , pages 471–480,
Reference 1
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation 34f43f4e-d7af-44bb-959b-cdc0890458ac · outbound
Locally computing edge orientations D eterministic distributed edge- coloring via hypergraph maximal matching
Reference 12
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation 36f8d48c-1c8b-4a8d-849f-aa0b1921e38b · outbound
Locally computing edge orientations Local computation of maximal indep endent set
Reference 13
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation 36be74ed-2841-497d-8f3a-6507210cfe97 · outbound
Locally computing edge orientations On d erandomizing local distributed algorithms
Reference 14
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation a9d8d41a-1002-4c97-9a3d-3ebc87029bb3 · outbound
Locally computing edge orientations Distributed local approximation al gorithms for maximum matching in graphs and hypergraphs
Reference 17
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation 559f6cef-9ddd-4c61-8352-5c18ffd4c802 · outbound
Locally computing edge orientations Polynomial lower bound for distributed graph coloring in a weak local model
Reference 18
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation f2a68378-0599-4144-ab9c-6bcb1985bc38 · outbound
Locally computing edge orientations Local graph partitions for approximation and testing
Reference 19
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation 50b3b411-f3fb-4c83-a1aa-d29e88ff19e5 · outbound
Locally computing edge orientations On the local ity of nash-williams forest decomposition and star-forest decomposition
Reference 20
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation d150f572-4466-4119-8ceb-3d04fac02b92 · outbound
Locally computing edge orientations Orienting dy namic graphs, with applications to maximal matchings and adjacency queries
Reference 21
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation 2010ae7f-f134-4648-8afb-16a841678d94 · outbound
Locally computing edge orientations Fast Local Computation Algorithms
Reference 25
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 56a60a7d-5fd9-441c-88ba-27af634276bd · outbound
Locally computing edge orientations Local Computation Algorithms for Coloring of Uniform Hypergraphs
Reference 1986
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation 2b3efaab-6131-4ff6-af1b-26a7a496e015 · outbound
Locally computing edge orientations Massively parallel algorithms for small subg raph counting
Reference 1991
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation c91c1a52-a880-4af7-b0df-844f19044785 · outbound
Locally computing edge orientations Sublogarithmic Distributed Algorithms for Lov\'asz Local lemma, and the Complexity Hierarchy
Reference 1993
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 3b208f14-fd47-4d9b-9be4-c8ed075132e3 · outbound
Locally computing edge orientations The landscape of distributed complexities on trees and beyond
Reference 2006
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation 51f98b29-e093-4849-b577-ece2c08ad73e · outbound
Locally computing edge orientations Muthukrishnan, M
Reference 2011
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation d10a7c6c-bc6f-4f8d-b374-a8feeccea8bf · outbound
Locally computing edge orientations Sub linear random access generators for preferential attachment graphs
Reference 2013
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation 8d07b6cc-c47a-47d9-8538-8192d8461cc5 · outbound
Locally computing edge orientations The randomized local compu- tation complexity of the lovász local lemma
Reference 2014
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation 5a990046-97e0-4a74-8586-a4e886ed5e9a · outbound
Locally computing edge orientations P roperly learning monotone functions via local reconstruction
Reference 2015
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation f981a35b-df5c-4b29-83a8-b21ec6b56c96 · outbound
Locally computing edge orientations Dynamic re presentations of sparse graphs
Reference 2016
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation 29a8adad-144a-42a2-97ea-25642a62988b · outbound
Locally computing edge orientations Deterministic s tateless centralized local algorithms for bounded degree graphs
Reference 2017
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation 6e55eec0-9e83-4feb-92eb-233dd228f795 · outbound
Locally computing edge orientations Non-Local Probes Do Not Help with Graph Problems
Reference 2018
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation 359c6f75-8c52-4a00-9659-068eb46c8a95 · outbound
Locally computing edge orientations On dynamic α+ 1 arboricity decomposition and out-orientation
Reference 2019
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation 29f12c0b-d0a3-4134-87e4-27e0ac8f1e72 · outbound
Locally computing edge orientations Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples
Reference 2020
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation 24457060-2953-4f36-9cd9-52c64a780956 · outbound
Locally computing edge orientations Fully Dynamic Spanners with Worst-Case Update Time
Reference 2021
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation 25f1243c-f918-46cd-a559-b17a6d42d984 · outbound
Locally computing edge orientations Linear Time Subgraph Counting, Graph Degeneracy, and the Chasm at Size Six
Reference 2022
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
No inbound Pith citation observations are available.