{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:7VNPKLFHM7WLRMVPDWDY2IG5YM","short_pith_number":"pith:7VNPKLFH","canonical_record":{"source":{"id":"1309.6847","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-09-26T12:45:00Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"25a31a22a7335d8bb24f1fd1e1f92a8827b8bcd7dce411064a0fe0f33b970e21","abstract_canon_sha256":"4266c3f322f22a4a2bda718276391a9fcc42b14f9a77b8370e13af2826ffac6f"},"schema_version":"1.0"},"canonical_sha256":"fd5af52ca767ecb8b2af1d878d20ddc31883187ada9262dbd575a8de05ee3644","source":{"kind":"arxiv","id":"1309.6847","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.6847","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"arxiv_version","alias_value":"1309.6847v1","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6847","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"pith_short_12","alias_value":"7VNPKLFHM7WL","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"7VNPKLFHM7WLRMVP","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"7VNPKLFH","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:7VNPKLFHM7WLRMVPDWDY2IG5YM","target":"record","payload":{"canonical_record":{"source":{"id":"1309.6847","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-09-26T12:45:00Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"25a31a22a7335d8bb24f1fd1e1f92a8827b8bcd7dce411064a0fe0f33b970e21","abstract_canon_sha256":"4266c3f322f22a4a2bda718276391a9fcc42b14f9a77b8370e13af2826ffac6f"},"schema_version":"1.0"},"canonical_sha256":"fd5af52ca767ecb8b2af1d878d20ddc31883187ada9262dbd575a8de05ee3644","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:10.109957Z","signature_b64":"tqXUyCcGZLWwPbws82AvAb0bvxoTjlWSdsqfg6IBSItMmicXqg1n0+ItIBZFtK73k7UOWVCh86AmcYqaH9gZAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd5af52ca767ecb8b2af1d878d20ddc31883187ada9262dbd575a8de05ee3644","last_reissued_at":"2026-05-18T03:12:10.109193Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:10.109193Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.6847","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:12:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rO23z0UT3aAq8Ve6ejldl5YMS750S4xeGAnIP9NEZiddR0vqGp/Zmj4RXIxmqbSrYOzo838EbQQFYMyw4EVbAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:24:21.025736Z"},"content_sha256":"519c9dacf79d5564a46d5fbc9ef72397f16c3fb6592fb98b5270f40a2eeb92c4","schema_version":"1.0","event_id":"sha256:519c9dacf79d5564a46d5fbc9ef72397f16c3fb6592fb98b5270f40a2eeb92c4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:7VNPKLFHM7WLRMVPDWDY2IG5YM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Max-Margin Tree Predictors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Amir Globerson, Elad Eban, Gal Elidan, Ofer Meshi","submitted_at":"2013-09-26T12:45:00Z","abstract_excerpt":"Structured prediction is a powerful framework for coping with joint prediction of interacting outputs. A central difficulty in using this framework is that often the correct label dependence structure is unknown. At the same time, we would like to avoid an overly complex structure that will lead to intractable prediction. In this work we address the challenge of learning tree structured predictive models that achieve high accuracy while at the same time facilitate efficient (linear time) inference. We start by proving that this task is in general NP-hard, and then suggest an approximate altern"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6847","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:12:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S5mo8RMqq8HfA1svkYquFF8ahlbIMRkZ5hGvRY77MGMjbiP33pXAAxJFh/XF6R0CubegxYT5qGbcs+7/GnTlDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:24:21.026089Z"},"content_sha256":"c42e10ad8ce7c3d7f8c97463a0fb2484361dad3776b1217fa3a761d13353709a","schema_version":"1.0","event_id":"sha256:c42e10ad8ce7c3d7f8c97463a0fb2484361dad3776b1217fa3a761d13353709a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7VNPKLFHM7WLRMVPDWDY2IG5YM/bundle.json","state_url":"https://pith.science/pith/7VNPKLFHM7WLRMVPDWDY2IG5YM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7VNPKLFHM7WLRMVPDWDY2IG5YM/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-02T18:24:21Z","links":{"resolver":"https://pith.science/pith/7VNPKLFHM7WLRMVPDWDY2IG5YM","bundle":"https://pith.science/pith/7VNPKLFHM7WLRMVPDWDY2IG5YM/bundle.json","state":"https://pith.science/pith/7VNPKLFHM7WLRMVPDWDY2IG5YM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7VNPKLFHM7WLRMVPDWDY2IG5YM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:7VNPKLFHM7WLRMVPDWDY2IG5YM","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":"4266c3f322f22a4a2bda718276391a9fcc42b14f9a77b8370e13af2826ffac6f","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-09-26T12:45:00Z","title_canon_sha256":"25a31a22a7335d8bb24f1fd1e1f92a8827b8bcd7dce411064a0fe0f33b970e21"},"schema_version":"1.0","source":{"id":"1309.6847","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.6847","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"arxiv_version","alias_value":"1309.6847v1","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6847","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"pith_short_12","alias_value":"7VNPKLFHM7WL","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"7VNPKLFHM7WLRMVP","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"7VNPKLFH","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:c42e10ad8ce7c3d7f8c97463a0fb2484361dad3776b1217fa3a761d13353709a","target":"graph","created_at":"2026-05-18T03:12:10Z","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":"Structured prediction is a powerful framework for coping with joint prediction of interacting outputs. A central difficulty in using this framework is that often the correct label dependence structure is unknown. At the same time, we would like to avoid an overly complex structure that will lead to intractable prediction. In this work we address the challenge of learning tree structured predictive models that achieve high accuracy while at the same time facilitate efficient (linear time) inference. We start by proving that this task is in general NP-hard, and then suggest an approximate altern","authors_text":"Amir Globerson, Elad Eban, Gal Elidan, Ofer Meshi","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-09-26T12:45:00Z","title":"Learning Max-Margin Tree Predictors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6847","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:519c9dacf79d5564a46d5fbc9ef72397f16c3fb6592fb98b5270f40a2eeb92c4","target":"record","created_at":"2026-05-18T03:12:10Z","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":"4266c3f322f22a4a2bda718276391a9fcc42b14f9a77b8370e13af2826ffac6f","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-09-26T12:45:00Z","title_canon_sha256":"25a31a22a7335d8bb24f1fd1e1f92a8827b8bcd7dce411064a0fe0f33b970e21"},"schema_version":"1.0","source":{"id":"1309.6847","kind":"arxiv","version":1}},"canonical_sha256":"fd5af52ca767ecb8b2af1d878d20ddc31883187ada9262dbd575a8de05ee3644","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fd5af52ca767ecb8b2af1d878d20ddc31883187ada9262dbd575a8de05ee3644","first_computed_at":"2026-05-18T03:12:10.109193Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:12:10.109193Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tqXUyCcGZLWwPbws82AvAb0bvxoTjlWSdsqfg6IBSItMmicXqg1n0+ItIBZFtK73k7UOWVCh86AmcYqaH9gZAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:12:10.109957Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.6847","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:519c9dacf79d5564a46d5fbc9ef72397f16c3fb6592fb98b5270f40a2eeb92c4","sha256:c42e10ad8ce7c3d7f8c97463a0fb2484361dad3776b1217fa3a761d13353709a"],"state_sha256":"160019463ecce96a5a6000fa1980837c8bbcbc66cd0a0fe9704a64137fc7bd8b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NNkGBZ+9AsapMSlbiuGq0WIDpquR9kCYZQVF/I5TYORRkDMvhm3sPtpNx8e9jhWnhnT90BuIZm2BIsEVWS39AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T18:24:21.028036Z","bundle_sha256":"ff02fe6ed732fa8b94361b1cfbf4199d131242890b4164262ea04cc203994d27"}}