{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:PVBWJ76T4Z3QWZCFBHSS66F32F","short_pith_number":"pith:PVBWJ76T","canonical_record":{"source":{"id":"1409.5834","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-09-19T23:51:09Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"52777046bd1cf92950149822c19d6e4275118d86cef4f297fc4ea57ddde802b3","abstract_canon_sha256":"2bdd26c793f5ad892c06368765e7c29e1f67c04a3c585d743678b3e46778535c"},"schema_version":"1.0"},"canonical_sha256":"7d4364ffd3e6770b644509e52f78bbd17d0dcc41f384ac047959f714da58ec5c","source":{"kind":"arxiv","id":"1409.5834","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.5834","created_at":"2026-05-18T02:42:15Z"},{"alias_kind":"arxiv_version","alias_value":"1409.5834v1","created_at":"2026-05-18T02:42:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.5834","created_at":"2026-05-18T02:42:15Z"},{"alias_kind":"pith_short_12","alias_value":"PVBWJ76T4Z3Q","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PVBWJ76T4Z3QWZCF","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PVBWJ76T","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:PVBWJ76T4Z3QWZCFBHSS66F32F","target":"record","payload":{"canonical_record":{"source":{"id":"1409.5834","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-09-19T23:51:09Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"52777046bd1cf92950149822c19d6e4275118d86cef4f297fc4ea57ddde802b3","abstract_canon_sha256":"2bdd26c793f5ad892c06368765e7c29e1f67c04a3c585d743678b3e46778535c"},"schema_version":"1.0"},"canonical_sha256":"7d4364ffd3e6770b644509e52f78bbd17d0dcc41f384ac047959f714da58ec5c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:15.894364Z","signature_b64":"BSQhPBt00QVaD0jPSPb+wc5lBvcUZpa/QkRuS8uDKMvc9jr4z0oQJcrEmQlgp7UQ95itmiFUcRPDhWguNX/YBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d4364ffd3e6770b644509e52f78bbd17d0dcc41f384ac047959f714da58ec5c","last_reissued_at":"2026-05-18T02:42:15.893464Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:15.893464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.5834","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:42:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2mGyM0kasy6sY6X9IHPJKT1nnkcroK9xoYQHWSzCGc1t1SI7Xo/dzB0dJmVk7s3aZ6FemJAjdr1OVhSYBZPtDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:18:59.158643Z"},"content_sha256":"9eda2d6bf87278b6234aeea364f74073e45d903bba0f2838d937fd5161ef9139","schema_version":"1.0","event_id":"sha256:9eda2d6bf87278b6234aeea364f74073e45d903bba0f2838d937fd5161ef9139"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:PVBWJ76T4Z3QWZCFBHSS66F32F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tight Error Bounds for Structured Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Amir Globerson, Cafer Yildirim, David Sontag, Tim Roughgarden","submitted_at":"2014-09-19T23:51:09Z","abstract_excerpt":"Structured prediction tasks in machine learning involve the simultaneous prediction of multiple labels. This is typically done by maximizing a score function on the space of labels, which decomposes as a sum of pairwise elements, each depending on two specific labels. Intuitively, the more pairwise terms are used, the better the expected accuracy. However, there is currently no theoretical account of this intuition. This paper takes a significant step in this direction.\n  We formulate the problem as classifying the vertices of a known graph $G=(V,E)$, where the vertices and edges of the graph "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.5834","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:42:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RBW8K7CW3WjdRx2L+luX8wnYObvrQErNHIzvJ2Va7j1thnGx/jeKxi17TpKn89xgl9mvW/BYcNltgHt1ervlDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:18:59.159058Z"},"content_sha256":"63ec66095bb753fff8d967ff6489fccdfdc1b301636dc4eca25da7440fdac3fc","schema_version":"1.0","event_id":"sha256:63ec66095bb753fff8d967ff6489fccdfdc1b301636dc4eca25da7440fdac3fc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PVBWJ76T4Z3QWZCFBHSS66F32F/bundle.json","state_url":"https://pith.science/pith/PVBWJ76T4Z3QWZCFBHSS66F32F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PVBWJ76T4Z3QWZCFBHSS66F32F/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-27T17:18:59Z","links":{"resolver":"https://pith.science/pith/PVBWJ76T4Z3QWZCFBHSS66F32F","bundle":"https://pith.science/pith/PVBWJ76T4Z3QWZCFBHSS66F32F/bundle.json","state":"https://pith.science/pith/PVBWJ76T4Z3QWZCFBHSS66F32F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PVBWJ76T4Z3QWZCFBHSS66F32F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:PVBWJ76T4Z3QWZCFBHSS66F32F","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":"2bdd26c793f5ad892c06368765e7c29e1f67c04a3c585d743678b3e46778535c","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-09-19T23:51:09Z","title_canon_sha256":"52777046bd1cf92950149822c19d6e4275118d86cef4f297fc4ea57ddde802b3"},"schema_version":"1.0","source":{"id":"1409.5834","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.5834","created_at":"2026-05-18T02:42:15Z"},{"alias_kind":"arxiv_version","alias_value":"1409.5834v1","created_at":"2026-05-18T02:42:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.5834","created_at":"2026-05-18T02:42:15Z"},{"alias_kind":"pith_short_12","alias_value":"PVBWJ76T4Z3Q","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PVBWJ76T4Z3QWZCF","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PVBWJ76T","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:63ec66095bb753fff8d967ff6489fccdfdc1b301636dc4eca25da7440fdac3fc","target":"graph","created_at":"2026-05-18T02:42:15Z","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 tasks in machine learning involve the simultaneous prediction of multiple labels. This is typically done by maximizing a score function on the space of labels, which decomposes as a sum of pairwise elements, each depending on two specific labels. Intuitively, the more pairwise terms are used, the better the expected accuracy. However, there is currently no theoretical account of this intuition. This paper takes a significant step in this direction.\n  We formulate the problem as classifying the vertices of a known graph $G=(V,E)$, where the vertices and edges of the graph ","authors_text":"Amir Globerson, Cafer Yildirim, David Sontag, Tim Roughgarden","cross_cats":["cs.DS","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-09-19T23:51:09Z","title":"Tight Error Bounds for Structured Prediction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.5834","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:9eda2d6bf87278b6234aeea364f74073e45d903bba0f2838d937fd5161ef9139","target":"record","created_at":"2026-05-18T02:42:15Z","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":"2bdd26c793f5ad892c06368765e7c29e1f67c04a3c585d743678b3e46778535c","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-09-19T23:51:09Z","title_canon_sha256":"52777046bd1cf92950149822c19d6e4275118d86cef4f297fc4ea57ddde802b3"},"schema_version":"1.0","source":{"id":"1409.5834","kind":"arxiv","version":1}},"canonical_sha256":"7d4364ffd3e6770b644509e52f78bbd17d0dcc41f384ac047959f714da58ec5c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7d4364ffd3e6770b644509e52f78bbd17d0dcc41f384ac047959f714da58ec5c","first_computed_at":"2026-05-18T02:42:15.893464Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:42:15.893464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BSQhPBt00QVaD0jPSPb+wc5lBvcUZpa/QkRuS8uDKMvc9jr4z0oQJcrEmQlgp7UQ95itmiFUcRPDhWguNX/YBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:42:15.894364Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.5834","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9eda2d6bf87278b6234aeea364f74073e45d903bba0f2838d937fd5161ef9139","sha256:63ec66095bb753fff8d967ff6489fccdfdc1b301636dc4eca25da7440fdac3fc"],"state_sha256":"183c52e56df3bf873e506805186ea2b63f02b6cd5199937e443d63abfd6387cb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PKxmG+h8tvIkEqRCvYRqpAgp2vAdHgWtiRk8eEEGfmV1u8PhfgJzRJ00Pm/bAMm0ELhQK13uvViNwxIzQc1yDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T17:18:59.162221Z","bundle_sha256":"752771750481e054532d737662606ed1aae56224196db785a46b15aa62242138"}}