{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:U2HNSAAVPTGSHRTNVMG4VFMKUR","short_pith_number":"pith:U2HNSAAV","canonical_record":{"source":{"id":"2412.12589","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-12-17T06:46:09Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"a881e323ce4721e4585060e30da17f917e0d6ba64b0c4b1c363b2fdf8a415133","abstract_canon_sha256":"2f97dfd8ef7a7426ea53c8c6fa75db141f785f5de9858f9e99b12340f8363d28"},"schema_version":"1.0"},"canonical_sha256":"a68ed900157ccd23c66dab0dca958aa479a4f3911c3de6df537bb1ba3ee96eec","source":{"kind":"arxiv","id":"2412.12589","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.12589","created_at":"2026-07-05T11:00:41Z"},{"alias_kind":"arxiv_version","alias_value":"2412.12589v2","created_at":"2026-07-05T11:00:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.12589","created_at":"2026-07-05T11:00:41Z"},{"alias_kind":"pith_short_12","alias_value":"U2HNSAAVPTGS","created_at":"2026-07-05T11:00:41Z"},{"alias_kind":"pith_short_16","alias_value":"U2HNSAAVPTGSHRTN","created_at":"2026-07-05T11:00:41Z"},{"alias_kind":"pith_short_8","alias_value":"U2HNSAAV","created_at":"2026-07-05T11:00:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:U2HNSAAVPTGSHRTNVMG4VFMKUR","target":"record","payload":{"canonical_record":{"source":{"id":"2412.12589","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-12-17T06:46:09Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"a881e323ce4721e4585060e30da17f917e0d6ba64b0c4b1c363b2fdf8a415133","abstract_canon_sha256":"2f97dfd8ef7a7426ea53c8c6fa75db141f785f5de9858f9e99b12340f8363d28"},"schema_version":"1.0"},"canonical_sha256":"a68ed900157ccd23c66dab0dca958aa479a4f3911c3de6df537bb1ba3ee96eec","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:00:41.039061Z","signature_b64":"zL0ItT+pn7Wv6YHtO1qy6r6ELWtiJZdDkL2F6gPJox+JfFBZA5AbPkxLyPMBdGlgg4Hfekwcyy1Jg2qy4vskCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a68ed900157ccd23c66dab0dca958aa479a4f3911c3de6df537bb1ba3ee96eec","last_reissued_at":"2026-07-05T11:00:41.038571Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:00:41.038571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.12589","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-05T11:00:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VXzcHwASUJ6bUD+ie26iYeRZZ6Bfz5zue3Ou9AE9xr1ZXJpclWF4Xb0hSxe++4ZNQzU/PfqAqNRBEm7UQpH9DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T14:58:24.148833Z"},"content_sha256":"987a3b93d25a91c6f4a03238cd74a31a846c708ba06de052320c76d60ad990e0","schema_version":"1.0","event_id":"sha256:987a3b93d25a91c6f4a03238cd74a31a846c708ba06de052320c76d60ad990e0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:U2HNSAAVPTGSHRTNVMG4VFMKUR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Round and Communication Efficient Graph Coloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Farrel D Salim, Gopinath Mishra, Hung Thuan Nguyen, Yi-Jun Chang","submitted_at":"2024-12-17T06:46:09Z","abstract_excerpt":"In the context of communication complexity, we explore protocols for graph coloring, focusing on the vertex and edge coloring problems in $n$-vertex graphs $G$ with a maximum degree $\\Delta$. We consider a scenario where the edges of $G$ are partitioned between two players.\n  Our first contribution is a randomized protocol that efficiently finds a $(\\Delta + 1)$-vertex coloring of $G$, utilizing $O(n)$ bits of communication in expectation and completing in $O(\\log \\log n \\cdot \\log \\Delta)$ rounds in the worst case. This advancement represents a significant improvement over the work of Flin an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.12589","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.12589/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-05T11:00:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2AP4fzg0l+/SrHfNyVfi3Z0QZlhZanWOed/xmzcfBPUJGRuF0IrrcP4p6uiqHFAOle20owXHtLW8YtojVNV1Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T14:58:24.149871Z"},"content_sha256":"6e8faf18ed9b94f36834cd7ff9176a1defa51145778f25b3d4ea8dc3af0f66a7","schema_version":"1.0","event_id":"sha256:6e8faf18ed9b94f36834cd7ff9176a1defa51145778f25b3d4ea8dc3af0f66a7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U2HNSAAVPTGSHRTNVMG4VFMKUR/bundle.json","state_url":"https://pith.science/pith/U2HNSAAVPTGSHRTNVMG4VFMKUR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U2HNSAAVPTGSHRTNVMG4VFMKUR/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-20T14:58:24Z","links":{"resolver":"https://pith.science/pith/U2HNSAAVPTGSHRTNVMG4VFMKUR","bundle":"https://pith.science/pith/U2HNSAAVPTGSHRTNVMG4VFMKUR/bundle.json","state":"https://pith.science/pith/U2HNSAAVPTGSHRTNVMG4VFMKUR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U2HNSAAVPTGSHRTNVMG4VFMKUR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:U2HNSAAVPTGSHRTNVMG4VFMKUR","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":"2f97dfd8ef7a7426ea53c8c6fa75db141f785f5de9858f9e99b12340f8363d28","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-12-17T06:46:09Z","title_canon_sha256":"a881e323ce4721e4585060e30da17f917e0d6ba64b0c4b1c363b2fdf8a415133"},"schema_version":"1.0","source":{"id":"2412.12589","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.12589","created_at":"2026-07-05T11:00:41Z"},{"alias_kind":"arxiv_version","alias_value":"2412.12589v2","created_at":"2026-07-05T11:00:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.12589","created_at":"2026-07-05T11:00:41Z"},{"alias_kind":"pith_short_12","alias_value":"U2HNSAAVPTGS","created_at":"2026-07-05T11:00:41Z"},{"alias_kind":"pith_short_16","alias_value":"U2HNSAAVPTGSHRTN","created_at":"2026-07-05T11:00:41Z"},{"alias_kind":"pith_short_8","alias_value":"U2HNSAAV","created_at":"2026-07-05T11:00:41Z"}],"graph_snapshots":[{"event_id":"sha256:6e8faf18ed9b94f36834cd7ff9176a1defa51145778f25b3d4ea8dc3af0f66a7","target":"graph","created_at":"2026-07-05T11:00:41Z","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.12589/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In the context of communication complexity, we explore protocols for graph coloring, focusing on the vertex and edge coloring problems in $n$-vertex graphs $G$ with a maximum degree $\\Delta$. We consider a scenario where the edges of $G$ are partitioned between two players.\n  Our first contribution is a randomized protocol that efficiently finds a $(\\Delta + 1)$-vertex coloring of $G$, utilizing $O(n)$ bits of communication in expectation and completing in $O(\\log \\log n \\cdot \\log \\Delta)$ rounds in the worst case. This advancement represents a significant improvement over the work of Flin an","authors_text":"Farrel D Salim, Gopinath Mishra, Hung Thuan Nguyen, Yi-Jun Chang","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-12-17T06:46:09Z","title":"Round and Communication Efficient Graph Coloring"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.12589","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:987a3b93d25a91c6f4a03238cd74a31a846c708ba06de052320c76d60ad990e0","target":"record","created_at":"2026-07-05T11:00:41Z","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":"2f97dfd8ef7a7426ea53c8c6fa75db141f785f5de9858f9e99b12340f8363d28","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-12-17T06:46:09Z","title_canon_sha256":"a881e323ce4721e4585060e30da17f917e0d6ba64b0c4b1c363b2fdf8a415133"},"schema_version":"1.0","source":{"id":"2412.12589","kind":"arxiv","version":2}},"canonical_sha256":"a68ed900157ccd23c66dab0dca958aa479a4f3911c3de6df537bb1ba3ee96eec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a68ed900157ccd23c66dab0dca958aa479a4f3911c3de6df537bb1ba3ee96eec","first_computed_at":"2026-07-05T11:00:41.038571Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:00:41.038571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zL0ItT+pn7Wv6YHtO1qy6r6ELWtiJZdDkL2F6gPJox+JfFBZA5AbPkxLyPMBdGlgg4Hfekwcyy1Jg2qy4vskCw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:00:41.039061Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.12589","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:987a3b93d25a91c6f4a03238cd74a31a846c708ba06de052320c76d60ad990e0","sha256:6e8faf18ed9b94f36834cd7ff9176a1defa51145778f25b3d4ea8dc3af0f66a7"],"state_sha256":"8971b6c0bd7870bf1a0a6589686048bab2f174ae2f165f0f57c3ea3e2f7a19c2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gz6iGE5zfXM1/k6snGSwGJyS1a0qgj3iltfdQGLYIiuvSQ9kaiqS+6fEuoAdRSfi2mvy3ZQPfH1pij+2UPJMDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T14:58:24.152572Z","bundle_sha256":"1e2c3d72b7953a012e56ecf06b59cdd280acd7fffec25c8e36182c1db454b051"}}