Pith. sign in

Paper Citation Record · LEDGER

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

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.

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:176f1f8fc75338a18284f2750553b7f46f76b98f4a4acf7bd0cc7019eb9174ca

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:814c9aab05944dcfe82dcfd4e5c83858cd8e1effe4a85aea2f8d0915ffbca24a

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:cdac1c69323e971d2941228e1415c5540ee50a8a12f266f908b474bba1cd72b0

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:5dc1190399ba542521cf3872d97ee596838f83d3f6c77d9d681997a0052f3590

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:f229af7a54611e7b5c3485cacf3b5a4a6a3cb2d0bf2dc533f4fe3c07d703399a

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:50665469142ee638e53b8f5711f35f6ebdd6bf310fa24c043853e0390592090d

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:8b82cd3bc941334245370c95f02913b919f8c9a0ab8392ba1903b6308c21acc9

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:e971e7d75967b8def6cbe4f3721834a7f80681ea5f6126773ac49f2170932e2b

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:acbb5b71b6acfebf391f5be08f0ba74985d73b52b84087f8ec63ff3ef4282321

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:18f75743975cfab596d133a84df9c691b03522829b98be19d9851f534f10adee

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:f24467ccd43f106d64d42111fcdb3697cba59db27cd8403bf296990a35c9c0dc

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:d274d81af1c15e1079d236541ac20cd0ed2adb8621e8b995a4c21dbf976ed79e

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:5688ed8c9330aa22c92f5b1033960a91547be4e9187b59b8c96102954bd398c8

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:39cb9416da24adb34b0825828a9d0d426a20cf862de66b989b0153943bcc2e7b

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:7b2cd75c48905636c26b2e77ddd8be2518db53af48089fbd843b72c513743f80

Pith citing papers

No inbound Pith citation observations are available.