{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:PHW5LXROBDOLL6UKEI6LIQEAC3","short_pith_number":"pith:PHW5LXRO","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"},"canonical_sha256":"79edd5de2e08dcb5fa8a223cb4408016ef674ff586dca850d65fa5b254b4f2d1","source":{"kind":"arxiv","id":"2503.23404","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.23404","created_at":"2026-07-05T12:05:15Z"},{"alias_kind":"arxiv_version","alias_value":"2503.23404v2","created_at":"2026-07-05T12:05:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.23404","created_at":"2026-07-05T12:05:15Z"},{"alias_kind":"pith_short_12","alias_value":"PHW5LXROBDOL","created_at":"2026-07-05T12:05:15Z"},{"alias_kind":"pith_short_16","alias_value":"PHW5LXROBDOLL6UK","created_at":"2026-07-05T12:05:15Z"},{"alias_kind":"pith_short_8","alias_value":"PHW5LXRO","created_at":"2026-07-05T12:05:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:PHW5LXROBDOLL6UKEI6LIQEAC3","target":"record","payload":{"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"},"canonical_sha256":"79edd5de2e08dcb5fa8a223cb4408016ef674ff586dca850d65fa5b254b4f2d1","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"},"source_kind":"arxiv","source_id":"2503.23404","source_version":2,"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-05T12:05:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vMS0QwS8tBJbOF4djl8CezAWpKHs5fQLcR+NtV0a8e83HmVkP5wLq0hxxzXndMF+S8X1vLzkp7Ex3L5DlZscCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T15:41:54.841853Z"},"content_sha256":"c5c40061bde568a063c3cfa19ef87225c259c7be3b077296e79f138c4ceb05d0","schema_version":"1.0","event_id":"sha256:c5c40061bde568a063c3cfa19ef87225c259c7be3b077296e79f138c4ceb05d0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:PHW5LXROBDOLL6UKEI6LIQEAC3","target":"graph","payload":{"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"},"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-05T12:05:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xbtWpeRQlOlynUyM5ZrKNyG6HnD48GcxBFe7gs2UTHrAdnLwJy3e2e81Aq9CUZ+NlQncKo8f/wrqUkrCllICAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T15:41:54.842617Z"},"content_sha256":"21fb34cce880ac73aeb17dc423070db1c08b1cd12edd2283b6d4f03daf5640f0","schema_version":"1.0","event_id":"sha256:21fb34cce880ac73aeb17dc423070db1c08b1cd12edd2283b6d4f03daf5640f0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PHW5LXROBDOLL6UKEI6LIQEAC3/bundle.json","state_url":"https://pith.science/pith/PHW5LXROBDOLL6UKEI6LIQEAC3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PHW5LXROBDOLL6UKEI6LIQEAC3/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-21T15:41:54Z","links":{"resolver":"https://pith.science/pith/PHW5LXROBDOLL6UKEI6LIQEAC3","bundle":"https://pith.science/pith/PHW5LXROBDOLL6UKEI6LIQEAC3/bundle.json","state":"https://pith.science/pith/PHW5LXROBDOLL6UKEI6LIQEAC3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PHW5LXROBDOLL6UKEI6LIQEAC3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:PHW5LXROBDOLL6UKEI6LIQEAC3","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":"199b9dbdb5ecd6d59e0cf70c9d91da68543133f223d7d31eaf3cfacdcc0d05dc","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-03-30T11:22:59Z","title_canon_sha256":"637e5ee684998b2d0d4b2dcad79929ed19e3d1c1c887d09e60539c3b0ec097ad"},"schema_version":"1.0","source":{"id":"2503.23404","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.23404","created_at":"2026-07-05T12:05:15Z"},{"alias_kind":"arxiv_version","alias_value":"2503.23404v2","created_at":"2026-07-05T12:05:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.23404","created_at":"2026-07-05T12:05:15Z"},{"alias_kind":"pith_short_12","alias_value":"PHW5LXROBDOL","created_at":"2026-07-05T12:05:15Z"},{"alias_kind":"pith_short_16","alias_value":"PHW5LXROBDOLL6UK","created_at":"2026-07-05T12:05:15Z"},{"alias_kind":"pith_short_8","alias_value":"PHW5LXRO","created_at":"2026-07-05T12:05:15Z"}],"graph_snapshots":[{"event_id":"sha256:21fb34cce880ac73aeb17dc423070db1c08b1cd12edd2283b6d4f03daf5640f0","target":"graph","created_at":"2026-07-05T12:05:15Z","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/2503.23404/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Dor Minzer, Shuo Wang, Yumou Fei","cross_cats":["cs.CC","cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-03-30T11:22:59Z","title":"Multi-Pass Streaming Lower Bounds for Approximating Max-Cut"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.23404","kind":"arxiv","version":2},"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:c5c40061bde568a063c3cfa19ef87225c259c7be3b077296e79f138c4ceb05d0","target":"record","created_at":"2026-07-05T12:05:15Z","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":"199b9dbdb5ecd6d59e0cf70c9d91da68543133f223d7d31eaf3cfacdcc0d05dc","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-03-30T11:22:59Z","title_canon_sha256":"637e5ee684998b2d0d4b2dcad79929ed19e3d1c1c887d09e60539c3b0ec097ad"},"schema_version":"1.0","source":{"id":"2503.23404","kind":"arxiv","version":2}},"canonical_sha256":"79edd5de2e08dcb5fa8a223cb4408016ef674ff586dca850d65fa5b254b4f2d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"79edd5de2e08dcb5fa8a223cb4408016ef674ff586dca850d65fa5b254b4f2d1","first_computed_at":"2026-07-05T12:05:15.452871Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:05:15.452871Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0MF4HHoWEYWg5se8lKtt8SKZeZC9n9RCx9nCISZ/nZW6/ZrJKZAEbVaM4qGRxsEcHy6tWXbYCcFgO/FoBvZCBw==","signature_status":"signed_v1","signed_at":"2026-07-05T12:05:15.453383Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.23404","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c5c40061bde568a063c3cfa19ef87225c259c7be3b077296e79f138c4ceb05d0","sha256:21fb34cce880ac73aeb17dc423070db1c08b1cd12edd2283b6d4f03daf5640f0"],"state_sha256":"45879a9b4450930fb5e7b00c4109662c79a17fd82488630be218239ef1c400e1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bZyyPrNhbX2A0bzu298d3GRAkm2XUAMn0yneB3xlve0r+m4TKQquK21/uYrz+Y6O6oaDenn6yALs0ojEJd22Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T15:41:54.847224Z","bundle_sha256":"35ceb1eac41ee30467394901b2e1b23d58335b15b10c37494f12fd273fc3ce07"}}