Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-07T11:55:01.972293Z
Paper Citation Record · LEDGER
As of 8 August 2026, this Paper Citation Record lists 15 of 15 outbound references and 0 inbound Pith citation observations for arXiv:2506.01669.
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-07T11:55:01.972293Z
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-08T06:32:00.761636+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
15 of 15 outbound references displayed
External citation measurements
No source-named external measurement is stored.
Observation 4a5b2158-fb05-42d5-ade6-32694b4cf80d · outbound
A 0.51-Approximation of Maximum Matching in Sublinear $n^{1.5}$ Time Fully dynamic match- ing: (2 − √ 2)-approximation in polylog update time
Reference 1
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation d9fff52c-369c-4857-a1f2-832ec9551272 · outbound
A 0.51-Approximation of Maximum Matching in Sublinear $n^{1.5}$ Time Dynamic matching with better-than-2 approximation in polylogarit hmic update time
Reference 6
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation f0d8d1d7-a102-4db2-bac0-a5d2e57a3b57 · outbound
A 0.51-Approximation of Maximum Matching in Sublinear $n^{1.5}$ Time Local computation algorithms for maximum matching: New lower bounds
Reference 7
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation c9a64019-7eeb-4dee-9159-dd7e86d91cca · outbound
A 0.51-Approximation of Maximum Matching in Sublinear $n^{1.5}$ Time Beating greedy matching in sublinear time
Reference 8
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation 13936342-7c07-4707-9a5c-994189cf933a · outbound
A 0.51-Approximation of Maximum Matching in Sublinear $n^{1.5}$ Time Sublinear Algorithms and Lower Bounds for Metric TSP Cost Estimation
Reference 9
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation 79389a73-a201-4bfc-958f-089d9528fd40 · outbound
A 0.51-Approximation of Maximum Matching in Sublinear $n^{1.5}$ Time Unresolved cited work
Reference 11
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation 1e337fa5-b006-4999-9b66-bf30061b87fa · outbound
A 0.51-Approximation of Maximum Matching in Sublinear $n^{1.5}$ Time Fast local computation algorithms
Reference 2007
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation 587113a9-417b-4f59-bbe5-78c818e5adb5 · outbound
A 0.51-Approximation of Maximum Matching in Sublinear $n^{1.5}$ Time An im proved constant-time ap- proximation algorithm for maximum matchings
Reference 2011
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation 03f35c0f-f6c6-439d-b94b-d2458425a249 · outbound
A 0.51-Approximation of Maximum Matching in Sublinear $n^{1.5}$ Time Time-optimal sublinear algorit hms for matching and vertex cover
Reference 2012
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation 72eadd56-4e97-450c-abbc-f342924fc338 · outbound
A 0.51-Approximation of Maximum Matching in Sublinear $n^{1.5}$ Time Sublin- ear Metric Steiner Tree via Improved Bounds for Set Cover
Reference 2017
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation 3e960b82-a8ed-46d9-aed8-1809bc9db9e2 · outbound
A 0.51-Approximation of Maximum Matching in Sublinear $n^{1.5}$ Time Local computation of maximal indepe ndent set
Reference 2020
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation bf5f496d-0631-4b0c-8bb0-f0d9b330694a · outbound
A 0.51-Approximation of Maximum Matching in Sublinear $n^{1.5}$ Time Dynamic algorithms for maximum m atching size
Reference 2021
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation d13900e0-6b46-40e1-bf14-1845cb474684 · outbound
A 0.51-Approximation of Maximum Matching in Sublinear $n^{1.5}$ Time Dynamic (1 + ε)- approximate matching size in truly sublinear update time
Reference 2023
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation 013f81f0-44f8-4c5e-873d-bf29cb6f5e8a · outbound
A 0.51-Approximation of Maximum Matching in Sublinear $n^{1.5}$ Time Space-Efficient Local Com- putation Algorithms
Reference 2024
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation 4896a175-3bbc-4e4f-8740-3ab80f7b349c · outbound
A 0.51-Approximation of Maximum Matching in Sublinear $n^{1.5}$ Time [NO08] Huy N Nguyen and Krzysztof Onak
Reference 2025
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
No inbound Pith citation observations are available.