{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:LEF6X5NBYV4SVRSURSJL4A6OMS","short_pith_number":"pith:LEF6X5NB","canonical_record":{"source":{"id":"1308.6342","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-08-29T01:55:37Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"4fde6be0e13568f58f7a7ff32a6fbd47f10afe9b57cd9346c2caf9c035317cd3","abstract_canon_sha256":"d11d21ab3f9c5b9fb6e1c98234c749c6d7ed8f414dc719893b1bacb292d6f3ca"},"schema_version":"1.0"},"canonical_sha256":"590bebf5a1c5792ac6548c92be03ce6499069279ba40257ffc9473b7b91a3a3e","source":{"kind":"arxiv","id":"1308.6342","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.6342","created_at":"2026-05-18T03:00:02Z"},{"alias_kind":"arxiv_version","alias_value":"1308.6342v4","created_at":"2026-05-18T03:00:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.6342","created_at":"2026-05-18T03:00:02Z"},{"alias_kind":"pith_short_12","alias_value":"LEF6X5NBYV4S","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LEF6X5NBYV4SVRSU","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LEF6X5NB","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:LEF6X5NBYV4SVRSURSJL4A6OMS","target":"record","payload":{"canonical_record":{"source":{"id":"1308.6342","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-08-29T01:55:37Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"4fde6be0e13568f58f7a7ff32a6fbd47f10afe9b57cd9346c2caf9c035317cd3","abstract_canon_sha256":"d11d21ab3f9c5b9fb6e1c98234c749c6d7ed8f414dc719893b1bacb292d6f3ca"},"schema_version":"1.0"},"canonical_sha256":"590bebf5a1c5792ac6548c92be03ce6499069279ba40257ffc9473b7b91a3a3e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:02.898039Z","signature_b64":"LORvM77l1Nmt0iihhk34hEEj+QzT7vB2iutQliSjnWjo54k76skW5kq9N7b8/AG3klkvbaY2aybEg2yn/haaBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"590bebf5a1c5792ac6548c92be03ce6499069279ba40257ffc9473b7b91a3a3e","last_reissued_at":"2026-05-18T03:00:02.897341Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:02.897341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.6342","source_version":4,"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:00:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ywdbu2P6muqLr+bS8xu8x6NPy4Xm+l8Dz6BT2cORPem/k1s5SOTNwOfxKerh0mW7hmhpacFK60PSKAEJzsUOBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T06:48:28.101456Z"},"content_sha256":"5cdb028cd7815829903b85e75141cb4c616dfe1ff88ae7c6832e668ea2e80cbd","schema_version":"1.0","event_id":"sha256:5cdb028cd7815829903b85e75141cb4c616dfe1ff88ae7c6832e668ea2e80cbd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:LEF6X5NBYV4SVRSURSJL4A6OMS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linear and Parallel Learning of Markov Random Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Misha Denil, Nando de Freitas, Yariv Dror Mizrahi","submitted_at":"2013-08-29T01:55:37Z","abstract_excerpt":"We introduce a new embarrassingly parallel parameter learning algorithm for Markov random fields with untied parameters which is efficient for a large class of practical models. Our algorithm parallelizes naturally over cliques and, for graphs of bounded degree, its complexity is linear in the number of cliques. Unlike its competitors, our algorithm is fully parallel and for log-linear models it is also data efficient, requiring only the local sufficient statistics of the data to estimate parameters."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.6342","kind":"arxiv","version":4},"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:00:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wpi3kIjPBZ0m+TFfZf25nWpNpwwRxXqFqo/VIPraFRnGLokEtAWXFj5BwWc2GLUSSZ09Ai6ff+n4alsWVkQGAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T06:48:28.102129Z"},"content_sha256":"a6bbae84d3058a1e9891aba9ed6833a0750e57315fd2dfd6cfb84525a5d85de9","schema_version":"1.0","event_id":"sha256:a6bbae84d3058a1e9891aba9ed6833a0750e57315fd2dfd6cfb84525a5d85de9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LEF6X5NBYV4SVRSURSJL4A6OMS/bundle.json","state_url":"https://pith.science/pith/LEF6X5NBYV4SVRSURSJL4A6OMS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LEF6X5NBYV4SVRSURSJL4A6OMS/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-06T06:48:28Z","links":{"resolver":"https://pith.science/pith/LEF6X5NBYV4SVRSURSJL4A6OMS","bundle":"https://pith.science/pith/LEF6X5NBYV4SVRSURSJL4A6OMS/bundle.json","state":"https://pith.science/pith/LEF6X5NBYV4SVRSURSJL4A6OMS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LEF6X5NBYV4SVRSURSJL4A6OMS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:LEF6X5NBYV4SVRSURSJL4A6OMS","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":"d11d21ab3f9c5b9fb6e1c98234c749c6d7ed8f414dc719893b1bacb292d6f3ca","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-08-29T01:55:37Z","title_canon_sha256":"4fde6be0e13568f58f7a7ff32a6fbd47f10afe9b57cd9346c2caf9c035317cd3"},"schema_version":"1.0","source":{"id":"1308.6342","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.6342","created_at":"2026-05-18T03:00:02Z"},{"alias_kind":"arxiv_version","alias_value":"1308.6342v4","created_at":"2026-05-18T03:00:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.6342","created_at":"2026-05-18T03:00:02Z"},{"alias_kind":"pith_short_12","alias_value":"LEF6X5NBYV4S","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LEF6X5NBYV4SVRSU","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LEF6X5NB","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:a6bbae84d3058a1e9891aba9ed6833a0750e57315fd2dfd6cfb84525a5d85de9","target":"graph","created_at":"2026-05-18T03:00:02Z","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 embarrassingly parallel parameter learning algorithm for Markov random fields with untied parameters which is efficient for a large class of practical models. Our algorithm parallelizes naturally over cliques and, for graphs of bounded degree, its complexity is linear in the number of cliques. Unlike its competitors, our algorithm is fully parallel and for log-linear models it is also data efficient, requiring only the local sufficient statistics of the data to estimate parameters.","authors_text":"Misha Denil, Nando de Freitas, Yariv Dror Mizrahi","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-08-29T01:55:37Z","title":"Linear and Parallel Learning of Markov Random Fields"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.6342","kind":"arxiv","version":4},"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:5cdb028cd7815829903b85e75141cb4c616dfe1ff88ae7c6832e668ea2e80cbd","target":"record","created_at":"2026-05-18T03:00:02Z","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":"d11d21ab3f9c5b9fb6e1c98234c749c6d7ed8f414dc719893b1bacb292d6f3ca","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-08-29T01:55:37Z","title_canon_sha256":"4fde6be0e13568f58f7a7ff32a6fbd47f10afe9b57cd9346c2caf9c035317cd3"},"schema_version":"1.0","source":{"id":"1308.6342","kind":"arxiv","version":4}},"canonical_sha256":"590bebf5a1c5792ac6548c92be03ce6499069279ba40257ffc9473b7b91a3a3e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"590bebf5a1c5792ac6548c92be03ce6499069279ba40257ffc9473b7b91a3a3e","first_computed_at":"2026-05-18T03:00:02.897341Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:00:02.897341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LORvM77l1Nmt0iihhk34hEEj+QzT7vB2iutQliSjnWjo54k76skW5kq9N7b8/AG3klkvbaY2aybEg2yn/haaBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:00:02.898039Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.6342","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5cdb028cd7815829903b85e75141cb4c616dfe1ff88ae7c6832e668ea2e80cbd","sha256:a6bbae84d3058a1e9891aba9ed6833a0750e57315fd2dfd6cfb84525a5d85de9"],"state_sha256":"b02bfe2e5ceac874278e186f5a001ce100ce64f52afa250bc65cc1ae7ff97f67"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YBuUYQdfFLQOx5V5hRSWL2srN5c04L6nt74xT2AFmoSFgZeedU6JAxDp8vbaiH3SS1/GuVI9jhVnYv7GrTlzCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T06:48:28.105865Z","bundle_sha256":"5763872d5258285d1d93f3fd1b0245613de7949f04fa47787bcd4d127ecb1de4"}}