{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:5YFLN7JH5XL7SZBUGXL5JDPQ5Y","short_pith_number":"pith:5YFLN7JH","canonical_record":{"source":{"id":"1507.07974","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-07-28T22:09:36Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"d1afbac5852bec101890250cf647cc8885e8b1a7f654180fabb83ec40686aa03","abstract_canon_sha256":"9bab4c538f77abf991227391acc5bf21a2988a6529c0c837e2da6780c0a5bf32"},"schema_version":"1.0"},"canonical_sha256":"ee0ab6fd27edd7f9643435d7d48df0ee186dcf27f6bab1b710b6fa5c6bba6668","source":{"kind":"arxiv","id":"1507.07974","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.07974","created_at":"2026-05-18T01:36:08Z"},{"alias_kind":"arxiv_version","alias_value":"1507.07974v1","created_at":"2026-05-18T01:36:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.07974","created_at":"2026-05-18T01:36:08Z"},{"alias_kind":"pith_short_12","alias_value":"5YFLN7JH5XL7","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"5YFLN7JH5XL7SZBU","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"5YFLN7JH","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:5YFLN7JH5XL7SZBUGXL5JDPQ5Y","target":"record","payload":{"canonical_record":{"source":{"id":"1507.07974","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-07-28T22:09:36Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"d1afbac5852bec101890250cf647cc8885e8b1a7f654180fabb83ec40686aa03","abstract_canon_sha256":"9bab4c538f77abf991227391acc5bf21a2988a6529c0c837e2da6780c0a5bf32"},"schema_version":"1.0"},"canonical_sha256":"ee0ab6fd27edd7f9643435d7d48df0ee186dcf27f6bab1b710b6fa5c6bba6668","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:08.788737Z","signature_b64":"FVG2O2tjuZaY9k3XANSiEo0R33eMiehd/o2pT/psg3XPSKgiwZ0E9XGb34l1BrCB7txdEHSLmTeA/O88EBFWAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee0ab6fd27edd7f9643435d7d48df0ee186dcf27f6bab1b710b6fa5c6bba6668","last_reissued_at":"2026-05-18T01:36:08.788275Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:08.788275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.07974","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:36:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H4aIjRTjYR3VNIUlOv1eduJTq8Jq8dOZKUBUum3N/9PVwqhRuLg2tnQivJTtuQNOWOvdUCmXEdIYpMlYne79CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:34:31.864976Z"},"content_sha256":"de149a43f7a19b22e2f4c9aaaa06788f9388aa8df7eaa460069dc3b757362c3a","schema_version":"1.0","event_id":"sha256:de149a43f7a19b22e2f4c9aaaa06788f9388aa8df7eaa460069dc3b757362c3a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:5YFLN7JH5XL7SZBUGXL5JDPQ5Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An algorithm for online tensor prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ML","authors_text":"John Pothier, Josh Girson, Shuchin Aeron","submitted_at":"2015-07-28T22:09:36Z","abstract_excerpt":"We present a new method for online prediction and learning of tensors ($N$-way arrays, $N >2$) from sequential measurements. We focus on the specific case of 3-D tensors and exploit a recently developed framework of structured tensor decompositions proposed in [1]. In this framework it is possible to treat 3-D tensors as linear operators and appropriately generalize notions of rank and positive definiteness to tensors in a natural way. Using these notions we propose a generalization of the matrix exponentiated gradient descent algorithm [2] to a tensor exponentiated gradient descent algorithm "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.07974","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:36:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UWa6ABPoCUKh90O1O2iTmMAa+J0qRHCCDaYzKgQ/JVfsv7ekjTvAov7taEx0cv5j5V8fulaFzXPsWbDSVJjFCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:34:31.865620Z"},"content_sha256":"49b92018ce1f91404618094a021ee29c3b1a27ca9dd7c31d61c18a4ae086446a","schema_version":"1.0","event_id":"sha256:49b92018ce1f91404618094a021ee29c3b1a27ca9dd7c31d61c18a4ae086446a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5YFLN7JH5XL7SZBUGXL5JDPQ5Y/bundle.json","state_url":"https://pith.science/pith/5YFLN7JH5XL7SZBUGXL5JDPQ5Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5YFLN7JH5XL7SZBUGXL5JDPQ5Y/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-07T17:34:31Z","links":{"resolver":"https://pith.science/pith/5YFLN7JH5XL7SZBUGXL5JDPQ5Y","bundle":"https://pith.science/pith/5YFLN7JH5XL7SZBUGXL5JDPQ5Y/bundle.json","state":"https://pith.science/pith/5YFLN7JH5XL7SZBUGXL5JDPQ5Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5YFLN7JH5XL7SZBUGXL5JDPQ5Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:5YFLN7JH5XL7SZBUGXL5JDPQ5Y","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":"9bab4c538f77abf991227391acc5bf21a2988a6529c0c837e2da6780c0a5bf32","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-07-28T22:09:36Z","title_canon_sha256":"d1afbac5852bec101890250cf647cc8885e8b1a7f654180fabb83ec40686aa03"},"schema_version":"1.0","source":{"id":"1507.07974","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.07974","created_at":"2026-05-18T01:36:08Z"},{"alias_kind":"arxiv_version","alias_value":"1507.07974v1","created_at":"2026-05-18T01:36:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.07974","created_at":"2026-05-18T01:36:08Z"},{"alias_kind":"pith_short_12","alias_value":"5YFLN7JH5XL7","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"5YFLN7JH5XL7SZBU","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"5YFLN7JH","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:49b92018ce1f91404618094a021ee29c3b1a27ca9dd7c31d61c18a4ae086446a","target":"graph","created_at":"2026-05-18T01:36:08Z","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 present a new method for online prediction and learning of tensors ($N$-way arrays, $N >2$) from sequential measurements. We focus on the specific case of 3-D tensors and exploit a recently developed framework of structured tensor decompositions proposed in [1]. In this framework it is possible to treat 3-D tensors as linear operators and appropriately generalize notions of rank and positive definiteness to tensors in a natural way. Using these notions we propose a generalization of the matrix exponentiated gradient descent algorithm [2] to a tensor exponentiated gradient descent algorithm ","authors_text":"John Pothier, Josh Girson, Shuchin Aeron","cross_cats":["cs.IT","cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-07-28T22:09:36Z","title":"An algorithm for online tensor prediction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.07974","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:de149a43f7a19b22e2f4c9aaaa06788f9388aa8df7eaa460069dc3b757362c3a","target":"record","created_at":"2026-05-18T01:36:08Z","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":"9bab4c538f77abf991227391acc5bf21a2988a6529c0c837e2da6780c0a5bf32","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-07-28T22:09:36Z","title_canon_sha256":"d1afbac5852bec101890250cf647cc8885e8b1a7f654180fabb83ec40686aa03"},"schema_version":"1.0","source":{"id":"1507.07974","kind":"arxiv","version":1}},"canonical_sha256":"ee0ab6fd27edd7f9643435d7d48df0ee186dcf27f6bab1b710b6fa5c6bba6668","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee0ab6fd27edd7f9643435d7d48df0ee186dcf27f6bab1b710b6fa5c6bba6668","first_computed_at":"2026-05-18T01:36:08.788275Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:08.788275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FVG2O2tjuZaY9k3XANSiEo0R33eMiehd/o2pT/psg3XPSKgiwZ0E9XGb34l1BrCB7txdEHSLmTeA/O88EBFWAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:08.788737Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.07974","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:de149a43f7a19b22e2f4c9aaaa06788f9388aa8df7eaa460069dc3b757362c3a","sha256:49b92018ce1f91404618094a021ee29c3b1a27ca9dd7c31d61c18a4ae086446a"],"state_sha256":"0a4c0f5edb26be3fce291526daff89a6a2ca37100bde4beaabacb19c6f5649ba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yseXKG7cGbh3J/+nM9yDmqhB/iduks3LUyO/h5KNfDKJ7nbTLlPNngRsNW84OUnafSpv0vDl43dvBmBBgBlxAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T17:34:31.870712Z","bundle_sha256":"7e9d5da5127171556eddefe8d0965b40f1f460d5a3ef6e6c68d995eb588a269e"}}