{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:YOA6H7N5JB4DGO7ITRUPKOR7HI","short_pith_number":"pith:YOA6H7N5","canonical_record":{"source":{"id":"1601.04667","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-01-18T19:38:51Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"74bfa4c72b830f90ef2514413bcd2d72f9e0167a6862fe9f55a41b3454d205c8","abstract_canon_sha256":"44281e3491e1b5651863015a2dbf5ab953c2771a09476669df55671230b22158"},"schema_version":"1.0"},"canonical_sha256":"c381e3fdbd4878333be89c68f53a3f3a12ab3b942916a26fd365b8a26c61998f","source":{"kind":"arxiv","id":"1601.04667","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.04667","created_at":"2026-05-18T01:22:44Z"},{"alias_kind":"arxiv_version","alias_value":"1601.04667v1","created_at":"2026-05-18T01:22:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.04667","created_at":"2026-05-18T01:22:44Z"},{"alias_kind":"pith_short_12","alias_value":"YOA6H7N5JB4D","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YOA6H7N5JB4DGO7I","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YOA6H7N5","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:YOA6H7N5JB4DGO7ITRUPKOR7HI","target":"record","payload":{"canonical_record":{"source":{"id":"1601.04667","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-01-18T19:38:51Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"74bfa4c72b830f90ef2514413bcd2d72f9e0167a6862fe9f55a41b3454d205c8","abstract_canon_sha256":"44281e3491e1b5651863015a2dbf5ab953c2771a09476669df55671230b22158"},"schema_version":"1.0"},"canonical_sha256":"c381e3fdbd4878333be89c68f53a3f3a12ab3b942916a26fd365b8a26c61998f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:44.521396Z","signature_b64":"5eG8TsxgOyyeyZerHv28fZwgw4kLLXX998/eso78pkQzC+JsNP1pnSuY6WEncYBseir5mGtBFzTdcxjSUjQcCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c381e3fdbd4878333be89c68f53a3f3a12ab3b942916a26fd365b8a26c61998f","last_reissued_at":"2026-05-18T01:22:44.520847Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:44.520847Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.04667","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-18T01:22:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y9zFgafSZSna0bDqdj/aWTtjMUgNRxgKHVhqMXxHnAlx4NCMAfM2JIgG0CKuk9bCC2zl90Utx/S4NFiKVVCSAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:48:37.278134Z"},"content_sha256":"09522fb55161924d5a353e955542e66463506700cbaaa9c49a3d29dbb1c906ee","schema_version":"1.0","event_id":"sha256:09522fb55161924d5a353e955542e66463506700cbaaa9c49a3d29dbb1c906ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:YOA6H7N5JB4DGO7ITRUPKOR7HI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Proactive Message Passing on Memory Factor Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.AI","authors_text":"Dan Schmidt, Jonathan Yedidia, Patrick Eschenfeldt, Stark Draper","submitted_at":"2016-01-18T19:38:51Z","abstract_excerpt":"We introduce a new type of graphical model that we call a \"memory factor network\" (MFN). We show how to use MFNs to model the structure inherent in many types of data sets. We also introduce an associated message-passing style algorithm called \"proactive message passing\"' (PMP) that performs inference on MFNs. PMP comes with convergence guarantees and is efficient in comparison to competing algorithms such as variants of belief propagation. We specialize MFNs and PMP to a number of distinct types of data (discrete, continuous, labelled) and inference problems (interpolation, hypothesis testing"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.04667","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-18T01:22:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zQPJiiMwj9dWTt6NU0yx8NPZWPV6EH7y3ZCo0UnFB1DbHSTXkr9/aPjkFcNZ9UkJh92dnASnAgLDzLLHEZDyCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:48:37.278698Z"},"content_sha256":"8b8d1cc615c460b86514f35fa739d11ff474cd29f5b10d133d5fe0067b9e273a","schema_version":"1.0","event_id":"sha256:8b8d1cc615c460b86514f35fa739d11ff474cd29f5b10d133d5fe0067b9e273a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YOA6H7N5JB4DGO7ITRUPKOR7HI/bundle.json","state_url":"https://pith.science/pith/YOA6H7N5JB4DGO7ITRUPKOR7HI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YOA6H7N5JB4DGO7ITRUPKOR7HI/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-01T02:48:37Z","links":{"resolver":"https://pith.science/pith/YOA6H7N5JB4DGO7ITRUPKOR7HI","bundle":"https://pith.science/pith/YOA6H7N5JB4DGO7ITRUPKOR7HI/bundle.json","state":"https://pith.science/pith/YOA6H7N5JB4DGO7ITRUPKOR7HI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YOA6H7N5JB4DGO7ITRUPKOR7HI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YOA6H7N5JB4DGO7ITRUPKOR7HI","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":"44281e3491e1b5651863015a2dbf5ab953c2771a09476669df55671230b22158","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-01-18T19:38:51Z","title_canon_sha256":"74bfa4c72b830f90ef2514413bcd2d72f9e0167a6862fe9f55a41b3454d205c8"},"schema_version":"1.0","source":{"id":"1601.04667","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.04667","created_at":"2026-05-18T01:22:44Z"},{"alias_kind":"arxiv_version","alias_value":"1601.04667v1","created_at":"2026-05-18T01:22:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.04667","created_at":"2026-05-18T01:22:44Z"},{"alias_kind":"pith_short_12","alias_value":"YOA6H7N5JB4D","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YOA6H7N5JB4DGO7I","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YOA6H7N5","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:8b8d1cc615c460b86514f35fa739d11ff474cd29f5b10d133d5fe0067b9e273a","target":"graph","created_at":"2026-05-18T01:22:44Z","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 introduce a new type of graphical model that we call a \"memory factor network\" (MFN). We show how to use MFNs to model the structure inherent in many types of data sets. We also introduce an associated message-passing style algorithm called \"proactive message passing\"' (PMP) that performs inference on MFNs. PMP comes with convergence guarantees and is efficient in comparison to competing algorithms such as variants of belief propagation. We specialize MFNs and PMP to a number of distinct types of data (discrete, continuous, labelled) and inference problems (interpolation, hypothesis testing","authors_text":"Dan Schmidt, Jonathan Yedidia, Patrick Eschenfeldt, Stark Draper","cross_cats":["cs.CV"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-01-18T19:38:51Z","title":"Proactive Message Passing on Memory Factor Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.04667","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:09522fb55161924d5a353e955542e66463506700cbaaa9c49a3d29dbb1c906ee","target":"record","created_at":"2026-05-18T01:22:44Z","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":"44281e3491e1b5651863015a2dbf5ab953c2771a09476669df55671230b22158","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-01-18T19:38:51Z","title_canon_sha256":"74bfa4c72b830f90ef2514413bcd2d72f9e0167a6862fe9f55a41b3454d205c8"},"schema_version":"1.0","source":{"id":"1601.04667","kind":"arxiv","version":1}},"canonical_sha256":"c381e3fdbd4878333be89c68f53a3f3a12ab3b942916a26fd365b8a26c61998f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c381e3fdbd4878333be89c68f53a3f3a12ab3b942916a26fd365b8a26c61998f","first_computed_at":"2026-05-18T01:22:44.520847Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:44.520847Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5eG8TsxgOyyeyZerHv28fZwgw4kLLXX998/eso78pkQzC+JsNP1pnSuY6WEncYBseir5mGtBFzTdcxjSUjQcCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:44.521396Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.04667","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:09522fb55161924d5a353e955542e66463506700cbaaa9c49a3d29dbb1c906ee","sha256:8b8d1cc615c460b86514f35fa739d11ff474cd29f5b10d133d5fe0067b9e273a"],"state_sha256":"46382ad9dadc73385f1169d6bf6960c754f197bffec3920c184655a536ed8e73"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LSNZNBKOslmLWHVPqG3s1qAWz5beBjDp2IykpGEJiZxrJCPnvLAbQ3ER/K4QREYn+RCVJ9rBSSdd5AZ101fIDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T02:48:37.281611Z","bundle_sha256":"16e1aa1ae173a87eb3949a22ee1784a2646c41745bafb869b2dca2be4fd8f17f"}}