{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:6GCYXYLA5OYVC4KTIKMR6YAGCK","short_pith_number":"pith:6GCYXYLA","canonical_record":{"source":{"id":"1505.04086","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-05-15T15:03:30Z","cross_cats_sorted":[],"title_canon_sha256":"995a54fe007dac3bb74724c98933a7cec46ad7ecb3147333242403d4a2c4c2d6","abstract_canon_sha256":"b19a9295ec8342264835d7a8d8f50dba100f610b44962ca0b16585812ae3d6f3"},"schema_version":"1.0"},"canonical_sha256":"f1858be160ebb151715342991f600612b8d94526a2742af3f3cbb1ba51e5aec6","source":{"kind":"arxiv","id":"1505.04086","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.04086","created_at":"2026-05-18T02:07:26Z"},{"alias_kind":"arxiv_version","alias_value":"1505.04086v2","created_at":"2026-05-18T02:07:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04086","created_at":"2026-05-18T02:07:26Z"},{"alias_kind":"pith_short_12","alias_value":"6GCYXYLA5OYV","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6GCYXYLA5OYVC4KT","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6GCYXYLA","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:6GCYXYLA5OYVC4KTIKMR6YAGCK","target":"record","payload":{"canonical_record":{"source":{"id":"1505.04086","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-05-15T15:03:30Z","cross_cats_sorted":[],"title_canon_sha256":"995a54fe007dac3bb74724c98933a7cec46ad7ecb3147333242403d4a2c4c2d6","abstract_canon_sha256":"b19a9295ec8342264835d7a8d8f50dba100f610b44962ca0b16585812ae3d6f3"},"schema_version":"1.0"},"canonical_sha256":"f1858be160ebb151715342991f600612b8d94526a2742af3f3cbb1ba51e5aec6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:07:26.119291Z","signature_b64":"BaEx0wEpUG7bgMLhzveWXNCxxOvx6qUwOho9kRDQ/q2CveXgSFptpNk5xRhnlTDn8qNluK4po5BeiltjJ++GDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1858be160ebb151715342991f600612b8d94526a2742af3f3cbb1ba51e5aec6","last_reissued_at":"2026-05-18T02:07:26.118712Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:07:26.118712Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.04086","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-18T02:07:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uUyTWB7zZporLSY6GU92gsWmjGHNQLbZ2K403uozkP8BppQv7qR34BAFnHEeFdrVty9qAybPo/ZiKDW0Yx3dCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T22:17:56.503714Z"},"content_sha256":"1e9fc08d40d6cd2d49987a2247f56ff901991546cad8018b3a4dd26f256b523c","schema_version":"1.0","event_id":"sha256:1e9fc08d40d6cd2d49987a2247f56ff901991546cad8018b3a4dd26f256b523c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:6GCYXYLA5OYVC4KTIKMR6YAGCK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Fast and Scalable Graph Coloring Algorithm for Multi-core and Many-core Architectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Georgios Rokos, Gerard Gorman, Paul H J Kelly","submitted_at":"2015-05-15T15:03:30Z","abstract_excerpt":"Irregular computations on unstructured data are an important class of problems for parallel programming. Graph coloring is often an important preprocessing step, e.g. as a way to perform dependency analysis for safe parallel execution. The total run time of a coloring algorithm adds to the overall parallel overhead of the application whereas the number of colors used determines the amount of exposed parallelism. A fast and scalable coloring algorithm using as few colors as possible is vital for the overall parallel performance and scalability of many irregular applications that depend upon run"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04086","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-18T02:07:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"frXOYPOtfZnN5U+2DF1ofcdGIf9DKZuRNj9ZT295UUZ0t5bPokejy2286OuTc3CM/x6+9qTx5DhP5O75eEubDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T22:17:56.504063Z"},"content_sha256":"4164a4f0ebca13da28f4e86382d78606c156401f55edb77385f36e1baa548a26","schema_version":"1.0","event_id":"sha256:4164a4f0ebca13da28f4e86382d78606c156401f55edb77385f36e1baa548a26"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6GCYXYLA5OYVC4KTIKMR6YAGCK/bundle.json","state_url":"https://pith.science/pith/6GCYXYLA5OYVC4KTIKMR6YAGCK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6GCYXYLA5OYVC4KTIKMR6YAGCK/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-01T22:17:56Z","links":{"resolver":"https://pith.science/pith/6GCYXYLA5OYVC4KTIKMR6YAGCK","bundle":"https://pith.science/pith/6GCYXYLA5OYVC4KTIKMR6YAGCK/bundle.json","state":"https://pith.science/pith/6GCYXYLA5OYVC4KTIKMR6YAGCK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6GCYXYLA5OYVC4KTIKMR6YAGCK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:6GCYXYLA5OYVC4KTIKMR6YAGCK","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":"b19a9295ec8342264835d7a8d8f50dba100f610b44962ca0b16585812ae3d6f3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-05-15T15:03:30Z","title_canon_sha256":"995a54fe007dac3bb74724c98933a7cec46ad7ecb3147333242403d4a2c4c2d6"},"schema_version":"1.0","source":{"id":"1505.04086","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.04086","created_at":"2026-05-18T02:07:26Z"},{"alias_kind":"arxiv_version","alias_value":"1505.04086v2","created_at":"2026-05-18T02:07:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04086","created_at":"2026-05-18T02:07:26Z"},{"alias_kind":"pith_short_12","alias_value":"6GCYXYLA5OYV","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6GCYXYLA5OYVC4KT","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6GCYXYLA","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:4164a4f0ebca13da28f4e86382d78606c156401f55edb77385f36e1baa548a26","target":"graph","created_at":"2026-05-18T02:07:26Z","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":"Irregular computations on unstructured data are an important class of problems for parallel programming. Graph coloring is often an important preprocessing step, e.g. as a way to perform dependency analysis for safe parallel execution. The total run time of a coloring algorithm adds to the overall parallel overhead of the application whereas the number of colors used determines the amount of exposed parallelism. A fast and scalable coloring algorithm using as few colors as possible is vital for the overall parallel performance and scalability of many irregular applications that depend upon run","authors_text":"Georgios Rokos, Gerard Gorman, Paul H J Kelly","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-05-15T15:03:30Z","title":"A Fast and Scalable Graph Coloring Algorithm for Multi-core and Many-core Architectures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04086","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:1e9fc08d40d6cd2d49987a2247f56ff901991546cad8018b3a4dd26f256b523c","target":"record","created_at":"2026-05-18T02:07:26Z","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":"b19a9295ec8342264835d7a8d8f50dba100f610b44962ca0b16585812ae3d6f3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-05-15T15:03:30Z","title_canon_sha256":"995a54fe007dac3bb74724c98933a7cec46ad7ecb3147333242403d4a2c4c2d6"},"schema_version":"1.0","source":{"id":"1505.04086","kind":"arxiv","version":2}},"canonical_sha256":"f1858be160ebb151715342991f600612b8d94526a2742af3f3cbb1ba51e5aec6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f1858be160ebb151715342991f600612b8d94526a2742af3f3cbb1ba51e5aec6","first_computed_at":"2026-05-18T02:07:26.118712Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:07:26.118712Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BaEx0wEpUG7bgMLhzveWXNCxxOvx6qUwOho9kRDQ/q2CveXgSFptpNk5xRhnlTDn8qNluK4po5BeiltjJ++GDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:07:26.119291Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.04086","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1e9fc08d40d6cd2d49987a2247f56ff901991546cad8018b3a4dd26f256b523c","sha256:4164a4f0ebca13da28f4e86382d78606c156401f55edb77385f36e1baa548a26"],"state_sha256":"8b6ecf7ad2ce7c78960e36f989079ad80c9cccbcaefe9d87e762ad8dd483be22"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XQ7iErvctBf8QFQdm1aeUTiXXWmnTeIvDlSuZGk1bqoaFsaC9+VuOjaKBt6sHQosuB3lOpDCSUEr/gTouXV6DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T22:17:56.506055Z","bundle_sha256":"8cbc87700dd4c0e2bfa9e2e5dd96cd7877ae3a85e9e73bcdb84f7b1e79ce0c44"}}