{"as_of":"2026-08-23T05:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b3bf1b407ee8c23fde5672cab83f2c0f32761f51ea591d09dfa60f22ca7f23e7","coverage":[{"denominator":17,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":17,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-10T18:59:54.280107Z","state":"measured"},{"denominator":17,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":17,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+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/2607.07439/citation-record","integrity":"/paper/2607.07439/integrity","json":"/paper/2607.07439/citation-record.json","paper":"/paper/2607.07439"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.ic.2012.10.006","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Linear programming in the semi-streaming model with ap- plication to the maximum matching problem.Inf","venue":"Information and Computation","work_id":"b6dc7490-6253-4994-8a1d-2ded35dcd66a","year":2013},"citing_paper":{"arxiv_id":"2607.07439","last_updated":"2026-07-09T12:58:56Z","snapshot_observed_at":"2026-08-16T03:52:46.666229Z","submitted_at":"2026-07-08T14:11:13Z","title":"On the Assadi Liu Tarjan Auction Algorithm for Bipartite Matching: Simplification, Alternative Analysis, and Hard Instance","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-10T18:59:54.280107Z"},"links":{"citing_paper":"/paper/2607.07439"},"observation_digest":"sha256:0af6705717ffd4bd799ac3e9a267791d173e6eebd089f93cf56971d51eaafdf4","observation_id":"602f2a2d-2171-41e9-80f4-32394e31812f","resolution":{"observed_at":"2026-07-10T19:07:35.026656Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-07-09T11:20:46.187064+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T11:20:46.187064+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3154855","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Access to data and number of iterations: Dual primal algorithms for maximum matching under resource constraints.ACM Trans","venue":"ACM Transactions on Parallel Computing","work_id":"7ef65c70-9627-4eaa-9ea6-770e6e918676","year":2018},"citing_paper":{"arxiv_id":"2607.07439","last_updated":"2026-07-09T12:58:56Z","snapshot_observed_at":"2026-08-16T03:52:46.666229Z","submitted_at":"2026-07-08T14:11:13Z","title":"On the Assadi Liu Tarjan Auction Algorithm for Bipartite Matching: Simplification, Alternative Analysis, and Hard Instance","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-10T18:59:54.280107Z"},"links":{"citing_paper":"/paper/2607.07439"},"observation_digest":"sha256:c9f88be676c5f42373af26b72b600152d3e2d3573a6aea039938a57bab1786c1","observation_id":"dc8f8d47-c69e-462d-9df7-e957705d9472","resolution":{"observed_at":"2026-07-10T19:07:35.024584Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-07-09T11:20:46.501565+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T11:20:46.501565+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+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-07-10T19:17:33.064648Z","title":"A simple (1 -ϵ)-approximation semi-streaming algorithm for maximum (weighted) matching","venue":null,"work_id":"7dfbdbbd-f311-4132-a994-ab5204f49738","year":2024},"citing_paper":{"arxiv_id":"2607.07439","last_updated":"2026-07-09T12:58:56Z","snapshot_observed_at":"2026-08-16T03:52:46.666229Z","submitted_at":"2026-07-08T14:11:13Z","title":"On the Assadi Liu Tarjan Auction Algorithm for Bipartite Matching: Simplification, Alternative Analysis, and Hard Instance","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-10T18:59:54.280107Z"},"links":{"citing_paper":"/paper/2607.07439"},"observation_digest":"sha256:868d0191b4a0f31eb21904629269d3a08f560a50d5034b639fb65c23bc78cee0","observation_id":"0c74c764-4bab-4187-81fc-9859bcee14d8","resolution":{"observed_at":"2026-07-10T19:17:33.066161Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.approx/random.2021.48","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On the Robust Communication Complexity of Bipar- tite Matching","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"a90fd396-56f6-4a0c-9528-aa32325ee53e","year":2021},"citing_paper":{"arxiv_id":"2607.07439","last_updated":"2026-07-09T12:58:56Z","snapshot_observed_at":"2026-08-16T03:52:46.666229Z","submitted_at":"2026-07-08T14:11:13Z","title":"On the Assadi Liu Tarjan Auction Algorithm for Bipartite Matching: Simplification, Alternative Analysis, and Hard Instance","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-10T18:59:54.280107Z"},"links":{"citing_paper":"/paper/2607.07439"},"observation_digest":"sha256:ca9d15c787e6c119cb20f8d61fbae3692531f1f1606debd10d9bcd8bb2415676","observation_id":"4d1be63a-8fca-4987-9ad8-d852538e9925","resolution":{"observed_at":"2026-07-10T19:07:35.028457Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-07-09T11:20:46.730026+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T11:20:46.730026+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611977073.29","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Semi-streaming bipartite matching in fewer passes and optimal space","venue":"Society for Industrial and Applied Mathematics eBooks","work_id":"8b75c3a7-cd5e-48b2-a300-5c995d4b44a1","year":2022},"citing_paper":{"arxiv_id":"2607.07439","last_updated":"2026-07-09T12:58:56Z","snapshot_observed_at":"2026-08-16T03:52:46.666229Z","submitted_at":"2026-07-08T14:11:13Z","title":"On the Assadi Liu Tarjan Auction Algorithm for Bipartite Matching: Simplification, Alternative Analysis, and Hard Instance","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-10T18:59:54.280107Z"},"links":{"citing_paper":"/paper/2607.07439"},"observation_digest":"sha256:ede2c2bcf9e00ff8163522eca8cbab3bc82f95e68177842f859705f19b9e97ff","observation_id":"f78a01be-d4fe-460d-b0b8-4ebd600422b6","resolution":{"observed_at":"2026-07-10T19:07:35.030140Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-07-09T11:20:46.980248+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T11:20:46.980248+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611976496.18","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Cliff Liu and Robert E","venue":"Society for Industrial and Applied Mathematics eBooks","work_id":"3046706e-05d0-45cd-bf8b-31ae945e93a4","year":2021},"citing_paper":{"arxiv_id":"2607.07439","last_updated":"2026-07-09T12:58:56Z","snapshot_observed_at":"2026-08-16T03:52:46.666229Z","submitted_at":"2026-07-08T14:11:13Z","title":"On the Assadi Liu Tarjan Auction Algorithm for Bipartite Matching: Simplification, Alternative Analysis, and Hard Instance","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-10T18:59:54.280107Z"},"links":{"citing_paper":"/paper/2607.07439"},"observation_digest":"sha256:fb303291b9f2c66b26a9b9493857dac82e9214eef307703d2c8b4e5275ba7de4","observation_id":"823ecbef-0428-4f2b-bbc2-34798192acab","resolution":{"observed_at":"2026-07-10T19:07:35.031840Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-07-09T11:20:47.220517+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T11:20:47.220517+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2019.00096","doi":"10.1109/focs.2019.00096","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pp","venue":null,"work_id":"c0ce7de2-b1b4-44e7-90be-eedaf9d5a0c0","year":2019},"citing_paper":{"arxiv_id":"2607.07439","last_updated":"2026-07-09T12:58:56Z","snapshot_observed_at":"2026-08-16T03:52:46.666229Z","submitted_at":"2026-07-08T14:11:13Z","title":"On the Assadi Liu Tarjan Auction Algorithm for Bipartite Matching: Simplification, Alternative Analysis, and Hard Instance","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-10T18:59:54.280107Z"},"links":{"citing_paper":"/paper/2607.07439"},"observation_digest":"sha256:ef9a9281487ff7188507f5f2605f9b44da17e03c40f57cc1472cd26af20cfcb1","observation_id":"5508723b-b6f8-414a-8dd2-0ec0f50b5d6b","resolution":{"observed_at":"2026-07-10T19:07:35.022638Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-07-09T11:20:47.446865+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T11:20:47.446865+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00224-023-10155-7","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Improved bounds for matching in random-order streams.Theory Comput","venue":"Theory of Computing Systems","work_id":"329acbd6-0ba1-4539-85e2-587afccfa3fe","year":2024},"citing_paper":{"arxiv_id":"2607.07439","last_updated":"2026-07-09T12:58:56Z","snapshot_observed_at":"2026-08-16T03:52:46.666229Z","submitted_at":"2026-07-08T14:11:13Z","title":"On the Assadi Liu Tarjan Auction Algorithm for Bipartite Matching: Simplification, Alternative Analysis, and Hard Instance","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-10T18:59:54.280107Z"},"links":{"citing_paper":"/paper/2607.07439"},"observation_digest":"sha256:f0f5caceda95d3857b7814b742a0251b78a8b047755f48b042354fa39add6f4c","observation_id":"ae141502-d29c-4caa-a828-d3af819550de","resolution":{"observed_at":"2026-07-10T19:07:35.019869Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-07-09T11:20:47.733189+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T11:20:47.733189+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.fsttcs.2020.26","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T19:07:35.007908Z","title":"Constructing large matchings via query access to a maximal matching oracle","venue":null,"work_id":"2d14a386-1d17-4525-b721-def609955733","year":2020},"citing_paper":{"arxiv_id":"2607.07439","last_updated":"2026-07-09T12:58:56Z","snapshot_observed_at":"2026-08-16T03:52:46.666229Z","submitted_at":"2026-07-08T14:11:13Z","title":"On the Assadi Liu Tarjan Auction Algorithm for Bipartite Matching: Simplification, Alternative Analysis, and Hard Instance","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-10T18:59:54.280107Z"},"links":{"citing_paper":"/paper/2607.07439"},"observation_digest":"sha256:a5732b6107331dab62007eb8c16491baca096d1ea8ff6ce8e76356fc22aa7c92","observation_id":"45380fac-293a-46c4-b645-6100d717bb54","resolution":{"observed_at":"2026-07-10T19:07:35.009160Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-07-09T11:20:47.979237+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T11:20:47.979237+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00453-011-9556-8","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Bipartite matching in the semi-streaming model.Algorithmica, 63(1-2):490–508, 2012","venue":"Algorithmica","work_id":"61576931-a53e-45ae-a21e-58906752ffbd","year":2012},"citing_paper":{"arxiv_id":"2607.07439","last_updated":"2026-07-09T12:58:56Z","snapshot_observed_at":"2026-08-16T03:52:46.666229Z","submitted_at":"2026-07-08T14:11:13Z","title":"On the Assadi Liu Tarjan Auction Algorithm for Bipartite Matching: Simplification, Alternative Analysis, and Hard Instance","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-10T18:59:54.280107Z"},"links":{"citing_paper":"/paper/2607.07439"},"observation_digest":"sha256:23fe2d7d7f2c3387f6ca9246263777329518af24caed06e34bfb9e478401fa1c","observation_id":"7b073f4a-a336-4336-8cc7-4140b930ae25","resolution":{"observed_at":"2026-07-10T19:07:35.007352Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-07-09T11:20:48.200643+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T11:20:48.200643+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.tcs.2005.09.013","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On graph problems in a semi-streaming model","venue":"Theoretical Computer Science","work_id":"0d295b72-1c7f-4034-baef-cce6b159096b","year":2005},"citing_paper":{"arxiv_id":"2607.07439","last_updated":"2026-07-09T12:58:56Z","snapshot_observed_at":"2026-08-16T03:52:46.666229Z","submitted_at":"2026-07-08T14:11:13Z","title":"On the Assadi Liu Tarjan Auction Algorithm for Bipartite Matching: Simplification, Alternative Analysis, and Hard Instance","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-10T18:59:54.280107Z"},"links":{"citing_paper":"/paper/2607.07439"},"observation_digest":"sha256:c6b51cf31532960197764021a96233c368f2c3fe55b5e1d390c16af3dc4bab23","observation_id":"b02aa41c-d11c-4f29-81e3-73d018f48556","resolution":{"observed_at":"2026-07-10T19:07:35.012773Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-07-09T11:20:48.451691+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T11:20:48.451691+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611973075.76","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Karloff, Siddharth Suri, and Sergei Vassilvitskii","venue":null,"work_id":"9ee65f8d-0130-4993-aa2b-58be63c6d8e8","year":2010},"citing_paper":{"arxiv_id":"2607.07439","last_updated":"2026-07-09T12:58:56Z","snapshot_observed_at":"2026-08-16T03:52:46.666229Z","submitted_at":"2026-07-08T14:11:13Z","title":"On the Assadi Liu Tarjan Auction Algorithm for Bipartite Matching: Simplification, Alternative Analysis, and Hard Instance","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-10T18:59:54.280107Z"},"links":{"citing_paper":"/paper/2607.07439"},"observation_digest":"sha256:787b05190c0e363cb504da8337ab28d7a74d100e6bbad4403a1eb88dab270906","observation_id":"66b6057c-dd25-4022-870f-7cded7b83f40","resolution":{"observed_at":"2026-07-10T19:07:35.005572Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-07-09T11:20:48.71795+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T11:20:48.71795+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.mfcs.2018.74","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A simple augmentation method for matchings with applications to stream- ing algorithms","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"486c6df1-2875-4f57-85e3-ba126e726ebd","year":2018},"citing_paper":{"arxiv_id":"2607.07439","last_updated":"2026-07-09T12:58:56Z","snapshot_observed_at":"2026-08-16T03:52:46.666229Z","submitted_at":"2026-07-08T14:11:13Z","title":"On the Assadi Liu Tarjan Auction Algorithm for Bipartite Matching: Simplification, Alternative Analysis, and Hard Instance","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-10T18:59:54.280107Z"},"links":{"citing_paper":"/paper/2607.07439"},"observation_digest":"sha256:5283134be1355ce3901eb2920919f087d18a0b820aa608935090f582d312307d","observation_id":"08a4a00e-4bd6-4c0d-b426-d20db00255a2","resolution":{"observed_at":"2026-07-10T19:07:35.014778Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-07-09T11:20:48.966842+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T11:20:48.966842+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-642-32512-0","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Maximum matching in semi-streaming with few passes","venue":null,"work_id":"ef6959da-ca66-4081-b9eb-58c14c13fb85","year":2012},"citing_paper":{"arxiv_id":"2607.07439","last_updated":"2026-07-09T12:58:56Z","snapshot_observed_at":"2026-08-16T03:52:46.666229Z","submitted_at":"2026-07-08T14:11:13Z","title":"On the Assadi Liu Tarjan Auction Algorithm for Bipartite Matching: Simplification, Alternative Analysis, and Hard Instance","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-10T18:59:54.280107Z"},"links":{"citing_paper":"/paper/2607.07439"},"observation_digest":"sha256:dabf2e77e9ac939f1e89dc476d7c018ab4f07199f6538f313c564343f4553f52","observation_id":"b78e6719-09cc-4b5f-9232-4658a51e59d4","resolution":{"observed_at":"2026-07-10T19:07:35.016519Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-07-09T11:20:49.211503+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T11:20:49.211503+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.approx/random.2021.19","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"a2a5b9f8-2e19-4472-a2d1-66c9e6e563e4","year":2021},"citing_paper":{"arxiv_id":"2607.07439","last_updated":"2026-07-09T12:58:56Z","snapshot_observed_at":"2026-08-16T03:52:46.666229Z","submitted_at":"2026-07-08T14:11:13Z","title":"On the Assadi Liu Tarjan Auction Algorithm for Bipartite Matching: Simplification, Alternative Analysis, and Hard Instance","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-10T18:59:54.280107Z"},"links":{"citing_paper":"/paper/2607.07439"},"observation_digest":"sha256:ef4d775eeb76f4a6a37f6d657f44e09059f0159e828101ca1fc08344011c3802","observation_id":"16cffb6a-93d8-41c7-938c-340c8209c7b7","resolution":{"observed_at":"2026-07-10T19:07:35.018136Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-07-09T11:20:49.451136+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T11:20:49.451136+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.stacs.2023","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Naidu, and Arun Steward","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","work_id":"1a4b1eaa-1d89-4773-96c9-af9bedc00e30","year":2023},"citing_paper":{"arxiv_id":"2607.07439","last_updated":"2026-07-09T12:58:56Z","snapshot_observed_at":"2026-08-16T03:52:46.666229Z","submitted_at":"2026-07-08T14:11:13Z","title":"On the Assadi Liu Tarjan Auction Algorithm for Bipartite Matching: Simplification, Alternative Analysis, and Hard Instance","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-10T18:59:54.280107Z"},"links":{"citing_paper":"/paper/2607.07439"},"observation_digest":"sha256:348df9b30151dbbdb29604ac9b293d577e97c4731797b895f6eb5e9289e4288b","observation_id":"88a8d764-c456-493e-83a2-616373657500","resolution":{"observed_at":"2026-07-10T19:07:35.033510Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-07-09T11:20:49.693239+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T11:20:49.693239+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/11538462","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Finding Graph Matchings in Data Streams , booktitle =","venue":null,"work_id":"16175f90-fe88-4a23-9316-329325258d22","year":2005},"citing_paper":{"arxiv_id":"2607.07439","last_updated":"2026-07-09T12:58:56Z","snapshot_observed_at":"2026-08-16T03:52:46.666229Z","submitted_at":"2026-07-08T14:11:13Z","title":"On the Assadi Liu Tarjan Auction Algorithm for Bipartite Matching: Simplification, Alternative Analysis, and Hard Instance","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-10T18:59:54.280107Z"},"links":{"citing_paper":"/paper/2607.07439"},"observation_digest":"sha256:331978df8359290259680d2c4f3bcd0660660bfe9b8dc0eb73809a62353b6e1e","observation_id":"6d92bcf3-1a0d-466a-9737-4dda3d7300f0","resolution":{"observed_at":"2026-07-10T19:07:35.010910Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-07-09T11:20:49.910967+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T11:20:49.910967+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2607.07439","last_updated":"2026-07-09T12:58:56Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-16T03:52:46.666229Z","submitted_at":"2026-07-08T14:11:13Z","title":"On the Assadi Liu Tarjan Auction Algorithm for Bipartite Matching: Simplification, Alternative Analysis, and Hard Instance"},"reference_resolution":{"displayed":17,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":16,"verified_fuzzy":1},"total_outbound_references":17},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"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."}