Pith. sign in

Paper Citation Record · LEDGER

A 0.51-Approximation of Maximum Matching in Sublinear $n^{1.5}$ Time

As of 9 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.

pith.paper-citation-record.v1
2506.01669 v1

Coverage vector

measured 15 of 15 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-07T11:55:01.972293Z

measured 15 of 15 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-08T06:32:00.761636+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

15 of 15 outbound references displayed

  • verified exact1
  • verified fuzzy13
  • unresolved1
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 4a5b2158-fb05-42d5-ade6-32694b4cf80d · outbound

This paper cites Fully dynamic match- ing: (2 − √ 2)-approximation in polylog update time.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:55:02.320334Z

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.

source=pdf_text observed=2026-08-07T11:55:00.903264Z digest=sha256:371f898cce5f7fa27e0f916bb5e047597f5b1d73a1ddff11a0c24d928e6b3a47

Observation d9fff52c-369c-4857-a1f2-832ec9551272 · outbound

This paper cites Dynamic matching with better-than-2 approximation in polylogarit hmic update time.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:55:02.212616Z

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.

source=pdf_text observed=2026-08-07T11:55:01.367178Z digest=sha256:15b9d6e84b12197d5a336d60ad46bcda6bc365d30b3acd315ba871b7ae8d383a

Observation f0d8d1d7-a102-4db2-bac0-a5d2e57a3b57 · outbound

This paper cites Local computation algorithms for maximum matching: New lower bounds.

A 0.51-Approximation of Maximum Matching in Sublinear $n^{1.5}$ Time Local computation algorithms for maximum matching: New lower bounds

Reference 7

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:55:02.187849Z

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.

source=pdf_text observed=2026-08-07T11:55:01.455092Z digest=sha256:23700eaab94ba9a6e0327a16fe00d6071f9c65d9ad8d090cd8b15f0029683b36

Observation c9a64019-7eeb-4dee-9159-dd7e86d91cca · outbound

This paper cites Beating greedy matching in sublinear time.

A 0.51-Approximation of Maximum Matching in Sublinear $n^{1.5}$ Time Beating greedy matching in sublinear time

Reference 8

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:55:02.167855Z

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.

source=pdf_text observed=2026-08-07T11:55:01.553558Z digest=sha256:0376bcdd36d9bd1b2861b9648e667b0ffaf977687314ecdafc0dbcc659481cf1

Observation 13936342-7c07-4707-9a5c-994189cf933a · outbound

This paper cites Sublinear Algorithms and Lower Bounds for Metric TSP Cost Estimation.

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

Resolution
verified exact
local_arxiv, observed 2026-08-07T11:55:02.018121Z

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.

source=pdf_text observed=2026-08-07T11:55:01.659984Z digest=sha256:1bd2d9ab308ca7861d61b46017b9b583a10c604b80428a761a9311cbfce68abd

Observation 79389a73-a201-4bfc-958f-089d9528fd40 · outbound

This paper cites an unresolved cited work.

A 0.51-Approximation of Maximum Matching in Sublinear $n^{1.5}$ Time Unresolved cited work

Reference 11

Resolution
unresolved
raw_fallback, observed 2026-08-07T11:55:02.121095Z

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.

source=pdf_text observed=2026-08-07T11:55:01.814897Z digest=sha256:c46ebb8510f0c5571d328057116e99454941a4fcb0e50b47c479f0455b9b9fc5

Observation 1e337fa5-b006-4999-9b66-bf30061b87fa · outbound

This paper cites Fast local computation algorithms.

A 0.51-Approximation of Maximum Matching in Sublinear $n^{1.5}$ Time Fast local computation algorithms

Reference 2007

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:55:02.062743Z

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.

source=pdf_text observed=2026-08-07T11:55:01.959959Z digest=sha256:ddf3021bafd75d7f608c7293b57b122abad28d916a72ded673781d5b86dccd1b

Observation 587113a9-417b-4f59-bbe5-78c818e5adb5 · outbound

This paper cites An im proved constant-time ap- proximation algorithm for maximum matchings.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:55:02.041319Z

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.

source=pdf_text observed=2026-08-07T11:55:01.972293Z digest=sha256:b1019740f25d3040dd680bdbf5c204f8cef3a62d6fe335cb98c63b4524f69bbe

Observation 03f35c0f-f6c6-439d-b94b-d2458425a249 · outbound

This paper cites Time-optimal sublinear algorit hms for matching and vertex cover.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:55:02.273257Z

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.

source=pdf_text observed=2026-08-07T11:55:01.104355Z digest=sha256:9d125cb9ef781f0894600d43b8e4d11255207a9111c7a640a1815ab0d7107f76

Observation 72eadd56-4e97-450c-abbc-f342924fc338 · outbound

This paper cites Sublin- ear Metric Steiner Tree via Improved Bounds for Set Cover.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:55:02.098927Z

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.

source=pdf_text observed=2026-08-07T11:55:01.857992Z digest=sha256:31bfbc1a0113153ce2993c8123aa86fb4d0f1ee138a4ce2cb98c1efdd7a46137

Observation 3e960b82-a8ed-46d9-aed8-1809bc9db9e2 · outbound

This paper cites Local computation of maximal indepe ndent set.

A 0.51-Approximation of Maximum Matching in Sublinear $n^{1.5}$ Time Local computation of maximal indepe ndent set

Reference 2020

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:55:02.146396Z

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.

source=pdf_text observed=2026-08-07T11:55:01.735934Z digest=sha256:9eae09c1dc607bbaa29eee60a9d8ee828e5913232cf28674197dfd13d088af90

Observation bf5f496d-0631-4b0c-8bb0-f0d9b330694a · outbound

This paper cites Dynamic algorithms for maximum m atching size.

A 0.51-Approximation of Maximum Matching in Sublinear $n^{1.5}$ Time Dynamic algorithms for maximum m atching size

Reference 2021

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:55:02.252133Z

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.

source=pdf_text observed=2026-08-07T11:55:01.188773Z digest=sha256:686f446217fb6766b7eaec3615b076a828e1a26708ff59a5b4dcf3e3be1e71f1

Observation d13900e0-6b46-40e1-bf14-1845cb474684 · outbound

This paper cites Dynamic (1 + ε)- approximate matching size in truly sublinear update time.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:55:02.234294Z

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.

source=pdf_text observed=2026-08-07T11:55:01.257320Z digest=sha256:0a5a05797ca8732b5f4e4e08e9a5f5a84913e1fedde99f75967f81ab5beb5161

Observation 013f81f0-44f8-4c5e-873d-bf29cb6f5e8a · outbound

This paper cites Space-Efficient Local Com- putation Algorithms.

A 0.51-Approximation of Maximum Matching in Sublinear $n^{1.5}$ Time Space-Efficient Local Com- putation Algorithms

Reference 2024

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:55:02.297329Z

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.

source=pdf_text observed=2026-08-07T11:55:00.978237Z digest=sha256:306337e8b45ae2ffae9a1ce60f4d694cc715408f7cbb16a02c1d5a6336c714ab

Observation 4896a175-3bbc-4e4f-8740-3ab80f7b349c · outbound

This paper cites [NO08] Huy N Nguyen and Krzysztof Onak.

A 0.51-Approximation of Maximum Matching in Sublinear $n^{1.5}$ Time [NO08] Huy N Nguyen and Krzysztof Onak

Reference 2025

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:55:02.082169Z

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.

source=pdf_text observed=2026-08-07T11:55:01.908455Z digest=sha256:ada19ab145f4936d612b25a96cf2d00836abf1fe69597455ad4126df5f4aa136

Pith citing papers

No inbound Pith citation observations are available.