{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:5AWQ2KGR5CZWKMQLBPDU4MH3SI","short_pith_number":"pith:5AWQ2KGR","canonical_record":{"source":{"id":"1407.6432","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-07-24T02:53:52Z","cross_cats_sorted":["cs.CV","cs.LG"],"title_canon_sha256":"8b74ae930a5bdb829675c826f08be4daad7d732e1fc28eae89417e846fe0cd87","abstract_canon_sha256":"f5d3cba6ebf19bb229b9d6219ecf4560adf0b4dc23b160ef52bc83da6e10173c"},"schema_version":"1.0"},"canonical_sha256":"e82d0d28d1e8b365320b0bc74e30fb921a520fa1de42449e120314d82b858049","source":{"kind":"arxiv","id":"1407.6432","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.6432","created_at":"2026-05-18T02:46:38Z"},{"alias_kind":"arxiv_version","alias_value":"1407.6432v1","created_at":"2026-05-18T02:46:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.6432","created_at":"2026-05-18T02:46:38Z"},{"alias_kind":"pith_short_12","alias_value":"5AWQ2KGR5CZW","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"5AWQ2KGR5CZWKMQL","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"5AWQ2KGR","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:5AWQ2KGR5CZWKMQLBPDU4MH3SI","target":"record","payload":{"canonical_record":{"source":{"id":"1407.6432","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-07-24T02:53:52Z","cross_cats_sorted":["cs.CV","cs.LG"],"title_canon_sha256":"8b74ae930a5bdb829675c826f08be4daad7d732e1fc28eae89417e846fe0cd87","abstract_canon_sha256":"f5d3cba6ebf19bb229b9d6219ecf4560adf0b4dc23b160ef52bc83da6e10173c"},"schema_version":"1.0"},"canonical_sha256":"e82d0d28d1e8b365320b0bc74e30fb921a520fa1de42449e120314d82b858049","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:38.740834Z","signature_b64":"kGDoCqc+SvUh3LdHSuL5PVlNOAHCWv54mUcEOMABlsbBEQv/2Z6C9pT/7d9KHhmocJocmlanJ1A5ComlBdNICA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e82d0d28d1e8b365320b0bc74e30fb921a520fa1de42449e120314d82b858049","last_reissued_at":"2026-05-18T02:46:38.740225Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:38.740225Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.6432","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-18T02:46:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"07sNuaDxESVDow28l7JgFYZoBOCpj46ydRr17XA/YuptVudTIihO2PsMbRXGR4afH+rcg7cXycpX6O4GByYYBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T22:17:43.667763Z"},"content_sha256":"84128952fcb8520d3e8d6b995b1c54bf8084d6b55bb7201c23e16dbc0ecb0277","schema_version":"1.0","event_id":"sha256:84128952fcb8520d3e8d6b995b1c54bf8084d6b55bb7201c23e16dbc0ecb0277"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:5AWQ2KGR5CZWKMQLBPDU4MH3SI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Structured Outputs from Partial Labels using Forest Ensemble","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG"],"primary_cat":"stat.ML","authors_text":"Dinh Phung, Svetha Venkatesh, Truyen Tran","submitted_at":"2014-07-24T02:53:52Z","abstract_excerpt":"Learning structured outputs with general structures is computationally challenging, except for tree-structured models. Thus we propose an efficient boosting-based algorithm AdaBoost.MRF for this task. The idea is based on the realization that a graph is a superimposition of trees. Different from most existing work, our algorithm can handle partial labelling, and thus is particularly attractive in practice where reliable labels are often sparsely observed. In addition, our method works exclusively on trees and thus is guaranteed to converge. We apply the AdaBoost.MRF algorithm to an indoor vide"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.6432","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-18T02:46:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TlFN1IN/mCHs5aFC7rjXXmONvnOBZB2+foZYSApiGbnEjdbQfxf58x0jjrsvUZv5CiZcrQqiY5e0aXUiY4+oDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T22:17:43.668105Z"},"content_sha256":"a34caf0f3eb482e23e29ac0499a2b1aadbe795dea7482126b843caecd8c574cf","schema_version":"1.0","event_id":"sha256:a34caf0f3eb482e23e29ac0499a2b1aadbe795dea7482126b843caecd8c574cf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5AWQ2KGR5CZWKMQLBPDU4MH3SI/bundle.json","state_url":"https://pith.science/pith/5AWQ2KGR5CZWKMQLBPDU4MH3SI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5AWQ2KGR5CZWKMQLBPDU4MH3SI/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-19T22:17:43Z","links":{"resolver":"https://pith.science/pith/5AWQ2KGR5CZWKMQLBPDU4MH3SI","bundle":"https://pith.science/pith/5AWQ2KGR5CZWKMQLBPDU4MH3SI/bundle.json","state":"https://pith.science/pith/5AWQ2KGR5CZWKMQLBPDU4MH3SI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5AWQ2KGR5CZWKMQLBPDU4MH3SI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:5AWQ2KGR5CZWKMQLBPDU4MH3SI","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":"f5d3cba6ebf19bb229b9d6219ecf4560adf0b4dc23b160ef52bc83da6e10173c","cross_cats_sorted":["cs.CV","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-07-24T02:53:52Z","title_canon_sha256":"8b74ae930a5bdb829675c826f08be4daad7d732e1fc28eae89417e846fe0cd87"},"schema_version":"1.0","source":{"id":"1407.6432","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.6432","created_at":"2026-05-18T02:46:38Z"},{"alias_kind":"arxiv_version","alias_value":"1407.6432v1","created_at":"2026-05-18T02:46:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.6432","created_at":"2026-05-18T02:46:38Z"},{"alias_kind":"pith_short_12","alias_value":"5AWQ2KGR5CZW","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"5AWQ2KGR5CZWKMQL","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"5AWQ2KGR","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:a34caf0f3eb482e23e29ac0499a2b1aadbe795dea7482126b843caecd8c574cf","target":"graph","created_at":"2026-05-18T02:46:38Z","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":"Learning structured outputs with general structures is computationally challenging, except for tree-structured models. Thus we propose an efficient boosting-based algorithm AdaBoost.MRF for this task. The idea is based on the realization that a graph is a superimposition of trees. Different from most existing work, our algorithm can handle partial labelling, and thus is particularly attractive in practice where reliable labels are often sparsely observed. In addition, our method works exclusively on trees and thus is guaranteed to converge. We apply the AdaBoost.MRF algorithm to an indoor vide","authors_text":"Dinh Phung, Svetha Venkatesh, Truyen Tran","cross_cats":["cs.CV","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-07-24T02:53:52Z","title":"Learning Structured Outputs from Partial Labels using Forest Ensemble"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.6432","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:84128952fcb8520d3e8d6b995b1c54bf8084d6b55bb7201c23e16dbc0ecb0277","target":"record","created_at":"2026-05-18T02:46:38Z","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":"f5d3cba6ebf19bb229b9d6219ecf4560adf0b4dc23b160ef52bc83da6e10173c","cross_cats_sorted":["cs.CV","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-07-24T02:53:52Z","title_canon_sha256":"8b74ae930a5bdb829675c826f08be4daad7d732e1fc28eae89417e846fe0cd87"},"schema_version":"1.0","source":{"id":"1407.6432","kind":"arxiv","version":1}},"canonical_sha256":"e82d0d28d1e8b365320b0bc74e30fb921a520fa1de42449e120314d82b858049","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e82d0d28d1e8b365320b0bc74e30fb921a520fa1de42449e120314d82b858049","first_computed_at":"2026-05-18T02:46:38.740225Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:46:38.740225Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kGDoCqc+SvUh3LdHSuL5PVlNOAHCWv54mUcEOMABlsbBEQv/2Z6C9pT/7d9KHhmocJocmlanJ1A5ComlBdNICA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:46:38.740834Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.6432","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:84128952fcb8520d3e8d6b995b1c54bf8084d6b55bb7201c23e16dbc0ecb0277","sha256:a34caf0f3eb482e23e29ac0499a2b1aadbe795dea7482126b843caecd8c574cf"],"state_sha256":"0b77ead21eea838d6f528026fcbdaea5fd476e3c4fff4f32ab5f6844e6d15d9e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ux8AgVaijwRYmXw4ngDE1etQ61nq2CmU/3lZR4nIiy9d171norHESAPuc5S2L0C7hjn5M/xsLGo43Yb8ZALYBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T22:17:43.670310Z","bundle_sha256":"0b01f18dd23970333ba5c207e867c14c61b462420f42c79e3729f3ea70fdb489"}}