{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:WAQHYHUPQPNPEJ3ULVQB3PD4XN","short_pith_number":"pith:WAQHYHUP","canonical_record":{"source":{"id":"1708.06275","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-21T15:07:36Z","cross_cats_sorted":[],"title_canon_sha256":"49afe7a7b0155355f48d375bdfc4097b8a95028f28ba339632d8949507df3f40","abstract_canon_sha256":"27fea34cd323506c20e347ff335e5e733b3b1496f91c9646c45a9afb5b5dea19"},"schema_version":"1.0"},"canonical_sha256":"b0207c1e8f83daf227745d601dbc7cbb7a3cdb82ab570b4c6c64833e7dc3cb56","source":{"kind":"arxiv","id":"1708.06275","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.06275","created_at":"2026-05-18T00:36:49Z"},{"alias_kind":"arxiv_version","alias_value":"1708.06275v2","created_at":"2026-05-18T00:36:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06275","created_at":"2026-05-18T00:36:49Z"},{"alias_kind":"pith_short_12","alias_value":"WAQHYHUPQPNP","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WAQHYHUPQPNPEJ3U","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WAQHYHUP","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:WAQHYHUPQPNPEJ3ULVQB3PD4XN","target":"record","payload":{"canonical_record":{"source":{"id":"1708.06275","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-21T15:07:36Z","cross_cats_sorted":[],"title_canon_sha256":"49afe7a7b0155355f48d375bdfc4097b8a95028f28ba339632d8949507df3f40","abstract_canon_sha256":"27fea34cd323506c20e347ff335e5e733b3b1496f91c9646c45a9afb5b5dea19"},"schema_version":"1.0"},"canonical_sha256":"b0207c1e8f83daf227745d601dbc7cbb7a3cdb82ab570b4c6c64833e7dc3cb56","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:49.105209Z","signature_b64":"zWIkdv6UF5Io+Sn/wxuGH3ZDf5lplKmrEXkDvNTKp6FOoiKhsTNxCfkl8Om+dYui6Sis/I/Vh6YMN/cqgFbIDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0207c1e8f83daf227745d601dbc7cbb7a3cdb82ab570b4c6c64833e7dc3cb56","last_reissued_at":"2026-05-18T00:36:49.104601Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:49.104601Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.06275","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-05-18T00:36:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B0x9rgkQlPuPAwV+jZfdq54aseMUivrOW2qkflZSIOESNEGaFEs31IS+3iP3Lp6lZGqS3aBGn9wed+vjUsFPAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T04:30:22.204770Z"},"content_sha256":"3d5c3d00d885e6bc67002943e69eb01bb9d48e6f7d0af102920b043f49471314","schema_version":"1.0","event_id":"sha256:3d5c3d00d885e6bc67002943e69eb01bb9d48e6f7d0af102920b043f49471314"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:WAQHYHUPQPNPEJ3ULVQB3PD4XN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simple and Near-Optimal Distributed Coloring for Sparse Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christiana Lymouri, Mohsen Ghaffari","submitted_at":"2017-08-21T15:07:36Z","abstract_excerpt":"Graph coloring is one of the central problems in distributed graph algorithms. Much of the research on this topic has focused on coloring with $\\Delta+1$ colors, where $\\Delta$ denotes the maximum degree. Using $\\Delta+1$ colors may be unsatisfactory in sparse graphs, where not all nodes have such a high degree; it would be more desirable to use a number of colors that improves with sparsity. A standard measure that captures sparsity is arboricity, which is the smallest number of forests into which the edges of the graph can be partitioned.\n  We present simple randomized distributed algorithms"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06275","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":""},"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-18T00:36:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z7Mk4L+pVkohjDJOnp3IpVFkwXgrEiPKHJ4J9EGZxp2WrW00eXBuFDO4lPPVVXYs+D+7qqV24OM+tU/ibpilBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T04:30:22.211056Z"},"content_sha256":"8571770bc3449a6b7c7d18d8763f919a1ffa929b597f41893bd417e52ebc635d","schema_version":"1.0","event_id":"sha256:8571770bc3449a6b7c7d18d8763f919a1ffa929b597f41893bd417e52ebc635d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WAQHYHUPQPNPEJ3ULVQB3PD4XN/bundle.json","state_url":"https://pith.science/pith/WAQHYHUPQPNPEJ3ULVQB3PD4XN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WAQHYHUPQPNPEJ3ULVQB3PD4XN/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-04T04:30:22Z","links":{"resolver":"https://pith.science/pith/WAQHYHUPQPNPEJ3ULVQB3PD4XN","bundle":"https://pith.science/pith/WAQHYHUPQPNPEJ3ULVQB3PD4XN/bundle.json","state":"https://pith.science/pith/WAQHYHUPQPNPEJ3ULVQB3PD4XN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WAQHYHUPQPNPEJ3ULVQB3PD4XN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:WAQHYHUPQPNPEJ3ULVQB3PD4XN","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":"27fea34cd323506c20e347ff335e5e733b3b1496f91c9646c45a9afb5b5dea19","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-21T15:07:36Z","title_canon_sha256":"49afe7a7b0155355f48d375bdfc4097b8a95028f28ba339632d8949507df3f40"},"schema_version":"1.0","source":{"id":"1708.06275","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.06275","created_at":"2026-05-18T00:36:49Z"},{"alias_kind":"arxiv_version","alias_value":"1708.06275v2","created_at":"2026-05-18T00:36:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06275","created_at":"2026-05-18T00:36:49Z"},{"alias_kind":"pith_short_12","alias_value":"WAQHYHUPQPNP","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WAQHYHUPQPNPEJ3U","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WAQHYHUP","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:8571770bc3449a6b7c7d18d8763f919a1ffa929b597f41893bd417e52ebc635d","target":"graph","created_at":"2026-05-18T00:36:49Z","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":"Graph coloring is one of the central problems in distributed graph algorithms. Much of the research on this topic has focused on coloring with $\\Delta+1$ colors, where $\\Delta$ denotes the maximum degree. Using $\\Delta+1$ colors may be unsatisfactory in sparse graphs, where not all nodes have such a high degree; it would be more desirable to use a number of colors that improves with sparsity. A standard measure that captures sparsity is arboricity, which is the smallest number of forests into which the edges of the graph can be partitioned.\n  We present simple randomized distributed algorithms","authors_text":"Christiana Lymouri, Mohsen Ghaffari","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-21T15:07:36Z","title":"Simple and Near-Optimal Distributed Coloring for Sparse Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06275","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:3d5c3d00d885e6bc67002943e69eb01bb9d48e6f7d0af102920b043f49471314","target":"record","created_at":"2026-05-18T00:36:49Z","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":"27fea34cd323506c20e347ff335e5e733b3b1496f91c9646c45a9afb5b5dea19","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-21T15:07:36Z","title_canon_sha256":"49afe7a7b0155355f48d375bdfc4097b8a95028f28ba339632d8949507df3f40"},"schema_version":"1.0","source":{"id":"1708.06275","kind":"arxiv","version":2}},"canonical_sha256":"b0207c1e8f83daf227745d601dbc7cbb7a3cdb82ab570b4c6c64833e7dc3cb56","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b0207c1e8f83daf227745d601dbc7cbb7a3cdb82ab570b4c6c64833e7dc3cb56","first_computed_at":"2026-05-18T00:36:49.104601Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:49.104601Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zWIkdv6UF5Io+Sn/wxuGH3ZDf5lplKmrEXkDvNTKp6FOoiKhsTNxCfkl8Om+dYui6Sis/I/Vh6YMN/cqgFbIDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:49.105209Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.06275","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d5c3d00d885e6bc67002943e69eb01bb9d48e6f7d0af102920b043f49471314","sha256:8571770bc3449a6b7c7d18d8763f919a1ffa929b597f41893bd417e52ebc635d"],"state_sha256":"49ad83ba0571cc3e1e119d610ee474ea773405534ad3634905b20664fdd57926"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OzGvL70l87soiYEIvHisCT/vqttXPQNGY6t3qBEb84qj1n4ULaVTAW318HHyUkzNmW1qejGLwD4nkVkzorpfBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T04:30:22.221620Z","bundle_sha256":"36f735a0a535b482867380523c5cfe58daacf0f78f0971d9359e8a06963f2711"}}