{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:TUOBLVD4SEP66NZ4QG6VIUKAK6","short_pith_number":"pith:TUOBLVD4","canonical_record":{"source":{"id":"2412.09773","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-12-13T00:44:47Z","cross_cats_sorted":[],"title_canon_sha256":"f3bad7fddc57c4f54aaa74f9c3eb9ec2fb0b61e5c0d02c500eb824ce8fe7e756","abstract_canon_sha256":"44b5d119af5899963a8f82bca182823fc68266d40d7dc803cdfe4dd03800d5bb"},"schema_version":"1.0"},"canonical_sha256":"9d1c15d47c911fef373c81bd5451405795cdf7a6780d6d8aa3ef49ea00288c3e","source":{"kind":"arxiv","id":"2412.09773","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.09773","created_at":"2026-07-05T09:56:57Z"},{"alias_kind":"arxiv_version","alias_value":"2412.09773v2","created_at":"2026-07-05T09:56:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.09773","created_at":"2026-07-05T09:56:57Z"},{"alias_kind":"pith_short_12","alias_value":"TUOBLVD4SEP6","created_at":"2026-07-05T09:56:57Z"},{"alias_kind":"pith_short_16","alias_value":"TUOBLVD4SEP66NZ4","created_at":"2026-07-05T09:56:57Z"},{"alias_kind":"pith_short_8","alias_value":"TUOBLVD4","created_at":"2026-07-05T09:56:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:TUOBLVD4SEP66NZ4QG6VIUKAK6","target":"record","payload":{"canonical_record":{"source":{"id":"2412.09773","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-12-13T00:44:47Z","cross_cats_sorted":[],"title_canon_sha256":"f3bad7fddc57c4f54aaa74f9c3eb9ec2fb0b61e5c0d02c500eb824ce8fe7e756","abstract_canon_sha256":"44b5d119af5899963a8f82bca182823fc68266d40d7dc803cdfe4dd03800d5bb"},"schema_version":"1.0"},"canonical_sha256":"9d1c15d47c911fef373c81bd5451405795cdf7a6780d6d8aa3ef49ea00288c3e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:56:57.618961Z","signature_b64":"/Jwk/09pEx5Av3iM9jii+JwRgPHCFi61YHnRIJ81fM+ca/pVH0FhMGRbzUdJgZ3EmR3l4fAAnpGsHN39x/V9Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d1c15d47c911fef373c81bd5451405795cdf7a6780d6d8aa3ef49ea00288c3e","last_reissued_at":"2026-07-05T09:56:57.618541Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:56:57.618541Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.09773","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-05T09:56:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dRGFADtbptOFg1psw/xXaqmQ5RXfzjC/2n9T3vFeLENGZYMsJCHiA+WBvETSC3PCvKc1Ud720KHmWxfcsOLpBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T19:47:54.603940Z"},"content_sha256":"65b4eacf97936bd3a38dbc7e23bd1c722eb55bac32b268420539ef822227992d","schema_version":"1.0","event_id":"sha256:65b4eacf97936bd3a38dbc7e23bd1c722eb55bac32b268420539ef822227992d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:TUOBLVD4SEP66NZ4QG6VIUKAK6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning-Augmented Streaming Algorithms for Approximating MAX-CUT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ali Vakilian, Pan Peng, Yinhao Dong","submitted_at":"2024-12-13T00:44:47Z","abstract_excerpt":"We study learning-augmented streaming algorithms for estimating the value of MAX-CUT in a graph. In the classical streaming model, while a $1/2$-approximation for estimating the value of MAX-CUT can be trivially achieved with $O(1)$ words of space, Kapralov and Krachun [STOC'19] showed that this is essentially the best possible: for any $\\epsilon > 0$, any (randomized) single-pass streaming algorithm that achieves an approximation ratio of at least $1/2 + \\epsilon$ requires $\\Omega(n / 2^{\\text{poly}(1/\\epsilon)})$ space. We show that it is possible to surpass the $1/2$-approximation barrier u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.09773","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/2412.09773/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-05T09:56:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VfB6fZ7VjiNyaONMf5sL55V5nKm5EFWsQKvaCreChcrh3Oe+3YPMxGvw03yP0sAKv4zs3Pz057sINvowExr1BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T19:47:54.604464Z"},"content_sha256":"b801adbb7aa18e97683e4732f5bc1ad119c0424c45821ff19016d817c122f174","schema_version":"1.0","event_id":"sha256:b801adbb7aa18e97683e4732f5bc1ad119c0424c45821ff19016d817c122f174"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TUOBLVD4SEP66NZ4QG6VIUKAK6/bundle.json","state_url":"https://pith.science/pith/TUOBLVD4SEP66NZ4QG6VIUKAK6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TUOBLVD4SEP66NZ4QG6VIUKAK6/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-20T19:47:54Z","links":{"resolver":"https://pith.science/pith/TUOBLVD4SEP66NZ4QG6VIUKAK6","bundle":"https://pith.science/pith/TUOBLVD4SEP66NZ4QG6VIUKAK6/bundle.json","state":"https://pith.science/pith/TUOBLVD4SEP66NZ4QG6VIUKAK6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TUOBLVD4SEP66NZ4QG6VIUKAK6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:TUOBLVD4SEP66NZ4QG6VIUKAK6","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":"44b5d119af5899963a8f82bca182823fc68266d40d7dc803cdfe4dd03800d5bb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-12-13T00:44:47Z","title_canon_sha256":"f3bad7fddc57c4f54aaa74f9c3eb9ec2fb0b61e5c0d02c500eb824ce8fe7e756"},"schema_version":"1.0","source":{"id":"2412.09773","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.09773","created_at":"2026-07-05T09:56:57Z"},{"alias_kind":"arxiv_version","alias_value":"2412.09773v2","created_at":"2026-07-05T09:56:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.09773","created_at":"2026-07-05T09:56:57Z"},{"alias_kind":"pith_short_12","alias_value":"TUOBLVD4SEP6","created_at":"2026-07-05T09:56:57Z"},{"alias_kind":"pith_short_16","alias_value":"TUOBLVD4SEP66NZ4","created_at":"2026-07-05T09:56:57Z"},{"alias_kind":"pith_short_8","alias_value":"TUOBLVD4","created_at":"2026-07-05T09:56:57Z"}],"graph_snapshots":[{"event_id":"sha256:b801adbb7aa18e97683e4732f5bc1ad119c0424c45821ff19016d817c122f174","target":"graph","created_at":"2026-07-05T09:56:57Z","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/2412.09773/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study learning-augmented streaming algorithms for estimating the value of MAX-CUT in a graph. In the classical streaming model, while a $1/2$-approximation for estimating the value of MAX-CUT can be trivially achieved with $O(1)$ words of space, Kapralov and Krachun [STOC'19] showed that this is essentially the best possible: for any $\\epsilon > 0$, any (randomized) single-pass streaming algorithm that achieves an approximation ratio of at least $1/2 + \\epsilon$ requires $\\Omega(n / 2^{\\text{poly}(1/\\epsilon)})$ space. We show that it is possible to surpass the $1/2$-approximation barrier u","authors_text":"Ali Vakilian, Pan Peng, Yinhao Dong","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-12-13T00:44:47Z","title":"Learning-Augmented Streaming Algorithms for Approximating MAX-CUT"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.09773","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:65b4eacf97936bd3a38dbc7e23bd1c722eb55bac32b268420539ef822227992d","target":"record","created_at":"2026-07-05T09:56:57Z","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":"44b5d119af5899963a8f82bca182823fc68266d40d7dc803cdfe4dd03800d5bb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-12-13T00:44:47Z","title_canon_sha256":"f3bad7fddc57c4f54aaa74f9c3eb9ec2fb0b61e5c0d02c500eb824ce8fe7e756"},"schema_version":"1.0","source":{"id":"2412.09773","kind":"arxiv","version":2}},"canonical_sha256":"9d1c15d47c911fef373c81bd5451405795cdf7a6780d6d8aa3ef49ea00288c3e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9d1c15d47c911fef373c81bd5451405795cdf7a6780d6d8aa3ef49ea00288c3e","first_computed_at":"2026-07-05T09:56:57.618541Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:56:57.618541Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/Jwk/09pEx5Av3iM9jii+JwRgPHCFi61YHnRIJ81fM+ca/pVH0FhMGRbzUdJgZ3EmR3l4fAAnpGsHN39x/V9Bg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:56:57.618961Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.09773","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:65b4eacf97936bd3a38dbc7e23bd1c722eb55bac32b268420539ef822227992d","sha256:b801adbb7aa18e97683e4732f5bc1ad119c0424c45821ff19016d817c122f174"],"state_sha256":"46566347d50c52be074b4895a90ba3ba114f34db04b2d8a6bcc45c9ae3c1cd09"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wdpIPLMVyn7zdtXI8mkR28xzfMWoYkV12wbticIuUCD0fIM4fEp6WO60FYYWyDDejfJWQOJzxMDWfb2p6RfkBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T19:47:54.608142Z","bundle_sha256":"91c64c1159d144ac443a3ec19fa5dfb6cce19dc05966ab8adb7edab274efbe9c"}}