{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:DYBVLJ5CGTBPS53OTNWGGMODOZ","short_pith_number":"pith:DYBVLJ5C","canonical_record":{"source":{"id":"2506.16032","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-06-19T05:07:07Z","cross_cats_sorted":["eess.SP","math.OC"],"title_canon_sha256":"4279331dcef74d5508d755556d34a11436e3739db327ede00abff235a79f77a2","abstract_canon_sha256":"5131b523111aa17bfb311a383fe0c826b9613cfce2daf9340279876c36d68f84"},"schema_version":"1.0"},"canonical_sha256":"1e0355a7a234c2f9776e9b6c6331c3766692b65b88b1bc50967cd31e6a1f3769","source":{"kind":"arxiv","id":"2506.16032","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.16032","created_at":"2026-07-05T11:24:28Z"},{"alias_kind":"arxiv_version","alias_value":"2506.16032v1","created_at":"2026-07-05T11:24:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.16032","created_at":"2026-07-05T11:24:28Z"},{"alias_kind":"pith_short_12","alias_value":"DYBVLJ5CGTBP","created_at":"2026-07-05T11:24:28Z"},{"alias_kind":"pith_short_16","alias_value":"DYBVLJ5CGTBPS53O","created_at":"2026-07-05T11:24:28Z"},{"alias_kind":"pith_short_8","alias_value":"DYBVLJ5C","created_at":"2026-07-05T11:24:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:DYBVLJ5CGTBPS53OTNWGGMODOZ","target":"record","payload":{"canonical_record":{"source":{"id":"2506.16032","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-06-19T05:07:07Z","cross_cats_sorted":["eess.SP","math.OC"],"title_canon_sha256":"4279331dcef74d5508d755556d34a11436e3739db327ede00abff235a79f77a2","abstract_canon_sha256":"5131b523111aa17bfb311a383fe0c826b9613cfce2daf9340279876c36d68f84"},"schema_version":"1.0"},"canonical_sha256":"1e0355a7a234c2f9776e9b6c6331c3766692b65b88b1bc50967cd31e6a1f3769","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:24:28.950831Z","signature_b64":"7Hq99Kvb5RwJZAku/XuVcAHE1TCVKOJDw7mtso30qfAzlHAyTQxVtFE2QgrWT1oNbmEFbj5R4E/4CL4gXXj3Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e0355a7a234c2f9776e9b6c6331c3766692b65b88b1bc50967cd31e6a1f3769","last_reissued_at":"2026-07-05T11:24:28.950354Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:24:28.950354Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.16032","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-07-05T11:24:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K66IcC50SwEvLEqYdos0YYRe+gN8R/BfxQVpjqdv9iz8MUmeShYHJO+iH7DOzNYYtVeSlwzgiK7RpVDkhbJDCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T22:21:55.782520Z"},"content_sha256":"fc725b253b6235b98e03207ef1fbbc8da9320de283d54f3f54e0f4da67e8347d","schema_version":"1.0","event_id":"sha256:fc725b253b6235b98e03207ef1fbbc8da9320de283d54f3f54e0f4da67e8347d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:DYBVLJ5CGTBPS53OTNWGGMODOZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","math.OC"],"primary_cat":"cs.LG","authors_text":"Michael B. Wakin, Zhen Qin, Zhihui Zhu","submitted_at":"2025-06-19T05:07:07Z","abstract_excerpt":"Tensor decompositions, which represent an $N$-order tensor using approximately $N$ factors of much smaller dimensions, can significantly reduce the number of parameters. This is particularly beneficial for high-order tensors, as the number of entries in a tensor grows exponentially with the order. Consequently, they are widely used in signal recovery and data analysis across domains such as signal processing, machine learning, and quantum physics. A computationally and memory-efficient approach to these problems is to optimize directly over the factors using local search algorithms such as gra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.16032","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.16032/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T11:24:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X+9zExLtZJrOmvWc6s9Uz3+6xsZM7O620UzZ+XVLJDNQfNQHSGzFExcURqYy7aAT15pt0k3db6VKMYML6oadBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T22:21:55.783025Z"},"content_sha256":"886a25889954d915d6a5cfdafcfe27b6cd4897b1beae6b1a29b757a8f9554f0e","schema_version":"1.0","event_id":"sha256:886a25889954d915d6a5cfdafcfe27b6cd4897b1beae6b1a29b757a8f9554f0e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DYBVLJ5CGTBPS53OTNWGGMODOZ/bundle.json","state_url":"https://pith.science/pith/DYBVLJ5CGTBPS53OTNWGGMODOZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DYBVLJ5CGTBPS53OTNWGGMODOZ/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-08-09T22:21:55Z","links":{"resolver":"https://pith.science/pith/DYBVLJ5CGTBPS53OTNWGGMODOZ","bundle":"https://pith.science/pith/DYBVLJ5CGTBPS53OTNWGGMODOZ/bundle.json","state":"https://pith.science/pith/DYBVLJ5CGTBPS53OTNWGGMODOZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DYBVLJ5CGTBPS53OTNWGGMODOZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:DYBVLJ5CGTBPS53OTNWGGMODOZ","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":"5131b523111aa17bfb311a383fe0c826b9613cfce2daf9340279876c36d68f84","cross_cats_sorted":["eess.SP","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-06-19T05:07:07Z","title_canon_sha256":"4279331dcef74d5508d755556d34a11436e3739db327ede00abff235a79f77a2"},"schema_version":"1.0","source":{"id":"2506.16032","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.16032","created_at":"2026-07-05T11:24:28Z"},{"alias_kind":"arxiv_version","alias_value":"2506.16032v1","created_at":"2026-07-05T11:24:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.16032","created_at":"2026-07-05T11:24:28Z"},{"alias_kind":"pith_short_12","alias_value":"DYBVLJ5CGTBP","created_at":"2026-07-05T11:24:28Z"},{"alias_kind":"pith_short_16","alias_value":"DYBVLJ5CGTBPS53O","created_at":"2026-07-05T11:24:28Z"},{"alias_kind":"pith_short_8","alias_value":"DYBVLJ5C","created_at":"2026-07-05T11:24:28Z"}],"graph_snapshots":[{"event_id":"sha256:886a25889954d915d6a5cfdafcfe27b6cd4897b1beae6b1a29b757a8f9554f0e","target":"graph","created_at":"2026-07-05T11:24:28Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2506.16032/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Tensor decompositions, which represent an $N$-order tensor using approximately $N$ factors of much smaller dimensions, can significantly reduce the number of parameters. This is particularly beneficial for high-order tensors, as the number of entries in a tensor grows exponentially with the order. Consequently, they are widely used in signal recovery and data analysis across domains such as signal processing, machine learning, and quantum physics. A computationally and memory-efficient approach to these problems is to optimize directly over the factors using local search algorithms such as gra","authors_text":"Michael B. Wakin, Zhen Qin, Zhihui Zhu","cross_cats":["eess.SP","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.16032","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:fc725b253b6235b98e03207ef1fbbc8da9320de283d54f3f54e0f4da67e8347d","target":"record","created_at":"2026-07-05T11:24:28Z","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":"5131b523111aa17bfb311a383fe0c826b9613cfce2daf9340279876c36d68f84","cross_cats_sorted":["eess.SP","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-06-19T05:07:07Z","title_canon_sha256":"4279331dcef74d5508d755556d34a11436e3739db327ede00abff235a79f77a2"},"schema_version":"1.0","source":{"id":"2506.16032","kind":"arxiv","version":1}},"canonical_sha256":"1e0355a7a234c2f9776e9b6c6331c3766692b65b88b1bc50967cd31e6a1f3769","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1e0355a7a234c2f9776e9b6c6331c3766692b65b88b1bc50967cd31e6a1f3769","first_computed_at":"2026-07-05T11:24:28.950354Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:24:28.950354Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7Hq99Kvb5RwJZAku/XuVcAHE1TCVKOJDw7mtso30qfAzlHAyTQxVtFE2QgrWT1oNbmEFbj5R4E/4CL4gXXj3Ag==","signature_status":"signed_v1","signed_at":"2026-07-05T11:24:28.950831Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.16032","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fc725b253b6235b98e03207ef1fbbc8da9320de283d54f3f54e0f4da67e8347d","sha256:886a25889954d915d6a5cfdafcfe27b6cd4897b1beae6b1a29b757a8f9554f0e"],"state_sha256":"4e967a6261512957d345fe7768aec32c5e9c4a800ee5fc7898cd81fca58e4ae1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qA+Yt+0mgSXIm10oHY0We+/2cJzwmFxujbiKleriGSaAbHc+dAu7jpo48EfMgQAcjMkfTSo/ekh0Wo+4uEHGCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T22:21:55.786557Z","bundle_sha256":"498aeaa45cef6b7efdd6a51167ea435f3c1c75f6eac9863cb9ac9258fc185ce6"}}