{"as_of":"2026-08-23T14:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7da4ee66a55c9bc78755c9562d352e355103e25c2dd2c4457179a3381e732db8","coverage":[{"denominator":114,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T05:32:49.362283Z","state":"measured"},{"denominator":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+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/2504.20780/citation-record","integrity":"/paper/2504.20780/integrity","json":"/paper/2504.20780/citation-record.json","paper":"/paper/2504.20780"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:32:48.843593Z","title":"Towards a unified theory of sparsification for matching problems","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:48.843593Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:0f211edb3e150b562d7e8fe5f8eede8240c823a2b94cc867e5d4ff6ee4c54a5d","observation_id":"9f35b842-38a6-41f9-bf15-42a2b999a749","resolution":{"observed_at":"2026-08-16T05:32:48.843593Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:32:48.850177Z","title":"Robust communication complexity of matching: Edcs achieves 5/6 approximation","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:48.850177Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:fbc793165871093253ba7f924ce2beb4a6d7a8bb91e9c39a1ed8dbe0f2deecbd","observation_id":"705ad523-1299-4151-a1e9-f03ed0ddd505","resolution":{"observed_at":"2026-08-16T05:32:48.850177Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:32:48.855507Z","title":"Coresets meet edcs: algorithms for matching and vertex cover on massive graphs","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:48.855507Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:1795e2e53ee863b64b6c7b513466fa9fcec79a3b3ac2948dbb1559e8c3eaa7d9","observation_id":"71a00c25-5253-4059-bd60-723eec86ef08","resolution":{"observed_at":"2026-08-16T05:32:48.855507Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:32:48.860946Z","title":"Mirrokni, and Cliff Stein","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:48.860946Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:8233ba19b97cf819d95270bf9bf349df94eb93f825bcc1c6858967465bb16939","observation_id":"1f419e68-011f-4433-8c2e-487e803b3df7","resolution":{"observed_at":"2026-08-16T05:32:48.860946Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:32:48.867046Z","title":"Decremental matching in general graphs","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:48.867046Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:633000d3e1c3c0a0fcea75f7060c63b48164610397eb3389dbe0180c015236e4","observation_id":"9dbd7ba5-b64c-4116-9156-5171cf37938f","resolution":{"observed_at":"2026-08-16T05:32:48.867046Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:32:48.872695Z","title":"A fast and simple randomized parallel algorithm for the maximal independent set problem","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:48.872695Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:8b52fc37e54847a71965bdd568453c8e78c6ce88267d5b8807b99d028cf49073","observation_id":"045ed53d-e312-4503-a769-69697c2a58b3","resolution":{"observed_at":"2026-08-16T05:32:48.872695Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:32:48.879587Z","title":"On regularity lemma and barriers in streaming and dynamic matching","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:48.879587Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:46e50f9ab75e23b9ab63dd6b2878e4094ab6a66547f06f8bf470e79f15a2e0aa","observation_id":"ed89b215-0248-4133-b171-20303ce9e01f","resolution":{"observed_at":"2026-08-16T05:32:48.879587Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:32:48.885973Z","title":"Fully dynamic matching: (2- 2 ) -approximation in polylog update time","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:48.885973Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:f177457d8797d377d585b96eceac8bbb2fc3b0737d2f0107b649e24e5575094e","observation_id":"7538b660-c2d2-4d42-99d3-100556af71c1","resolution":{"observed_at":"2026-08-16T05:32:48.885973Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:32:48.891141Z","title":"Dynamic matching: Reducing integral algorithms to approximately-maximal fractional algorithms","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:48.891141Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:7df8f54bfe4ebb4ed33ebebd1d4ce6551fe37c74d33088197407929a0cacb9b3","observation_id":"cda52149-ac22-4b39-80cb-11f6c9430441","resolution":{"observed_at":"2026-08-16T05:32:48.891141Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:32:48.896678Z","title":"Extreme values of the stationary distribution of random walks on directed graphs","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:48.896678Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:c85ccb29e2d2093fc161258614f94b80c57b9a77d34d1a5e0f2c354132107910","observation_id":"e50252df-a5cb-4d60-99f3-fa05c3b7fd62","resolution":{"observed_at":"2026-08-16T05:32:48.896678Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:32:48.901955Z","title":"Network decomposition and locality in distributed computation","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:48.901955Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:16385214bdb91c6dec8ce224c0e6b7864aa4dabffd1ba33d705a2bb0623cc30b","observation_id":"304b331b-3d83-423f-acab-fd7b95efcaef","resolution":{"observed_at":"2026-08-16T05:32:48.901955Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:32:48.907064Z","title":"The stochastic matching problem with (very) few queries","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:48.907064Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:04c42814e2ad681feda6b9718b2b514928fbd88617fd0c54528d0f2a6d2f3625","observation_id":"f2171f62-a824-4d8c-a8f2-7db674ec7eaf","resolution":{"observed_at":"2026-08-16T05:32:48.907064Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:32:48.912166Z","title":"Breaking the cubic barrier for all-pairs max-flow: Gomory-hu tree in nearly quadratic time","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:48.912166Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:3fa14c4c1e5ea7ea48ec04cca103142230a8ba00f7aa1d20a82dcc53fe84abd4","observation_id":"d7801466-40ff-4a23-931f-5130d2d84c4a","resolution":{"observed_at":"2026-08-16T05:32:48.912166Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:32:48.917086Z","title":"All-pairs max-flow is no harder than single-pair max-flow: Gomory-hu trees in almost-linear time","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:48.917086Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:02c1c8bae8b894dfadaef2023f35c60d6da77bba91f909c4cfe7d2d1b9eb49f3","observation_id":"fea135b6-1f9b-48aa-8274-1fc23c6d5342","resolution":{"observed_at":"2026-08-16T05:32:48.917086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.13371","last_updated":"2024-05-22T06:14:59Z","snapshot_observed_at":"2026-08-16T13:50:44.602107Z","submitted_at":"2024-05-22T06:14:59Z","title":"Faster Vizing and Near-Vizing Edge Coloring Algorithms","version":1},"cited_work":{"arxiv_id":"2405.13371","doi":null,"metadata_source":"pith","pith_arxiv_id":"2405.13371","snapshot_observed_at":"2026-08-16T05:32:49.740707Z","title":"Faster Vizing and Near-Vizing Edge Coloring Algorithms","venue":"cs.DS","work_id":"752035d9-189b-4a9a-bf6d-e14121285ffc","year":2024},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:48.922251Z"},"links":{"cited_paper":"/paper/2405.13371","citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:4600eb04aafcc914a8b94a4d59801ffe7ba5aeee5a6d1237e91eb7ea16865553","observation_id":"209bbf31-381a-4979-a968-0b27882f0dcd","resolution":{"observed_at":"2026-08-16T05:32:49.746126Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2004.08432","last_updated":"2020-11-10T09:27:32Z","snapshot_observed_at":"2026-08-14T23:39:54.419483Z","submitted_at":"2020-04-17T19:51:47Z","title":"Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.08432","snapshot_observed_at":"2026-08-16T05:32:48.927587Z","title":"Fully-dynamic graph sparsifiers against an adaptive adversary","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:48.927587Z"},"links":{"cited_paper":"/paper/2004.08432","citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:674cb8faf2f42e8b524101fe54166942c83a56d252a67990d49de4de470cdb52","observation_id":"6611cc94-1805-4d1c-b5a0-04d81e2265e0","resolution":{"observed_at":"2026-08-16T05:32:48.927587Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:32:48.932884Z","title":"Lower bounds for maximal matchings and maximal independent sets","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:48.932884Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:ee848061e8366c328fce2378a70852e0b6ef031241b098639d370dc1b30719e9","observation_id":"1224f2fa-2fea-42cc-bfb4-638d255f35c5","resolution":{"observed_at":"2026-08-16T05:32:48.932884Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:32:48.939714Z","title":"Deterministic decremental single source shortest paths: beyond the o (mn) bound","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:48.939714Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:bcadecd73970021c72cf83b9fd322f48b4001ee7ab96548cbbd8d0d16f6ad1de","observation_id":"b59354a7-661b-4c14-a230-a7f9e58f1cf0","resolution":{"observed_at":"2026-08-16T05:32:48.939714Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:32:48.944804Z","title":"Deterministic partially dynamic single source shortest paths for sparse graphs","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:48.944804Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:7bc6f61ee9d350ced1aefeadaf3055d7bc637e8aca1ce9a78b593bd20abe04b2","observation_id":"901a31b3-4e28-42c7-8968-11956b594e87","resolution":{"observed_at":"2026-08-16T05:32:48.944804Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.18936","last_updated":"2026-07-18T02:44:52Z","snapshot_observed_at":"2026-08-16T13:06:11.508261Z","submitted_at":"2024-10-24T17:22:24Z","title":"Matching Composition and Efficient Weight Reduction in Dynamic Matching","version":2},"cited_work":{"arxiv_id":"2410.18936","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.18936","snapshot_observed_at":"2026-08-16T05:32:49.698165Z","title":"Matching Composition and Efficient Weight Reduction in Dynamic Matching","venue":"cs.DS","work_id":"d95c6f98-eeb8-491d-bf87-6f4d899fe7ef","year":2024},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:48.949816Z"},"links":{"cited_paper":"/paper/2410.18936","citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:27ee41ab5a2b09f76c5434b8bd736f4d0a2f8d2000a75ffcc7a49d0e71b20d74","observation_id":"49436309-d803-45d1-a133-787ddd482072","resolution":{"observed_at":"2026-08-16T05:32:49.703611Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:32:48.954973Z","title":"Deterministic fully dynamic approximate vertex cover and fractional matching in O(1) amortized update time","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:48.954973Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:23cfe6eeb58f9c88ab3ba115f71a77d7b2ad20703448cbf5f92d25465444125a","observation_id":"27b5e234-58bb-4cb8-beaf-cde7be0603ce","resolution":{"observed_at":"2026-08-16T05:32:48.954973Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:32:48.959963Z","title":"Dynamic algorithms for graph coloring","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:48.959963Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:7c39a077e0ac21a24352304bff53d7eea7f037de0b229d1038b2453b2d2a01ef","observation_id":"53cd6e3a-fbf8-40e3-86ec-5f77a06a4e1b","resolution":{"observed_at":"2026-08-16T05:32:48.959963Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.10830","last_updated":"2024-07-15T15:42:54Z","snapshot_observed_at":"2026-08-16T13:34:06.243104Z","submitted_at":"2024-07-15T15:42:54Z","title":"Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality","version":1},"cited_work":{"arxiv_id":"2407.10830","doi":null,"metadata_source":"pith","pith_arxiv_id":"2407.10830","snapshot_observed_at":"2026-08-16T05:32:49.673794Z","title":"Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality","venue":"cs.DS","work_id":"55bfa033-c467-4605-9c9a-79d92065060e","year":2024},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:48.964803Z"},"links":{"cited_paper":"/paper/2407.10830","citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:0a3a157d0711857600b87ece5ce2dc08bfe85c59ccba5a812fe321d35c5f6ea0","observation_id":"acd0faf0-4935-4d9a-bcc3-cc2992523f1b","resolution":{"observed_at":"2026-08-16T05:32:49.679920Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:32:48.970257Z","title":"Fully dynamic maximal independent set with polylogarithmic update time","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:48.970257Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:cff973745e5170c74069ea62c59661a9f2ebbed12ef0e9aeab470c6d17baa84b","observation_id":"5344c2b5-bd37-4e24-b8f8-cea3b14d1be9","resolution":{"observed_at":"2026-08-16T05:32:48.970257Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:32:48.974972Z","title":"A framework for dynamic matching in weighted graphs","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:48.974972Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:ccceb55ef8ab635a7e9760be8e1ba76466ac82bc738f891451fe85ce5dc3b4f9","observation_id":"25355a5a-33f7-4cd1-8e58-ca9ede10a6e5","resolution":{"observed_at":"2026-08-16T05:32:48.974972Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:32:48.979954Z","title":"Dynamic algorithms for maximum matching size","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:48.979954Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:beddd8cf1ca116157e8946dfb23c3c069edd5030c820df6bab2ea7a5b1dd3040","observation_id":"41b4185b-d683-40f2-b484-d80c98b6127d","resolution":{"observed_at":"2026-08-16T05:32:48.979954Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:32:48.985001Z","title":"Dynamic algorithms for maximum matching size","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:48.985001Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:b68de58ff939ba76ab777c119af0ca1afd531e321ff751222c65e3527722dd0e","observation_id":"94970b9c-f973-416e-8091-2504e70bdff0","resolution":{"observed_at":"2026-08-16T05:32:48.985001Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:32:48.990493Z","title":"The locality of distributed symmetry breaking","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:48.990493Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:e8503e7f1c342563a5cb5b51cbfb3b809a59f96e35df2c3215ade519b1d9f786","observation_id":"bb1f2d1c-78a1-4073-8e35-a37ea0893b45","resolution":{"observed_at":"2026-08-16T05:32:48.990493Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:32:48.995677Z","title":"The locality of distributed symmetry breaking","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:48.995677Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:8841878783208c56cd26e17077aa9de690fd614cf709f41103ce02e1c938fe09","observation_id":"e1b10064-52f4-470c-aa23-34a4f2be22e3","resolution":{"observed_at":"2026-08-16T05:32:48.995677Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1705.10097","last_updated":"2017-05-29T10:05:29Z","snapshot_observed_at":"2026-08-14T20:57:38.224221Z","submitted_at":"2017-05-29T10:05:29Z","title":"Deterministic Partially Dynamic Single Source Shortest Paths in Weighted Graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1705.10097","snapshot_observed_at":"2026-08-16T05:32:49.001169Z","title":"Deterministic partially dynamic single source shortest paths in weighted graphs","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.001169Z"},"links":{"cited_paper":"/paper/1705.10097","citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:d9b3d9721ac7b1401d3e6a61b9855f49583068a9ea592e211e560572ad0bb303","observation_id":"32462931-a5fe-43f0-868f-6f4a2926470a","resolution":{"observed_at":"2026-08-16T05:32:49.001169Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:32:49.006668Z","title":"Improved bounds for matching in random-order streams","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.006668Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:66a5c17aa0337bcffd9106bd8deb83cc037d132271c32205d6be073715379f9e","observation_id":"2381dad3-5172-4a90-bd6b-484002e7c0bf","resolution":{"observed_at":"2026-08-16T05:32:49.006668Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:32:49.011742Z","title":"A deamortization approach for dynamic spanner and dynamic maximal matching","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.011742Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:dbb7b5bb985163b92029cab7363e9af29cb5dc0b88c263fbc75a8643ee14a67c","observation_id":"f4559416-00be-452c-afce-cabd44f7dc02","resolution":{"observed_at":"2026-08-16T05:32:49.011742Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:32:49.016956Z","title":"Fully dynamic maximal matching in O ( n) update time","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.016956Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:78958252d571544be1ac57dd51cf7ed0af6d9e129657645bd633c439af940506","observation_id":"c3a0689f-aeb7-4f5f-9d9f-17ecbb8bf322","resolution":{"observed_at":"2026-08-16T05:32:49.016956Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:32:49.022239Z","title":"Fully dynamic maximal matching in o( (n)) update time","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.022239Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:c82f2b513a5e19ef448e6fc99afcb64575f3bb0d191fa459fcb3f09858259f59","observation_id":"20001a70-14ab-480f-b983-2342a9495270","resolution":{"observed_at":"2026-08-16T05:32:49.022239Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:32:49.027387Z","title":"Fully dynamic maximal matching in o( n) update time (corrected version)","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.027387Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:9399b75c164231a6749417062f3b062ac186c719cb80d08208d5609af2b59806","observation_id":"a35f707e-6fa7-4056-a5cd-5e1988a14ce7","resolution":{"observed_at":"2026-08-16T05:32:49.027387Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:32:49.032715Z","title":"Deterministic decremental reachability, scc, and shortest paths via directed expanders and congestion balancing","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.032715Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:f50143208dfd786fd92a22b27f83f8e4faadc17ed4bf9ecc3520ebc95876c38a","observation_id":"7abe2802-5335-4b77-9d16-6465bf419b06","resolution":{"observed_at":"2026-08-16T05:32:49.032715Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:32:49.038290Z","title":"Exponentially faster massively parallel maximal matching","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.038290Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:20f332946bdaaf536a5e7ad11e3079490c5ebc9faa4d0ff2b942caf7a8122bc8","observation_id":"b1b437e7-89f0-475b-9473-1c93ac685e6b","resolution":{"observed_at":"2026-08-16T05:32:49.038290Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:32:49.043759Z","title":"Italiano","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.043759Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:5846a9b3bc9bedb1975fb8e954aa17602537b7631e447ce2630060afeed1e79b","observation_id":"5d76af85-6e5d-4a1c-953c-6304b48e5587","resolution":{"observed_at":"2026-08-16T05:32:49.043759Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:32:49.049743Z","title":"New deterministic approximation algorithms for fully dynamic matching","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.049743Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:87a21e400bfe213cc0a96915410e8c9d977b9e3492cf26bc4a1b043de6a9dd9c","observation_id":"1cf0cb34-6f7b-4d74-a45e-d60a595a06ff","resolution":{"observed_at":"2026-08-16T05:32:49.049743Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:32:50.848840Z","title":"Fully dynamic approximate maximum matching and minimum vertex cover in O(log\\( ^ 3 \\) n) worst case update time","venue":null,"work_id":"336ced40-150c-4c37-aab9-2aa97f2f6b66","year":2017},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.055132Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:5f45146267caf8f6211a45253d987c7dfbc5912cb5bbba19ab54cd5877f94dc1","observation_id":"c3068640-4382-4dea-bedc-bf9b8f066079","resolution":{"observed_at":"2026-08-16T05:32:50.853992Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-16T05:32:50.832998Z","title":"Deterministically maintaining a (2 + ) -approximate minimum vertex cover in o(1/ ) amortized update time","venue":null,"work_id":"8a76d0e4-36ba-435b-89cd-9efd4a444138","year":2019},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.060793Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:1576a41285e9b7a9bd3f8c0e15bab1729fd4a156a411c172244b6e288d39073c","observation_id":"388a67c8-2ea7-4a51-b040-80a35a9f9713","resolution":{"observed_at":"2026-08-16T05:32:50.838229Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-16T05:32:50.816902Z","title":"Deterministic rounding of dynamic fractional matchings","venue":null,"work_id":"b2d185c1-00dd-4a03-ada1-5e771e83faea","year":2021},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.066344Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:abe8ddef299d315ce8be6696e511e0c3dd56b1471676869791fd7fe8b7a22365","observation_id":"71017ec3-5dd7-47d6-b8e5-88fb26ee1e35","resolution":{"observed_at":"2026-08-16T05:32:50.822198Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.08432","last_updated":"2023-07-12T11:26:29Z","snapshot_observed_at":"2026-08-16T15:54:49.756634Z","submitted_at":"2023-02-16T17:10:18Z","title":"Incremental $(1-\\epsilon)$-approximate dynamic matching in $O(poly(1/\\epsilon))$ update time","version":2},"cited_work":{"arxiv_id":"2302.08432","doi":null,"metadata_source":"pith","pith_arxiv_id":"2302.08432","snapshot_observed_at":"2026-08-16T05:32:49.630033Z","title":"Incremental $(1-\\epsilon)$-approximate dynamic matching in $O(poly(1/\\epsilon))$ update time","venue":"cs.DS","work_id":"e2e22627-6b75-4a79-9dc7-860ba1dd412a","year":2023},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.071667Z"},"links":{"cited_paper":"/paper/2302.08432","citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:c311e3e67bbf720664998871f5fe3f43be49829e3de08e94b7e9321dec596d83","observation_id":"d43f2e58-f102-4620-95a3-57dd6e12f6cf","resolution":{"observed_at":"2026-08-16T05:32:49.636366Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-16T05:32:50.800460Z","title":"Dynamic algorithms for packing-covering lps via multiplicative weight updates","venue":null,"work_id":"7939cb20-bee6-4be6-8d82-21897cc7e3e5","year":2023},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.077250Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:b8af04f0fe43f5d8a26c186b957d28e76b170da5fb67df45f34a5503ae325f7e","observation_id":"c44bcc12-d859-43ea-a628-07497db3ca22","resolution":{"observed_at":"2026-08-16T05:32:50.805829Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-16T05:32:50.784252Z","title":"Sublinear algorithms for (1.5+ ) -approximate matching","venue":null,"work_id":"be36e113-7b43-4ac6-b09e-0f637eb801cf","year":2023},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.082873Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:599e49ce084952fd2753e52bc877a816242bb6e1ba04c3f19c7b68fa47311648","observation_id":"10c7c706-3705-49ba-b6bf-a44a89244fb7","resolution":{"observed_at":"2026-08-16T05:32:50.789392Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-16T05:32:50.767370Z","title":"Dynamic matching with better-than-2 approximation in polylogarithmic update time","venue":null,"work_id":"b312145a-9153-481e-a2f9-1e7499bd3641","year":2023},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.088417Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:4f1a30e337d9e8f3ebbe0a29678401335ac0e008e0126d1138d63fbf2503ab81","observation_id":"139605ea-a279-47ce-802f-e9ceb11df8dd","resolution":{"observed_at":"2026-08-16T05:32:50.772722Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-16T05:32:50.750497Z","title":"Near-optimal dynamic rounding of fractional matchings in bipartite graphs","venue":null,"work_id":"0a93e345-8e82-4a83-8ef0-172909b4f724","year":2024},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.094087Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:c63c2bd17861061fc9df8ee731991e2cb33f97a8d0cbd73b3ad57e9d6b878d01","observation_id":"63085825-b4a1-42a8-b139-18f342d342b9","resolution":{"observed_at":"2026-08-16T05:32:50.755683Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-16T05:32:50.733884Z","title":"Fully dynamic matching: Beating 2-approximation in ^ update time","venue":null,"work_id":"cfb8989a-9855-4fb2-8ad5-1eaf6615bc65","year":2020},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.099545Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:396a550a81d9956b897cf2a59961bf587611fba253748059e2d31cb1e8a170d5","observation_id":"3d4d1b6b-43c4-44ed-b37c-99ee6a066113","resolution":{"observed_at":"2026-08-16T05:32:50.739107Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-16T05:32:50.717357Z","title":"Fully dynamic ( + 1) coloring against adaptive adversaries","venue":null,"work_id":"3d4f195b-8e6c-4d61-9910-19a52c601112","year":2025},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.104862Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:90e4b97f35ca1fecc45ca5858641ea68bc63f0715a10029fae6b53997d23d1b2","observation_id":"3b3a5506-e925-49d6-9460-3d98afaafa80","resolution":{"observed_at":"2026-08-16T05:32:50.722551Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-16T05:32:50.700920Z","title":"Fully dynamic matching in bipartite graphs","venue":null,"work_id":"f15aeb2c-ed4e-4fc8-9ebf-8abafd982a77","year":2015},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.110742Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:222e8ecd27efe659324524248d8b45ec746f4deee7011dc4797e369ecf9aa9ec","observation_id":"128528ef-8d4d-4051-b83b-459b2d1fe8c2","resolution":{"observed_at":"2026-08-16T05:32:50.706264Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-16T05:32:50.683168Z","title":"Fully dynamic matching in bipartite graphs","venue":null,"work_id":"8c95bc6a-d4bf-45f4-8c28-722b61e996f9","year":2015},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.116210Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:8c231348b9cdaebb220a84d20d49391cbb1a723983f6b7811b0700d8b23a737a","observation_id":"780e3512-2081-4ae5-8341-d5e27883e963","resolution":{"observed_at":"2026-08-16T05:32:50.688997Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-16T05:32:50.665407Z","title":"Faster fully dynamic matchings with small approximation ratios","venue":null,"work_id":"3abe3720-fd34-48a3-a517-141433431bbb","year":2016},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.121326Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:b3d7952385122924e84dd4195987e2cf4c0006a2890ab833b1ad9c85c6a162a5","observation_id":"829e065c-fe29-448c-93fa-8dbb59b022d3","resolution":{"observed_at":"2026-08-16T05:32:50.670744Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-16T05:32:50.648892Z","title":"Faster fully dynamic matchings with small approximation ratios","venue":null,"work_id":"8a31cbaa-766d-4c4d-b8e7-d6c58d11e811","year":2016},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.126471Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:32d8f0def802928c1414c506300e3f9b8f75b7bd063f53c41bed33d0768fac30","observation_id":"6d0c9aa1-4cca-44d0-9776-ca9c3a653a88","resolution":{"observed_at":"2026-08-16T05:32:50.653897Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2207.04954","last_updated":"2022-07-11T15:36:10Z","snapshot_observed_at":"2026-08-16T16:46:52.415423Z","submitted_at":"2022-07-11T15:36:10Z","title":"Simple Dynamic Spanners with Near-optimal Recourse against an Adaptive Adversary","version":1},"cited_work":{"arxiv_id":"2207.04954","doi":null,"metadata_source":"pith","pith_arxiv_id":"2207.04954","snapshot_observed_at":"2026-08-16T05:32:49.606762Z","title":"Simple Dynamic Spanners with Near-optimal Recourse against an Adaptive Adversary","venue":"cs.DS","work_id":"17b5cca7-fb94-42fd-ad56-afcb493ed03f","year":2022},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.131722Z"},"links":{"cited_paper":"/paper/2207.04954","citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:3c7c2b8b87d8d930da9af69256eb32b4107fce4be213f3f642cf7d8ae4e88e54","observation_id":"97876fbb-94d9-48be-b43f-780f7b16ea0a","resolution":{"observed_at":"2026-08-16T05:32:49.612234Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-16T05:32:50.631990Z","title":"Fast dynamic cuts, distances and effective resistances via vertex sparsifiers","venue":null,"work_id":"d8fc2eff-d4c3-49b9-802c-a0f0a0587f4f","year":2020},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.137507Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:6f09aefb168c0c5abc3c36ad2387147c8a9c7bac4104abf1c9c10be34bd5311f","observation_id":"912f8ebd-41d4-4528-8f25-aa7827ae089c","resolution":{"observed_at":"2026-08-16T05:32:50.637168Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-16T05:32:50.615261Z","title":"A deterministic algorithm for balanced cut with applications to dynamic connectivity, flows, and beyond","venue":null,"work_id":"dde96f34-7af8-4083-9953-951ff38c0de8","year":2020},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.142672Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:5adab2768930b31d438400c55c8e0981db130877995259e2b85d70f3dd9f823c","observation_id":"98707a99-6777-441e-9cb9-9ca57c5d9c20","resolution":{"observed_at":"2026-08-16T05:32:50.620631Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2209.14087","last_updated":"2023-02-15T12:59:14Z","snapshot_observed_at":"2026-08-16T16:29:15.022370Z","submitted_at":"2022-09-28T13:31:30Z","title":"Adaptive Out-Orientations with Applications","version":3},"cited_work":{"arxiv_id":"2209.14087","doi":null,"metadata_source":"pith","pith_arxiv_id":"2209.14087","snapshot_observed_at":"2026-08-16T05:32:49.583028Z","title":"Adaptive Out-Orientations with Applications","venue":"cs.DS","work_id":"cc565bce-9e42-4f77-8130-9e8b02712244","year":2022},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.147636Z"},"links":{"cited_paper":"/paper/2209.14087","citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:fe6e014cc8344c08089845c6aba080798b9df5a92c97ecad98078cdab291d923","observation_id":"026592e1-7c37-47d4-b921-2fcf9fc81f5e","resolution":{"observed_at":"2026-08-16T05:32:49.588673Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-16T05:32:50.597543Z","title":"A new algorithm for decremental single-source shortest paths with applications to vertex-capacitated flow and cut problems","venue":null,"work_id":"b2efd182-9baa-4905-a0cf-9c9a4e02e73a","year":2019},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.153816Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:9bef24c0a6567f2ed99ec97cd57be1d05dff946d62eade57c4c262ae21f5288d","observation_id":"3d7be9e2-4f88-41ee-bc3e-145e843d70ba","resolution":{"observed_at":"2026-08-16T05:32:50.603436Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:32:49.158765Z","title":"Maximum flow and minimum-cost flow in almost-linear time","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.158765Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:fa444bf7f5a30297939001ed6f9d23c2707897485dfa3109a9c8c4aab9ef8b07","observation_id":"90666e2b-d863-4d4f-accb-3ca42f64503a","resolution":{"observed_at":"2026-08-16T05:32:49.158765Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:32:49.163807Z","title":"Round compression for parallel matching algorithms","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.163807Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:ae121c541d3abced7294bb56cc7de188001217bdc2409d0a69e761f1d68af390","observation_id":"eee7b026-1b0b-43d1-8ad8-edb533a3f809","resolution":{"observed_at":"2026-08-16T05:32:49.163807Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:32:50.558833Z","title":"Fully dynamic almost-maximal matching: Breaking the polynomial worst-case time barrier","venue":null,"work_id":"2d0e8b88-0372-42c4-8c0c-3cd1d657a3b7","year":2018},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.168866Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:5145928f0ee09937d321a29f246775d5e137342069d4defe4d73570c71382f48","observation_id":"c11361ee-b98e-4af6-baa3-e3b2ffc66772","resolution":{"observed_at":"2026-08-16T05:32:50.563948Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-16T05:32:50.540916Z","title":"Deterministic algorithms for decremental shortest paths via layered core decomposition","venue":null,"work_id":"e469a866-b72b-482f-a5bb-c025426a1af3","year":2021},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.173831Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:3478cde6a6fa6a83d7aacb20beb22fa3c3f0fb573a60a3d9621db0e1afb505cc","observation_id":"3d762d35-f99a-4ccd-81f3-e75a48d9cce2","resolution":{"observed_at":"2026-08-16T05:32:50.546618Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.09077","last_updated":"2024-12-03T22:44:41Z","snapshot_observed_at":"2026-08-16T14:34:42.621521Z","submitted_at":"2023-12-14T16:12:16Z","title":"Entropy Regularization and Faster Decremental Matching in General Graphs","version":2},"cited_work":{"arxiv_id":"2312.09077","doi":null,"metadata_source":"pith","pith_arxiv_id":"2312.09077","snapshot_observed_at":"2026-08-16T05:32:49.560240Z","title":"Entropy Regularization and Faster Decremental Matching in General Graphs","venue":"cs.DS","work_id":"0abf5121-1a88-4a35-a423-73bfad3b4472","year":2023},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.178829Z"},"links":{"cited_paper":"/paper/2312.09077","citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:8407c73feacd788df8f5e9a730c50f23907517acd3d7d20626fc5e816e318865","observation_id":"d8125507-8c62-4184-91a7-3f82ce16602a","resolution":{"observed_at":"2026-08-16T05:32:49.565705Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-16T05:32:50.522774Z","title":"Fully dynamic maximal independent set in expected poly-log update time","venue":null,"work_id":"6fd0cfcd-fe73-4f4c-97c3-a19c5a56c9d0","year":2019},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.183913Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:92e83251e9e8d382273b42c2883fa45da3fe61a0def708bcbad971252e29961b","observation_id":"9eefbaf2-584d-4b6e-a480-5ee46653cc78","resolution":{"observed_at":"2026-08-16T05:32:50.528951Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:32:49.188734Z","title":"A new deterministic algorithm for fully dynamic all-pairs shortest paths","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.188734Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:da731e1681d4cc8e41a584fcb2a98c330c8a7acaded5c59504fe3149c738f93e","observation_id":"5d768caa-3e0e-4e45-b63d-6cf882945cf3","resolution":{"observed_at":"2026-08-16T05:32:49.188734Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:32:50.494385Z","title":"On the hardness of partially dynamic graph problems and connections to diameter","venue":null,"work_id":"ae939b9c-281d-4a6e-8fd1-6ffb54e91a85","year":2016},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.193714Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:278fd00cd541e808de09528448c514fab21f3d1598bba4918d3fab4c13d302cc","observation_id":"d448a54c-08fb-4865-8304-b55eb111b1ab","resolution":{"observed_at":"2026-08-16T05:32:50.499799Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.03068","last_updated":"2024-02-05T14:59:35Z","snapshot_observed_at":"2026-08-16T14:21:24.472172Z","submitted_at":"2024-02-05T14:59:35Z","title":"A Note on Rounding Matchings in General Graphs","version":1},"cited_work":{"arxiv_id":"2402.03068","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.03068","snapshot_observed_at":"2026-08-16T05:32:49.534825Z","title":"A Note on Rounding Matchings in General Graphs","venue":"cs.DS","work_id":"b5d30112-2b6a-4cee-8187-db4caf22407a","year":2024},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.198758Z"},"links":{"cited_paper":"/paper/2402.03068","citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:1fc91ba5d9fad06f95362ae3bbc83d89f03d083893e0bbc9e4e083ef2862c0e8","observation_id":"2cbb4967-fd59-4acd-99e2-746c9baf90c8","resolution":{"observed_at":"2026-08-16T05:32:49.541175Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.10538","last_updated":"2024-07-09T09:24:13Z","snapshot_observed_at":"2026-08-16T14:26:14.644105Z","submitted_at":"2024-01-19T07:33:48Z","title":"Deterministic Simple $(\\Delta+\\varepsilon\\alpha)$-Edge-Coloring in Near-Linear Time","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.10538","snapshot_observed_at":"2026-08-16T05:32:49.203893Z","title":"Deterministic simple (1+ ) -edge-coloring in near-linear time","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.203893Z"},"links":{"cited_paper":"/paper/2401.10538","citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:27c99e6e984e285939baa56e0f46a15dd510e007ad2d0742a6d124f306814392","observation_id":"34d77521-f14c-422c-8e8c-95aee0bfa9e2","resolution":{"observed_at":"2026-08-16T05:32:49.203893Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:32:49.209254Z","title":"Improved deterministic distributed matching via rounding","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.209254Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:e48e49623d6d927d4a1b20e1614e223fd5c3807101adfe81017758b3b9d08ba3","observation_id":"eb4e3c10-4f16-4522-86b8-de6025ae8f90","resolution":{"observed_at":"2026-08-16T05:32:49.209254Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:32:50.463835Z","title":"Improved massively parallel computation algorithms for mis, matching, and vertex cover","venue":null,"work_id":"f8026ae0-9a3b-4dd5-8166-07adea45c2f8","year":2018},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.214452Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:df15f9703f3300a74cfcfdfad04da4833a9714524d2cc76b7ea4cd09ec28d842","observation_id":"8aafa9c3-27c5-48bb-9371-ca9d28665bea","resolution":{"observed_at":"2026-08-16T05:32:50.469993Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-16T05:32:50.444367Z","title":"A time-optimal randomized parallel algorithm for mis","venue":null,"work_id":"ebaaffea-a8c5-4452-a0fc-5577bdf5621d","year":2021},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.219289Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:9dcbbbaea7d7f13d765a17a85cb8c30c19a2d0a072000c931e35a63cd4f7a0fe","observation_id":"0b7f5db9-9b66-4377-9f02-89a6a68fb126","resolution":{"observed_at":"2026-08-16T05:32:50.450401Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-16T05:32:50.426548Z","title":"(1+ ) -approximate incremental matching in constant deterministic amortized time","venue":null,"work_id":"7090dd30-eaf9-46e0-9b98-3098e7bb6b41","year":2019},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.224064Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:e92f29b9e35fa3bca42fe46e4576f25b096297a1a20582dfe3027f6f05874317","observation_id":"60786ae0-760d-4ab1-95d0-68f51da7c79f","resolution":{"observed_at":"2026-08-16T05:32:50.431768Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-16T05:32:50.409069Z","title":"Gabow, Takao Nishizeki, Oded Kariv, Daniel Leven, and Osamu Terada","venue":null,"work_id":"ee5426c9-7f0f-4020-bed8-678e40ec0f36","year":1985},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.229104Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:5db2c47f7560e877d083e17a1cec3a1a0c1f4daba54a3fd524eceb0fd4cffd81","observation_id":"97ae3dd8-ed56-4682-8c04-5aa6d540a907","resolution":{"observed_at":"2026-08-16T05:32:50.414436Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-16T05:32:50.392174Z","title":"Fully dynamic (1+ ) -approximate matchings","venue":null,"work_id":"c690a2c0-e500-4997-b4ed-8d7a6890298d","year":2013},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.234358Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:7af443d85337190936ea9e13bedb5f82a25f696d7bd9ba8ee64fee7873c35e43","observation_id":"12b5108c-d3b9-4c0d-a2e2-942101668cd3","resolution":{"observed_at":"2026-08-16T05:32:50.397479Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-16T05:32:50.375157Z","title":"Maintaining approximate maximum matching in an incremental bipartite graph in polylogarithmic update time","venue":null,"work_id":"5611ed7b-f959-4a90-bf3c-845b65062ea2","year":2014},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.239528Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:639a45b843f5eb8c69438f99e621835eea498c6c32f2facfd817ad1991f519f8","observation_id":"3f85ed55-8dcd-49e6-ab9f-003c9d1e8779","resolution":{"observed_at":"2026-08-16T05:32:50.380637Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:32:49.244268Z","title":"The expander hierarchy and its applications to dynamic graph algorithms","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.244268Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:4dca8d1bcf8684ac71fb72d7bdc58ac4a45dbacf99578ed7567f61290b3906af","observation_id":"44b9bab0-0de3-4405-a089-4eb91d73acd8","resolution":{"observed_at":"2026-08-16T05:32:49.244268Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:32:50.346609Z","title":"Maintaining an edcs in general graphs: Simpler, density-sensitive and with worst-case time bounds","venue":null,"work_id":"86cd894f-c6e5-47f2-9d9e-f6eb081be217","year":2022},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.249187Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:1cb276ec22a663d37ae5eb43bafaf916ddfb0e5e7c6e513ca113c33f290d0d00","observation_id":"9b229a6e-095c-4622-8f58-f7cf3bc936bf","resolution":{"observed_at":"2026-08-16T05:32:50.352426Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-16T05:32:50.328392Z","title":"Maintaining an edcs in general graphs: Simpler, density-sensitive and with worst-case time bounds","venue":null,"work_id":"b094a852-6e30-40a9-bd32-f595a89e18ee","year":2022},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.253966Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:c6d80a869e67a3779d9ef3dcd82a2e65e9e4123e7cb305793bcae2a77b06b116","observation_id":"3f218dac-1b86-4d19-a9b3-2671ed933774","resolution":{"observed_at":"2026-08-16T05:32:50.333931Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:32:49.258540Z","title":"Parallel dynamic maximal matching","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.258540Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:32c30b3afb42f72322b9ae4c5ef17cb1f5683db34ac443df78d210aeeeac9b3e","observation_id":"bc75aa82-4cc5-4ee3-b768-6e1b16d5f433","resolution":{"observed_at":"2026-08-16T05:32:49.258540Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:32:50.296550Z","title":"Sparsifying distributed algorithms with ramifications in massively parallel computation and centralized local computation","venue":null,"work_id":"138775f2-471d-4b9a-9502-6e675af198ac","year":2019},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.263402Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:b74c6934f99a9c54bfde2683e0d026e5229df4fe618c1c456d44f3db3a7964db","observation_id":"07d820a0-4410-48b5-8d44-9998b4572571","resolution":{"observed_at":"2026-08-16T05:32:50.302223Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-16T05:32:50.279207Z","title":"Decremental sssp in weighted digraphs: Faster and against an adaptive adversary","venue":null,"work_id":"1025cfdb-667c-4335-8e5f-42a4fcea28a9","year":2020},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.268086Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:5871ea70917a9a21c376af5e39f7c7de909b2484be8049d08b39268758109ab1","observation_id":"06b4a00d-091b-4a5d-ac9b-c7c3338f5bd8","resolution":{"observed_at":"2026-08-16T05:32:50.284583Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-16T05:32:50.262184Z","title":"Deterministic algorithms for decremental approximate shortest paths: Faster and simpler","venue":null,"work_id":"7eceafeb-8bf6-4253-b670-ac25decdb4e0","year":2020},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.273485Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:9f708357c9613e888beca6648bc164548aa7fe6512bbecee3e668599cd3bc1e1","observation_id":"5fe874f9-0392-4101-9e4e-432f2ab5216f","resolution":{"observed_at":"2026-08-16T05:32:50.267832Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-16T05:32:50.245451Z","title":"Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity","venue":null,"work_id":"ee11912a-8d2c-43cf-97ec-5cf84604d570","year":2001},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.278382Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:47f6e166b2e9575ef65e2794630b91777be8ebb57dbe6423f72ffd18f5e454e9","observation_id":"703e0f7d-ede4-4247-b921-2e975a1ac5a7","resolution":{"observed_at":"2026-08-16T05:32:50.250966Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-16T05:32:50.228313Z","title":"Dynamic approximate all-pairs shortest paths: Breaking the o(mn) barrier and derandomization","venue":null,"work_id":"72320ddb-7a05-41cf-8da9-22ab92b9f27d","year":2016},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.283119Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:38cfecc1af6d7a830d57c58ddd6716a47447460fe6cad8bb3db1c652475bfc0b","observation_id":"8e838833-5e10-4f02-a716-a44cd2f4c0d0","resolution":{"observed_at":"2026-08-16T05:32:50.233650Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:32:49.288968Z","title":"Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":85,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.288968Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:0519ec376a0106dd73d039041d34202e972141a1680b80dab6559b66dff22076","observation_id":"1fc19cf9-b65c-4fac-9728-d81055239ec0","resolution":{"observed_at":"2026-08-16T05:32:49.288968Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:32:50.199231Z","title":"A faster distributed algorithm for computing maximal matchings deterministically","venue":null,"work_id":"2c1bc084-fe3d-4035-b754-0e155102cb31","year":1999},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":86,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.293947Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:daae403a59186c99c1aa47e165bcbb753dc9771d4c9b7d1de5e7fe4b20bdc0e8","observation_id":"b62f78ca-8b96-4dc1-895b-e8ce1cc8a3a3","resolution":{"observed_at":"2026-08-16T05:32:50.205136Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-16T05:32:50.182457Z","title":"On the distributed complexity of computing maximal matchings","venue":null,"work_id":"0cce4ec7-cfe4-45dd-97ea-fd0d8f517c25","year":2001},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":87,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.298899Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:83d808e15b803bb9aabc642f1713463b9d75dd677f0a09014608d3e2bfde2cc3","observation_id":"1b75261f-2506-407e-898b-435518ee6a9e","resolution":{"observed_at":"2026-08-16T05:32:50.187603Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.18541","last_updated":"2024-04-10T21:33:24Z","snapshot_observed_at":"2026-08-16T14:14:25.444032Z","submitted_at":"2024-02-28T18:24:05Z","title":"Dynamic Deterministic Constant-Approximate Distance Oracles with $n^{\\epsilon}$ Worst-Case Update Time","version":2},"cited_work":{"arxiv_id":"2402.18541","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.18541","snapshot_observed_at":"2026-08-16T05:32:49.490093Z","title":"Dynamic Deterministic Constant-Approximate Distance Oracles with $n^{\\epsilon}$ Worst-Case Update Time","venue":"cs.DS","work_id":"933a110f-a603-4a38-ba45-d0d8f7392028","year":2024},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":88,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.303471Z"},"links":{"cited_paper":"/paper/2402.18541","citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:c265aa1da0dfe11006054699181fc2a434b95eba30221be91f1ee7feec553b54","observation_id":"dc0e108f-95d1-482d-860f-6ebfd3b13ec7","resolution":{"observed_at":"2026-08-16T05:32:49.497618Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-16T05:32:50.165197Z","title":"Constant-time dynamic ( \\( \\) +1)-coloring","venue":null,"work_id":"afbb10d2-90bc-4242-b619-4f6486fdd3bf","year":2022},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":89,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.308436Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:71b0177336d1684ec1829ac77effb3e0df7bccff338e604e5c72a687eaf0a213","observation_id":"cf98d022-495a-4ca9-a87a-04d51eef851e","resolution":{"observed_at":"2026-08-16T05:32:50.170380Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-16T05:32:50.147524Z","title":"A fast and simple randomized parallel algorithm for maximal matching","venue":null,"work_id":"03a50a8b-68e2-4e8e-8473-d3cf57e56b90","year":1986},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":90,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.313633Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:20c75d0351c290334a9a3c2f65ed30ada2f243b329e8d488850a81a71dc9df8b","observation_id":"8bb61354-546b-404b-89d5-af741d1e8356","resolution":{"observed_at":"2026-08-16T05:32:50.152892Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-16T05:32:50.130234Z","title":"Fully dynamic maintenance of vertex cover","venue":null,"work_id":"cd5c7aef-f737-4534-bdd5-ff79e6f076b1","year":1993},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":91,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.318260Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:1e1fecf78937fc0ad48b49afbd1f3603985b01ce389e319d33199e2e61735445","observation_id":"6e4e3b78-a64d-4bf3-894e-4807668838df","resolution":{"observed_at":"2026-08-16T05:32:50.135684Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-16T05:32:50.111765Z","title":"An improved parallel algorithm for maximal matching","venue":null,"work_id":"ad1cf9d3-b36c-492e-b530-395af024169f","year":1986},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":92,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.323088Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:5112cd7848c29b550dcc485e215c1d2648268980e6ffb2ae61919b6ac2d8f2a8","observation_id":"13c7b869-ba64-448d-a557-748e6e5a0af3","resolution":{"observed_at":"2026-08-16T05:32:50.117724Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-16T05:32:50.093088Z","title":"Regularized box-simplex games and dynamic decremental bipartite matching","venue":null,"work_id":"d7da20bc-3e63-4fd8-9d26-c3bde6418fc7","year":2022},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":93,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.327765Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:a79ae6fa7e2516a114e94b54669c0a02d92a91dee2d15b97897f9d8ef7152070","observation_id":"9eca33ba-a3f2-4484-b6b4-f0103d07fe45","resolution":{"observed_at":"2026-08-16T05:32:50.098521Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-16T05:32:50.075318Z","title":null,"venue":null,"work_id":"cc8819e2-2552-484e-ab88-395ddf88fe2d","year":1999},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":94,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.332577Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:ea45a7ecd9c431dde782aea0a3f46348da089f0ebb18839a896812de1d2321ec","observation_id":"0878d581-2c92-430b-8173-dd919e4e40d7","resolution":{"observed_at":"2026-08-16T05:32:50.080727Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-16T05:32:50.056864Z","title":"Deterministic dynamic matching in worst-case update time","venue":null,"work_id":"5eb317f1-9813-4770-a05a-cd4b59a0575a","year":2022},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":95,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.337376Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:e1a0b535c1820ef7d211107c8d6bd16cdd51be725d41cf5716277841c1dfb8a8","observation_id":"67e71b9d-ba24-4c23-9376-3dacafbe5e56","resolution":{"observed_at":"2026-08-16T05:32:50.062680Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-16T05:32:50.038386Z","title":"A dynamic shortest paths toolbox: Low-congestion vertex sparsifiers and their applications","venue":null,"work_id":"c7770a84-cd06-4fd6-8218-af7cd20bbf6b","year":2024},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":96,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.342374Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:3f13c07687f7ca357771f777bd4bd56b6ff83d7b87298d1465065d27e1042ecb","observation_id":"e6848ae8-7648-44af-a09e-dda1603576d0","resolution":{"observed_at":"2026-08-16T05:32:50.043874Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-16T05:32:50.020775Z","title":"A fast parallel algorithm for the maximal independent set problem","venue":null,"work_id":"6a2d5ed7-07be-4c59-a8ac-af333277cb01","year":1985},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":97,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.347048Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:f00ecb6cac8fca3d1155298c0dbdbed52b0c9a4da4ca1bab1fc7c933ec4c4edd","observation_id":"8bf7dc91-8da9-4619-ba85-3bf7b8ae7624","resolution":{"observed_at":"2026-08-16T05:32:50.026312Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.02582","last_updated":"2024-03-05T01:33:09Z","snapshot_observed_at":"2026-08-16T14:12:50.166141Z","submitted_at":"2024-03-05T01:33:09Z","title":"On Approximate Fully-Dynamic Matching and Online Matrix-Vector Multiplication","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.02582","snapshot_observed_at":"2026-08-16T05:32:49.351948Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":98,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.351948Z"},"links":{"cited_paper":"/paper/2403.02582","citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:96911b12eca75cbd57f7d0a9a3f3c079467dc56a59d68fdf0ad6537496c43445","observation_id":"e60cc699-f55c-4256-b0c1-ea26d522c3a3","resolution":{"observed_at":"2026-08-16T05:32:49.351948Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:32:49.356901Z","title":"Filtering: a method for solving graph problems in mapreduce","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":99,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.356901Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:819e9ac6fd09096964398f46a9347f5a504bf32b120e3b95f7eda9677b13e725","observation_id":"a6e5c52c-13b3-4a3e-b388-5d61c10ee0fd","resolution":{"observed_at":"2026-08-16T05:32:49.356901Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:32:49.992312Z","title":"A simple parallel algorithm for the maximal independent set problem","venue":null,"work_id":"67d9efac-bfed-4a83-bc13-230ce356239f","year":1985},"citing_paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time","version":2},"reference_index":100,"source":"arxiv_source","source_observed_at":"2026-08-16T05:32:49.362283Z"},"links":{"citing_paper":"/paper/2504.20780"},"observation_digest":"sha256:6835994c61f1169aaa9a10fea42b485ca37731f2a9f4d1d6500aeb3757ec7ba8","observation_id":"ee8565ce-1a0d-42fa-b863-6db7aba27850","resolution":{"observed_at":"2026-08-16T05:32:49.998406Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2504.20780","last_updated":"2025-08-29T10:32:43Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-17T08:17:33.644127Z","submitted_at":"2025-04-29T13:59:33Z","title":"Deterministic Dynamic Maximal Matching in Sublinear Update Time"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":47,"verified_exact":9,"verified_fuzzy":44},"total_outbound_references":114},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 100 of 114 outbound references and 0 inbound Pith citation observations for arXiv:2504.20780."}