{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:EXNI3KI4XISQLLL5BEFRNMYUV4","short_pith_number":"pith:EXNI3KI4","canonical_record":{"source":{"id":"1604.03356","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-04-12T11:56:07Z","cross_cats_sorted":[],"title_canon_sha256":"b439d4352b552bb4f26d81c4b5782436fb12d3aba7904fe7a977fe765e74d928","abstract_canon_sha256":"d03bc5f3c8718a93b20c9059c3d58a534264caf4346ad1c0c0fe3fcb3024c990"},"schema_version":"1.0"},"canonical_sha256":"25da8da91cba2505ad7d090b16b314af2acf7bae25e601f01030c30a48d42123","source":{"kind":"arxiv","id":"1604.03356","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.03356","created_at":"2026-05-18T01:17:13Z"},{"alias_kind":"arxiv_version","alias_value":"1604.03356v1","created_at":"2026-05-18T01:17:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.03356","created_at":"2026-05-18T01:17:13Z"},{"alias_kind":"pith_short_12","alias_value":"EXNI3KI4XISQ","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"EXNI3KI4XISQLLL5","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"EXNI3KI4","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:EXNI3KI4XISQLLL5BEFRNMYUV4","target":"record","payload":{"canonical_record":{"source":{"id":"1604.03356","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-04-12T11:56:07Z","cross_cats_sorted":[],"title_canon_sha256":"b439d4352b552bb4f26d81c4b5782436fb12d3aba7904fe7a977fe765e74d928","abstract_canon_sha256":"d03bc5f3c8718a93b20c9059c3d58a534264caf4346ad1c0c0fe3fcb3024c990"},"schema_version":"1.0"},"canonical_sha256":"25da8da91cba2505ad7d090b16b314af2acf7bae25e601f01030c30a48d42123","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:13.839996Z","signature_b64":"JTlVdqgPFI2dFjZbAmYZhM3cUgYny6x0JX8s2d/Ruy8hjVKyxJwK7EASDqymALsW99vdDAqax1LKhMIL4Q4qCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25da8da91cba2505ad7d090b16b314af2acf7bae25e601f01030c30a48d42123","last_reissued_at":"2026-05-18T01:17:13.839384Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:13.839384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.03356","source_version":1,"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-05-18T01:17:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/YUsf7nWfoX3H6Y6jb3al88Fr5dTSAyEVAHKLXDzc+idr9ePLMcFmQY55D3iioSs5Vqd5bsyN0Gsx7BNqjpuDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T22:58:07.764363Z"},"content_sha256":"a581447818770346fac9d49d8c53ba9ae0be7497dd6176ce0edcb965267b6b2d","schema_version":"1.0","event_id":"sha256:a581447818770346fac9d49d8c53ba9ae0be7497dd6176ce0edcb965267b6b2d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:EXNI3KI4XISQLLL5BEFRNMYUV4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Vertex Coloring with Communication and Local Memory Constraints in Synchronous Broadcast Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Fran\\c{c}ois Ta\\\"iani (ASAP), Hicham Lakhlef (ASAP), Michel Raynal (ASAP)","submitted_at":"2016-04-12T11:56:07Z","abstract_excerpt":"The vertex coloring problem has received a lot of attention in the context of synchronous round-based systems where, at each round, a process can send a message to all its neighbors, and receive a message from each of them. Hence, this communication model is  particularly suited to point-to-point communication channels. Several vertex coloring algorithms suited to these systems have been proposed. They differ mainly in the  number of rounds they require and the number of colors they use. This paper considers a broadcast/receive communication model in which message collisions and message confli"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.03356","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"},"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-05-18T01:17:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O3LLILkDqA95tgLG4lNR3JNcxa2yziePHb/leMjXGhpsa+LZ1uH545jH3yktvMIf1S61zoG++8tbRzEqpDmRBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T22:58:07.764707Z"},"content_sha256":"7f3223f7042d57e97ce02576e9ddcc0d81b38b05f2d9993c5c4701879f58ddca","schema_version":"1.0","event_id":"sha256:7f3223f7042d57e97ce02576e9ddcc0d81b38b05f2d9993c5c4701879f58ddca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EXNI3KI4XISQLLL5BEFRNMYUV4/bundle.json","state_url":"https://pith.science/pith/EXNI3KI4XISQLLL5BEFRNMYUV4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EXNI3KI4XISQLLL5BEFRNMYUV4/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-06-24T22:58:07Z","links":{"resolver":"https://pith.science/pith/EXNI3KI4XISQLLL5BEFRNMYUV4","bundle":"https://pith.science/pith/EXNI3KI4XISQLLL5BEFRNMYUV4/bundle.json","state":"https://pith.science/pith/EXNI3KI4XISQLLL5BEFRNMYUV4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EXNI3KI4XISQLLL5BEFRNMYUV4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:EXNI3KI4XISQLLL5BEFRNMYUV4","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":"d03bc5f3c8718a93b20c9059c3d58a534264caf4346ad1c0c0fe3fcb3024c990","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-04-12T11:56:07Z","title_canon_sha256":"b439d4352b552bb4f26d81c4b5782436fb12d3aba7904fe7a977fe765e74d928"},"schema_version":"1.0","source":{"id":"1604.03356","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.03356","created_at":"2026-05-18T01:17:13Z"},{"alias_kind":"arxiv_version","alias_value":"1604.03356v1","created_at":"2026-05-18T01:17:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.03356","created_at":"2026-05-18T01:17:13Z"},{"alias_kind":"pith_short_12","alias_value":"EXNI3KI4XISQ","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"EXNI3KI4XISQLLL5","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"EXNI3KI4","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:7f3223f7042d57e97ce02576e9ddcc0d81b38b05f2d9993c5c4701879f58ddca","target":"graph","created_at":"2026-05-18T01:17:13Z","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":"The vertex coloring problem has received a lot of attention in the context of synchronous round-based systems where, at each round, a process can send a message to all its neighbors, and receive a message from each of them. Hence, this communication model is  particularly suited to point-to-point communication channels. Several vertex coloring algorithms suited to these systems have been proposed. They differ mainly in the  number of rounds they require and the number of colors they use. This paper considers a broadcast/receive communication model in which message collisions and message confli","authors_text":"Fran\\c{c}ois Ta\\\"iani (ASAP), Hicham Lakhlef (ASAP), Michel Raynal (ASAP)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-04-12T11:56:07Z","title":"Vertex Coloring with Communication and Local Memory Constraints in Synchronous Broadcast Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.03356","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:a581447818770346fac9d49d8c53ba9ae0be7497dd6176ce0edcb965267b6b2d","target":"record","created_at":"2026-05-18T01:17:13Z","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":"d03bc5f3c8718a93b20c9059c3d58a534264caf4346ad1c0c0fe3fcb3024c990","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-04-12T11:56:07Z","title_canon_sha256":"b439d4352b552bb4f26d81c4b5782436fb12d3aba7904fe7a977fe765e74d928"},"schema_version":"1.0","source":{"id":"1604.03356","kind":"arxiv","version":1}},"canonical_sha256":"25da8da91cba2505ad7d090b16b314af2acf7bae25e601f01030c30a48d42123","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"25da8da91cba2505ad7d090b16b314af2acf7bae25e601f01030c30a48d42123","first_computed_at":"2026-05-18T01:17:13.839384Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:13.839384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JTlVdqgPFI2dFjZbAmYZhM3cUgYny6x0JX8s2d/Ruy8hjVKyxJwK7EASDqymALsW99vdDAqax1LKhMIL4Q4qCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:13.839996Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.03356","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a581447818770346fac9d49d8c53ba9ae0be7497dd6176ce0edcb965267b6b2d","sha256:7f3223f7042d57e97ce02576e9ddcc0d81b38b05f2d9993c5c4701879f58ddca"],"state_sha256":"cf8b3df108adbb3d53fcdda10f94420463da84faaaf05ce4b53cfaa10234940b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sp2tuhTkFvI/NOjAhJO0AlkK7gIK821yssB6UgKEKPNrbZu3fH9oDRrujf+Fgfdc4QQvCIB2OI42oZW+70CZCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T22:58:07.766573Z","bundle_sha256":"3f8aa41aae59ce921580ed1270fb5fc99d436c2c94437193583253310403a17d"}}