{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:6KTDCMWFLSOLAHF2E6FK4OAYAD","short_pith_number":"pith:6KTDCMWF","schema_version":"1.0","canonical_sha256":"f2a63132c55c9cb01cba278aae381800cc0317bd522fc023e40f6c4e5fa572d1","source":{"kind":"arxiv","id":"1407.6745","version":1},"attestation_state":"computed","paper":{"title":"On Distributed Graph Coloring with Iterative Recoloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ahmet Erdem Sar{\\i}y\\\"uce, Erik Saule, \\\"Umit V. \\c{C}ataly\\\"urek","submitted_at":"2014-07-24T22:02:53Z","abstract_excerpt":"Identifying the sets of operations that can be executed simultaneously is an important problem appearing in many parallel applications. By modeling the operations and their interactions as a graph, one can identify the independent operations by solving a graph coloring problem. Many efficient sequential algorithms are known for this NP-Complete problem, but they are typically unsuitable when the operations and their interactions are distributed in the memory of large parallel computers. On top of an existing distributed-memory graph coloring algorithm, we investigate two compatible techniques "},"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":"1407.6745","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-07-24T22:02:53Z","cross_cats_sorted":[],"title_canon_sha256":"1eed09f976442ea62742c488917059d4561e88a0b1d89d47154db5c5fd9b5633","abstract_canon_sha256":"a9fe2c6643c05f1e306e19a7508bbc7562ad6e1dc5e53508d1e519adbee4316c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:32.318240Z","signature_b64":"/twPqui0ZrckEXxH4GkplRBG9+Z3RK9jHgdwmcYNBb0PtSqUXEQh1qVhzPs4uq6RDbE1Iib0vtJZmcnPZd2WDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2a63132c55c9cb01cba278aae381800cc0317bd522fc023e40f6c4e5fa572d1","last_reissued_at":"2026-05-18T02:46:32.317773Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:32.317773Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Distributed Graph Coloring with Iterative Recoloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ahmet Erdem Sar{\\i}y\\\"uce, Erik Saule, \\\"Umit V. \\c{C}ataly\\\"urek","submitted_at":"2014-07-24T22:02:53Z","abstract_excerpt":"Identifying the sets of operations that can be executed simultaneously is an important problem appearing in many parallel applications. By modeling the operations and their interactions as a graph, one can identify the independent operations by solving a graph coloring problem. Many efficient sequential algorithms are known for this NP-Complete problem, but they are typically unsuitable when the operations and their interactions are distributed in the memory of large parallel computers. On top of an existing distributed-memory graph coloring algorithm, we investigate two compatible techniques "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.6745","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":"1407.6745","created_at":"2026-05-18T02:46:32.317840+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.6745v1","created_at":"2026-05-18T02:46:32.317840+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.6745","created_at":"2026-05-18T02:46:32.317840+00:00"},{"alias_kind":"pith_short_12","alias_value":"6KTDCMWFLSOL","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"6KTDCMWFLSOLAHF2","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"6KTDCMWF","created_at":"2026-05-18T12:28:16.859392+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/6KTDCMWFLSOLAHF2E6FK4OAYAD","json":"https://pith.science/pith/6KTDCMWFLSOLAHF2E6FK4OAYAD.json","graph_json":"https://pith.science/api/pith-number/6KTDCMWFLSOLAHF2E6FK4OAYAD/graph.json","events_json":"https://pith.science/api/pith-number/6KTDCMWFLSOLAHF2E6FK4OAYAD/events.json","paper":"https://pith.science/paper/6KTDCMWF"},"agent_actions":{"view_html":"https://pith.science/pith/6KTDCMWFLSOLAHF2E6FK4OAYAD","download_json":"https://pith.science/pith/6KTDCMWFLSOLAHF2E6FK4OAYAD.json","view_paper":"https://pith.science/paper/6KTDCMWF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.6745&json=true","fetch_graph":"https://pith.science/api/pith-number/6KTDCMWFLSOLAHF2E6FK4OAYAD/graph.json","fetch_events":"https://pith.science/api/pith-number/6KTDCMWFLSOLAHF2E6FK4OAYAD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6KTDCMWFLSOLAHF2E6FK4OAYAD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6KTDCMWFLSOLAHF2E6FK4OAYAD/action/storage_attestation","attest_author":"https://pith.science/pith/6KTDCMWFLSOLAHF2E6FK4OAYAD/action/author_attestation","sign_citation":"https://pith.science/pith/6KTDCMWFLSOLAHF2E6FK4OAYAD/action/citation_signature","submit_replication":"https://pith.science/pith/6KTDCMWFLSOLAHF2E6FK4OAYAD/action/replication_record"}},"created_at":"2026-05-18T02:46:32.317840+00:00","updated_at":"2026-05-18T02:46:32.317840+00:00"}