{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:3NFGDGYOHOI6EVQM4AXSP3W3TB","short_pith_number":"pith:3NFGDGYO","canonical_record":{"source":{"id":"1111.6214","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2011-11-27T02:02:53Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"db7833d83ee8f0294ed3cad9b565cdc992f0858b4c165e67b1720596309b103c","abstract_canon_sha256":"5d6877995f68d3eee18e3b088ee7c8658ca01305659db1ac0c17fa79c1dc8aac"},"schema_version":"1.0"},"canonical_sha256":"db4a619b0e3b91e2560ce02f27eedb9870973a1083cdfd7386280e5e2567b06d","source":{"kind":"arxiv","id":"1111.6214","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.6214","created_at":"2026-05-18T04:07:31Z"},{"alias_kind":"arxiv_version","alias_value":"1111.6214v1","created_at":"2026-05-18T04:07:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.6214","created_at":"2026-05-18T04:07:31Z"},{"alias_kind":"pith_short_12","alias_value":"3NFGDGYOHOI6","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"3NFGDGYOHOI6EVQM","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"3NFGDGYO","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:3NFGDGYOHOI6EVQM4AXSP3W3TB","target":"record","payload":{"canonical_record":{"source":{"id":"1111.6214","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2011-11-27T02:02:53Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"db7833d83ee8f0294ed3cad9b565cdc992f0858b4c165e67b1720596309b103c","abstract_canon_sha256":"5d6877995f68d3eee18e3b088ee7c8658ca01305659db1ac0c17fa79c1dc8aac"},"schema_version":"1.0"},"canonical_sha256":"db4a619b0e3b91e2560ce02f27eedb9870973a1083cdfd7386280e5e2567b06d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:07:31.531920Z","signature_b64":"IHSKjr1yGcBVHXDj/VblIuF1YJMyEaHUZ8GVsy7rD5bOtiMJ8gy9osZ4i+oYHHXj0t011aBV1g/iFwJ3sJ5IBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db4a619b0e3b91e2560ce02f27eedb9870973a1083cdfd7386280e5e2567b06d","last_reissued_at":"2026-05-18T04:07:31.531219Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:07:31.531219Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.6214","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-18T04:07:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0lvOxGV/FvM3KpFjEyskoziRVLSb7HN2FHk9pjAsBp8oRjkCZsx+2oj/GomqCNGfugVNbyxpuJePq5484I72Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T20:08:21.821724Z"},"content_sha256":"60def1976cb10cbf13ab1c400a1bbad4ad4a00f8ec43a1e369b702c1628eafab","schema_version":"1.0","event_id":"sha256:60def1976cb10cbf13ab1c400a1bbad4ad4a00f8ec43a1e369b702c1628eafab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:3NFGDGYOHOI6EVQM4AXSP3W3TB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Max-Product Belief Propagation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"cs.CE","authors_text":"Adel Javanmard, Andrea Montanari, Morteza Ibrahimi, Yashodhan Kanoria","submitted_at":"2011-11-27T02:02:53Z","abstract_excerpt":"We study the problem of optimizing a graph-structured objective function under \\emph{adversarial} uncertainty. This problem can be modeled as a two-persons zero-sum game between an Engineer and Nature. The Engineer controls a subset of the variables (nodes in the graph), and tries to assign their values to maximize an objective function. Nature controls the complementary subset of variables and tries to minimize the same objective. This setting encompasses estimation and optimization problems under model uncertainty, and strategic problems with a graph structure. Von Neumann's minimax theorem "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.6214","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-18T04:07:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R9Y9eu8/kUNGGbg6Mci01XcVt4xzmzcCL+WWjywIY3DTxzDmrNPJFI8sKWeOGsqBd73094IieZo23LUuugVhCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T20:08:21.822385Z"},"content_sha256":"16ac3b0c33e653eb7b36c3fabcc513bb7a5ad7e4b9570736ec0ce36cda5abc9c","schema_version":"1.0","event_id":"sha256:16ac3b0c33e653eb7b36c3fabcc513bb7a5ad7e4b9570736ec0ce36cda5abc9c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3NFGDGYOHOI6EVQM4AXSP3W3TB/bundle.json","state_url":"https://pith.science/pith/3NFGDGYOHOI6EVQM4AXSP3W3TB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3NFGDGYOHOI6EVQM4AXSP3W3TB/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-20T20:08:21Z","links":{"resolver":"https://pith.science/pith/3NFGDGYOHOI6EVQM4AXSP3W3TB","bundle":"https://pith.science/pith/3NFGDGYOHOI6EVQM4AXSP3W3TB/bundle.json","state":"https://pith.science/pith/3NFGDGYOHOI6EVQM4AXSP3W3TB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3NFGDGYOHOI6EVQM4AXSP3W3TB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:3NFGDGYOHOI6EVQM4AXSP3W3TB","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":"5d6877995f68d3eee18e3b088ee7c8658ca01305659db1ac0c17fa79c1dc8aac","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2011-11-27T02:02:53Z","title_canon_sha256":"db7833d83ee8f0294ed3cad9b565cdc992f0858b4c165e67b1720596309b103c"},"schema_version":"1.0","source":{"id":"1111.6214","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.6214","created_at":"2026-05-18T04:07:31Z"},{"alias_kind":"arxiv_version","alias_value":"1111.6214v1","created_at":"2026-05-18T04:07:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.6214","created_at":"2026-05-18T04:07:31Z"},{"alias_kind":"pith_short_12","alias_value":"3NFGDGYOHOI6","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"3NFGDGYOHOI6EVQM","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"3NFGDGYO","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:16ac3b0c33e653eb7b36c3fabcc513bb7a5ad7e4b9570736ec0ce36cda5abc9c","target":"graph","created_at":"2026-05-18T04:07:31Z","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 study the problem of optimizing a graph-structured objective function under \\emph{adversarial} uncertainty. This problem can be modeled as a two-persons zero-sum game between an Engineer and Nature. The Engineer controls a subset of the variables (nodes in the graph), and tries to assign their values to maximize an objective function. Nature controls the complementary subset of variables and tries to minimize the same objective. This setting encompasses estimation and optimization problems under model uncertainty, and strategic problems with a graph structure. Von Neumann's minimax theorem ","authors_text":"Adel Javanmard, Andrea Montanari, Morteza Ibrahimi, Yashodhan Kanoria","cross_cats":["cs.LG","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2011-11-27T02:02:53Z","title":"Robust Max-Product Belief Propagation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.6214","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:60def1976cb10cbf13ab1c400a1bbad4ad4a00f8ec43a1e369b702c1628eafab","target":"record","created_at":"2026-05-18T04:07:31Z","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":"5d6877995f68d3eee18e3b088ee7c8658ca01305659db1ac0c17fa79c1dc8aac","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2011-11-27T02:02:53Z","title_canon_sha256":"db7833d83ee8f0294ed3cad9b565cdc992f0858b4c165e67b1720596309b103c"},"schema_version":"1.0","source":{"id":"1111.6214","kind":"arxiv","version":1}},"canonical_sha256":"db4a619b0e3b91e2560ce02f27eedb9870973a1083cdfd7386280e5e2567b06d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"db4a619b0e3b91e2560ce02f27eedb9870973a1083cdfd7386280e5e2567b06d","first_computed_at":"2026-05-18T04:07:31.531219Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:07:31.531219Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IHSKjr1yGcBVHXDj/VblIuF1YJMyEaHUZ8GVsy7rD5bOtiMJ8gy9osZ4i+oYHHXj0t011aBV1g/iFwJ3sJ5IBA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:07:31.531920Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.6214","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:60def1976cb10cbf13ab1c400a1bbad4ad4a00f8ec43a1e369b702c1628eafab","sha256:16ac3b0c33e653eb7b36c3fabcc513bb7a5ad7e4b9570736ec0ce36cda5abc9c"],"state_sha256":"4cb057ca5ae58a0dc5ac0e61f96430ed373c4fc24d37781c5286c3b4e665dc63"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pwLG40K8HLNs51KKSMFo1j/CQcapomtwGaYM5vA+sOEyxTVvJjW5c8sSeg4zubkxIo4QxvfQiuJTCuVF9JIUDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T20:08:21.825888Z","bundle_sha256":"07f6ec6c91e784a1b8741e261871f7e750f3081f6d120f2fb208ba15180c5bec"}}