{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SHVNEYQ3CV2CNM6PZYG5UQULOF","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":"037239876ea824129babf9855f264954a63e3db115c56d0dc8efc0ca023836f1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-27T09:04:16Z","title_canon_sha256":"d577d292aa7315c4a35061b513bf0945b6345268420828967ff27475d93b7f5b"},"schema_version":"1.0","source":{"id":"1811.10879","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.10879","created_at":"2026-05-17T23:59:47Z"},{"alias_kind":"arxiv_version","alias_value":"1811.10879v1","created_at":"2026-05-17T23:59:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.10879","created_at":"2026-05-17T23:59:47Z"},{"alias_kind":"pith_short_12","alias_value":"SHVNEYQ3CV2C","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SHVNEYQ3CV2CNM6P","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SHVNEYQ3","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:1819af66a77edeeb3a731dcd6502b9a9eaf33015292370d7746d2b0a3ca4a097","target":"graph","created_at":"2026-05-17T23:59:47Z","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"},"paper":{"abstract_excerpt":"We consider the problem of estimating the value of MAX-CUT in a graph in the streaming model of computation. At one extreme, there is a trivial $2$-approximation for this problem that uses only $O(\\log n)$ space, namely, count the number of edges and output half of this value as the estimate for the size of the MAX-CUT. On the other extreme, for any fixed $\\epsilon > 0$, if one allows $\\tilde{O}(n)$ space, a $(1+\\epsilon)$-approximate solution to the MAX-CUT value can be obtained by storing an $\\tilde{O}(n)$-size sparsifier that essentially preserves MAX-CUT value.\n  Our main result is that an","authors_text":"Dmitry Krachun, Michael Kapralov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-27T09:04:16Z","title":"An Optimal Space Lower Bound for Approximating MAX-CUT"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.10879","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:12e6bf2f60c1d71ca801dc7ee25732d6ad12f442647d86d36cd158238054698b","target":"record","created_at":"2026-05-17T23:59:47Z","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":"037239876ea824129babf9855f264954a63e3db115c56d0dc8efc0ca023836f1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-27T09:04:16Z","title_canon_sha256":"d577d292aa7315c4a35061b513bf0945b6345268420828967ff27475d93b7f5b"},"schema_version":"1.0","source":{"id":"1811.10879","kind":"arxiv","version":1}},"canonical_sha256":"91ead2621b157426b3cfce0dda428b7158ee2c0fb3fa26f6da920db3879a65d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"91ead2621b157426b3cfce0dda428b7158ee2c0fb3fa26f6da920db3879a65d1","first_computed_at":"2026-05-17T23:59:47.241594Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:47.241594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mTzRfj/xAafx/f/+bUjcRznpPxL8KXPszpsaHjsWcd6NGRO8lyZeUNRjLfRTDuVy1nef0Ynwifx1jFPT+hOiBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:47.242045Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.10879","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:12e6bf2f60c1d71ca801dc7ee25732d6ad12f442647d86d36cd158238054698b","sha256:1819af66a77edeeb3a731dcd6502b9a9eaf33015292370d7746d2b0a3ca4a097"],"state_sha256":"aa4a431f6585bc4ef4a8056ba7e7336f2795dcd354fc5ddf281d983bbf94b2a7"}