{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:HP7KL47CTNU3HTJ3O23EALODUI","short_pith_number":"pith:HP7KL47C","canonical_record":{"source":{"id":"1606.05031","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-16T02:55:39Z","cross_cats_sorted":[],"title_canon_sha256":"f16361be64e241663e74f4ba01315c6061bb660d790899c4028272ab35493470","abstract_canon_sha256":"92d5ed78ef8fc1fe44c67bda137856befc1c86b016a49d0f73768755008e2018"},"schema_version":"1.0"},"canonical_sha256":"3bfea5f3e29b69b3cd3b76b6402dc3a21366817f38f0e80a2cb9d473452e76f6","source":{"kind":"arxiv","id":"1606.05031","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.05031","created_at":"2026-05-18T01:12:22Z"},{"alias_kind":"arxiv_version","alias_value":"1606.05031v1","created_at":"2026-05-18T01:12:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.05031","created_at":"2026-05-18T01:12:22Z"},{"alias_kind":"pith_short_12","alias_value":"HP7KL47CTNU3","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HP7KL47CTNU3HTJ3","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HP7KL47C","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:HP7KL47CTNU3HTJ3O23EALODUI","target":"record","payload":{"canonical_record":{"source":{"id":"1606.05031","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-16T02:55:39Z","cross_cats_sorted":[],"title_canon_sha256":"f16361be64e241663e74f4ba01315c6061bb660d790899c4028272ab35493470","abstract_canon_sha256":"92d5ed78ef8fc1fe44c67bda137856befc1c86b016a49d0f73768755008e2018"},"schema_version":"1.0"},"canonical_sha256":"3bfea5f3e29b69b3cd3b76b6402dc3a21366817f38f0e80a2cb9d473452e76f6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:22.187001Z","signature_b64":"jc1XVmJqMxK45HwigL8+eZKr5vYmBySSY0rz0ihLxD+rH71s/n6m2JUezhsJwVtb6DdtJ+NWmJnUITQaREVkAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3bfea5f3e29b69b3cd3b76b6402dc3a21366817f38f0e80a2cb9d473452e76f6","last_reissued_at":"2026-05-18T01:12:22.186543Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:22.186543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.05031","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-18T01:12:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y2/Nsfm/ZtUGnP3PtJohjl+Mnzrq+vexmeqB5/TOCO4dNSz89Yuv0OK/cIYhiMaC0clng3P2177JOo64VMwbDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T01:18:07.073783Z"},"content_sha256":"3165fc8bcec959d24de6ed98359497d50811aa004799fce32e15828a665ae2b8","schema_version":"1.0","event_id":"sha256:3165fc8bcec959d24de6ed98359497d50811aa004799fce32e15828a665ae2b8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:HP7KL47CTNU3HTJ3O23EALODUI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable Partial Least Squares Regression on Grammar-Compressed Data Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hiroto Saigo, Simon J. Puglisi, Yasuo Tabei, Yoshihiro Yamanishi","submitted_at":"2016-06-16T02:55:39Z","abstract_excerpt":"With massive high-dimensional data now commonplace in research and industry, there is a strong and growing demand for more scalable computational techniques for data analysis and knowledge discovery. Key to turning these data into knowledge is the ability to learn statistical models with high interpretability. Current methods for learning statistical models either produce models that are not interpretable or have prohibitive computational costs when applied to massive data. In this paper we address this need by presenting a scalable algorithm for partial least squares regression (PLS), which w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.05031","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-18T01:12:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jTb6V5LrG/afPJutI7Yq2atAen5SwQi9CaLRcUib+hDCdXSLkKQ4MiqwZCsk6CXOzyZfZvLSAiS+QDE2AXlzBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T01:18:07.074127Z"},"content_sha256":"c74ff932ce2839d061a75bc673169df802e1f9912b643536546989900bbdeab6","schema_version":"1.0","event_id":"sha256:c74ff932ce2839d061a75bc673169df802e1f9912b643536546989900bbdeab6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HP7KL47CTNU3HTJ3O23EALODUI/bundle.json","state_url":"https://pith.science/pith/HP7KL47CTNU3HTJ3O23EALODUI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HP7KL47CTNU3HTJ3O23EALODUI/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-06-27T01:18:07Z","links":{"resolver":"https://pith.science/pith/HP7KL47CTNU3HTJ3O23EALODUI","bundle":"https://pith.science/pith/HP7KL47CTNU3HTJ3O23EALODUI/bundle.json","state":"https://pith.science/pith/HP7KL47CTNU3HTJ3O23EALODUI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HP7KL47CTNU3HTJ3O23EALODUI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HP7KL47CTNU3HTJ3O23EALODUI","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":"92d5ed78ef8fc1fe44c67bda137856befc1c86b016a49d0f73768755008e2018","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-16T02:55:39Z","title_canon_sha256":"f16361be64e241663e74f4ba01315c6061bb660d790899c4028272ab35493470"},"schema_version":"1.0","source":{"id":"1606.05031","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.05031","created_at":"2026-05-18T01:12:22Z"},{"alias_kind":"arxiv_version","alias_value":"1606.05031v1","created_at":"2026-05-18T01:12:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.05031","created_at":"2026-05-18T01:12:22Z"},{"alias_kind":"pith_short_12","alias_value":"HP7KL47CTNU3","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HP7KL47CTNU3HTJ3","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HP7KL47C","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:c74ff932ce2839d061a75bc673169df802e1f9912b643536546989900bbdeab6","target":"graph","created_at":"2026-05-18T01:12:22Z","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":"With massive high-dimensional data now commonplace in research and industry, there is a strong and growing demand for more scalable computational techniques for data analysis and knowledge discovery. Key to turning these data into knowledge is the ability to learn statistical models with high interpretability. Current methods for learning statistical models either produce models that are not interpretable or have prohibitive computational costs when applied to massive data. In this paper we address this need by presenting a scalable algorithm for partial least squares regression (PLS), which w","authors_text":"Hiroto Saigo, Simon J. Puglisi, Yasuo Tabei, Yoshihiro Yamanishi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-16T02:55:39Z","title":"Scalable Partial Least Squares Regression on Grammar-Compressed Data Matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.05031","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:3165fc8bcec959d24de6ed98359497d50811aa004799fce32e15828a665ae2b8","target":"record","created_at":"2026-05-18T01:12:22Z","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":"92d5ed78ef8fc1fe44c67bda137856befc1c86b016a49d0f73768755008e2018","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-16T02:55:39Z","title_canon_sha256":"f16361be64e241663e74f4ba01315c6061bb660d790899c4028272ab35493470"},"schema_version":"1.0","source":{"id":"1606.05031","kind":"arxiv","version":1}},"canonical_sha256":"3bfea5f3e29b69b3cd3b76b6402dc3a21366817f38f0e80a2cb9d473452e76f6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3bfea5f3e29b69b3cd3b76b6402dc3a21366817f38f0e80a2cb9d473452e76f6","first_computed_at":"2026-05-18T01:12:22.186543Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:22.186543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jc1XVmJqMxK45HwigL8+eZKr5vYmBySSY0rz0ihLxD+rH71s/n6m2JUezhsJwVtb6DdtJ+NWmJnUITQaREVkAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:22.187001Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.05031","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3165fc8bcec959d24de6ed98359497d50811aa004799fce32e15828a665ae2b8","sha256:c74ff932ce2839d061a75bc673169df802e1f9912b643536546989900bbdeab6"],"state_sha256":"4b4ec2bc704e161eb772c69e19d7e41ad6072b7a5f51c4637c9fb66558981d25"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8XOfzXNbJdoMZh/gAqLSIo2qs4ZnueTTsCooDQkf9IuttV3sp0hhxBMk616Lq12oRb3A8sNDPi94mi0dNRbACg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T01:18:07.075984Z","bundle_sha256":"03b67b467ddc50031e0eb9970962aae59669cb3a40f3e0a9afe0075711880982"}}