{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:O5FSI5IB4IENPKV7ZLQLOKBHYN","short_pith_number":"pith:O5FSI5IB","schema_version":"1.0","canonical_sha256":"774b247501e208d7aabfcae0b72827c37c1ed6ca9795d0ac27fae610af5a498c","source":{"kind":"arxiv","id":"1902.04899","version":3},"attestation_state":"computed","paper":{"title":"Local approximation of the Maximum Cut in regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"math.CO","authors_text":"\\'Etienne Bamas, Louis Esperet","submitted_at":"2019-02-13T13:32:24Z","abstract_excerpt":"This paper is devoted to the distributed complexity of finding an approximation of the maximum cut in graphs. A classical algorithm consists in letting each vertex choose its side of the cut uniformly at random. This does not require any communication and achieves an approximation ratio of at least $\\tfrac12$ in average. When the graph is $d$-regular and triangle-free, a slightly better approximation ratio can be achieved with a randomized algorithm running in a single round. Here, we investigate the round complexity of deterministic distributed algorithms for MAXCUT in regular graphs. We firs"},"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":"1902.04899","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-13T13:32:24Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"1c2fa857d90c27fb3cf4d7005193df0c640997a68951f2413c9ce0f65916483b","abstract_canon_sha256":"ee9368f0c60fc15351d0f61b2c93074b0a6cc516fc0e2cf2616023ab48aa40a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:55:51.216592Z","signature_b64":"sV6Slv7t0bByHT0HXeK7RHZpP7D0Nvo8R8TsKezQ4kPLST3Gehv8nQMYwS3hxnOYXKb9zdXyY4YPJomQcnscBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"774b247501e208d7aabfcae0b72827c37c1ed6ca9795d0ac27fae610af5a498c","last_reissued_at":"2026-07-05T02:55:51.216149Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:55:51.216149Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Local approximation of the Maximum Cut in regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"math.CO","authors_text":"\\'Etienne Bamas, Louis Esperet","submitted_at":"2019-02-13T13:32:24Z","abstract_excerpt":"This paper is devoted to the distributed complexity of finding an approximation of the maximum cut in graphs. A classical algorithm consists in letting each vertex choose its side of the cut uniformly at random. This does not require any communication and achieves an approximation ratio of at least $\\tfrac12$ in average. When the graph is $d$-regular and triangle-free, a slightly better approximation ratio can be achieved with a randomized algorithm running in a single round. Here, we investigate the round complexity of deterministic distributed algorithms for MAXCUT in regular graphs. We firs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.04899","kind":"arxiv","version":3},"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/1902.04899/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1902.04899","created_at":"2026-07-05T02:55:51.216206+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.04899v3","created_at":"2026-07-05T02:55:51.216206+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.04899","created_at":"2026-07-05T02:55:51.216206+00:00"},{"alias_kind":"pith_short_12","alias_value":"O5FSI5IB4IEN","created_at":"2026-07-05T02:55:51.216206+00:00"},{"alias_kind":"pith_short_16","alias_value":"O5FSI5IB4IENPKV7","created_at":"2026-07-05T02:55:51.216206+00:00"},{"alias_kind":"pith_short_8","alias_value":"O5FSI5IB","created_at":"2026-07-05T02:55:51.216206+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1909.02559","citing_title":"Alibaba Cloud Quantum Development Platform: Applications to Quantum Algorithm Design","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/O5FSI5IB4IENPKV7ZLQLOKBHYN","json":"https://pith.science/pith/O5FSI5IB4IENPKV7ZLQLOKBHYN.json","graph_json":"https://pith.science/api/pith-number/O5FSI5IB4IENPKV7ZLQLOKBHYN/graph.json","events_json":"https://pith.science/api/pith-number/O5FSI5IB4IENPKV7ZLQLOKBHYN/events.json","paper":"https://pith.science/paper/O5FSI5IB"},"agent_actions":{"view_html":"https://pith.science/pith/O5FSI5IB4IENPKV7ZLQLOKBHYN","download_json":"https://pith.science/pith/O5FSI5IB4IENPKV7ZLQLOKBHYN.json","view_paper":"https://pith.science/paper/O5FSI5IB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.04899&json=true","fetch_graph":"https://pith.science/api/pith-number/O5FSI5IB4IENPKV7ZLQLOKBHYN/graph.json","fetch_events":"https://pith.science/api/pith-number/O5FSI5IB4IENPKV7ZLQLOKBHYN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O5FSI5IB4IENPKV7ZLQLOKBHYN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O5FSI5IB4IENPKV7ZLQLOKBHYN/action/storage_attestation","attest_author":"https://pith.science/pith/O5FSI5IB4IENPKV7ZLQLOKBHYN/action/author_attestation","sign_citation":"https://pith.science/pith/O5FSI5IB4IENPKV7ZLQLOKBHYN/action/citation_signature","submit_replication":"https://pith.science/pith/O5FSI5IB4IENPKV7ZLQLOKBHYN/action/replication_record"}},"created_at":"2026-07-05T02:55:51.216206+00:00","updated_at":"2026-07-05T02:55:51.216206+00:00"}