{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:G52HKY2Y4STOLNC673BRXDGZ3H","short_pith_number":"pith:G52HKY2Y","schema_version":"1.0","canonical_sha256":"3774756358e4a6e5b45efec31b8cd9d9c369bb7ec94df8127818ef8e0afdf7dd","source":{"kind":"arxiv","id":"1709.00901","version":1},"attestation_state":"computed","paper":{"title":"Distributed Colour Reduction Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Christopher Purcell, Janne H. Korhonen, Jukka Kohonen, Jukka Suomela, Przemys{\\l}aw Uzna\\'nski","submitted_at":"2017-09-04T11:17:46Z","abstract_excerpt":"We give a new, simple distributed algorithm for graph colouring in paths and cycles. Our algorithm is fast and self-contained, it does not need any globally consistent orientation, and it reduces the number of colours from $10^{100}$ to $3$ in three iterations."},"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":"1709.00901","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-09-04T11:17:46Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"279d4dbc46d02f355001e5c855a5a7005e9fc60eb6663951354d3b0e689c1873","abstract_canon_sha256":"aacf3faa1bcaa902c1e6afa4d4fea213e2a511cbb9ea691bbccefbb03861b0a7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:04.783630Z","signature_b64":"01wAQaHjPu0LFl5qQ2KLWbTRIPKKj/FUnOlX1edAM4gOsoIcDiVZiLAIs+dU0fLZDCpweYFnvrfiR5q/+ROeCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3774756358e4a6e5b45efec31b8cd9d9c369bb7ec94df8127818ef8e0afdf7dd","last_reissued_at":"2026-05-18T00:36:04.782939Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:04.782939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Colour Reduction Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Christopher Purcell, Janne H. Korhonen, Jukka Kohonen, Jukka Suomela, Przemys{\\l}aw Uzna\\'nski","submitted_at":"2017-09-04T11:17:46Z","abstract_excerpt":"We give a new, simple distributed algorithm for graph colouring in paths and cycles. Our algorithm is fast and self-contained, it does not need any globally consistent orientation, and it reduces the number of colours from $10^{100}$ to $3$ in three iterations."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.00901","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1709.00901","created_at":"2026-05-18T00:36:04.783055+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.00901v1","created_at":"2026-05-18T00:36:04.783055+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.00901","created_at":"2026-05-18T00:36:04.783055+00:00"},{"alias_kind":"pith_short_12","alias_value":"G52HKY2Y4STO","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"G52HKY2Y4STOLNC6","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"G52HKY2Y","created_at":"2026-05-18T12:31:15.632608+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/G52HKY2Y4STOLNC673BRXDGZ3H","json":"https://pith.science/pith/G52HKY2Y4STOLNC673BRXDGZ3H.json","graph_json":"https://pith.science/api/pith-number/G52HKY2Y4STOLNC673BRXDGZ3H/graph.json","events_json":"https://pith.science/api/pith-number/G52HKY2Y4STOLNC673BRXDGZ3H/events.json","paper":"https://pith.science/paper/G52HKY2Y"},"agent_actions":{"view_html":"https://pith.science/pith/G52HKY2Y4STOLNC673BRXDGZ3H","download_json":"https://pith.science/pith/G52HKY2Y4STOLNC673BRXDGZ3H.json","view_paper":"https://pith.science/paper/G52HKY2Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.00901&json=true","fetch_graph":"https://pith.science/api/pith-number/G52HKY2Y4STOLNC673BRXDGZ3H/graph.json","fetch_events":"https://pith.science/api/pith-number/G52HKY2Y4STOLNC673BRXDGZ3H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G52HKY2Y4STOLNC673BRXDGZ3H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G52HKY2Y4STOLNC673BRXDGZ3H/action/storage_attestation","attest_author":"https://pith.science/pith/G52HKY2Y4STOLNC673BRXDGZ3H/action/author_attestation","sign_citation":"https://pith.science/pith/G52HKY2Y4STOLNC673BRXDGZ3H/action/citation_signature","submit_replication":"https://pith.science/pith/G52HKY2Y4STOLNC673BRXDGZ3H/action/replication_record"}},"created_at":"2026-05-18T00:36:04.783055+00:00","updated_at":"2026-05-18T00:36:04.783055+00:00"}