{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:Y2LDJS4K3ND7UN5Y6FJIHRBDWW","short_pith_number":"pith:Y2LDJS4K","canonical_record":{"source":{"id":"1712.01897","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-05T20:07:59Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"94f8fb40de053b0fbf7f8b0eac7f1053b942ed4679f8bc3bdc2a2abb9b351537","abstract_canon_sha256":"9fe9e1b74ac042ac799e286601c631778c51fbb0023ff07747334678dc2c6c6a"},"schema_version":"1.0"},"canonical_sha256":"c69634cb8adb47fa37b8f15283c423b5866d28c021ac1a0e4c626cb1a17cb4a3","source":{"kind":"arxiv","id":"1712.01897","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.01897","created_at":"2026-05-18T00:28:39Z"},{"alias_kind":"arxiv_version","alias_value":"1712.01897v1","created_at":"2026-05-18T00:28:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.01897","created_at":"2026-05-18T00:28:39Z"},{"alias_kind":"pith_short_12","alias_value":"Y2LDJS4K3ND7","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"Y2LDJS4K3ND7UN5Y","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"Y2LDJS4K","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:Y2LDJS4K3ND7UN5Y6FJIHRBDWW","target":"record","payload":{"canonical_record":{"source":{"id":"1712.01897","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-05T20:07:59Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"94f8fb40de053b0fbf7f8b0eac7f1053b942ed4679f8bc3bdc2a2abb9b351537","abstract_canon_sha256":"9fe9e1b74ac042ac799e286601c631778c51fbb0023ff07747334678dc2c6c6a"},"schema_version":"1.0"},"canonical_sha256":"c69634cb8adb47fa37b8f15283c423b5866d28c021ac1a0e4c626cb1a17cb4a3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:39.798496Z","signature_b64":"qmwq13jq3qeBcCCjVak0m7roZObjfY2AN2OAek3+GL3nQfJ2QWgzq/ZdMNYUMSsR76WMzV2TA95uXaLSdDIRAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c69634cb8adb47fa37b8f15283c423b5866d28c021ac1a0e4c626cb1a17cb4a3","last_reissued_at":"2026-05-18T00:28:39.797852Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:39.797852Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.01897","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-18T00:28:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xj+aY8T6RIUkwqiSkKno92cBDB9/AygJWYwa4iUZn84p5TJkUltwOaKtZ/hTDuj5sugLDVWSSLDiyR5AaNhTBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:33:28.071190Z"},"content_sha256":"83e11d8f03e2378d9a25f2f3d46f8365a4be64b091ebfd5c02748b3130707a14","schema_version":"1.0","event_id":"sha256:83e11d8f03e2378d9a25f2f3d46f8365a4be64b091ebfd5c02748b3130707a14"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:Y2LDJS4K3ND7UN5Y6FJIHRBDWW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Learning with Gated Linear Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.LG","authors_text":"Agnieszka Grabska-Barwinska, Avishkar Bhoopchand, Christopher Mattern, Joel Veness, Peter Toth, Tor Lattimore","submitted_at":"2017-12-05T20:07:59Z","abstract_excerpt":"This paper describes a family of probabilistic architectures designed for online learning under the logarithmic loss. Rather than relying on non-linear transfer functions, our method gains representational power by the use of data conditioning. We state under general conditions a learnable capacity theorem that shows this approach can in principle learn any bounded Borel-measurable function on a compact subset of euclidean space; the result is stronger than many universality results for connectionist architectures because we provide both the model and the learning procedure for which convergen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.01897","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-18T00:28:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8WwFHWQFXdjOcVAOztumoCDiJgiCn1tqUeWRJZS/iMEBIuGcObRZsqqbrIH93f/0aVQMGlVcRLOjcoJds4MWCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:33:28.071874Z"},"content_sha256":"a8952fed5f87aa3938244928127de29c26293f86fb117a3decf204c98011cf37","schema_version":"1.0","event_id":"sha256:a8952fed5f87aa3938244928127de29c26293f86fb117a3decf204c98011cf37"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y2LDJS4K3ND7UN5Y6FJIHRBDWW/bundle.json","state_url":"https://pith.science/pith/Y2LDJS4K3ND7UN5Y6FJIHRBDWW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y2LDJS4K3ND7UN5Y6FJIHRBDWW/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-26T10:33:28Z","links":{"resolver":"https://pith.science/pith/Y2LDJS4K3ND7UN5Y6FJIHRBDWW","bundle":"https://pith.science/pith/Y2LDJS4K3ND7UN5Y6FJIHRBDWW/bundle.json","state":"https://pith.science/pith/Y2LDJS4K3ND7UN5Y6FJIHRBDWW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y2LDJS4K3ND7UN5Y6FJIHRBDWW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:Y2LDJS4K3ND7UN5Y6FJIHRBDWW","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":"9fe9e1b74ac042ac799e286601c631778c51fbb0023ff07747334678dc2c6c6a","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-05T20:07:59Z","title_canon_sha256":"94f8fb40de053b0fbf7f8b0eac7f1053b942ed4679f8bc3bdc2a2abb9b351537"},"schema_version":"1.0","source":{"id":"1712.01897","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.01897","created_at":"2026-05-18T00:28:39Z"},{"alias_kind":"arxiv_version","alias_value":"1712.01897v1","created_at":"2026-05-18T00:28:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.01897","created_at":"2026-05-18T00:28:39Z"},{"alias_kind":"pith_short_12","alias_value":"Y2LDJS4K3ND7","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"Y2LDJS4K3ND7UN5Y","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"Y2LDJS4K","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:a8952fed5f87aa3938244928127de29c26293f86fb117a3decf204c98011cf37","target":"graph","created_at":"2026-05-18T00:28:39Z","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":"This paper describes a family of probabilistic architectures designed for online learning under the logarithmic loss. Rather than relying on non-linear transfer functions, our method gains representational power by the use of data conditioning. We state under general conditions a learnable capacity theorem that shows this approach can in principle learn any bounded Borel-measurable function on a compact subset of euclidean space; the result is stronger than many universality results for connectionist architectures because we provide both the model and the learning procedure for which convergen","authors_text":"Agnieszka Grabska-Barwinska, Avishkar Bhoopchand, Christopher Mattern, Joel Veness, Peter Toth, Tor Lattimore","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-05T20:07:59Z","title":"Online Learning with Gated Linear Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.01897","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:83e11d8f03e2378d9a25f2f3d46f8365a4be64b091ebfd5c02748b3130707a14","target":"record","created_at":"2026-05-18T00:28:39Z","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":"9fe9e1b74ac042ac799e286601c631778c51fbb0023ff07747334678dc2c6c6a","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-05T20:07:59Z","title_canon_sha256":"94f8fb40de053b0fbf7f8b0eac7f1053b942ed4679f8bc3bdc2a2abb9b351537"},"schema_version":"1.0","source":{"id":"1712.01897","kind":"arxiv","version":1}},"canonical_sha256":"c69634cb8adb47fa37b8f15283c423b5866d28c021ac1a0e4c626cb1a17cb4a3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c69634cb8adb47fa37b8f15283c423b5866d28c021ac1a0e4c626cb1a17cb4a3","first_computed_at":"2026-05-18T00:28:39.797852Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:39.797852Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qmwq13jq3qeBcCCjVak0m7roZObjfY2AN2OAek3+GL3nQfJ2QWgzq/ZdMNYUMSsR76WMzV2TA95uXaLSdDIRAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:39.798496Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.01897","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:83e11d8f03e2378d9a25f2f3d46f8365a4be64b091ebfd5c02748b3130707a14","sha256:a8952fed5f87aa3938244928127de29c26293f86fb117a3decf204c98011cf37"],"state_sha256":"d0337874be7efd7fbe4d8ca8e6da818ecedf0c5775c9ac9f6f94fe3041d8fa29"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eiMOaRTZiH0LEemM5+WjpT1u+9LzE9cc607pYO77Zi6pHoT21qnFxW7gj1Dd0Fnly8TZHiLNh06s6k4lyQgxDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T10:33:28.076174Z","bundle_sha256":"5b4df225aa938d18b3ca4706b7aa656d15c25c5a4f5ebdcb021df4863ec8e4c7"}}