{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:MWDMPELYC2AEIRWWSULZM5NKMI","short_pith_number":"pith:MWDMPELY","schema_version":"1.0","canonical_sha256":"6586c7917816804446d695179675aa6227bba94a11d63283fe4f0ab8d16e718c","source":{"kind":"arxiv","id":"1205.3809","version":1},"attestation_state":"computed","paper":{"title":"Graph Coloring Algorithms for Muti-core and Massively Multithreaded Architectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alex Pothen, Assefaw Gebremedhin, John Feo, Mahantesh Halappanavar, Umit Catalyurek","submitted_at":"2012-05-16T20:59:48Z","abstract_excerpt":"We explore the interplay between architectures and algorithm design in the context of shared-memory platforms and a specific graph problem of central importance in scientific and high-performance computing, distance-1 graph coloring. We introduce two different kinds of multithreaded heuristic algorithms for the stated, NP-hard, problem. The first algorithm relies on speculation and iteration, and is suitable for any shared-memory system. The second algorithm uses dataflow principles, and is targeted at the non-conventional, massively multithreaded Cray XMT system. We study the performance of t"},"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":"1205.3809","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-05-16T20:59:48Z","cross_cats_sorted":[],"title_canon_sha256":"0b53fda019d0a26ebb51cb9ed732e0ad021a5e1890da82732294db2ccd9e9480","abstract_canon_sha256":"d64762b580f59c7947760ed6702044db18d7fa61492b0a5ffa26d0d4f0ded914"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:24.386797Z","signature_b64":"gkjXMOaXykht7h1pRU9uYLo7zQiitInp7zLMIlIVgc5Zcf0VSv5G8dfFOU8Bzn9k/kWrvEHLGZzwId1zHQziAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6586c7917816804446d695179675aa6227bba94a11d63283fe4f0ab8d16e718c","last_reissued_at":"2026-05-18T03:55:24.386275Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:24.386275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Coloring Algorithms for Muti-core and Massively Multithreaded Architectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alex Pothen, Assefaw Gebremedhin, John Feo, Mahantesh Halappanavar, Umit Catalyurek","submitted_at":"2012-05-16T20:59:48Z","abstract_excerpt":"We explore the interplay between architectures and algorithm design in the context of shared-memory platforms and a specific graph problem of central importance in scientific and high-performance computing, distance-1 graph coloring. We introduce two different kinds of multithreaded heuristic algorithms for the stated, NP-hard, problem. The first algorithm relies on speculation and iteration, and is suitable for any shared-memory system. The second algorithm uses dataflow principles, and is targeted at the non-conventional, massively multithreaded Cray XMT system. We study the performance of t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.3809","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":"1205.3809","created_at":"2026-05-18T03:55:24.386364+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.3809v1","created_at":"2026-05-18T03:55:24.386364+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.3809","created_at":"2026-05-18T03:55:24.386364+00:00"},{"alias_kind":"pith_short_12","alias_value":"MWDMPELYC2AE","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"MWDMPELYC2AEIRWW","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"MWDMPELY","created_at":"2026-05-18T12:27:14.488303+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/MWDMPELYC2AEIRWWSULZM5NKMI","json":"https://pith.science/pith/MWDMPELYC2AEIRWWSULZM5NKMI.json","graph_json":"https://pith.science/api/pith-number/MWDMPELYC2AEIRWWSULZM5NKMI/graph.json","events_json":"https://pith.science/api/pith-number/MWDMPELYC2AEIRWWSULZM5NKMI/events.json","paper":"https://pith.science/paper/MWDMPELY"},"agent_actions":{"view_html":"https://pith.science/pith/MWDMPELYC2AEIRWWSULZM5NKMI","download_json":"https://pith.science/pith/MWDMPELYC2AEIRWWSULZM5NKMI.json","view_paper":"https://pith.science/paper/MWDMPELY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.3809&json=true","fetch_graph":"https://pith.science/api/pith-number/MWDMPELYC2AEIRWWSULZM5NKMI/graph.json","fetch_events":"https://pith.science/api/pith-number/MWDMPELYC2AEIRWWSULZM5NKMI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MWDMPELYC2AEIRWWSULZM5NKMI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MWDMPELYC2AEIRWWSULZM5NKMI/action/storage_attestation","attest_author":"https://pith.science/pith/MWDMPELYC2AEIRWWSULZM5NKMI/action/author_attestation","sign_citation":"https://pith.science/pith/MWDMPELYC2AEIRWWSULZM5NKMI/action/citation_signature","submit_replication":"https://pith.science/pith/MWDMPELYC2AEIRWWSULZM5NKMI/action/replication_record"}},"created_at":"2026-05-18T03:55:24.386364+00:00","updated_at":"2026-05-18T03:55:24.386364+00:00"}