{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:OXROC3WDAS4PA6QIVCEXFVRM3Q","short_pith_number":"pith:OXROC3WD","schema_version":"1.0","canonical_sha256":"75e2e16ec304b8f07a08a88972d62cdc21f56feff570455111caca07ebcb3738","source":{"kind":"arxiv","id":"1511.01287","version":2},"attestation_state":"computed","paper":{"title":"Local Conflict Coloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Adrian Kosowski (GANG), Marc Heinrich (GANG), Pierre Fraigniaud (GANG)","submitted_at":"2015-11-04T10:56:55Z","abstract_excerpt":"Locally finding a solution to symmetry-breaking tasks such as vertex-coloring, edge-coloring, maximal matching, maximal independent set, etc., is a long-standing challenge in distributed network computing. More recently, it has also become a challenge in the framework of centralized local computation. We introduce conflict coloring as a general symmetry-breaking task that includes all the aforementioned tasks as specific instantiations --- conflict coloring includes all locally checkable labeling tasks from [Naor\\&Stockmeyer, STOC 1993]. Conflict coloring is characterized by two parameters $l$"},"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":"1511.01287","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-04T10:56:55Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"3033ba4342c13482bf4cf8156fdd9108c4bb86845104b588dff12b586a22690f","abstract_canon_sha256":"b9fea2453c7c63af1575d3c29438b1e0409ad92cdd4188e0aefad41e1238de98"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:34.235346Z","signature_b64":"hf2L2+KOX3b1GlJMvbD3ZDe6DDvIvhxzBzUSbkfNlnc/bA0M4D63F9ax1LrMETzXPUew0tEs2K3dr4vn/mjEBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75e2e16ec304b8f07a08a88972d62cdc21f56feff570455111caca07ebcb3738","last_reissued_at":"2026-05-18T00:51:34.234886Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:34.234886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Local Conflict Coloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Adrian Kosowski (GANG), Marc Heinrich (GANG), Pierre Fraigniaud (GANG)","submitted_at":"2015-11-04T10:56:55Z","abstract_excerpt":"Locally finding a solution to symmetry-breaking tasks such as vertex-coloring, edge-coloring, maximal matching, maximal independent set, etc., is a long-standing challenge in distributed network computing. More recently, it has also become a challenge in the framework of centralized local computation. We introduce conflict coloring as a general symmetry-breaking task that includes all the aforementioned tasks as specific instantiations --- conflict coloring includes all locally checkable labeling tasks from [Naor\\&Stockmeyer, STOC 1993]. Conflict coloring is characterized by two parameters $l$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01287","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1511.01287","created_at":"2026-05-18T00:51:34.234958+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.01287v2","created_at":"2026-05-18T00:51:34.234958+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01287","created_at":"2026-05-18T00:51:34.234958+00:00"},{"alias_kind":"pith_short_12","alias_value":"OXROC3WDAS4P","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"OXROC3WDAS4PA6QI","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"OXROC3WD","created_at":"2026-05-18T12:29:34.919912+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/OXROC3WDAS4PA6QIVCEXFVRM3Q","json":"https://pith.science/pith/OXROC3WDAS4PA6QIVCEXFVRM3Q.json","graph_json":"https://pith.science/api/pith-number/OXROC3WDAS4PA6QIVCEXFVRM3Q/graph.json","events_json":"https://pith.science/api/pith-number/OXROC3WDAS4PA6QIVCEXFVRM3Q/events.json","paper":"https://pith.science/paper/OXROC3WD"},"agent_actions":{"view_html":"https://pith.science/pith/OXROC3WDAS4PA6QIVCEXFVRM3Q","download_json":"https://pith.science/pith/OXROC3WDAS4PA6QIVCEXFVRM3Q.json","view_paper":"https://pith.science/paper/OXROC3WD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.01287&json=true","fetch_graph":"https://pith.science/api/pith-number/OXROC3WDAS4PA6QIVCEXFVRM3Q/graph.json","fetch_events":"https://pith.science/api/pith-number/OXROC3WDAS4PA6QIVCEXFVRM3Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OXROC3WDAS4PA6QIVCEXFVRM3Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OXROC3WDAS4PA6QIVCEXFVRM3Q/action/storage_attestation","attest_author":"https://pith.science/pith/OXROC3WDAS4PA6QIVCEXFVRM3Q/action/author_attestation","sign_citation":"https://pith.science/pith/OXROC3WDAS4PA6QIVCEXFVRM3Q/action/citation_signature","submit_replication":"https://pith.science/pith/OXROC3WDAS4PA6QIVCEXFVRM3Q/action/replication_record"}},"created_at":"2026-05-18T00:51:34.234958+00:00","updated_at":"2026-05-18T00:51:34.234958+00:00"}