{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:MYWF3VYYHEI73QGNVL627JWH66","short_pith_number":"pith:MYWF3VYY","canonical_record":{"source":{"id":"1409.3836","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-09-12T19:57:59Z","cross_cats_sorted":["cs.AI","cs.IT","math.IT","stat.CO"],"title_canon_sha256":"553c6d19d07188258a6dd51e63c7b77276506bd53cc78b9ba6aeb72078b8ad23","abstract_canon_sha256":"bbd93ebc70c056cb3aa4dce7cb2d2b3507c32f16bcf4d457ce1c1678ac3f75f7"},"schema_version":"1.0"},"canonical_sha256":"662c5dd7183911fdc0cdaafdafa6c7f7a6d199c5b0b6e0e7793e0557890d450a","source":{"kind":"arxiv","id":"1409.3836","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.3836","created_at":"2026-05-18T02:42:27Z"},{"alias_kind":"arxiv_version","alias_value":"1409.3836v2","created_at":"2026-05-18T02:42:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.3836","created_at":"2026-05-18T02:42:27Z"},{"alias_kind":"pith_short_12","alias_value":"MYWF3VYYHEI7","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MYWF3VYYHEI73QGN","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MYWF3VYY","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:MYWF3VYYHEI73QGNVL627JWH66","target":"record","payload":{"canonical_record":{"source":{"id":"1409.3836","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-09-12T19:57:59Z","cross_cats_sorted":["cs.AI","cs.IT","math.IT","stat.CO"],"title_canon_sha256":"553c6d19d07188258a6dd51e63c7b77276506bd53cc78b9ba6aeb72078b8ad23","abstract_canon_sha256":"bbd93ebc70c056cb3aa4dce7cb2d2b3507c32f16bcf4d457ce1c1678ac3f75f7"},"schema_version":"1.0"},"canonical_sha256":"662c5dd7183911fdc0cdaafdafa6c7f7a6d199c5b0b6e0e7793e0557890d450a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:27.681530Z","signature_b64":"fg51ozK33+SJ0Y+vkrIaTAN3PskR/sbhCpfpfpWbpiFh5KXG/7RepbavRjKU+i6Oz+5krNtUw1CsRbr+V+XYDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"662c5dd7183911fdc0cdaafdafa6c7f7a6d199c5b0b6e0e7793e0557890d450a","last_reissued_at":"2026-05-18T02:42:27.680656Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:27.680656Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.3836","source_version":2,"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-18T02:42:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SJHXxZNSwvxvqunHPSICc8KN3NJf7r5OVvgFojFuLN/HQbk77A8yaeUPheADR2tdmxYGTo5nQ4m7eAkem8glCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:18:51.646007Z"},"content_sha256":"517e537a0675e0cf08225ce56924aff50650cff4106ac071fd27ecab3cb9f29b","schema_version":"1.0","event_id":"sha256:517e537a0675e0cf08225ce56924aff50650cff4106ac071fd27ecab3cb9f29b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:MYWF3VYYHEI73QGNVL627JWH66","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hardness of parameter estimation in graphical models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.IT","math.IT","stat.CO"],"primary_cat":"cs.CC","authors_text":"David Gamarnik, Devavrat Shah, Guy Bresler","submitted_at":"2014-09-12T19:57:59Z","abstract_excerpt":"We consider the problem of learning the canonical parameters specifying an undirected graphical model (Markov random field) from the mean parameters. For graphical models representing a minimal exponential family, the canonical parameters are uniquely determined by the mean parameters, so the problem is feasible in principle. The goal of this paper is to investigate the computational feasibility of this statistical task. Our main result shows that parameter estimation is in general intractable: no algorithm can learn the canonical parameters of a generic pair-wise binary graphical model from t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.3836","kind":"arxiv","version":2},"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-18T02:42:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NWMg540U0Zc+dWZhumfYJvgo/o/Kuha7rPstVr1bSERC3bY5o3UxJ3xgJ+svAWpse7wASxHNznQeHssyFg0pDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:18:51.646762Z"},"content_sha256":"9968b3a9b3f1f23ea4d9d8a4055670763240d6923b5c625a224af1b4bb77088c","schema_version":"1.0","event_id":"sha256:9968b3a9b3f1f23ea4d9d8a4055670763240d6923b5c625a224af1b4bb77088c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MYWF3VYYHEI73QGNVL627JWH66/bundle.json","state_url":"https://pith.science/pith/MYWF3VYYHEI73QGNVL627JWH66/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MYWF3VYYHEI73QGNVL627JWH66/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-27T12:18:51Z","links":{"resolver":"https://pith.science/pith/MYWF3VYYHEI73QGNVL627JWH66","bundle":"https://pith.science/pith/MYWF3VYYHEI73QGNVL627JWH66/bundle.json","state":"https://pith.science/pith/MYWF3VYYHEI73QGNVL627JWH66/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MYWF3VYYHEI73QGNVL627JWH66/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:MYWF3VYYHEI73QGNVL627JWH66","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":"bbd93ebc70c056cb3aa4dce7cb2d2b3507c32f16bcf4d457ce1c1678ac3f75f7","cross_cats_sorted":["cs.AI","cs.IT","math.IT","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-09-12T19:57:59Z","title_canon_sha256":"553c6d19d07188258a6dd51e63c7b77276506bd53cc78b9ba6aeb72078b8ad23"},"schema_version":"1.0","source":{"id":"1409.3836","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.3836","created_at":"2026-05-18T02:42:27Z"},{"alias_kind":"arxiv_version","alias_value":"1409.3836v2","created_at":"2026-05-18T02:42:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.3836","created_at":"2026-05-18T02:42:27Z"},{"alias_kind":"pith_short_12","alias_value":"MYWF3VYYHEI7","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MYWF3VYYHEI73QGN","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MYWF3VYY","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:9968b3a9b3f1f23ea4d9d8a4055670763240d6923b5c625a224af1b4bb77088c","target":"graph","created_at":"2026-05-18T02:42:27Z","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 consider the problem of learning the canonical parameters specifying an undirected graphical model (Markov random field) from the mean parameters. For graphical models representing a minimal exponential family, the canonical parameters are uniquely determined by the mean parameters, so the problem is feasible in principle. The goal of this paper is to investigate the computational feasibility of this statistical task. Our main result shows that parameter estimation is in general intractable: no algorithm can learn the canonical parameters of a generic pair-wise binary graphical model from t","authors_text":"David Gamarnik, Devavrat Shah, Guy Bresler","cross_cats":["cs.AI","cs.IT","math.IT","stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-09-12T19:57:59Z","title":"Hardness of parameter estimation in graphical models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.3836","kind":"arxiv","version":2},"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:517e537a0675e0cf08225ce56924aff50650cff4106ac071fd27ecab3cb9f29b","target":"record","created_at":"2026-05-18T02:42:27Z","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":"bbd93ebc70c056cb3aa4dce7cb2d2b3507c32f16bcf4d457ce1c1678ac3f75f7","cross_cats_sorted":["cs.AI","cs.IT","math.IT","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-09-12T19:57:59Z","title_canon_sha256":"553c6d19d07188258a6dd51e63c7b77276506bd53cc78b9ba6aeb72078b8ad23"},"schema_version":"1.0","source":{"id":"1409.3836","kind":"arxiv","version":2}},"canonical_sha256":"662c5dd7183911fdc0cdaafdafa6c7f7a6d199c5b0b6e0e7793e0557890d450a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"662c5dd7183911fdc0cdaafdafa6c7f7a6d199c5b0b6e0e7793e0557890d450a","first_computed_at":"2026-05-18T02:42:27.680656Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:42:27.680656Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fg51ozK33+SJ0Y+vkrIaTAN3PskR/sbhCpfpfpWbpiFh5KXG/7RepbavRjKU+i6Oz+5krNtUw1CsRbr+V+XYDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:42:27.681530Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.3836","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:517e537a0675e0cf08225ce56924aff50650cff4106ac071fd27ecab3cb9f29b","sha256:9968b3a9b3f1f23ea4d9d8a4055670763240d6923b5c625a224af1b4bb77088c"],"state_sha256":"9012cf29243f0b9a2ae23da0cc4699fa5369a473c39f3c8828487825f45fa643"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sppThneE3ztBR/yWoR4ddrM+vFIvi5TTmJqF0NBm43KtZULhV8Wk2RbYQzmgsScL24UWhaYR3XVOldj+qRprAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T12:18:51.650624Z","bundle_sha256":"4fc6efcbfd60a448735a532d9082672d406dcad12ab05509cf081286d2c83640"}}