{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:T2A6JJL3MKW7WTHHUERL3BYSXO","short_pith_number":"pith:T2A6JJL3","canonical_record":{"source":{"id":"1811.01158","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-03T04:45:57Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"064e0df0d9f5e2edfe067c4b70d81fc63f84242ae52c3e1e412928919fc67113","abstract_canon_sha256":"d799f2841be51ba21ff8355575b10a708b19f0443cd4b27e0bff45c2e286b2d8"},"schema_version":"1.0"},"canonical_sha256":"9e81e4a57b62adfb4ce7a122bd8712bb99262b11ae3a279dc31999b8ae26b9ce","source":{"kind":"arxiv","id":"1811.01158","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.01158","created_at":"2026-05-18T00:01:35Z"},{"alias_kind":"arxiv_version","alias_value":"1811.01158v1","created_at":"2026-05-18T00:01:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01158","created_at":"2026-05-18T00:01:35Z"},{"alias_kind":"pith_short_12","alias_value":"T2A6JJL3MKW7","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"T2A6JJL3MKW7WTHH","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"T2A6JJL3","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:T2A6JJL3MKW7WTHHUERL3BYSXO","target":"record","payload":{"canonical_record":{"source":{"id":"1811.01158","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-03T04:45:57Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"064e0df0d9f5e2edfe067c4b70d81fc63f84242ae52c3e1e412928919fc67113","abstract_canon_sha256":"d799f2841be51ba21ff8355575b10a708b19f0443cd4b27e0bff45c2e286b2d8"},"schema_version":"1.0"},"canonical_sha256":"9e81e4a57b62adfb4ce7a122bd8712bb99262b11ae3a279dc31999b8ae26b9ce","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:35.204794Z","signature_b64":"bu81go/Wi8q4pxedOoi+OQUgmwdVpJL6aNFvRDy2PVqKQ/K2NHdbr+EvyKOLRMxqTu1Fo9v34K6LWigloJ7PAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e81e4a57b62adfb4ce7a122bd8712bb99262b11ae3a279dc31999b8ae26b9ce","last_reissued_at":"2026-05-18T00:01:35.204233Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:35.204233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.01158","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:01:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zLKMJ+xZY5q55wyQouu/cU/whDs1vF0WUYu9WpJOcteWcsMYvX/C9NseYipbJMfsmyuGzcORvhOSeY++o/hfCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:19:02.632937Z"},"content_sha256":"22a2183da5f8fe584addcd2382cdcafdd932b8b0f43e203ec294786c356fe933","schema_version":"1.0","event_id":"sha256:22a2183da5f8fe584addcd2382cdcafdd932b8b0f43e203ec294786c356fe933"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:T2A6JJL3MKW7WTHHUERL3BYSXO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Boosted Sparse and Low-Rank Tensor Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Fei Wang, Jiayu Zhou, Kun Chen, Lifang He, Wanwan Xu","submitted_at":"2018-11-03T04:45:57Z","abstract_excerpt":"We propose a sparse and low-rank tensor regression model to relate a univariate outcome to a feature tensor, in which each unit-rank tensor from the CP decomposition of the coefficient tensor is assumed to be sparse. This structure is both parsimonious and highly interpretable, as it implies that the outcome is related to the features through a few distinct pathways, each of which may only involve subsets of feature dimensions. We take a divide-and-conquer strategy to simplify the task into a set of sparse unit-rank tensor regression problems. To make the computation efficient and scalable, fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01158","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:01:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ufg7e4/yGlvx+FAaMOCO2fVRKcQraJHVMUwcLKeczEccswNmsSRlN0Y6vt2NcmYsCr+LN41k1tPIw1yClp2QAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:19:02.633278Z"},"content_sha256":"3131b538142435c6550a7e24587f64ab5e568008652f6dc63e23423ecb60cfe8","schema_version":"1.0","event_id":"sha256:3131b538142435c6550a7e24587f64ab5e568008652f6dc63e23423ecb60cfe8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T2A6JJL3MKW7WTHHUERL3BYSXO/bundle.json","state_url":"https://pith.science/pith/T2A6JJL3MKW7WTHHUERL3BYSXO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T2A6JJL3MKW7WTHHUERL3BYSXO/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-01T12:19:02Z","links":{"resolver":"https://pith.science/pith/T2A6JJL3MKW7WTHHUERL3BYSXO","bundle":"https://pith.science/pith/T2A6JJL3MKW7WTHHUERL3BYSXO/bundle.json","state":"https://pith.science/pith/T2A6JJL3MKW7WTHHUERL3BYSXO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T2A6JJL3MKW7WTHHUERL3BYSXO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:T2A6JJL3MKW7WTHHUERL3BYSXO","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":"d799f2841be51ba21ff8355575b10a708b19f0443cd4b27e0bff45c2e286b2d8","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-03T04:45:57Z","title_canon_sha256":"064e0df0d9f5e2edfe067c4b70d81fc63f84242ae52c3e1e412928919fc67113"},"schema_version":"1.0","source":{"id":"1811.01158","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.01158","created_at":"2026-05-18T00:01:35Z"},{"alias_kind":"arxiv_version","alias_value":"1811.01158v1","created_at":"2026-05-18T00:01:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01158","created_at":"2026-05-18T00:01:35Z"},{"alias_kind":"pith_short_12","alias_value":"T2A6JJL3MKW7","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"T2A6JJL3MKW7WTHH","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"T2A6JJL3","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:3131b538142435c6550a7e24587f64ab5e568008652f6dc63e23423ecb60cfe8","target":"graph","created_at":"2026-05-18T00:01:35Z","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":"We propose a sparse and low-rank tensor regression model to relate a univariate outcome to a feature tensor, in which each unit-rank tensor from the CP decomposition of the coefficient tensor is assumed to be sparse. This structure is both parsimonious and highly interpretable, as it implies that the outcome is related to the features through a few distinct pathways, each of which may only involve subsets of feature dimensions. We take a divide-and-conquer strategy to simplify the task into a set of sparse unit-rank tensor regression problems. To make the computation efficient and scalable, fo","authors_text":"Fei Wang, Jiayu Zhou, Kun Chen, Lifang He, Wanwan Xu","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-03T04:45:57Z","title":"Boosted Sparse and Low-Rank Tensor Regression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01158","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:22a2183da5f8fe584addcd2382cdcafdd932b8b0f43e203ec294786c356fe933","target":"record","created_at":"2026-05-18T00:01:35Z","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":"d799f2841be51ba21ff8355575b10a708b19f0443cd4b27e0bff45c2e286b2d8","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-03T04:45:57Z","title_canon_sha256":"064e0df0d9f5e2edfe067c4b70d81fc63f84242ae52c3e1e412928919fc67113"},"schema_version":"1.0","source":{"id":"1811.01158","kind":"arxiv","version":1}},"canonical_sha256":"9e81e4a57b62adfb4ce7a122bd8712bb99262b11ae3a279dc31999b8ae26b9ce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9e81e4a57b62adfb4ce7a122bd8712bb99262b11ae3a279dc31999b8ae26b9ce","first_computed_at":"2026-05-18T00:01:35.204233Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:35.204233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bu81go/Wi8q4pxedOoi+OQUgmwdVpJL6aNFvRDy2PVqKQ/K2NHdbr+EvyKOLRMxqTu1Fo9v34K6LWigloJ7PAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:35.204794Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.01158","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:22a2183da5f8fe584addcd2382cdcafdd932b8b0f43e203ec294786c356fe933","sha256:3131b538142435c6550a7e24587f64ab5e568008652f6dc63e23423ecb60cfe8"],"state_sha256":"59cf5c1352e8b412054e845b637f24a8232a09d8ac97d45424e57b229ca52707"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TWwwDofuZjalWWxQDbO+j3En1mEjoOYX0TCWwLwPFYZqbawX3+tJQENRI2pt+XSJlEeBpdvtAjtiLzQ4ezy6CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T12:19:02.635353Z","bundle_sha256":"c984585c8cd17ba68428afe8b1372c9cf23afa6436620d6b8ec75ef802f37ded"}}