{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:O5FSI5IB4IENPKV7ZLQLOKBHYN","short_pith_number":"pith:O5FSI5IB","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"},"canonical_sha256":"774b247501e208d7aabfcae0b72827c37c1ed6ca9795d0ac27fae610af5a498c","source":{"kind":"arxiv","id":"1902.04899","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.04899","created_at":"2026-07-05T02:55:51Z"},{"alias_kind":"arxiv_version","alias_value":"1902.04899v3","created_at":"2026-07-05T02:55:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.04899","created_at":"2026-07-05T02:55:51Z"},{"alias_kind":"pith_short_12","alias_value":"O5FSI5IB4IEN","created_at":"2026-07-05T02:55:51Z"},{"alias_kind":"pith_short_16","alias_value":"O5FSI5IB4IENPKV7","created_at":"2026-07-05T02:55:51Z"},{"alias_kind":"pith_short_8","alias_value":"O5FSI5IB","created_at":"2026-07-05T02:55:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:O5FSI5IB4IENPKV7ZLQLOKBHYN","target":"record","payload":{"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"},"canonical_sha256":"774b247501e208d7aabfcae0b72827c37c1ed6ca9795d0ac27fae610af5a498c","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"},"source_kind":"arxiv","source_id":"1902.04899","source_version":3,"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-05T02:55:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3GIl59zgnnVt2MSb1jJs5zMdn60XrbP+t/jHFuO3D4waBUSil5TEbd2R2jeTKfdibyASbOGjJLDzz6IfyB4OBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T15:33:50.511073Z"},"content_sha256":"4f52b08517709d7e2e1677ef3b8c7387864f08155070ee648dadfc39d7237d2b","schema_version":"1.0","event_id":"sha256:4f52b08517709d7e2e1677ef3b8c7387864f08155070ee648dadfc39d7237d2b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:O5FSI5IB4IENPKV7ZLQLOKBHYN","target":"graph","payload":{"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"},"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-05T02:55:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a2FSzzmVAb9OzkvHdtKTECwWddmN+sdlYTtzCxhYHfDRcCVN7wfIxzi4QgUDmptt/NWOqox41gzP5xuXU+pdAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T15:33:50.511610Z"},"content_sha256":"a34159ca79bf5d5a5fdc3e5d7079558f4d1a03623ec6ee8cdf2801ed50a5d983","schema_version":"1.0","event_id":"sha256:a34159ca79bf5d5a5fdc3e5d7079558f4d1a03623ec6ee8cdf2801ed50a5d983"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O5FSI5IB4IENPKV7ZLQLOKBHYN/bundle.json","state_url":"https://pith.science/pith/O5FSI5IB4IENPKV7ZLQLOKBHYN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O5FSI5IB4IENPKV7ZLQLOKBHYN/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-15T15:33:50Z","links":{"resolver":"https://pith.science/pith/O5FSI5IB4IENPKV7ZLQLOKBHYN","bundle":"https://pith.science/pith/O5FSI5IB4IENPKV7ZLQLOKBHYN/bundle.json","state":"https://pith.science/pith/O5FSI5IB4IENPKV7ZLQLOKBHYN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O5FSI5IB4IENPKV7ZLQLOKBHYN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:O5FSI5IB4IENPKV7ZLQLOKBHYN","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":"ee9368f0c60fc15351d0f61b2c93074b0a6cc516fc0e2cf2616023ab48aa40a9","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-13T13:32:24Z","title_canon_sha256":"1c2fa857d90c27fb3cf4d7005193df0c640997a68951f2413c9ce0f65916483b"},"schema_version":"1.0","source":{"id":"1902.04899","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.04899","created_at":"2026-07-05T02:55:51Z"},{"alias_kind":"arxiv_version","alias_value":"1902.04899v3","created_at":"2026-07-05T02:55:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.04899","created_at":"2026-07-05T02:55:51Z"},{"alias_kind":"pith_short_12","alias_value":"O5FSI5IB4IEN","created_at":"2026-07-05T02:55:51Z"},{"alias_kind":"pith_short_16","alias_value":"O5FSI5IB4IENPKV7","created_at":"2026-07-05T02:55:51Z"},{"alias_kind":"pith_short_8","alias_value":"O5FSI5IB","created_at":"2026-07-05T02:55:51Z"}],"graph_snapshots":[{"event_id":"sha256:a34159ca79bf5d5a5fdc3e5d7079558f4d1a03623ec6ee8cdf2801ed50a5d983","target":"graph","created_at":"2026-07-05T02:55:51Z","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/1902.04899/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"\\'Etienne Bamas, Louis Esperet","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-13T13:32:24Z","title":"Local approximation of the Maximum Cut in regular graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.04899","kind":"arxiv","version":3},"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:4f52b08517709d7e2e1677ef3b8c7387864f08155070ee648dadfc39d7237d2b","target":"record","created_at":"2026-07-05T02:55:51Z","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":"ee9368f0c60fc15351d0f61b2c93074b0a6cc516fc0e2cf2616023ab48aa40a9","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-13T13:32:24Z","title_canon_sha256":"1c2fa857d90c27fb3cf4d7005193df0c640997a68951f2413c9ce0f65916483b"},"schema_version":"1.0","source":{"id":"1902.04899","kind":"arxiv","version":3}},"canonical_sha256":"774b247501e208d7aabfcae0b72827c37c1ed6ca9795d0ac27fae610af5a498c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"774b247501e208d7aabfcae0b72827c37c1ed6ca9795d0ac27fae610af5a498c","first_computed_at":"2026-07-05T02:55:51.216149Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:55:51.216149Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sV6Slv7t0bByHT0HXeK7RHZpP7D0Nvo8R8TsKezQ4kPLST3Gehv8nQMYwS3hxnOYXKb9zdXyY4YPJomQcnscBw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:55:51.216592Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.04899","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f52b08517709d7e2e1677ef3b8c7387864f08155070ee648dadfc39d7237d2b","sha256:a34159ca79bf5d5a5fdc3e5d7079558f4d1a03623ec6ee8cdf2801ed50a5d983"],"state_sha256":"af51eeddbecb723f02b83ff18895286225c53921b66cdff49a64672e2144d1c3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DFPUXg9OwOIDQjKbOk7ROtmBPATPwPRkbCchXH3cEEVK33brw9oHQeP7eryuyP+GalFP3N5xLZ5JkvI/e2KgDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T15:33:50.516666Z","bundle_sha256":"74e9dae41abed553da874cd4f2d5c8d2b994ab6205c154a7072a068d3991a2dd"}}