{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:PHW5LXROBDOLL6UKEI6LIQEAC3","short_pith_number":"pith:PHW5LXRO","schema_version":"1.0","canonical_sha256":"79edd5de2e08dcb5fa8a223cb4408016ef674ff586dca850d65fa5b254b4f2d1","source":{"kind":"arxiv","id":"2503.23404","version":2},"attestation_state":"computed","paper":{"title":"Multi-Pass Streaming Lower Bounds for Approximating Max-Cut","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.DS","authors_text":"Dor Minzer, Shuo Wang, Yumou Fei","submitted_at":"2025-03-30T11:22:59Z","abstract_excerpt":"In the Max-Cut problem in the streaming model, an algorithm is given the edges of an unknown graph $G = (V,E)$ in some fixed order, and its goal is to approximate the size of the largest cut in $G$. Improving upon an earlier result of Kapralov, Khanna and Sudan, it was shown by Kapralov and Krachun that for all $\\varepsilon>0$, no $o(n)$ memory streaming algorithm can achieve a $(1/2+\\varepsilon)$-approximation for Max-Cut. Their result holds for single-pass streams, i.e.~the setting in which the algorithm only views the stream once, and it was open whether multi-pass access may help. The stat"},"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":"2503.23404","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-03-30T11:22:59Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"637e5ee684998b2d0d4b2dcad79929ed19e3d1c1c887d09e60539c3b0ec097ad","abstract_canon_sha256":"199b9dbdb5ecd6d59e0cf70c9d91da68543133f223d7d31eaf3cfacdcc0d05dc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:05:15.453383Z","signature_b64":"0MF4HHoWEYWg5se8lKtt8SKZeZC9n9RCx9nCISZ/nZW6/ZrJKZAEbVaM4qGRxsEcHy6tWXbYCcFgO/FoBvZCBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79edd5de2e08dcb5fa8a223cb4408016ef674ff586dca850d65fa5b254b4f2d1","last_reissued_at":"2026-07-05T12:05:15.452871Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:05:15.452871Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Pass Streaming Lower Bounds for Approximating Max-Cut","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.DS","authors_text":"Dor Minzer, Shuo Wang, Yumou Fei","submitted_at":"2025-03-30T11:22:59Z","abstract_excerpt":"In the Max-Cut problem in the streaming model, an algorithm is given the edges of an unknown graph $G = (V,E)$ in some fixed order, and its goal is to approximate the size of the largest cut in $G$. Improving upon an earlier result of Kapralov, Khanna and Sudan, it was shown by Kapralov and Krachun that for all $\\varepsilon>0$, no $o(n)$ memory streaming algorithm can achieve a $(1/2+\\varepsilon)$-approximation for Max-Cut. Their result holds for single-pass streams, i.e.~the setting in which the algorithm only views the stream once, and it was open whether multi-pass access may help. The stat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.23404","kind":"arxiv","version":2},"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/2503.23404/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":"2503.23404","created_at":"2026-07-05T12:05:15.452935+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.23404v2","created_at":"2026-07-05T12:05:15.452935+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.23404","created_at":"2026-07-05T12:05:15.452935+00:00"},{"alias_kind":"pith_short_12","alias_value":"PHW5LXROBDOL","created_at":"2026-07-05T12:05:15.452935+00:00"},{"alias_kind":"pith_short_16","alias_value":"PHW5LXROBDOLL6UK","created_at":"2026-07-05T12:05:15.452935+00:00"},{"alias_kind":"pith_short_8","alias_value":"PHW5LXRO","created_at":"2026-07-05T12:05:15.452935+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2512.19521","citing_title":"Near-optimal streaming approximation for Max-DICUT in sublinear space using two passes","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2604.07639","citing_title":"Exponential quantum advantage in processing massive classical data","ref_index":94,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PHW5LXROBDOLL6UKEI6LIQEAC3","json":"https://pith.science/pith/PHW5LXROBDOLL6UKEI6LIQEAC3.json","graph_json":"https://pith.science/api/pith-number/PHW5LXROBDOLL6UKEI6LIQEAC3/graph.json","events_json":"https://pith.science/api/pith-number/PHW5LXROBDOLL6UKEI6LIQEAC3/events.json","paper":"https://pith.science/paper/PHW5LXRO"},"agent_actions":{"view_html":"https://pith.science/pith/PHW5LXROBDOLL6UKEI6LIQEAC3","download_json":"https://pith.science/pith/PHW5LXROBDOLL6UKEI6LIQEAC3.json","view_paper":"https://pith.science/paper/PHW5LXRO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.23404&json=true","fetch_graph":"https://pith.science/api/pith-number/PHW5LXROBDOLL6UKEI6LIQEAC3/graph.json","fetch_events":"https://pith.science/api/pith-number/PHW5LXROBDOLL6UKEI6LIQEAC3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PHW5LXROBDOLL6UKEI6LIQEAC3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PHW5LXROBDOLL6UKEI6LIQEAC3/action/storage_attestation","attest_author":"https://pith.science/pith/PHW5LXROBDOLL6UKEI6LIQEAC3/action/author_attestation","sign_citation":"https://pith.science/pith/PHW5LXROBDOLL6UKEI6LIQEAC3/action/citation_signature","submit_replication":"https://pith.science/pith/PHW5LXROBDOLL6UKEI6LIQEAC3/action/replication_record"}},"created_at":"2026-07-05T12:05:15.452935+00:00","updated_at":"2026-07-05T12:05:15.452935+00:00"}