{"as_of":"2026-08-08T11:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:890bd63eabe1da1e20f77c0d345752fbbf5ebf7dbb5b23485d2f2dd4944c2aab","coverage":[{"denominator":15,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":15,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T11:55:01.972293Z","state":"measured"},{"denominator":15,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":15,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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/2506.01669/citation-record","integrity":"/paper/2506.01669/integrity","json":"/paper/2506.01669/citation-record.json","paper":"/paper/2506.01669"},"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-07T11:55:02.309244Z","title":"Fully dynamic match- ing: (2 − √ 2)-approximation in polylog update time","venue":null,"work_id":"d91271a1-677f-4c2a-b6f4-3a308ae3580f","year":2024},"citing_paper":{"arxiv_id":"2506.01669","last_updated":"2025-06-02T13:38:55Z","snapshot_observed_at":"2026-08-07T11:33:53.467538Z","submitted_at":"2025-06-02T13:38:55Z","title":"A 0.51-Approximation of Maximum Matching in Sublinear $n^{1.5}$ Time","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T11:55:00.903264Z"},"links":{"citing_paper":"/paper/2506.01669"},"observation_digest":"sha256:176f1f8fc75338a18284f2750553b7f46f76b98f4a4acf7bd0cc7019eb9174ca","observation_id":"4a5b2158-fb05-42d5-ade6-32694b4cf80d","resolution":{"observed_at":"2026-08-07T11:55:02.320334Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:55:02.201124Z","title":"Dynamic matching with better-than-2 approximation in polylogarit hmic update time","venue":null,"work_id":"0f56cde1-4809-43a9-85c5-989038dc88dd","year":2023},"citing_paper":{"arxiv_id":"2506.01669","last_updated":"2025-06-02T13:38:55Z","snapshot_observed_at":"2026-08-07T11:33:53.467538Z","submitted_at":"2025-06-02T13:38:55Z","title":"A 0.51-Approximation of Maximum Matching in Sublinear $n^{1.5}$ Time","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T11:55:01.367178Z"},"links":{"citing_paper":"/paper/2506.01669"},"observation_digest":"sha256:814c9aab05944dcfe82dcfd4e5c83858cd8e1effe4a85aea2f8d0915ffbca24a","observation_id":"d9fff52c-369c-4857-a1f2-832ec9551272","resolution":{"observed_at":"2026-08-07T11:55:02.212616Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:55:02.179244Z","title":"Local computation algorithms for maximum matching: New lower bounds","venue":null,"work_id":"bbafed6b-6404-4e4b-8b71-01a170b60047","year":2023},"citing_paper":{"arxiv_id":"2506.01669","last_updated":"2025-06-02T13:38:55Z","snapshot_observed_at":"2026-08-07T11:33:53.467538Z","submitted_at":"2025-06-02T13:38:55Z","title":"A 0.51-Approximation of Maximum Matching in Sublinear $n^{1.5}$ Time","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T11:55:01.455092Z"},"links":{"citing_paper":"/paper/2506.01669"},"observation_digest":"sha256:cdac1c69323e971d2941228e1415c5540ee50a8a12f266f908b474bba1cd72b0","observation_id":"f0d8d1d7-a102-4db2-bac0-a5d2e57a3b57","resolution":{"observed_at":"2026-08-07T11:55:02.187849Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:55:02.158501Z","title":"Beating greedy matching in sublinear time","venue":null,"work_id":"b0700527-5e9b-4494-a6e6-2ddca0594ee0","year":2023},"citing_paper":{"arxiv_id":"2506.01669","last_updated":"2025-06-02T13:38:55Z","snapshot_observed_at":"2026-08-07T11:33:53.467538Z","submitted_at":"2025-06-02T13:38:55Z","title":"A 0.51-Approximation of Maximum Matching in Sublinear $n^{1.5}$ Time","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T11:55:01.553558Z"},"links":{"citing_paper":"/paper/2506.01669"},"observation_digest":"sha256:5dc1190399ba542521cf3872d97ee596838f83d3f6c77d9d681997a0052f3590","observation_id":"c9a64019-7eeb-4dee-9159-dd7e86d91cca","resolution":{"observed_at":"2026-08-07T11:55:02.167855Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.05490","last_updated":"2020-06-09T20:08:09Z","snapshot_observed_at":"2026-07-06T09:27:28.721506Z","submitted_at":"2020-06-09T20:08:09Z","title":"Sublinear Algorithms and Lower Bounds for Metric TSP Cost Estimation","version":1},"cited_work":{"arxiv_id":"2006.05490","doi":null,"metadata_source":"pith","pith_arxiv_id":"2006.05490","snapshot_observed_at":"2026-08-07T11:55:02.005262Z","title":"Sublinear Algorithms and Lower Bounds for Metric TSP Cost Estimation","venue":"cs.DS","work_id":"d54bc496-1ebc-49f6-847a-4df696a184b1","year":2020},"citing_paper":{"arxiv_id":"2506.01669","last_updated":"2025-06-02T13:38:55Z","snapshot_observed_at":"2026-08-07T11:33:53.467538Z","submitted_at":"2025-06-02T13:38:55Z","title":"A 0.51-Approximation of Maximum Matching in Sublinear $n^{1.5}$ Time","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T11:55:01.659984Z"},"links":{"cited_paper":"/paper/2006.05490","citing_paper":"/paper/2506.01669"},"observation_digest":"sha256:f229af7a54611e7b5c3485cacf3b5a4a6a3cb2d0bf2dc533f4fe3c07d703399a","observation_id":"13936342-7c07-4707-9a5c-994189cf933a","resolution":{"observed_at":"2026-08-07T11:55:02.018121Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:55:02.110000Z","title":null,"venue":null,"work_id":"e2b406ed-2bcf-4e3e-bd33-53a25b411ac9","year":2021},"citing_paper":{"arxiv_id":"2506.01669","last_updated":"2025-06-02T13:38:55Z","snapshot_observed_at":"2026-08-07T11:33:53.467538Z","submitted_at":"2025-06-02T13:38:55Z","title":"A 0.51-Approximation of Maximum Matching in Sublinear $n^{1.5}$ Time","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T11:55:01.814897Z"},"links":{"citing_paper":"/paper/2506.01669"},"observation_digest":"sha256:50665469142ee638e53b8f5711f35f6ebdd6bf310fa24c043853e0390592090d","observation_id":"79389a73-a201-4bfc-958f-089d9528fd40","resolution":{"observed_at":"2026-08-07T11:55:02.121095Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:55:02.053366Z","title":"Fast local computation algorithms","venue":null,"work_id":"62c60a3e-cc96-4744-a227-efa061305852","year":2011},"citing_paper":{"arxiv_id":"2506.01669","last_updated":"2025-06-02T13:38:55Z","snapshot_observed_at":"2026-08-07T11:33:53.467538Z","submitted_at":"2025-06-02T13:38:55Z","title":"A 0.51-Approximation of Maximum Matching in Sublinear $n^{1.5}$ Time","version":1},"reference_index":2007,"source":"pdf_text","source_observed_at":"2026-08-07T11:55:01.959959Z"},"links":{"citing_paper":"/paper/2506.01669"},"observation_digest":"sha256:8b82cd3bc941334245370c95f02913b919f8c9a0ab8392ba1903b6308c21acc9","observation_id":"1e337fa5-b006-4999-9b66-bf30061b87fa","resolution":{"observed_at":"2026-08-07T11:55:02.062743Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:55:02.031725Z","title":"An im proved constant-time ap- proximation algorithm for maximum matchings","venue":null,"work_id":"b09953cb-d3c5-4a61-b609-621ad21f6350","year":2009},"citing_paper":{"arxiv_id":"2506.01669","last_updated":"2025-06-02T13:38:55Z","snapshot_observed_at":"2026-08-07T11:33:53.467538Z","submitted_at":"2025-06-02T13:38:55Z","title":"A 0.51-Approximation of Maximum Matching in Sublinear $n^{1.5}$ Time","version":1},"reference_index":2011,"source":"pdf_text","source_observed_at":"2026-08-07T11:55:01.972293Z"},"links":{"citing_paper":"/paper/2506.01669"},"observation_digest":"sha256:e971e7d75967b8def6cbe4f3721834a7f80681ea5f6126773ac49f2170932e2b","observation_id":"587113a9-417b-4f59-bbe5-78c818e5adb5","resolution":{"observed_at":"2026-08-07T11:55:02.041319Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:55:02.264574Z","title":"Time-optimal sublinear algorit hms for matching and vertex cover","venue":null,"work_id":"6d992062-93a6-4332-a188-12f05ea48845","year":2021},"citing_paper":{"arxiv_id":"2506.01669","last_updated":"2025-06-02T13:38:55Z","snapshot_observed_at":"2026-08-07T11:33:53.467538Z","submitted_at":"2025-06-02T13:38:55Z","title":"A 0.51-Approximation of Maximum Matching in Sublinear $n^{1.5}$ Time","version":1},"reference_index":2012,"source":"pdf_text","source_observed_at":"2026-08-07T11:55:01.104355Z"},"links":{"citing_paper":"/paper/2506.01669"},"observation_digest":"sha256:acbb5b71b6acfebf391f5be08f0ba74985d73b52b84087f8ec63ff3ef4282321","observation_id":"03f35c0f-f6c6-439d-b94b-d2458425a249","resolution":{"observed_at":"2026-08-07T11:55:02.273257Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:55:02.092414Z","title":"Sublin- ear Metric Steiner Tree via Improved Bounds for Set Cover","venue":null,"work_id":"fafecb3a-435d-41a5-be12-3ac893f5625f","year":2025},"citing_paper":{"arxiv_id":"2506.01669","last_updated":"2025-06-02T13:38:55Z","snapshot_observed_at":"2026-08-07T11:33:53.467538Z","submitted_at":"2025-06-02T13:38:55Z","title":"A 0.51-Approximation of Maximum Matching in Sublinear $n^{1.5}$ Time","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-07T11:55:01.857992Z"},"links":{"citing_paper":"/paper/2506.01669"},"observation_digest":"sha256:18f75743975cfab596d133a84df9c691b03522829b98be19d9851f534f10adee","observation_id":"72eadd56-4e97-450c-abbc-f342924fc338","resolution":{"observed_at":"2026-08-07T11:55:02.098927Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:55:02.132467Z","title":"Local computation of maximal indepe ndent set","venue":null,"work_id":"094ac30f-24e0-4eb2-9289-6cd2a9826c8a","year":2022},"citing_paper":{"arxiv_id":"2506.01669","last_updated":"2025-06-02T13:38:55Z","snapshot_observed_at":"2026-08-07T11:33:53.467538Z","submitted_at":"2025-06-02T13:38:55Z","title":"A 0.51-Approximation of Maximum Matching in Sublinear $n^{1.5}$ Time","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-07T11:55:01.735934Z"},"links":{"citing_paper":"/paper/2506.01669"},"observation_digest":"sha256:f24467ccd43f106d64d42111fcdb3697cba59db27cd8403bf296990a35c9c0dc","observation_id":"3e960b82-a8ed-46d9-aed8-1809bc9db9e2","resolution":{"observed_at":"2026-08-07T11:55:02.146396Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:55:02.246862Z","title":"Dynamic algorithms for maximum m atching size","venue":null,"work_id":"b0b7e3f7-d1c8-4c62-b841-aa2809064108","year":2023},"citing_paper":{"arxiv_id":"2506.01669","last_updated":"2025-06-02T13:38:55Z","snapshot_observed_at":"2026-08-07T11:33:53.467538Z","submitted_at":"2025-06-02T13:38:55Z","title":"A 0.51-Approximation of Maximum Matching in Sublinear $n^{1.5}$ Time","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-07T11:55:01.188773Z"},"links":{"citing_paper":"/paper/2506.01669"},"observation_digest":"sha256:d274d81af1c15e1079d236541ac20cd0ed2adb8621e8b995a4c21dbf976ed79e","observation_id":"bf5f496d-0631-4b0c-8bb0-f0d9b330694a","resolution":{"observed_at":"2026-08-07T11:55:02.252133Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:55:02.224995Z","title":"Dynamic (1 + ε)- approximate matching size in truly sublinear update time","venue":null,"work_id":"49a90bd7-1307-4a88-9be7-ffce7baec1e1","year":2023},"citing_paper":{"arxiv_id":"2506.01669","last_updated":"2025-06-02T13:38:55Z","snapshot_observed_at":"2026-08-07T11:33:53.467538Z","submitted_at":"2025-06-02T13:38:55Z","title":"A 0.51-Approximation of Maximum Matching in Sublinear $n^{1.5}$ Time","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-07T11:55:01.257320Z"},"links":{"citing_paper":"/paper/2506.01669"},"observation_digest":"sha256:5688ed8c9330aa22c92f5b1033960a91547be4e9187b59b8c96102954bd398c8","observation_id":"d13900e0-6b46-40e1-bf14-1845cb474684","resolution":{"observed_at":"2026-08-07T11:55:02.234294Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:55:02.286648Z","title":"Space-Efficient Local Com- putation Algorithms","venue":null,"work_id":"549ba255-9239-4a0b-a4ed-0f8801e8cbff","year":2012},"citing_paper":{"arxiv_id":"2506.01669","last_updated":"2025-06-02T13:38:55Z","snapshot_observed_at":"2026-08-07T11:33:53.467538Z","submitted_at":"2025-06-02T13:38:55Z","title":"A 0.51-Approximation of Maximum Matching in Sublinear $n^{1.5}$ Time","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-07T11:55:00.978237Z"},"links":{"citing_paper":"/paper/2506.01669"},"observation_digest":"sha256:39cb9416da24adb34b0825828a9d0d426a20cf862de66b989b0153943bcc2e7b","observation_id":"013f81f0-44f8-4c5e-873d-bf29cb6f5e8a","resolution":{"observed_at":"2026-08-07T11:55:02.297329Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:55:02.075154Z","title":"[NO08] Huy N Nguyen and Krzysztof Onak","venue":null,"work_id":"44812ebe-66e0-4a52-8ef3-c36faccb4370","year":2008},"citing_paper":{"arxiv_id":"2506.01669","last_updated":"2025-06-02T13:38:55Z","snapshot_observed_at":"2026-08-07T11:33:53.467538Z","submitted_at":"2025-06-02T13:38:55Z","title":"A 0.51-Approximation of Maximum Matching in Sublinear $n^{1.5}$ Time","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-07T11:55:01.908455Z"},"links":{"citing_paper":"/paper/2506.01669"},"observation_digest":"sha256:7b2cd75c48905636c26b2e77ddd8be2518db53af48089fbd843b72c513743f80","observation_id":"4896a175-3bbc-4e4f-8740-3ab80f7b349c","resolution":{"observed_at":"2026-08-07T11:55:02.082169Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.01669","last_updated":"2025-06-02T13:38:55Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-07T11:33:53.467538Z","submitted_at":"2025-06-02T13:38:55Z","title":"A 0.51-Approximation of Maximum Matching in Sublinear $n^{1.5}$ Time"},"reference_resolution":{"displayed":15,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":1,"verified_fuzzy":13},"total_outbound_references":15},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"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."}