{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:Y2LDJS4K3ND7UN5Y6FJIHRBDWW","short_pith_number":"pith:Y2LDJS4K","schema_version":"1.0","canonical_sha256":"c69634cb8adb47fa37b8f15283c423b5866d28c021ac1a0e4c626cb1a17cb4a3","source":{"kind":"arxiv","id":"1712.01897","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1712.01897","created_at":"2026-05-18T00:28:39.797947+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.01897v1","created_at":"2026-05-18T00:28:39.797947+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.01897","created_at":"2026-05-18T00:28:39.797947+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y2LDJS4K3ND7","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y2LDJS4K3ND7UN5Y","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y2LDJS4K","created_at":"2026-05-18T12:31:56.362134+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/Y2LDJS4K3ND7UN5Y6FJIHRBDWW","json":"https://pith.science/pith/Y2LDJS4K3ND7UN5Y6FJIHRBDWW.json","graph_json":"https://pith.science/api/pith-number/Y2LDJS4K3ND7UN5Y6FJIHRBDWW/graph.json","events_json":"https://pith.science/api/pith-number/Y2LDJS4K3ND7UN5Y6FJIHRBDWW/events.json","paper":"https://pith.science/paper/Y2LDJS4K"},"agent_actions":{"view_html":"https://pith.science/pith/Y2LDJS4K3ND7UN5Y6FJIHRBDWW","download_json":"https://pith.science/pith/Y2LDJS4K3ND7UN5Y6FJIHRBDWW.json","view_paper":"https://pith.science/paper/Y2LDJS4K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.01897&json=true","fetch_graph":"https://pith.science/api/pith-number/Y2LDJS4K3ND7UN5Y6FJIHRBDWW/graph.json","fetch_events":"https://pith.science/api/pith-number/Y2LDJS4K3ND7UN5Y6FJIHRBDWW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y2LDJS4K3ND7UN5Y6FJIHRBDWW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y2LDJS4K3ND7UN5Y6FJIHRBDWW/action/storage_attestation","attest_author":"https://pith.science/pith/Y2LDJS4K3ND7UN5Y6FJIHRBDWW/action/author_attestation","sign_citation":"https://pith.science/pith/Y2LDJS4K3ND7UN5Y6FJIHRBDWW/action/citation_signature","submit_replication":"https://pith.science/pith/Y2LDJS4K3ND7UN5Y6FJIHRBDWW/action/replication_record"}},"created_at":"2026-05-18T00:28:39.797947+00:00","updated_at":"2026-05-18T00:28:39.797947+00:00"}