{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:B2J2QN4UWLWCMZ3JNRKZFKNQLZ","short_pith_number":"pith:B2J2QN4U","canonical_record":{"source":{"id":"1811.02728","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-11-07T02:18:32Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"0ba3cec708348b4e1f20607b594fd22ab6c78f9c5dd32e8d3ff651c59035563f","abstract_canon_sha256":"763f47fc87a2d0434008ebbde2a2bdb1d5bfc3335e8fc30e58cf772d586409e0"},"schema_version":"1.0"},"canonical_sha256":"0e93a83794b2ec2667696c5592a9b05e58121c4077c73db6ad021248dd290d99","source":{"kind":"arxiv","id":"1811.02728","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.02728","created_at":"2026-05-18T00:01:20Z"},{"alias_kind":"arxiv_version","alias_value":"1811.02728v1","created_at":"2026-05-18T00:01:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02728","created_at":"2026-05-18T00:01:20Z"},{"alias_kind":"pith_short_12","alias_value":"B2J2QN4UWLWC","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"B2J2QN4UWLWCMZ3J","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"B2J2QN4U","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:B2J2QN4UWLWCMZ3JNRKZFKNQLZ","target":"record","payload":{"canonical_record":{"source":{"id":"1811.02728","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-11-07T02:18:32Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"0ba3cec708348b4e1f20607b594fd22ab6c78f9c5dd32e8d3ff651c59035563f","abstract_canon_sha256":"763f47fc87a2d0434008ebbde2a2bdb1d5bfc3335e8fc30e58cf772d586409e0"},"schema_version":"1.0"},"canonical_sha256":"0e93a83794b2ec2667696c5592a9b05e58121c4077c73db6ad021248dd290d99","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:20.926873Z","signature_b64":"QPRGEUHCBUZMEIdRP6qTxmO/kn2gKhMoJeA/2qnVdUQQRoaAMDDO4PCktY6K3ulwdccssTBi63fD9NEX+WVBBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e93a83794b2ec2667696c5592a9b05e58121c4077c73db6ad021248dd290d99","last_reissued_at":"2026-05-18T00:01:20.926481Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:20.926481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.02728","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-18T00:01:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IwEOQEhrQZwhjy1oMnuvVep2P7K4S14O32Asy06f8Y8KBprLAQ12E9SWGp0/c4vAHNj0jvRxz3ee5CS2lOGQCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:01:08.377415Z"},"content_sha256":"a75f0f4532b34ba844a8bef64247e1744f42b0fd0bc00723c96cf9f341d9310e","schema_version":"1.0","event_id":"sha256:a75f0f4532b34ba844a8bef64247e1744f42b0fd0bc00723c96cf9f341d9310e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:B2J2QN4UWLWCMZ3JNRKZFKNQLZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributionally Robust Graphical Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"stat.ML","authors_text":"Ashkan Rezaei, Brian D. Ziebart, Mohammad Ali Bashiri, Rizal Fathony, Xinhua Zhang","submitted_at":"2018-11-07T02:18:32Z","abstract_excerpt":"In many structured prediction problems, complex relationships between variables are compactly defined using graphical structures. The most prevalent graphical prediction methods---probabilistic graphical models and large margin methods---have their own distinct strengths but also possess significant drawbacks. Conditional random fields (CRFs) are Fisher consistent, but they do not permit integration of customized loss metrics into their learning process. Large-margin models, such as structured support vector machines (SSVMs), have the flexibility to incorporate customized loss metrics, but lac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02728","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-18T00:01:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2oCRGd+btka75pp042eCPC+2QASqzrELj10EgB5fwwCEut0Kn5P3fY6qpuPTnM7RIHrLa9No2agKDrRS9x2VAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:01:08.377756Z"},"content_sha256":"a4073606d4eccfcae3a0d507df6401267e446b03e2cde8d0e97cf058e1a15e24","schema_version":"1.0","event_id":"sha256:a4073606d4eccfcae3a0d507df6401267e446b03e2cde8d0e97cf058e1a15e24"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B2J2QN4UWLWCMZ3JNRKZFKNQLZ/bundle.json","state_url":"https://pith.science/pith/B2J2QN4UWLWCMZ3JNRKZFKNQLZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B2J2QN4UWLWCMZ3JNRKZFKNQLZ/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-05T16:01:08Z","links":{"resolver":"https://pith.science/pith/B2J2QN4UWLWCMZ3JNRKZFKNQLZ","bundle":"https://pith.science/pith/B2J2QN4UWLWCMZ3JNRKZFKNQLZ/bundle.json","state":"https://pith.science/pith/B2J2QN4UWLWCMZ3JNRKZFKNQLZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B2J2QN4UWLWCMZ3JNRKZFKNQLZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:B2J2QN4UWLWCMZ3JNRKZFKNQLZ","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":"763f47fc87a2d0434008ebbde2a2bdb1d5bfc3335e8fc30e58cf772d586409e0","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-11-07T02:18:32Z","title_canon_sha256":"0ba3cec708348b4e1f20607b594fd22ab6c78f9c5dd32e8d3ff651c59035563f"},"schema_version":"1.0","source":{"id":"1811.02728","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.02728","created_at":"2026-05-18T00:01:20Z"},{"alias_kind":"arxiv_version","alias_value":"1811.02728v1","created_at":"2026-05-18T00:01:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02728","created_at":"2026-05-18T00:01:20Z"},{"alias_kind":"pith_short_12","alias_value":"B2J2QN4UWLWC","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"B2J2QN4UWLWCMZ3J","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"B2J2QN4U","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:a4073606d4eccfcae3a0d507df6401267e446b03e2cde8d0e97cf058e1a15e24","target":"graph","created_at":"2026-05-18T00:01:20Z","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":"In many structured prediction problems, complex relationships between variables are compactly defined using graphical structures. The most prevalent graphical prediction methods---probabilistic graphical models and large margin methods---have their own distinct strengths but also possess significant drawbacks. Conditional random fields (CRFs) are Fisher consistent, but they do not permit integration of customized loss metrics into their learning process. Large-margin models, such as structured support vector machines (SSVMs), have the flexibility to incorporate customized loss metrics, but lac","authors_text":"Ashkan Rezaei, Brian D. Ziebart, Mohammad Ali Bashiri, Rizal Fathony, Xinhua Zhang","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-11-07T02:18:32Z","title":"Distributionally Robust Graphical Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02728","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:a75f0f4532b34ba844a8bef64247e1744f42b0fd0bc00723c96cf9f341d9310e","target":"record","created_at":"2026-05-18T00:01:20Z","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":"763f47fc87a2d0434008ebbde2a2bdb1d5bfc3335e8fc30e58cf772d586409e0","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-11-07T02:18:32Z","title_canon_sha256":"0ba3cec708348b4e1f20607b594fd22ab6c78f9c5dd32e8d3ff651c59035563f"},"schema_version":"1.0","source":{"id":"1811.02728","kind":"arxiv","version":1}},"canonical_sha256":"0e93a83794b2ec2667696c5592a9b05e58121c4077c73db6ad021248dd290d99","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e93a83794b2ec2667696c5592a9b05e58121c4077c73db6ad021248dd290d99","first_computed_at":"2026-05-18T00:01:20.926481Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:20.926481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QPRGEUHCBUZMEIdRP6qTxmO/kn2gKhMoJeA/2qnVdUQQRoaAMDDO4PCktY6K3ulwdccssTBi63fD9NEX+WVBBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:20.926873Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.02728","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a75f0f4532b34ba844a8bef64247e1744f42b0fd0bc00723c96cf9f341d9310e","sha256:a4073606d4eccfcae3a0d507df6401267e446b03e2cde8d0e97cf058e1a15e24"],"state_sha256":"392bdd6f3329f9ed64e5aadbd258c16234a05a43857487969190a4733bb07beb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EbL1TALuTf5uNBXhi7SUIwniUxoobcFcsQDs/VvMVGFal3QOxChJDNkQlZuGqobxlIdNonzVmwFw23+/mqmVBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T16:01:08.379666Z","bundle_sha256":"5c76f76176517527f85785f728ab7a90bd9befa0a9f8d98f3929cc8bc316270d"}}