{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:6KTDCMWFLSOLAHF2E6FK4OAYAD","short_pith_number":"pith:6KTDCMWF","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"},"canonical_sha256":"f2a63132c55c9cb01cba278aae381800cc0317bd522fc023e40f6c4e5fa572d1","source":{"kind":"arxiv","id":"1407.6745","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.6745","created_at":"2026-05-18T02:46:32Z"},{"alias_kind":"arxiv_version","alias_value":"1407.6745v1","created_at":"2026-05-18T02:46:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.6745","created_at":"2026-05-18T02:46:32Z"},{"alias_kind":"pith_short_12","alias_value":"6KTDCMWFLSOL","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6KTDCMWFLSOLAHF2","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6KTDCMWF","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:6KTDCMWFLSOLAHF2E6FK4OAYAD","target":"record","payload":{"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"},"canonical_sha256":"f2a63132c55c9cb01cba278aae381800cc0317bd522fc023e40f6c4e5fa572d1","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"},"source_kind":"arxiv","source_id":"1407.6745","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-18T02:46:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6PlAZJ0p2/0FiGvbqE+dEj0syhj998rEQx00JdDaojoMlcZ/P3mgLd0p8CbIq+9mZ7dIK9hyZfXSQ/a2IKWFDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:49:30.788983Z"},"content_sha256":"34163e605ce687bce83382708ed0cf3220eff304745f67a43c6e08feeab754a0","schema_version":"1.0","event_id":"sha256:34163e605ce687bce83382708ed0cf3220eff304745f67a43c6e08feeab754a0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:6KTDCMWFLSOLAHF2E6FK4OAYAD","target":"graph","payload":{"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"},"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-18T02:46:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FMfa6F9HLPIHIhL9Ohg7r/DpIZdVnSZYvfItVH7zSF42hunpid33gNh0pHugTnUgUW599hTW6M+Vh858fRmmDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:49:30.789771Z"},"content_sha256":"16d87e9e646c271773b7e67166d422023c321f480af12b17115e1d9ac61c6e65","schema_version":"1.0","event_id":"sha256:16d87e9e646c271773b7e67166d422023c321f480af12b17115e1d9ac61c6e65"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6KTDCMWFLSOLAHF2E6FK4OAYAD/bundle.json","state_url":"https://pith.science/pith/6KTDCMWFLSOLAHF2E6FK4OAYAD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6KTDCMWFLSOLAHF2E6FK4OAYAD/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-05-26T00:49:30Z","links":{"resolver":"https://pith.science/pith/6KTDCMWFLSOLAHF2E6FK4OAYAD","bundle":"https://pith.science/pith/6KTDCMWFLSOLAHF2E6FK4OAYAD/bundle.json","state":"https://pith.science/pith/6KTDCMWFLSOLAHF2E6FK4OAYAD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6KTDCMWFLSOLAHF2E6FK4OAYAD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:6KTDCMWFLSOLAHF2E6FK4OAYAD","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":"a9fe2c6643c05f1e306e19a7508bbc7562ad6e1dc5e53508d1e519adbee4316c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-07-24T22:02:53Z","title_canon_sha256":"1eed09f976442ea62742c488917059d4561e88a0b1d89d47154db5c5fd9b5633"},"schema_version":"1.0","source":{"id":"1407.6745","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.6745","created_at":"2026-05-18T02:46:32Z"},{"alias_kind":"arxiv_version","alias_value":"1407.6745v1","created_at":"2026-05-18T02:46:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.6745","created_at":"2026-05-18T02:46:32Z"},{"alias_kind":"pith_short_12","alias_value":"6KTDCMWFLSOL","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6KTDCMWFLSOLAHF2","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6KTDCMWF","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:16d87e9e646c271773b7e67166d422023c321f480af12b17115e1d9ac61c6e65","target":"graph","created_at":"2026-05-18T02:46:32Z","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":"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 ","authors_text":"Ahmet Erdem Sar{\\i}y\\\"uce, Erik Saule, \\\"Umit V. \\c{C}ataly\\\"urek","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-07-24T22:02:53Z","title":"On Distributed Graph Coloring with Iterative Recoloring"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.6745","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:34163e605ce687bce83382708ed0cf3220eff304745f67a43c6e08feeab754a0","target":"record","created_at":"2026-05-18T02:46:32Z","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":"a9fe2c6643c05f1e306e19a7508bbc7562ad6e1dc5e53508d1e519adbee4316c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-07-24T22:02:53Z","title_canon_sha256":"1eed09f976442ea62742c488917059d4561e88a0b1d89d47154db5c5fd9b5633"},"schema_version":"1.0","source":{"id":"1407.6745","kind":"arxiv","version":1}},"canonical_sha256":"f2a63132c55c9cb01cba278aae381800cc0317bd522fc023e40f6c4e5fa572d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f2a63132c55c9cb01cba278aae381800cc0317bd522fc023e40f6c4e5fa572d1","first_computed_at":"2026-05-18T02:46:32.317773Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:46:32.317773Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/twPqui0ZrckEXxH4GkplRBG9+Z3RK9jHgdwmcYNBb0PtSqUXEQh1qVhzPs4uq6RDbE1Iib0vtJZmcnPZd2WDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:46:32.318240Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.6745","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:34163e605ce687bce83382708ed0cf3220eff304745f67a43c6e08feeab754a0","sha256:16d87e9e646c271773b7e67166d422023c321f480af12b17115e1d9ac61c6e65"],"state_sha256":"b358f1dd2b01b7eed346c53e76fa6b6c577f231e678e344a84bd27dbb89364e7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fxUVP2AMMZYLU+vikQVP8xTkiTOZ4uLoJYov6hnVhOErAeNexTFLr+Tbr1zLamGZ7suoD9nBsZkAo/+ded5YAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T00:49:30.794505Z","bundle_sha256":"3374668062552f321cf8fa2ccd3c85e208cd75359e6ec66139fce546d0f7f793"}}