{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ZCXYMDVHLXYM7EYF3LLHSXUPPB","short_pith_number":"pith:ZCXYMDVH","canonical_record":{"source":{"id":"1502.02206","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-02-08T03:18:50Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"04613672e893469c78c753879fb3cc10cdf865ce395fef3e9bd8081ad8c24e00","abstract_canon_sha256":"0f4d77c6fb2dc1c26b5e5f9f0e382356a8b1539a0774cb09b1f7c9bdd2330f0a"},"schema_version":"1.0"},"canonical_sha256":"c8af860ea75df0cf9305dad6795e8f785adf7aaf2d8b06b8e69b65a5146cbe60","source":{"kind":"arxiv","id":"1502.02206","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.02206","created_at":"2026-05-18T02:03:59Z"},{"alias_kind":"arxiv_version","alias_value":"1502.02206v2","created_at":"2026-05-18T02:03:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02206","created_at":"2026-05-18T02:03:59Z"},{"alias_kind":"pith_short_12","alias_value":"ZCXYMDVHLXYM","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZCXYMDVHLXYM7EYF","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZCXYMDVH","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ZCXYMDVHLXYM7EYF3LLHSXUPPB","target":"record","payload":{"canonical_record":{"source":{"id":"1502.02206","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-02-08T03:18:50Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"04613672e893469c78c753879fb3cc10cdf865ce395fef3e9bd8081ad8c24e00","abstract_canon_sha256":"0f4d77c6fb2dc1c26b5e5f9f0e382356a8b1539a0774cb09b1f7c9bdd2330f0a"},"schema_version":"1.0"},"canonical_sha256":"c8af860ea75df0cf9305dad6795e8f785adf7aaf2d8b06b8e69b65a5146cbe60","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:03:59.819822Z","signature_b64":"+1roZyCnVJkmDe3dsS7BXiskwFE/zRMP1BP8b96/zQy/MtZRPdLAdCrbCyEzVko+sv1bge+Eh+AjHguxo9bfAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8af860ea75df0cf9305dad6795e8f785adf7aaf2d8b06b8e69b65a5146cbe60","last_reissued_at":"2026-05-18T02:03:59.819122Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:03:59.819122Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.02206","source_version":2,"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:03:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/K9R4TWS+b/P7F8SRwzF1RchyNKGWWRM9aCJjjmAMRDwW1eAl+xDIFLePop3rUKTixDv1SAqSNrYauD8v5XWDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:31:29.948024Z"},"content_sha256":"d7f92a2d411413fa6b23a73d2e869958698680c91bc0f10d0235cca49dfefc3e","schema_version":"1.0","event_id":"sha256:d7f92a2d411413fa6b23a73d2e869958698680c91bc0f10d0235cca49dfefc3e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ZCXYMDVHLXYM7EYF3LLHSXUPPB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning to Search Better Than Your Teacher","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Akshay Krishnamurthy, Alekh Agarwal, Hal Daum\\'e III, John Langford, Kai-Wei Chang","submitted_at":"2015-02-08T03:18:50Z","abstract_excerpt":"Methods for learning to search for structured prediction typically imitate a reference policy, with existing theoretical guarantees demonstrating low regret compared to that reference. This is unsatisfactory in many applications where the reference policy is suboptimal and the goal of learning is to improve upon it. Can learning to search work even when the reference is poor?\n  We provide a new learning to search algorithm, LOLS, which does well relative to the reference policy, but additionally guarantees low regret compared to deviations from the learned policy: a local-optimality guarantee."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02206","kind":"arxiv","version":2},"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:03:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mWZbN+CqJfdQvFg05SSpm8dTobN+GyChP2hbYgxmVudou4adG294QKxzpw2q75zdf9ZkDzWJpWcWGvqXUk9dAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:31:29.948407Z"},"content_sha256":"aaa6aa1d8ab61ea4c772d943e6534f5b6e6c3a8b85fb98d1973f160b52efed18","schema_version":"1.0","event_id":"sha256:aaa6aa1d8ab61ea4c772d943e6534f5b6e6c3a8b85fb98d1973f160b52efed18"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZCXYMDVHLXYM7EYF3LLHSXUPPB/bundle.json","state_url":"https://pith.science/pith/ZCXYMDVHLXYM7EYF3LLHSXUPPB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZCXYMDVHLXYM7EYF3LLHSXUPPB/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-26T21:31:29Z","links":{"resolver":"https://pith.science/pith/ZCXYMDVHLXYM7EYF3LLHSXUPPB","bundle":"https://pith.science/pith/ZCXYMDVHLXYM7EYF3LLHSXUPPB/bundle.json","state":"https://pith.science/pith/ZCXYMDVHLXYM7EYF3LLHSXUPPB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZCXYMDVHLXYM7EYF3LLHSXUPPB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ZCXYMDVHLXYM7EYF3LLHSXUPPB","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":"0f4d77c6fb2dc1c26b5e5f9f0e382356a8b1539a0774cb09b1f7c9bdd2330f0a","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-02-08T03:18:50Z","title_canon_sha256":"04613672e893469c78c753879fb3cc10cdf865ce395fef3e9bd8081ad8c24e00"},"schema_version":"1.0","source":{"id":"1502.02206","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.02206","created_at":"2026-05-18T02:03:59Z"},{"alias_kind":"arxiv_version","alias_value":"1502.02206v2","created_at":"2026-05-18T02:03:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02206","created_at":"2026-05-18T02:03:59Z"},{"alias_kind":"pith_short_12","alias_value":"ZCXYMDVHLXYM","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZCXYMDVHLXYM7EYF","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZCXYMDVH","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:aaa6aa1d8ab61ea4c772d943e6534f5b6e6c3a8b85fb98d1973f160b52efed18","target":"graph","created_at":"2026-05-18T02:03:59Z","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":"Methods for learning to search for structured prediction typically imitate a reference policy, with existing theoretical guarantees demonstrating low regret compared to that reference. This is unsatisfactory in many applications where the reference policy is suboptimal and the goal of learning is to improve upon it. Can learning to search work even when the reference is poor?\n  We provide a new learning to search algorithm, LOLS, which does well relative to the reference policy, but additionally guarantees low regret compared to deviations from the learned policy: a local-optimality guarantee.","authors_text":"Akshay Krishnamurthy, Alekh Agarwal, Hal Daum\\'e III, John Langford, Kai-Wei Chang","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-02-08T03:18:50Z","title":"Learning to Search Better Than Your Teacher"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02206","kind":"arxiv","version":2},"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:d7f92a2d411413fa6b23a73d2e869958698680c91bc0f10d0235cca49dfefc3e","target":"record","created_at":"2026-05-18T02:03:59Z","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":"0f4d77c6fb2dc1c26b5e5f9f0e382356a8b1539a0774cb09b1f7c9bdd2330f0a","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-02-08T03:18:50Z","title_canon_sha256":"04613672e893469c78c753879fb3cc10cdf865ce395fef3e9bd8081ad8c24e00"},"schema_version":"1.0","source":{"id":"1502.02206","kind":"arxiv","version":2}},"canonical_sha256":"c8af860ea75df0cf9305dad6795e8f785adf7aaf2d8b06b8e69b65a5146cbe60","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c8af860ea75df0cf9305dad6795e8f785adf7aaf2d8b06b8e69b65a5146cbe60","first_computed_at":"2026-05-18T02:03:59.819122Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:03:59.819122Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+1roZyCnVJkmDe3dsS7BXiskwFE/zRMP1BP8b96/zQy/MtZRPdLAdCrbCyEzVko+sv1bge+Eh+AjHguxo9bfAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:03:59.819822Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.02206","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d7f92a2d411413fa6b23a73d2e869958698680c91bc0f10d0235cca49dfefc3e","sha256:aaa6aa1d8ab61ea4c772d943e6534f5b6e6c3a8b85fb98d1973f160b52efed18"],"state_sha256":"8d637710d0d814515ce06d26ac9f81f2c91e069cb6b1afa23c49c015b401fce3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WQpQhQuDVgiW1PHUn5lmUYM9Lel9cbvO2OkOwQcKXz+dpckYqvXJjgIM1vNIlz5GkqjLjNYSg+4+sONoNujCBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T21:31:29.950601Z","bundle_sha256":"c6aa225e3ed7b5139076c753be0dd63582fab373fd608447bb243b97ca4125a9"}}