{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:AS4AC7V7LEQLTQYLDAE34OUN7I","short_pith_number":"pith:AS4AC7V7","schema_version":"1.0","canonical_sha256":"04b8017ebf5920b9c30b1809be3a8dfa214155a31cee72513e3763fd0e2d2fb2","source":{"kind":"arxiv","id":"1008.3938","version":1},"attestation_state":"computed","paper":{"title":"Combinatorial Approximation Algorithms for MaxCut using Random Walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"C. Seshadhri, Satyen Kale","submitted_at":"2010-08-23T23:51:46Z","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"},"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":"1008.3938","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-08-23T23:51:46Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"3658b5393c6368793743153cd7fa5a425ef72719d66004132291e070bad12e40","abstract_canon_sha256":"1aa0d1c9caf377dab26e267121bc6754daafea1dd66514fc0cc7909f35f0e6d2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:41:54.472666Z","signature_b64":"0c/HQr899RH0NSUxuWi24o+QI3rxKWYxr7e18rXkGPCEnS8lGYw4PLkPiHQ7jvc1VhYjj98wnW6BDS84Oq8vDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04b8017ebf5920b9c30b1809be3a8dfa214155a31cee72513e3763fd0e2d2fb2","last_reissued_at":"2026-05-18T04:41:54.472044Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:41:54.472044Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Combinatorial Approximation Algorithms for MaxCut using Random Walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"C. Seshadhri, Satyen Kale","submitted_at":"2010-08-23T23:51:46Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.3938","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1008.3938","created_at":"2026-05-18T04:41:54.472131+00:00"},{"alias_kind":"arxiv_version","alias_value":"1008.3938v1","created_at":"2026-05-18T04:41:54.472131+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.3938","created_at":"2026-05-18T04:41:54.472131+00:00"},{"alias_kind":"pith_short_12","alias_value":"AS4AC7V7LEQL","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_16","alias_value":"AS4AC7V7LEQLTQYL","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_8","alias_value":"AS4AC7V7","created_at":"2026-05-18T12:26:05.355336+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AS4AC7V7LEQLTQYLDAE34OUN7I","json":"https://pith.science/pith/AS4AC7V7LEQLTQYLDAE34OUN7I.json","graph_json":"https://pith.science/api/pith-number/AS4AC7V7LEQLTQYLDAE34OUN7I/graph.json","events_json":"https://pith.science/api/pith-number/AS4AC7V7LEQLTQYLDAE34OUN7I/events.json","paper":"https://pith.science/paper/AS4AC7V7"},"agent_actions":{"view_html":"https://pith.science/pith/AS4AC7V7LEQLTQYLDAE34OUN7I","download_json":"https://pith.science/pith/AS4AC7V7LEQLTQYLDAE34OUN7I.json","view_paper":"https://pith.science/paper/AS4AC7V7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1008.3938&json=true","fetch_graph":"https://pith.science/api/pith-number/AS4AC7V7LEQLTQYLDAE34OUN7I/graph.json","fetch_events":"https://pith.science/api/pith-number/AS4AC7V7LEQLTQYLDAE34OUN7I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AS4AC7V7LEQLTQYLDAE34OUN7I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AS4AC7V7LEQLTQYLDAE34OUN7I/action/storage_attestation","attest_author":"https://pith.science/pith/AS4AC7V7LEQLTQYLDAE34OUN7I/action/author_attestation","sign_citation":"https://pith.science/pith/AS4AC7V7LEQLTQYLDAE34OUN7I/action/citation_signature","submit_replication":"https://pith.science/pith/AS4AC7V7LEQLTQYLDAE34OUN7I/action/replication_record"}},"created_at":"2026-05-18T04:41:54.472131+00:00","updated_at":"2026-05-18T04:41:54.472131+00:00"}