{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:6GCYXYLA5OYVC4KTIKMR6YAGCK","short_pith_number":"pith:6GCYXYLA","schema_version":"1.0","canonical_sha256":"f1858be160ebb151715342991f600612b8d94526a2742af3f3cbb1ba51e5aec6","source":{"kind":"arxiv","id":"1505.04086","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1505.04086","created_at":"2026-05-18T02:07:26.118809+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.04086v2","created_at":"2026-05-18T02:07:26.118809+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04086","created_at":"2026-05-18T02:07:26.118809+00:00"},{"alias_kind":"pith_short_12","alias_value":"6GCYXYLA5OYV","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"6GCYXYLA5OYVC4KT","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"6GCYXYLA","created_at":"2026-05-18T12:29:07.941421+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/6GCYXYLA5OYVC4KTIKMR6YAGCK","json":"https://pith.science/pith/6GCYXYLA5OYVC4KTIKMR6YAGCK.json","graph_json":"https://pith.science/api/pith-number/6GCYXYLA5OYVC4KTIKMR6YAGCK/graph.json","events_json":"https://pith.science/api/pith-number/6GCYXYLA5OYVC4KTIKMR6YAGCK/events.json","paper":"https://pith.science/paper/6GCYXYLA"},"agent_actions":{"view_html":"https://pith.science/pith/6GCYXYLA5OYVC4KTIKMR6YAGCK","download_json":"https://pith.science/pith/6GCYXYLA5OYVC4KTIKMR6YAGCK.json","view_paper":"https://pith.science/paper/6GCYXYLA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.04086&json=true","fetch_graph":"https://pith.science/api/pith-number/6GCYXYLA5OYVC4KTIKMR6YAGCK/graph.json","fetch_events":"https://pith.science/api/pith-number/6GCYXYLA5OYVC4KTIKMR6YAGCK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6GCYXYLA5OYVC4KTIKMR6YAGCK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6GCYXYLA5OYVC4KTIKMR6YAGCK/action/storage_attestation","attest_author":"https://pith.science/pith/6GCYXYLA5OYVC4KTIKMR6YAGCK/action/author_attestation","sign_citation":"https://pith.science/pith/6GCYXYLA5OYVC4KTIKMR6YAGCK/action/citation_signature","submit_replication":"https://pith.science/pith/6GCYXYLA5OYVC4KTIKMR6YAGCK/action/replication_record"}},"created_at":"2026-05-18T02:07:26.118809+00:00","updated_at":"2026-05-18T02:07:26.118809+00:00"}