{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:VZMTCXUKI5PISSN6XZNLLZF4J6","short_pith_number":"pith:VZMTCXUK","canonical_record":{"source":{"id":"1205.2645","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-05-09T15:23:28Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"8e3f90897daf22a3f93163b42bffef8a4f4cdd4744133dcd63e437a94700ef8f","abstract_canon_sha256":"f16d809bae8ef6aed19f7a737a108c6d73df6faeb8a14e9bb0b4f9a7060661ae"},"schema_version":"1.0"},"canonical_sha256":"ae59315e8a475e8949bebe5ab5e4bc4f93d074eaf23951f2e1e20b0643450140","source":{"kind":"arxiv","id":"1205.2645","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.2645","created_at":"2026-05-18T03:55:47Z"},{"alias_kind":"arxiv_version","alias_value":"1205.2645v1","created_at":"2026-05-18T03:55:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.2645","created_at":"2026-05-18T03:55:47Z"},{"alias_kind":"pith_short_12","alias_value":"VZMTCXUKI5PI","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VZMTCXUKI5PISSN6","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VZMTCXUK","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:VZMTCXUKI5PISSN6XZNLLZF4J6","target":"record","payload":{"canonical_record":{"source":{"id":"1205.2645","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-05-09T15:23:28Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"8e3f90897daf22a3f93163b42bffef8a4f4cdd4744133dcd63e437a94700ef8f","abstract_canon_sha256":"f16d809bae8ef6aed19f7a737a108c6d73df6faeb8a14e9bb0b4f9a7060661ae"},"schema_version":"1.0"},"canonical_sha256":"ae59315e8a475e8949bebe5ab5e4bc4f93d074eaf23951f2e1e20b0643450140","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:47.669489Z","signature_b64":"jwmH2kA0EWAywM+r/623HYhRbSZWAmas1iGU4jB82wNCqHMplA32Qs7P6waR1m7sek7WLQEY/X0FCgdZKj9UAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae59315e8a475e8949bebe5ab5e4bc4f93d074eaf23951f2e1e20b0643450140","last_reissued_at":"2026-05-18T03:55:47.669070Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:47.669070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.2645","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-18T03:55:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JNJULcvicGzvVH7QIVrc5/4GuW3dhgiCv5XE1jRmco7ZNEk3QcJPIOBMrWogXWOthb4VZ2ZzHs3M91Z9kMmZBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:34:45.107879Z"},"content_sha256":"06e4c65c44f1613219768aae3e69e55f5ebc6b5c03d0ae1c8ba94275da46334a","schema_version":"1.0","event_id":"sha256:06e4c65c44f1613219768aae3e69e55f5ebc6b5c03d0ae1c8ba94275da46334a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:VZMTCXUKI5PISSN6XZNLLZF4J6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Parallel Inference on Large Factor Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.AI","authors_text":"Carlos E. Guestrin, David O'Hallaron, Joseph E. Gonzalez, Yucheng Low","submitted_at":"2012-05-09T15:23:28Z","abstract_excerpt":"As computer clusters become more common and the size of the problems encountered in the field of AI grows, there is an increasing demand for efficient parallel inference algorithms. We consider the problem of parallel inference on large factor graphs in the distributed memory setting of computer clusters. We develop a new efficient parallel inference algorithm, DBRSplash, which incorporates over-segmented graph partitioning, belief residual scheduling, and uniform work Splash operations. We empirically evaluate the DBRSplash algorithm on a 120 processor cluster and demonstrate linear to super-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.2645","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-18T03:55:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ts5bH5wDEBAaUkT5WQQhIFaaMFuNUyL4yaaWAXlesira27daNdDBCsnRScv1/eAOt1+w3olxFnJV8DcmcdrtDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:34:45.108219Z"},"content_sha256":"300145aa56f4aa9fa6d6f34471fcfc7fa19ed2955deb366b31b148bc4c8d2bab","schema_version":"1.0","event_id":"sha256:300145aa56f4aa9fa6d6f34471fcfc7fa19ed2955deb366b31b148bc4c8d2bab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VZMTCXUKI5PISSN6XZNLLZF4J6/bundle.json","state_url":"https://pith.science/pith/VZMTCXUKI5PISSN6XZNLLZF4J6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VZMTCXUKI5PISSN6XZNLLZF4J6/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-01T15:34:45Z","links":{"resolver":"https://pith.science/pith/VZMTCXUKI5PISSN6XZNLLZF4J6","bundle":"https://pith.science/pith/VZMTCXUKI5PISSN6XZNLLZF4J6/bundle.json","state":"https://pith.science/pith/VZMTCXUKI5PISSN6XZNLLZF4J6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VZMTCXUKI5PISSN6XZNLLZF4J6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:VZMTCXUKI5PISSN6XZNLLZF4J6","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":"f16d809bae8ef6aed19f7a737a108c6d73df6faeb8a14e9bb0b4f9a7060661ae","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-05-09T15:23:28Z","title_canon_sha256":"8e3f90897daf22a3f93163b42bffef8a4f4cdd4744133dcd63e437a94700ef8f"},"schema_version":"1.0","source":{"id":"1205.2645","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.2645","created_at":"2026-05-18T03:55:47Z"},{"alias_kind":"arxiv_version","alias_value":"1205.2645v1","created_at":"2026-05-18T03:55:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.2645","created_at":"2026-05-18T03:55:47Z"},{"alias_kind":"pith_short_12","alias_value":"VZMTCXUKI5PI","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VZMTCXUKI5PISSN6","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VZMTCXUK","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:300145aa56f4aa9fa6d6f34471fcfc7fa19ed2955deb366b31b148bc4c8d2bab","target":"graph","created_at":"2026-05-18T03:55:47Z","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":"As computer clusters become more common and the size of the problems encountered in the field of AI grows, there is an increasing demand for efficient parallel inference algorithms. We consider the problem of parallel inference on large factor graphs in the distributed memory setting of computer clusters. We develop a new efficient parallel inference algorithm, DBRSplash, which incorporates over-segmented graph partitioning, belief residual scheduling, and uniform work Splash operations. We empirically evaluate the DBRSplash algorithm on a 120 processor cluster and demonstrate linear to super-","authors_text":"Carlos E. Guestrin, David O'Hallaron, Joseph E. Gonzalez, Yucheng Low","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-05-09T15:23:28Z","title":"Distributed Parallel Inference on Large Factor Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.2645","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:06e4c65c44f1613219768aae3e69e55f5ebc6b5c03d0ae1c8ba94275da46334a","target":"record","created_at":"2026-05-18T03:55:47Z","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":"f16d809bae8ef6aed19f7a737a108c6d73df6faeb8a14e9bb0b4f9a7060661ae","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-05-09T15:23:28Z","title_canon_sha256":"8e3f90897daf22a3f93163b42bffef8a4f4cdd4744133dcd63e437a94700ef8f"},"schema_version":"1.0","source":{"id":"1205.2645","kind":"arxiv","version":1}},"canonical_sha256":"ae59315e8a475e8949bebe5ab5e4bc4f93d074eaf23951f2e1e20b0643450140","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ae59315e8a475e8949bebe5ab5e4bc4f93d074eaf23951f2e1e20b0643450140","first_computed_at":"2026-05-18T03:55:47.669070Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:55:47.669070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jwmH2kA0EWAywM+r/623HYhRbSZWAmas1iGU4jB82wNCqHMplA32Qs7P6waR1m7sek7WLQEY/X0FCgdZKj9UAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:55:47.669489Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.2645","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:06e4c65c44f1613219768aae3e69e55f5ebc6b5c03d0ae1c8ba94275da46334a","sha256:300145aa56f4aa9fa6d6f34471fcfc7fa19ed2955deb366b31b148bc4c8d2bab"],"state_sha256":"0f1e2a6fe0bdbd98ff127e5f51d7af291414d10c72906aaa68fb66ff9bce8f1c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qb6bUi4mfe2kcl9VjE8ujCkJdeKFkiHZd8imm8hBX1a5/bwcOz8WsiSqhLTjLRzGPIELj2rVYHbT4JtaGtGjAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T15:34:45.110538Z","bundle_sha256":"e37cec318bf6d0a0ed9a14c8a90f8d31e89a027f32b464146cd21aaeaa5333d8"}}