{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:XM7BHMJJZHZJAQ6A74SUP3IWDS","short_pith_number":"pith:XM7BHMJJ","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"},"canonical_sha256":"bb3e13b129c9f29043c0ff2547ed161cbc8e85fcbfe64098384ebbde79b0e801","source":{"kind":"arxiv","id":"2607.07439","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.07439","created_at":"2026-07-09T01:20:24Z"},{"alias_kind":"arxiv_version","alias_value":"2607.07439v1","created_at":"2026-07-09T01:20:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.07439","created_at":"2026-07-09T01:20:24Z"},{"alias_kind":"pith_short_12","alias_value":"XM7BHMJJZHZJ","created_at":"2026-07-09T01:20:24Z"},{"alias_kind":"pith_short_16","alias_value":"XM7BHMJJZHZJAQ6A","created_at":"2026-07-09T01:20:24Z"},{"alias_kind":"pith_short_8","alias_value":"XM7BHMJJ","created_at":"2026-07-09T01:20:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:XM7BHMJJZHZJAQ6A74SUP3IWDS","target":"record","payload":{"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"},"canonical_sha256":"bb3e13b129c9f29043c0ff2547ed161cbc8e85fcbfe64098384ebbde79b0e801","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"},"source_kind":"arxiv","source_id":"2607.07439","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-09T01:20:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mAG6NGtcCc2++MlzNZSQCn/c37z0G17HjZdrZtdKH1u8Xvm36W+Tm2MRPkZvcBmL0EC93tvQ4MiPsfh6R1YDAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T02:29:47.006751Z"},"content_sha256":"5c9bdda4e24e64931d1e0ed3ac2262ff5115aa88a9bdc8abedbfcc5704c3b797","schema_version":"1.0","event_id":"sha256:5c9bdda4e24e64931d1e0ed3ac2262ff5115aa88a9bdc8abedbfcc5704c3b797"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:XM7BHMJJZHZJAQ6A74SUP3IWDS","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-09T01:20:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c9CrnSoXR+sIcSK3/RGxOc7CMcOsdEbOuGBgWBZ/r3yZ41VcAb5H8tSDha12T8WqweT3GhHzOJW2/JtDqtlKBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T02:29:47.007259Z"},"content_sha256":"9042dfdf12c434e6a5b9573689b24adf26fd35aeb3b0667da46cc2464137659e","schema_version":"1.0","event_id":"sha256:9042dfdf12c434e6a5b9573689b24adf26fd35aeb3b0667da46cc2464137659e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XM7BHMJJZHZJAQ6A74SUP3IWDS/bundle.json","state_url":"https://pith.science/pith/XM7BHMJJZHZJAQ6A74SUP3IWDS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XM7BHMJJZHZJAQ6A74SUP3IWDS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-23T02:29:47Z","links":{"resolver":"https://pith.science/pith/XM7BHMJJZHZJAQ6A74SUP3IWDS","bundle":"https://pith.science/pith/XM7BHMJJZHZJAQ6A74SUP3IWDS/bundle.json","state":"https://pith.science/pith/XM7BHMJJZHZJAQ6A74SUP3IWDS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XM7BHMJJZHZJAQ6A74SUP3IWDS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:XM7BHMJJZHZJAQ6A74SUP3IWDS","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2b798368ca51106d43fa16e35968f7198050ff1c66ac8291a922579a79518b39","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-08T14:11:13Z","title_canon_sha256":"462595541448c1f9db3eefb93ba9d36419dc55669f4b02e3780324c1a0dbcd20"},"schema_version":"1.0","source":{"id":"2607.07439","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.07439","created_at":"2026-07-09T01:20:24Z"},{"alias_kind":"arxiv_version","alias_value":"2607.07439v1","created_at":"2026-07-09T01:20:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.07439","created_at":"2026-07-09T01:20:24Z"},{"alias_kind":"pith_short_12","alias_value":"XM7BHMJJZHZJ","created_at":"2026-07-09T01:20:24Z"},{"alias_kind":"pith_short_16","alias_value":"XM7BHMJJZHZJAQ6A","created_at":"2026-07-09T01:20:24Z"},{"alias_kind":"pith_short_8","alias_value":"XM7BHMJJ","created_at":"2026-07-09T01:20:24Z"}],"graph_snapshots":[{"event_id":"sha256:9042dfdf12c434e6a5b9573689b24adf26fd35aeb3b0667da46cc2464137659e","target":"graph","created_at":"2026-07-09T01:20:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.07439/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Archie Walton, Christian Konrad, Eric Wang, Kheeran K. Naidu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-08T14:11:13Z","title":"On the Assadi Liu Tarjan Auction Algorithm for Bipartite Matching: Simplification, Alternative Analysis, and Hard Instance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.07439","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5c9bdda4e24e64931d1e0ed3ac2262ff5115aa88a9bdc8abedbfcc5704c3b797","target":"record","created_at":"2026-07-09T01:20:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2b798368ca51106d43fa16e35968f7198050ff1c66ac8291a922579a79518b39","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-08T14:11:13Z","title_canon_sha256":"462595541448c1f9db3eefb93ba9d36419dc55669f4b02e3780324c1a0dbcd20"},"schema_version":"1.0","source":{"id":"2607.07439","kind":"arxiv","version":1}},"canonical_sha256":"bb3e13b129c9f29043c0ff2547ed161cbc8e85fcbfe64098384ebbde79b0e801","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bb3e13b129c9f29043c0ff2547ed161cbc8e85fcbfe64098384ebbde79b0e801","first_computed_at":"2026-07-09T01:20:24.941184Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-09T01:20:24.941184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MeH0wI3QEAkPpYZThcNyO/cYrMQTMWjdexoanjV9QSO83xrHxOjGefTNfrCN04nVFgtBFL2KjJAdApnegDtSDg==","signature_status":"signed_v1","signed_at":"2026-07-09T01:20:24.941594Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.07439","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5c9bdda4e24e64931d1e0ed3ac2262ff5115aa88a9bdc8abedbfcc5704c3b797","sha256:9042dfdf12c434e6a5b9573689b24adf26fd35aeb3b0667da46cc2464137659e"],"state_sha256":"acb0ecf7cf40016d8c0a90e1124acb5921f7c1393532d7de0adab0660a26fa08"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DMrq9KKqsFUuJau4hyrFiTyirW2q3uBMWeQv++BbaOEIQEEGq0b3fIyWp0irFUMKliLgMQ+iWmRA8MZqIdG3BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T02:29:47.011794Z","bundle_sha256":"3b79ac1cc02f9d4b16e9dc5a09108b178db4b4b0f3df3a3a5e345873731117f3"}}