{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:I5BDW7K3WX6LTIFF3RURIGILSX","short_pith_number":"pith:I5BDW7K3","canonical_record":{"source":{"id":"1809.05018","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-09-13T15:41:57Z","cross_cats_sorted":[],"title_canon_sha256":"85710f6013367e49f0a5795df61e3e384a49c4bb5f96153750fd1ad49f50e500","abstract_canon_sha256":"4aa13097c0ef99fecf2bf0ef47e49cb9e5d61b04caf1a1e9cc6f14f4cd3bfec0"},"schema_version":"1.0"},"canonical_sha256":"47423b7d5bb5fcb9a0a5dc6914190b95deb8d960748221868059f7ae34a27e92","source":{"kind":"arxiv","id":"1809.05018","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.05018","created_at":"2026-05-18T00:05:46Z"},{"alias_kind":"arxiv_version","alias_value":"1809.05018v1","created_at":"2026-05-18T00:05:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.05018","created_at":"2026-05-18T00:05:46Z"},{"alias_kind":"pith_short_12","alias_value":"I5BDW7K3WX6L","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"I5BDW7K3WX6LTIFF","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"I5BDW7K3","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:I5BDW7K3WX6LTIFF3RURIGILSX","target":"record","payload":{"canonical_record":{"source":{"id":"1809.05018","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-09-13T15:41:57Z","cross_cats_sorted":[],"title_canon_sha256":"85710f6013367e49f0a5795df61e3e384a49c4bb5f96153750fd1ad49f50e500","abstract_canon_sha256":"4aa13097c0ef99fecf2bf0ef47e49cb9e5d61b04caf1a1e9cc6f14f4cd3bfec0"},"schema_version":"1.0"},"canonical_sha256":"47423b7d5bb5fcb9a0a5dc6914190b95deb8d960748221868059f7ae34a27e92","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:46.858449Z","signature_b64":"GPpv+kMa9KvBinLhPZaizhreLuAxs3HYw3ubX8aT7JiKKv07PEea8yOyAuAkyxmnGPFQt8G0c8EQPnSf00A1AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47423b7d5bb5fcb9a0a5dc6914190b95deb8d960748221868059f7ae34a27e92","last_reissued_at":"2026-05-18T00:05:46.857793Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:46.857793Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.05018","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:05:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YpZzcMFimbIvtu7ncqZVrYTVu2fKjn6WWP7kzi+AN/ZJuSkXtNwi58TClRZMV5T8uH87O3J0e+Ls5Qpwywy/Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T08:12:04.887948Z"},"content_sha256":"ab5ece5a7c6b2c6f0f1ec72252c642bbd17d8e847b6d2932e6961512957e3ffc","schema_version":"1.0","event_id":"sha256:ab5ece5a7c6b2c6f0f1ec72252c642bbd17d8e847b6d2932e6961512957e3ffc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:I5BDW7K3WX6LTIFF3RURIGILSX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"DPP-PMRF: Rethinking Optimization for a Probabilistic Graphical Model Using Data-Parallel Primitives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Brenton Lessley, Colleen Heinemann, David Camp, E. Wes Bethel, Hank Childs, Talita Perciano","submitted_at":"2018-09-13T15:41:57Z","abstract_excerpt":"We present a new parallel algorithm for probabilistic graphical model optimization. The algorithm relies on data-parallel primitives (DPPs), which provide portable performance over hardware architecture. We evaluate results on CPUs and GPUs for an image segmentation problem. Compared to a serial baseline, we observe runtime speedups of up to 13X (CPU) and 44X (GPU). We also compare our performance to a reference, OpenMP-based algorithm, and find speedups of up to 7X (CPU)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.05018","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:05:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/B76Z61pQM68SWCLL1AUM34VjKH+obosgmqzYDVeNyRsnq/AEf+y9cV3GBERbgJO8DksWh762F4PthQRuDCzBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T08:12:04.888286Z"},"content_sha256":"194e01c349f65c6a979f19f8e0fc96c8e4cd04bd9bd1075305c2827b330fadd1","schema_version":"1.0","event_id":"sha256:194e01c349f65c6a979f19f8e0fc96c8e4cd04bd9bd1075305c2827b330fadd1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I5BDW7K3WX6LTIFF3RURIGILSX/bundle.json","state_url":"https://pith.science/pith/I5BDW7K3WX6LTIFF3RURIGILSX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I5BDW7K3WX6LTIFF3RURIGILSX/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-29T08:12:04Z","links":{"resolver":"https://pith.science/pith/I5BDW7K3WX6LTIFF3RURIGILSX","bundle":"https://pith.science/pith/I5BDW7K3WX6LTIFF3RURIGILSX/bundle.json","state":"https://pith.science/pith/I5BDW7K3WX6LTIFF3RURIGILSX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I5BDW7K3WX6LTIFF3RURIGILSX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:I5BDW7K3WX6LTIFF3RURIGILSX","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":"4aa13097c0ef99fecf2bf0ef47e49cb9e5d61b04caf1a1e9cc6f14f4cd3bfec0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-09-13T15:41:57Z","title_canon_sha256":"85710f6013367e49f0a5795df61e3e384a49c4bb5f96153750fd1ad49f50e500"},"schema_version":"1.0","source":{"id":"1809.05018","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.05018","created_at":"2026-05-18T00:05:46Z"},{"alias_kind":"arxiv_version","alias_value":"1809.05018v1","created_at":"2026-05-18T00:05:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.05018","created_at":"2026-05-18T00:05:46Z"},{"alias_kind":"pith_short_12","alias_value":"I5BDW7K3WX6L","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"I5BDW7K3WX6LTIFF","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"I5BDW7K3","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:194e01c349f65c6a979f19f8e0fc96c8e4cd04bd9bd1075305c2827b330fadd1","target":"graph","created_at":"2026-05-18T00:05:46Z","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":"We present a new parallel algorithm for probabilistic graphical model optimization. The algorithm relies on data-parallel primitives (DPPs), which provide portable performance over hardware architecture. We evaluate results on CPUs and GPUs for an image segmentation problem. Compared to a serial baseline, we observe runtime speedups of up to 13X (CPU) and 44X (GPU). We also compare our performance to a reference, OpenMP-based algorithm, and find speedups of up to 7X (CPU).","authors_text":"Brenton Lessley, Colleen Heinemann, David Camp, E. Wes Bethel, Hank Childs, Talita Perciano","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-09-13T15:41:57Z","title":"DPP-PMRF: Rethinking Optimization for a Probabilistic Graphical Model Using Data-Parallel Primitives"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.05018","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:ab5ece5a7c6b2c6f0f1ec72252c642bbd17d8e847b6d2932e6961512957e3ffc","target":"record","created_at":"2026-05-18T00:05:46Z","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":"4aa13097c0ef99fecf2bf0ef47e49cb9e5d61b04caf1a1e9cc6f14f4cd3bfec0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-09-13T15:41:57Z","title_canon_sha256":"85710f6013367e49f0a5795df61e3e384a49c4bb5f96153750fd1ad49f50e500"},"schema_version":"1.0","source":{"id":"1809.05018","kind":"arxiv","version":1}},"canonical_sha256":"47423b7d5bb5fcb9a0a5dc6914190b95deb8d960748221868059f7ae34a27e92","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"47423b7d5bb5fcb9a0a5dc6914190b95deb8d960748221868059f7ae34a27e92","first_computed_at":"2026-05-18T00:05:46.857793Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:46.857793Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GPpv+kMa9KvBinLhPZaizhreLuAxs3HYw3ubX8aT7JiKKv07PEea8yOyAuAkyxmnGPFQt8G0c8EQPnSf00A1AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:46.858449Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.05018","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ab5ece5a7c6b2c6f0f1ec72252c642bbd17d8e847b6d2932e6961512957e3ffc","sha256:194e01c349f65c6a979f19f8e0fc96c8e4cd04bd9bd1075305c2827b330fadd1"],"state_sha256":"4e5bfa6a4c1a402817e2fa12706deef29950cf047a3e56489cf407307a6b04c5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UiIS4ESd93LvM+P95W1SWHPB8wBYSIoZ+hOvqZRQ4m3fquduE3d4FlPpfv+QH1Ta5ejCx49KYC23DeU3nHHmBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T08:12:04.890132Z","bundle_sha256":"b02829a03c65a1418910ce2e8c19a80cc5f4710bd2bf88d00fd917407bac86d1"}}