Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-07-10T18:59:54.280107Z
Paper Citation Record · LEDGER
On the Assadi Liu Tarjan Auction Algorithm for Bipartite Matching: Simplification, Alternative Analysis, and Hard Instance
As of 23 August 2026, this Paper Citation Record lists 17 of 17 outbound references and 0 inbound Pith citation observations for arXiv:2607.07439.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-22T06:32:14.747728+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links
A source-named dated measurement, never combined with another source.
Source: cited_works
Reference resolution
17 of 17 outbound references displayed
- verified exact16
- verified fuzzy1
- unresolved0
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation 602f2a2d-2171-41e9-80f4-32394e31812f · outbound
This paper cites Linear programming in the semi-streaming model with ap- plication to the maximum matching problem.Inf.
On the Assadi Liu Tarjan Auction Algorithm for Bipartite Matching: Simplification, Alternative Analysis, and Hard Instance Linear programming in the semi-streaming model with ap- plication to the maximum matching problem.Inf
Reference 1
- Resolution
- verified exact
- doi, observed 2026-07-10T19:07:35.026656Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation dc8f8d47-c69e-462d-9df7-e957705d9472 · outbound
This paper cites Access to data and number of iterations: Dual primal algorithms for maximum matching under resource constraints.ACM Trans.
On the Assadi Liu Tarjan Auction Algorithm for Bipartite Matching: Simplification, Alternative Analysis, and Hard Instance Access to data and number of iterations: Dual primal algorithms for maximum matching under resource constraints.ACM Trans
Reference 2
- Resolution
- verified exact
- doi, observed 2026-07-10T19:07:35.024584Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 0c74c764-4bab-4187-81fc-9859bcee14d8 · outbound
This paper cites A simple (1 -ϵ)-approximation semi-streaming algorithm for maximum (weighted) matching.
On the Assadi Liu Tarjan Auction Algorithm for Bipartite Matching: Simplification, Alternative Analysis, and Hard Instance A simple (1 -ϵ)-approximation semi-streaming algorithm for maximum (weighted) matching
Reference 3
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-07-10T19:17:33.066161Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 4d1be63a-8fca-4987-9ad8-d852538e9925 · outbound
This paper cites On the Robust Communication Complexity of Bipar- tite Matching.
On the Assadi Liu Tarjan Auction Algorithm for Bipartite Matching: Simplification, Alternative Analysis, and Hard Instance On the Robust Communication Complexity of Bipar- tite Matching
Reference 4
- Resolution
- verified exact
- doi, observed 2026-07-10T19:07:35.028457Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation f78a01be-d4fe-460d-b0b8-4ebd600422b6 · outbound
This paper cites Semi-streaming bipartite matching in fewer passes and optimal space.
On the Assadi Liu Tarjan Auction Algorithm for Bipartite Matching: Simplification, Alternative Analysis, and Hard Instance Semi-streaming bipartite matching in fewer passes and optimal space
Reference 5
- Resolution
- verified exact
- doi, observed 2026-07-10T19:07:35.030140Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 823ecbef-0428-4f2b-bbc2-34798192acab · outbound
This paper cites Cliff Liu and Robert E.
On the Assadi Liu Tarjan Auction Algorithm for Bipartite Matching: Simplification, Alternative Analysis, and Hard Instance Cliff Liu and Robert E
Reference 6
- Resolution
- verified exact
- doi, observed 2026-07-10T19:07:35.031840Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 5508723b-b6f8-414a-8dd2-0ec0f50b5d6b · outbound
This paper cites In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pp.
On the Assadi Liu Tarjan Auction Algorithm for Bipartite Matching: Simplification, Alternative Analysis, and Hard Instance In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pp
Reference 7
- Resolution
- verified exact
- arxiv_id, observed 2026-07-10T19:07:35.022638Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation ae141502-d29c-4caa-a828-d3af819550de · outbound
This paper cites Improved bounds for matching in random-order streams.Theory Comput.
On the Assadi Liu Tarjan Auction Algorithm for Bipartite Matching: Simplification, Alternative Analysis, and Hard Instance Improved bounds for matching in random-order streams.Theory Comput
Reference 8
- Resolution
- verified exact
- doi, observed 2026-07-10T19:07:35.019869Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 45380fac-293a-46c4-b645-6100d717bb54 · outbound
This paper cites Constructing large matchings via query access to a maximal matching oracle.
On the Assadi Liu Tarjan Auction Algorithm for Bipartite Matching: Simplification, Alternative Analysis, and Hard Instance Constructing large matchings via query access to a maximal matching oracle
Reference 9
- Resolution
- verified exact
- doi, observed 2026-07-10T19:07:35.009160Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 7b073f4a-a336-4336-8cc7-4140b930ae25 · outbound
This paper cites Bipartite matching in the semi-streaming model.Algorithmica, 63(1-2):490–508, 2012.
On the Assadi Liu Tarjan Auction Algorithm for Bipartite Matching: Simplification, Alternative Analysis, and Hard Instance Bipartite matching in the semi-streaming model.Algorithmica, 63(1-2):490–508, 2012
Reference 10
- Resolution
- verified exact
- doi, observed 2026-07-10T19:07:35.007352Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation b02aa41c-d11c-4f29-81e3-73d018f48556 · outbound
This paper cites On graph problems in a semi-streaming model.
On the Assadi Liu Tarjan Auction Algorithm for Bipartite Matching: Simplification, Alternative Analysis, and Hard Instance On graph problems in a semi-streaming model
Reference 11
- Resolution
- verified exact
- doi, observed 2026-07-10T19:07:35.012773Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 66b6057c-dd25-4022-870f-7cded7b83f40 · outbound
This paper cites Karloff, Siddharth Suri, and Sergei Vassilvitskii.
On the Assadi Liu Tarjan Auction Algorithm for Bipartite Matching: Simplification, Alternative Analysis, and Hard Instance Karloff, Siddharth Suri, and Sergei Vassilvitskii
Reference 12
- Resolution
- verified exact
- doi, observed 2026-07-10T19:07:35.005572Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 08a4a00e-4bd6-4c0d-b426-d20db00255a2 · outbound
This paper cites A simple augmentation method for matchings with applications to stream- ing algorithms.
On the Assadi Liu Tarjan Auction Algorithm for Bipartite Matching: Simplification, Alternative Analysis, and Hard Instance A simple augmentation method for matchings with applications to stream- ing algorithms
Reference 13
- Resolution
- verified exact
- doi, observed 2026-07-10T19:07:35.014778Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation b78e6719-09cc-4b5f-9232-4658a51e59d4 · outbound
This paper cites Maximum matching in semi-streaming with few passes.
On the Assadi Liu Tarjan Auction Algorithm for Bipartite Matching: Simplification, Alternative Analysis, and Hard Instance Maximum matching in semi-streaming with few passes
Reference 14
- Resolution
- verified exact
- doi, observed 2026-07-10T19:07:35.016519Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 16cffb6a-93d8-41c7-938c-340c8209c7b7 · outbound
This paper cites an unresolved cited work.
On the Assadi Liu Tarjan Auction Algorithm for Bipartite Matching: Simplification, Alternative Analysis, and Hard Instance Unresolved cited work
Reference 15
- Resolution
- verified exact
- doi, observed 2026-07-10T19:07:35.018136Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 88a8d764-c456-493e-83a2-616373657500 · outbound
This paper cites Naidu, and Arun Steward.
On the Assadi Liu Tarjan Auction Algorithm for Bipartite Matching: Simplification, Alternative Analysis, and Hard Instance Naidu, and Arun Steward
Reference 16
- Resolution
- verified exact
- doi, observed 2026-07-10T19:07:35.033510Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 6d92bcf3-1a0d-466a-9737-4dda3d7300f0 · outbound
This paper cites Finding Graph Matchings in Data Streams , booktitle =.
On the Assadi Liu Tarjan Auction Algorithm for Bipartite Matching: Simplification, Alternative Analysis, and Hard Instance Finding Graph Matchings in Data Streams , booktitle =
Reference 17
- Resolution
- verified exact
- doi, observed 2026-07-10T19:07:35.010910Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Pith citing papers
No inbound Pith citation observations are available.