{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:JLXAP2KRIUQCPR5TDJ4JZY36HJ","short_pith_number":"pith:JLXAP2KR","schema_version":"1.0","canonical_sha256":"4aee07e951452027c7b31a789ce37e3a678edf3cb15a71b3d8795f7b406c6ea3","source":{"kind":"arxiv","id":"1403.5287","version":1},"attestation_state":"computed","paper":{"title":"Online Local Learning via Semidefinite Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Paul Christiano","submitted_at":"2014-03-20T20:36:18Z","abstract_excerpt":"In many online learning problems we are interested in predicting local information about some universe of items. For example, we may want to know whether two items are in the same cluster rather than computing an assignment of items to clusters; we may want to know which of two teams will win a game rather than computing a ranking of teams. Although finding the optimal clustering or ranking is typically intractable, it may be possible to predict the relationships between items as well as if you could solve the global optimization problem exactly.\n  Formally, we consider an online learning prob"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1403.5287","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-03-20T20:36:18Z","cross_cats_sorted":[],"title_canon_sha256":"db91267422a40cc904b825712abde4821c7739056508210ab970b639b7e61a40","abstract_canon_sha256":"8f4154837c870d0d7a4b2ea1b7ed5cd2a6fad8e91d5eabcca5d88ace56223bdd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:56.748725Z","signature_b64":"gtG10IzngSg15s5J6x2QooWP4o6V2HZlURRBoE9yaWNPci/Wo8m1qed/nKRg7FzONeZTPbffIXz8ogJefjaHCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4aee07e951452027c7b31a789ce37e3a678edf3cb15a71b3d8795f7b406c6ea3","last_reissued_at":"2026-05-18T02:55:56.748265Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:56.748265Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Local Learning via Semidefinite Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Paul Christiano","submitted_at":"2014-03-20T20:36:18Z","abstract_excerpt":"In many online learning problems we are interested in predicting local information about some universe of items. For example, we may want to know whether two items are in the same cluster rather than computing an assignment of items to clusters; we may want to know which of two teams will win a game rather than computing a ranking of teams. Although finding the optimal clustering or ranking is typically intractable, it may be possible to predict the relationships between items as well as if you could solve the global optimization problem exactly.\n  Formally, we consider an online learning prob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.5287","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1403.5287","created_at":"2026-05-18T02:55:56.748344+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.5287v1","created_at":"2026-05-18T02:55:56.748344+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.5287","created_at":"2026-05-18T02:55:56.748344+00:00"},{"alias_kind":"pith_short_12","alias_value":"JLXAP2KRIUQC","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"JLXAP2KRIUQCPR5T","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"JLXAP2KR","created_at":"2026-05-18T12:28:33.132498+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JLXAP2KRIUQCPR5TDJ4JZY36HJ","json":"https://pith.science/pith/JLXAP2KRIUQCPR5TDJ4JZY36HJ.json","graph_json":"https://pith.science/api/pith-number/JLXAP2KRIUQCPR5TDJ4JZY36HJ/graph.json","events_json":"https://pith.science/api/pith-number/JLXAP2KRIUQCPR5TDJ4JZY36HJ/events.json","paper":"https://pith.science/paper/JLXAP2KR"},"agent_actions":{"view_html":"https://pith.science/pith/JLXAP2KRIUQCPR5TDJ4JZY36HJ","download_json":"https://pith.science/pith/JLXAP2KRIUQCPR5TDJ4JZY36HJ.json","view_paper":"https://pith.science/paper/JLXAP2KR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.5287&json=true","fetch_graph":"https://pith.science/api/pith-number/JLXAP2KRIUQCPR5TDJ4JZY36HJ/graph.json","fetch_events":"https://pith.science/api/pith-number/JLXAP2KRIUQCPR5TDJ4JZY36HJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JLXAP2KRIUQCPR5TDJ4JZY36HJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JLXAP2KRIUQCPR5TDJ4JZY36HJ/action/storage_attestation","attest_author":"https://pith.science/pith/JLXAP2KRIUQCPR5TDJ4JZY36HJ/action/author_attestation","sign_citation":"https://pith.science/pith/JLXAP2KRIUQCPR5TDJ4JZY36HJ/action/citation_signature","submit_replication":"https://pith.science/pith/JLXAP2KRIUQCPR5TDJ4JZY36HJ/action/replication_record"}},"created_at":"2026-05-18T02:55:56.748344+00:00","updated_at":"2026-05-18T02:55:56.748344+00:00"}