{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:XM7BHMJJZHZJAQ6A74SUP3IWDS","short_pith_number":"pith:XM7BHMJJ","schema_version":"1.0","canonical_sha256":"bb3e13b129c9f29043c0ff2547ed161cbc8e85fcbfe64098384ebbde79b0e801","source":{"kind":"arxiv","id":"2607.07439","version":1},"attestation_state":"computed","paper":{"title":"On the Assadi Liu Tarjan Auction Algorithm for Bipartite Matching: Simplification, Alternative Analysis, and Hard Instance","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Archie Walton, Christian Konrad, Eric Wang, Kheeran K. Naidu","submitted_at":"2026-07-08T14:11:13Z","abstract_excerpt":"Assadi, Liu, and Tarjan [SOSA'21] gave an auction algorithm that outputs a $(1-\\epsilon)$-approximation to Maximum Matching in bipartite graphs. Their algorithm computes a sequence of $O(\\frac{1}{\\epsilon^2})$ maximal matchings in subgraphs of the input graph and can be implemented in the multi-pass streaming setting with $O(\\frac{1}{\\epsilon^2})$ passes in a straightforward manner, which constitutes the state-of-the-art pass/approximation trade-off result in the multi-pass streaming setting. Their analysis uses tools from combinatorial auctions and, at its heart, relies on a clever potential "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2607.07439","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-08T14:11:13Z","cross_cats_sorted":[],"title_canon_sha256":"462595541448c1f9db3eefb93ba9d36419dc55669f4b02e3780324c1a0dbcd20","abstract_canon_sha256":"2b798368ca51106d43fa16e35968f7198050ff1c66ac8291a922579a79518b39"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-09T01:20:24.941594Z","signature_b64":"MeH0wI3QEAkPpYZThcNyO/cYrMQTMWjdexoanjV9QSO83xrHxOjGefTNfrCN04nVFgtBFL2KjJAdApnegDtSDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb3e13b129c9f29043c0ff2547ed161cbc8e85fcbfe64098384ebbde79b0e801","last_reissued_at":"2026-07-09T01:20:24.941184Z","signature_status":"signed_v1","first_computed_at":"2026-07-09T01:20:24.941184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Assadi Liu Tarjan Auction Algorithm for Bipartite Matching: Simplification, Alternative Analysis, and Hard Instance","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Archie Walton, Christian Konrad, Eric Wang, Kheeran K. Naidu","submitted_at":"2026-07-08T14:11:13Z","abstract_excerpt":"Assadi, Liu, and Tarjan [SOSA'21] gave an auction algorithm that outputs a $(1-\\epsilon)$-approximation to Maximum Matching in bipartite graphs. Their algorithm computes a sequence of $O(\\frac{1}{\\epsilon^2})$ maximal matchings in subgraphs of the input graph and can be implemented in the multi-pass streaming setting with $O(\\frac{1}{\\epsilon^2})$ passes in a straightforward manner, which constitutes the state-of-the-art pass/approximation trade-off result in the multi-pass streaming setting. Their analysis uses tools from combinatorial auctions and, at its heart, relies on a clever potential "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.07439","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.07439/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2607.07439","created_at":"2026-07-09T01:20:24.941240+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.07439v1","created_at":"2026-07-09T01:20:24.941240+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.07439","created_at":"2026-07-09T01:20:24.941240+00:00"},{"alias_kind":"pith_short_12","alias_value":"XM7BHMJJZHZJ","created_at":"2026-07-09T01:20:24.941240+00:00"},{"alias_kind":"pith_short_16","alias_value":"XM7BHMJJZHZJAQ6A","created_at":"2026-07-09T01:20:24.941240+00:00"},{"alias_kind":"pith_short_8","alias_value":"XM7BHMJJ","created_at":"2026-07-09T01:20:24.941240+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XM7BHMJJZHZJAQ6A74SUP3IWDS","json":"https://pith.science/pith/XM7BHMJJZHZJAQ6A74SUP3IWDS.json","graph_json":"https://pith.science/api/pith-number/XM7BHMJJZHZJAQ6A74SUP3IWDS/graph.json","events_json":"https://pith.science/api/pith-number/XM7BHMJJZHZJAQ6A74SUP3IWDS/events.json","paper":"https://pith.science/paper/XM7BHMJJ"},"agent_actions":{"view_html":"https://pith.science/pith/XM7BHMJJZHZJAQ6A74SUP3IWDS","download_json":"https://pith.science/pith/XM7BHMJJZHZJAQ6A74SUP3IWDS.json","view_paper":"https://pith.science/paper/XM7BHMJJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.07439&json=true","fetch_graph":"https://pith.science/api/pith-number/XM7BHMJJZHZJAQ6A74SUP3IWDS/graph.json","fetch_events":"https://pith.science/api/pith-number/XM7BHMJJZHZJAQ6A74SUP3IWDS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XM7BHMJJZHZJAQ6A74SUP3IWDS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XM7BHMJJZHZJAQ6A74SUP3IWDS/action/storage_attestation","attest_author":"https://pith.science/pith/XM7BHMJJZHZJAQ6A74SUP3IWDS/action/author_attestation","sign_citation":"https://pith.science/pith/XM7BHMJJZHZJAQ6A74SUP3IWDS/action/citation_signature","submit_replication":"https://pith.science/pith/XM7BHMJJZHZJAQ6A74SUP3IWDS/action/replication_record"}},"created_at":"2026-07-09T01:20:24.941240+00:00","updated_at":"2026-07-09T01:20:24.941240+00:00"}