{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:RFUP722ZDI6LJHQXMOMS4JUJWM","short_pith_number":"pith:RFUP722Z","schema_version":"1.0","canonical_sha256":"8968ffeb591a3cb49e1763992e2689b337109781ca67baea1dbd3356757ac99a","source":{"kind":"arxiv","id":"1701.02628","version":1},"attestation_state":"computed","paper":{"title":"Greed is Good: Optimistic Algorithms for Bipartite-Graph Partial Coloring on Multicore Architectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Erik Saule, Kamer Kaya, Mustafa Kemal Ta\\c{s}","submitted_at":"2017-01-10T15:13:49Z","abstract_excerpt":"In parallel computing, a valid graph coloring yields a lock-free processing of the colored tasks, data points, etc., without expensive synchronization mechanisms. However, coloring is not free and the overhead can be significant. In particular, for the bipartite-graph partial coloring (BGPC) and distance-2 graph coloring (D2GC) problems, which have various use-cases within the scientific computing and numerical optimization domains, the coloring overhead can be in the order of minutes with a single thread for many real-life graphs.\n  In this work, we propose parallel algorithms for bipartite-g"},"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":"1701.02628","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-01-10T15:13:49Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"4c5c141c53680b433f8ead874956ccc857577e1c0dbdc8c7eeff181dc01997e8","abstract_canon_sha256":"ea7eb0958e98b873f9ce4da6a67bac78ab588ca45df00296c3839607da3e741a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:03.806384Z","signature_b64":"YaLkU3aAkWVBUcpcQEC4YJ8zMhyiYB+farunusDXd2HZCh79zcw3eZTvNkKMLE5Iefx15yTcrveLi4gNiCeHDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8968ffeb591a3cb49e1763992e2689b337109781ca67baea1dbd3356757ac99a","last_reissued_at":"2026-05-18T00:53:03.805842Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:03.805842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Greed is Good: Optimistic Algorithms for Bipartite-Graph Partial Coloring on Multicore Architectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Erik Saule, Kamer Kaya, Mustafa Kemal Ta\\c{s}","submitted_at":"2017-01-10T15:13:49Z","abstract_excerpt":"In parallel computing, a valid graph coloring yields a lock-free processing of the colored tasks, data points, etc., without expensive synchronization mechanisms. However, coloring is not free and the overhead can be significant. In particular, for the bipartite-graph partial coloring (BGPC) and distance-2 graph coloring (D2GC) problems, which have various use-cases within the scientific computing and numerical optimization domains, the coloring overhead can be in the order of minutes with a single thread for many real-life graphs.\n  In this work, we propose parallel algorithms for bipartite-g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.02628","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":"1701.02628","created_at":"2026-05-18T00:53:03.805925+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.02628v1","created_at":"2026-05-18T00:53:03.805925+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.02628","created_at":"2026-05-18T00:53:03.805925+00:00"},{"alias_kind":"pith_short_12","alias_value":"RFUP722ZDI6L","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"RFUP722ZDI6LJHQX","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"RFUP722Z","created_at":"2026-05-18T12:31:39.905425+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/RFUP722ZDI6LJHQXMOMS4JUJWM","json":"https://pith.science/pith/RFUP722ZDI6LJHQXMOMS4JUJWM.json","graph_json":"https://pith.science/api/pith-number/RFUP722ZDI6LJHQXMOMS4JUJWM/graph.json","events_json":"https://pith.science/api/pith-number/RFUP722ZDI6LJHQXMOMS4JUJWM/events.json","paper":"https://pith.science/paper/RFUP722Z"},"agent_actions":{"view_html":"https://pith.science/pith/RFUP722ZDI6LJHQXMOMS4JUJWM","download_json":"https://pith.science/pith/RFUP722ZDI6LJHQXMOMS4JUJWM.json","view_paper":"https://pith.science/paper/RFUP722Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.02628&json=true","fetch_graph":"https://pith.science/api/pith-number/RFUP722ZDI6LJHQXMOMS4JUJWM/graph.json","fetch_events":"https://pith.science/api/pith-number/RFUP722ZDI6LJHQXMOMS4JUJWM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RFUP722ZDI6LJHQXMOMS4JUJWM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RFUP722ZDI6LJHQXMOMS4JUJWM/action/storage_attestation","attest_author":"https://pith.science/pith/RFUP722ZDI6LJHQXMOMS4JUJWM/action/author_attestation","sign_citation":"https://pith.science/pith/RFUP722ZDI6LJHQXMOMS4JUJWM/action/citation_signature","submit_replication":"https://pith.science/pith/RFUP722ZDI6LJHQXMOMS4JUJWM/action/replication_record"}},"created_at":"2026-05-18T00:53:03.805925+00:00","updated_at":"2026-05-18T00:53:03.805925+00:00"}