{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:AECLGQTBA6PIDFCOPGF4WL3VM6","short_pith_number":"pith:AECLGQTB","canonical_record":{"source":{"id":"1402.4984","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2014-02-20T12:34:36Z","cross_cats_sorted":[],"title_canon_sha256":"e536dba1341f41e2ae8b833cf5d7049cc6dab2e262a154c32a59a95a1e1fbcfe","abstract_canon_sha256":"2c33508a72c6f69568bff69024da6c4b06460f9ebfdbd2eed94bd0b549e5a035"},"schema_version":"1.0"},"canonical_sha256":"0104b34261079e81944e798bcb2f75679ed2a181d1ae42b09c0063128a0d7ff4","source":{"kind":"arxiv","id":"1402.4984","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.4984","created_at":"2026-05-18T02:58:31Z"},{"alias_kind":"arxiv_version","alias_value":"1402.4984v1","created_at":"2026-05-18T02:58:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.4984","created_at":"2026-05-18T02:58:31Z"},{"alias_kind":"pith_short_12","alias_value":"AECLGQTBA6PI","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"AECLGQTBA6PIDFCO","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"AECLGQTB","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:AECLGQTBA6PIDFCOPGF4WL3VM6","target":"record","payload":{"canonical_record":{"source":{"id":"1402.4984","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2014-02-20T12:34:36Z","cross_cats_sorted":[],"title_canon_sha256":"e536dba1341f41e2ae8b833cf5d7049cc6dab2e262a154c32a59a95a1e1fbcfe","abstract_canon_sha256":"2c33508a72c6f69568bff69024da6c4b06460f9ebfdbd2eed94bd0b549e5a035"},"schema_version":"1.0"},"canonical_sha256":"0104b34261079e81944e798bcb2f75679ed2a181d1ae42b09c0063128a0d7ff4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:31.453248Z","signature_b64":"pIK3976kcg2FiPKPSMHmAyXKlUEHo2fZw04AsVDQnOFpqx5X/5wtPJUjrH3aaKRTz7Ds8U1YgpaeGcZogFCpAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0104b34261079e81944e798bcb2f75679ed2a181d1ae42b09c0063128a0d7ff4","last_reissued_at":"2026-05-18T02:58:31.452428Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:31.452428Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.4984","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:58:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0GZMDzxxLd7bsJbYIEkakwylfmj5E08DjCRwvxKq5qczqhaS9gygWSNHWuhl39JNC0NC1ImbGYpUHxUtXEugDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:09:53.251231Z"},"content_sha256":"04fee366a8262c598cb7870e528bb22d5d5bdff9b98e9cca4e2c15de5b57228c","schema_version":"1.0","event_id":"sha256:04fee366a8262c598cb7870e528bb22d5d5bdff9b98e9cca4e2c15de5b57228c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:AECLGQTBA6PIDFCOPGF4WL3VM6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast matrix computations for functional additive models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Simon Barthelme","submitted_at":"2014-02-20T12:34:36Z","abstract_excerpt":"It is common in functional data analysis to look at a set of related functions: a set of learning curves, a set of brain signals, a set of spatial maps, etc. One way to express relatedness is through an additive model, whereby each individual function $g_{i}\\left(x\\right)$ is assumed to be a variation around some shared mean $f(x)$. Gaussian processes provide an elegant way of constructing such additive models, but suffer from computational difficulties arising from the matrix operations that need to be performed. Recently Heersink & Furrer have shown that functional additive model give rise t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.4984","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:58:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DyNKKVsIVLscmxmLFSPiPc5T8vEDDk381VK0mNSpvwGkuQ/IQ+AcTYix3TQz9FsnzztNOzgPwMtoxObYvHy/Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:09:53.251594Z"},"content_sha256":"b49cbb70b5675d1143c94954032610a7a9caf82f82aac14ce713b80ae3e7a299","schema_version":"1.0","event_id":"sha256:b49cbb70b5675d1143c94954032610a7a9caf82f82aac14ce713b80ae3e7a299"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AECLGQTBA6PIDFCOPGF4WL3VM6/bundle.json","state_url":"https://pith.science/pith/AECLGQTBA6PIDFCOPGF4WL3VM6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AECLGQTBA6PIDFCOPGF4WL3VM6/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-28T08:09:53Z","links":{"resolver":"https://pith.science/pith/AECLGQTBA6PIDFCOPGF4WL3VM6","bundle":"https://pith.science/pith/AECLGQTBA6PIDFCOPGF4WL3VM6/bundle.json","state":"https://pith.science/pith/AECLGQTBA6PIDFCOPGF4WL3VM6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AECLGQTBA6PIDFCOPGF4WL3VM6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:AECLGQTBA6PIDFCOPGF4WL3VM6","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":"2c33508a72c6f69568bff69024da6c4b06460f9ebfdbd2eed94bd0b549e5a035","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2014-02-20T12:34:36Z","title_canon_sha256":"e536dba1341f41e2ae8b833cf5d7049cc6dab2e262a154c32a59a95a1e1fbcfe"},"schema_version":"1.0","source":{"id":"1402.4984","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.4984","created_at":"2026-05-18T02:58:31Z"},{"alias_kind":"arxiv_version","alias_value":"1402.4984v1","created_at":"2026-05-18T02:58:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.4984","created_at":"2026-05-18T02:58:31Z"},{"alias_kind":"pith_short_12","alias_value":"AECLGQTBA6PI","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"AECLGQTBA6PIDFCO","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"AECLGQTB","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:b49cbb70b5675d1143c94954032610a7a9caf82f82aac14ce713b80ae3e7a299","target":"graph","created_at":"2026-05-18T02:58:31Z","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":"It is common in functional data analysis to look at a set of related functions: a set of learning curves, a set of brain signals, a set of spatial maps, etc. One way to express relatedness is through an additive model, whereby each individual function $g_{i}\\left(x\\right)$ is assumed to be a variation around some shared mean $f(x)$. Gaussian processes provide an elegant way of constructing such additive models, but suffer from computational difficulties arising from the matrix operations that need to be performed. Recently Heersink & Furrer have shown that functional additive model give rise t","authors_text":"Simon Barthelme","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2014-02-20T12:34:36Z","title":"Fast matrix computations for functional additive models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.4984","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:04fee366a8262c598cb7870e528bb22d5d5bdff9b98e9cca4e2c15de5b57228c","target":"record","created_at":"2026-05-18T02:58:31Z","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":"2c33508a72c6f69568bff69024da6c4b06460f9ebfdbd2eed94bd0b549e5a035","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2014-02-20T12:34:36Z","title_canon_sha256":"e536dba1341f41e2ae8b833cf5d7049cc6dab2e262a154c32a59a95a1e1fbcfe"},"schema_version":"1.0","source":{"id":"1402.4984","kind":"arxiv","version":1}},"canonical_sha256":"0104b34261079e81944e798bcb2f75679ed2a181d1ae42b09c0063128a0d7ff4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0104b34261079e81944e798bcb2f75679ed2a181d1ae42b09c0063128a0d7ff4","first_computed_at":"2026-05-18T02:58:31.452428Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:58:31.452428Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pIK3976kcg2FiPKPSMHmAyXKlUEHo2fZw04AsVDQnOFpqx5X/5wtPJUjrH3aaKRTz7Ds8U1YgpaeGcZogFCpAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:58:31.453248Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.4984","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:04fee366a8262c598cb7870e528bb22d5d5bdff9b98e9cca4e2c15de5b57228c","sha256:b49cbb70b5675d1143c94954032610a7a9caf82f82aac14ce713b80ae3e7a299"],"state_sha256":"419e4595860c9f201457360a78667127b451433165e821b37472cb8fc33f2de4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R9VAOUKL+PUBq8zewirB3N35iyHedqAKF9GhAqzJNwaL0In83m+bAEK0dogLhByzyuIcW5jdk6l/AbsPPY0qDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T08:09:53.253516Z","bundle_sha256":"29d9abc0f14bef4dbed5af86696adff3fe46f7a771e16f83ee5de928d25858ab"}}