{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RFUP722ZDI6LJHQXMOMS4JUJWM","short_pith_number":"pith:RFUP722Z","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"},"canonical_sha256":"8968ffeb591a3cb49e1763992e2689b337109781ca67baea1dbd3356757ac99a","source":{"kind":"arxiv","id":"1701.02628","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.02628","created_at":"2026-05-18T00:53:03Z"},{"alias_kind":"arxiv_version","alias_value":"1701.02628v1","created_at":"2026-05-18T00:53:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.02628","created_at":"2026-05-18T00:53:03Z"},{"alias_kind":"pith_short_12","alias_value":"RFUP722ZDI6L","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RFUP722ZDI6LJHQX","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RFUP722Z","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RFUP722ZDI6LJHQXMOMS4JUJWM","target":"record","payload":{"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"},"canonical_sha256":"8968ffeb591a3cb49e1763992e2689b337109781ca67baea1dbd3356757ac99a","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"},"source_kind":"arxiv","source_id":"1701.02628","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-18T00:53:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BHHHDitKBWdFd2JCKitXYgxUAgLRzBJemQNQ8HKF6Skc262E95sdRnGzp1g0jkmdV0O2WM+fqBivS4Rm5ZihAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:24:03.633022Z"},"content_sha256":"1008201eafc44c3d3a20b348e0f57cd73d4c78e3b0e479003ddace0414c547b2","schema_version":"1.0","event_id":"sha256:1008201eafc44c3d3a20b348e0f57cd73d4c78e3b0e479003ddace0414c547b2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RFUP722ZDI6LJHQXMOMS4JUJWM","target":"graph","payload":{"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"},"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-18T00:53:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Oqt2J6GrcMUYor4E70kBcWh4zg+0K8p3aSLneYIbkvkrBkkkVhK8THe3uK5vNbSOt4F2sgOacyYNBLpEwmp8CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:24:03.633734Z"},"content_sha256":"55debd1726a5264f8ab32caf68696b75e32c5068bac78e8b47ba284915111138","schema_version":"1.0","event_id":"sha256:55debd1726a5264f8ab32caf68696b75e32c5068bac78e8b47ba284915111138"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RFUP722ZDI6LJHQXMOMS4JUJWM/bundle.json","state_url":"https://pith.science/pith/RFUP722ZDI6LJHQXMOMS4JUJWM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RFUP722ZDI6LJHQXMOMS4JUJWM/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-25T15:24:03Z","links":{"resolver":"https://pith.science/pith/RFUP722ZDI6LJHQXMOMS4JUJWM","bundle":"https://pith.science/pith/RFUP722ZDI6LJHQXMOMS4JUJWM/bundle.json","state":"https://pith.science/pith/RFUP722ZDI6LJHQXMOMS4JUJWM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RFUP722ZDI6LJHQXMOMS4JUJWM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RFUP722ZDI6LJHQXMOMS4JUJWM","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":"ea7eb0958e98b873f9ce4da6a67bac78ab588ca45df00296c3839607da3e741a","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-01-10T15:13:49Z","title_canon_sha256":"4c5c141c53680b433f8ead874956ccc857577e1c0dbdc8c7eeff181dc01997e8"},"schema_version":"1.0","source":{"id":"1701.02628","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.02628","created_at":"2026-05-18T00:53:03Z"},{"alias_kind":"arxiv_version","alias_value":"1701.02628v1","created_at":"2026-05-18T00:53:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.02628","created_at":"2026-05-18T00:53:03Z"},{"alias_kind":"pith_short_12","alias_value":"RFUP722ZDI6L","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RFUP722ZDI6LJHQX","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RFUP722Z","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:55debd1726a5264f8ab32caf68696b75e32c5068bac78e8b47ba284915111138","target":"graph","created_at":"2026-05-18T00:53:03Z","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":"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","authors_text":"Erik Saule, Kamer Kaya, Mustafa Kemal Ta\\c{s}","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-01-10T15:13:49Z","title":"Greed is Good: Optimistic Algorithms for Bipartite-Graph Partial Coloring on Multicore Architectures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.02628","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:1008201eafc44c3d3a20b348e0f57cd73d4c78e3b0e479003ddace0414c547b2","target":"record","created_at":"2026-05-18T00:53:03Z","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":"ea7eb0958e98b873f9ce4da6a67bac78ab588ca45df00296c3839607da3e741a","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-01-10T15:13:49Z","title_canon_sha256":"4c5c141c53680b433f8ead874956ccc857577e1c0dbdc8c7eeff181dc01997e8"},"schema_version":"1.0","source":{"id":"1701.02628","kind":"arxiv","version":1}},"canonical_sha256":"8968ffeb591a3cb49e1763992e2689b337109781ca67baea1dbd3356757ac99a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8968ffeb591a3cb49e1763992e2689b337109781ca67baea1dbd3356757ac99a","first_computed_at":"2026-05-18T00:53:03.805842Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:03.805842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YaLkU3aAkWVBUcpcQEC4YJ8zMhyiYB+farunusDXd2HZCh79zcw3eZTvNkKMLE5Iefx15yTcrveLi4gNiCeHDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:03.806384Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.02628","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1008201eafc44c3d3a20b348e0f57cd73d4c78e3b0e479003ddace0414c547b2","sha256:55debd1726a5264f8ab32caf68696b75e32c5068bac78e8b47ba284915111138"],"state_sha256":"74a67e016b32c226d36ffb26b8d26bc440ea53a5dae917afe2834da6bb0448bc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jKGaV8czZbPGPE5ExGWW4pwaWX2n1M1+cp/rgaGf2aepJVtJnYSWOakPpLWqAyvyXUgx8dPYczbs2hKeZLWqDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T15:24:03.637483Z","bundle_sha256":"f29fdbad672c75f181a340d23d5ba729c598e9c325efd11e8bd5f3dd14be9ab0"}}