{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:PVRIPQQCT5Z6P64RPSQAKKRWRH","short_pith_number":"pith:PVRIPQQC","canonical_record":{"source":{"id":"1206.6436","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-27T19:59:59Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"89d294676fb8ee1d433e7b3b4128c1267bd67743be76448dc1be5fb31e8039f0","abstract_canon_sha256":"9fb8e51dbc6da91f631313ab3932deb2e00f2c006edb9b3ac923438dc0f1da09"},"schema_version":"1.0"},"canonical_sha256":"7d6287c2029f73e7fb917ca0052a3689eae480fcac48698165f860222f639bb1","source":{"kind":"arxiv","id":"1206.6436","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.6436","created_at":"2026-05-18T03:52:14Z"},{"alias_kind":"arxiv_version","alias_value":"1206.6436v1","created_at":"2026-05-18T03:52:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6436","created_at":"2026-05-18T03:52:14Z"},{"alias_kind":"pith_short_12","alias_value":"PVRIPQQCT5Z6","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"PVRIPQQCT5Z6P64R","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"PVRIPQQC","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:PVRIPQQCT5Z6P64RPSQAKKRWRH","target":"record","payload":{"canonical_record":{"source":{"id":"1206.6436","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-27T19:59:59Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"89d294676fb8ee1d433e7b3b4128c1267bd67743be76448dc1be5fb31e8039f0","abstract_canon_sha256":"9fb8e51dbc6da91f631313ab3932deb2e00f2c006edb9b3ac923438dc0f1da09"},"schema_version":"1.0"},"canonical_sha256":"7d6287c2029f73e7fb917ca0052a3689eae480fcac48698165f860222f639bb1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:14.150817Z","signature_b64":"kmtxHuXCXD61P0j8dior2Z22FQtIibvV3x5+kMP/0l4o6g5AvDNMf7SLxVRNUCJfSG2jiJZ5AEVEhoAlkYTkDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d6287c2029f73e7fb917ca0052a3689eae480fcac48698165f860222f639bb1","last_reissued_at":"2026-05-18T03:52:14.149989Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:14.149989Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.6436","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-18T03:52:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qbweUpSX8MBjOONzbeyw0x/PU2NKoRZZhXSrqxyjxbbH8cny5bDHqX3t9p2Vc3bTpNOiODy6bQ7zwKxv6H4aDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:09:04.254816Z"},"content_sha256":"7dcfd288f12e7209e1c5afc67b4bbfe9c7ea4088af19b337fa986653b2b1afb9","schema_version":"1.0","event_id":"sha256:7dcfd288f12e7209e1c5afc67b4bbfe9c7ea4088af19b337fa986653b2b1afb9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:PVRIPQQCT5Z6P64RPSQAKKRWRH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Structured Prediction with Latent Variables for General Graphical Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alexander Schwing (ETH Zurich), Marc Pollefeys (ETH Zurich), Raquel Urtasun (TTIC), Tamir Hazan (TTIC)","submitted_at":"2012-06-27T19:59:59Z","abstract_excerpt":"In this paper we propose a unified framework for structured prediction with latent variables which includes hidden conditional random fields and latent structured support vector machines as special cases. We describe a local entropy approximation for this general formulation using duality, and derive an efficient message passing algorithm that is guaranteed to converge. We demonstrate its effectiveness in the tasks of image segmentation as well as 3D indoor scene understanding from single images, showing that our approach is superior to latent structured support vector machines and hidden cond"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6436","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-18T03:52:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oPiX8E+O2My6HAZ0+JHe+ulDc6t3RudTzTUDu4ur7mcvmbIcsitC2gzOEbsVrjpMAMgBumtbRz9Kq5hxiz4wBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:09:04.255478Z"},"content_sha256":"016d461aafe4f9245a4762af76f441a33a01e3a802520da0b6c81fb37da2eed0","schema_version":"1.0","event_id":"sha256:016d461aafe4f9245a4762af76f441a33a01e3a802520da0b6c81fb37da2eed0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PVRIPQQCT5Z6P64RPSQAKKRWRH/bundle.json","state_url":"https://pith.science/pith/PVRIPQQCT5Z6P64RPSQAKKRWRH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PVRIPQQCT5Z6P64RPSQAKKRWRH/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-06T20:09:04Z","links":{"resolver":"https://pith.science/pith/PVRIPQQCT5Z6P64RPSQAKKRWRH","bundle":"https://pith.science/pith/PVRIPQQCT5Z6P64RPSQAKKRWRH/bundle.json","state":"https://pith.science/pith/PVRIPQQCT5Z6P64RPSQAKKRWRH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PVRIPQQCT5Z6P64RPSQAKKRWRH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:PVRIPQQCT5Z6P64RPSQAKKRWRH","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":"9fb8e51dbc6da91f631313ab3932deb2e00f2c006edb9b3ac923438dc0f1da09","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-27T19:59:59Z","title_canon_sha256":"89d294676fb8ee1d433e7b3b4128c1267bd67743be76448dc1be5fb31e8039f0"},"schema_version":"1.0","source":{"id":"1206.6436","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.6436","created_at":"2026-05-18T03:52:14Z"},{"alias_kind":"arxiv_version","alias_value":"1206.6436v1","created_at":"2026-05-18T03:52:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6436","created_at":"2026-05-18T03:52:14Z"},{"alias_kind":"pith_short_12","alias_value":"PVRIPQQCT5Z6","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"PVRIPQQCT5Z6P64R","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"PVRIPQQC","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:016d461aafe4f9245a4762af76f441a33a01e3a802520da0b6c81fb37da2eed0","target":"graph","created_at":"2026-05-18T03:52:14Z","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 this paper we propose a unified framework for structured prediction with latent variables which includes hidden conditional random fields and latent structured support vector machines as special cases. We describe a local entropy approximation for this general formulation using duality, and derive an efficient message passing algorithm that is guaranteed to converge. We demonstrate its effectiveness in the tasks of image segmentation as well as 3D indoor scene understanding from single images, showing that our approach is superior to latent structured support vector machines and hidden cond","authors_text":"Alexander Schwing (ETH Zurich), Marc Pollefeys (ETH Zurich), Raquel Urtasun (TTIC), Tamir Hazan (TTIC)","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-27T19:59:59Z","title":"Efficient Structured Prediction with Latent Variables for General Graphical Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6436","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:7dcfd288f12e7209e1c5afc67b4bbfe9c7ea4088af19b337fa986653b2b1afb9","target":"record","created_at":"2026-05-18T03:52:14Z","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":"9fb8e51dbc6da91f631313ab3932deb2e00f2c006edb9b3ac923438dc0f1da09","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-27T19:59:59Z","title_canon_sha256":"89d294676fb8ee1d433e7b3b4128c1267bd67743be76448dc1be5fb31e8039f0"},"schema_version":"1.0","source":{"id":"1206.6436","kind":"arxiv","version":1}},"canonical_sha256":"7d6287c2029f73e7fb917ca0052a3689eae480fcac48698165f860222f639bb1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7d6287c2029f73e7fb917ca0052a3689eae480fcac48698165f860222f639bb1","first_computed_at":"2026-05-18T03:52:14.149989Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:52:14.149989Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kmtxHuXCXD61P0j8dior2Z22FQtIibvV3x5+kMP/0l4o6g5AvDNMf7SLxVRNUCJfSG2jiJZ5AEVEhoAlkYTkDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:52:14.150817Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.6436","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7dcfd288f12e7209e1c5afc67b4bbfe9c7ea4088af19b337fa986653b2b1afb9","sha256:016d461aafe4f9245a4762af76f441a33a01e3a802520da0b6c81fb37da2eed0"],"state_sha256":"1d3cb4da4ed2edc977661205cd848080f3ff25787a9e9a9e19bf5729f81c462f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"djPt2Y53Osp6xMsTI5UGv8oxXlgljS8MO+0rASKF0y06o7QhtAF6tbLwQhd0Izc9qvZoPm7XLOXx8TjKUXeBCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T20:09:04.258700Z","bundle_sha256":"f8b3f097f0dc57a60255b77e912749985ac8e8c70790bddb105560f13ebe6a76"}}