{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:AS4AC7V7LEQLTQYLDAE34OUN7I","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":"1aa0d1c9caf377dab26e267121bc6754daafea1dd66514fc0cc7909f35f0e6d2","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-08-23T23:51:46Z","title_canon_sha256":"3658b5393c6368793743153cd7fa5a425ef72719d66004132291e070bad12e40"},"schema_version":"1.0","source":{"id":"1008.3938","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.3938","created_at":"2026-05-18T04:41:54Z"},{"alias_kind":"arxiv_version","alias_value":"1008.3938v1","created_at":"2026-05-18T04:41:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.3938","created_at":"2026-05-18T04:41:54Z"},{"alias_kind":"pith_short_12","alias_value":"AS4AC7V7LEQL","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"AS4AC7V7LEQLTQYL","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"AS4AC7V7","created_at":"2026-05-18T12:26:05Z"}],"graph_snapshots":[{"event_id":"sha256:8e46f451abc2f0adb1e41decf1bc9faf267cc95eb724de457148f0b737244a3c","target":"graph","created_at":"2026-05-18T04:41:54Z","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 give the first combinatorial approximation algorithm for Maxcut that beats the trivial 0.5 factor by a constant. The main partitioning procedure is very intuitive, natural, and easily described. It essentially performs a number of random walks and aggregates the information to provide the partition. We can control the running time to get an approximation factor-running time tradeoff. We show that for any constant b > 1.5, there is an O(n^{b}) algorithm that outputs a (0.5+delta)-approximation for Maxcut, where delta = delta(b) is some positive constant.\n  One of the components of our algori","authors_text":"C. Seshadhri, Satyen Kale","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-08-23T23:51:46Z","title":"Combinatorial Approximation Algorithms for MaxCut using Random Walks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.3938","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:835b6586c0db2c8d9b0da1f9fd1e12bd23295c4a511ecd402a2ad8fc5d9da406","target":"record","created_at":"2026-05-18T04:41:54Z","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":"1aa0d1c9caf377dab26e267121bc6754daafea1dd66514fc0cc7909f35f0e6d2","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-08-23T23:51:46Z","title_canon_sha256":"3658b5393c6368793743153cd7fa5a425ef72719d66004132291e070bad12e40"},"schema_version":"1.0","source":{"id":"1008.3938","kind":"arxiv","version":1}},"canonical_sha256":"04b8017ebf5920b9c30b1809be3a8dfa214155a31cee72513e3763fd0e2d2fb2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"04b8017ebf5920b9c30b1809be3a8dfa214155a31cee72513e3763fd0e2d2fb2","first_computed_at":"2026-05-18T04:41:54.472044Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:41:54.472044Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0c/HQr899RH0NSUxuWi24o+QI3rxKWYxr7e18rXkGPCEnS8lGYw4PLkPiHQ7jvc1VhYjj98wnW6BDS84Oq8vDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:41:54.472666Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.3938","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:835b6586c0db2c8d9b0da1f9fd1e12bd23295c4a511ecd402a2ad8fc5d9da406","sha256:8e46f451abc2f0adb1e41decf1bc9faf267cc95eb724de457148f0b737244a3c"],"state_sha256":"d814aa0a89f67db41bb22e54c3119523c7947d465175e55eedfdda6d04a81718"}