{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:DYBVLJ5CGTBPS53OTNWGGMODOZ","short_pith_number":"pith:DYBVLJ5C","schema_version":"1.0","canonical_sha256":"1e0355a7a234c2f9776e9b6c6331c3766692b65b88b1bc50967cd31e6a1f3769","source":{"kind":"arxiv","id":"2506.16032","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2506.16032","created_at":"2026-07-05T11:24:28.950415+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.16032v1","created_at":"2026-07-05T11:24:28.950415+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.16032","created_at":"2026-07-05T11:24:28.950415+00:00"},{"alias_kind":"pith_short_12","alias_value":"DYBVLJ5CGTBP","created_at":"2026-07-05T11:24:28.950415+00:00"},{"alias_kind":"pith_short_16","alias_value":"DYBVLJ5CGTBPS53O","created_at":"2026-07-05T11:24:28.950415+00:00"},{"alias_kind":"pith_short_8","alias_value":"DYBVLJ5C","created_at":"2026-07-05T11:24:28.950415+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.10085","citing_title":"Structured Adaptive Tensor Prediction for Streaming Data","ref_index":81,"is_internal_anchor":false},{"citing_arxiv_id":"2605.27191","citing_title":"Statistical and Algorithmic Foundations of Probing Quantum Systems with Compressive Measurements: A Review","ref_index":57,"is_internal_anchor":false},{"citing_arxiv_id":"2605.27795","citing_title":"Geometric Analysis of Variational Quantum Eigensolver","ref_index":76,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DYBVLJ5CGTBPS53OTNWGGMODOZ","json":"https://pith.science/pith/DYBVLJ5CGTBPS53OTNWGGMODOZ.json","graph_json":"https://pith.science/api/pith-number/DYBVLJ5CGTBPS53OTNWGGMODOZ/graph.json","events_json":"https://pith.science/api/pith-number/DYBVLJ5CGTBPS53OTNWGGMODOZ/events.json","paper":"https://pith.science/paper/DYBVLJ5C"},"agent_actions":{"view_html":"https://pith.science/pith/DYBVLJ5CGTBPS53OTNWGGMODOZ","download_json":"https://pith.science/pith/DYBVLJ5CGTBPS53OTNWGGMODOZ.json","view_paper":"https://pith.science/paper/DYBVLJ5C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.16032&json=true","fetch_graph":"https://pith.science/api/pith-number/DYBVLJ5CGTBPS53OTNWGGMODOZ/graph.json","fetch_events":"https://pith.science/api/pith-number/DYBVLJ5CGTBPS53OTNWGGMODOZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DYBVLJ5CGTBPS53OTNWGGMODOZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DYBVLJ5CGTBPS53OTNWGGMODOZ/action/storage_attestation","attest_author":"https://pith.science/pith/DYBVLJ5CGTBPS53OTNWGGMODOZ/action/author_attestation","sign_citation":"https://pith.science/pith/DYBVLJ5CGTBPS53OTNWGGMODOZ/action/citation_signature","submit_replication":"https://pith.science/pith/DYBVLJ5CGTBPS53OTNWGGMODOZ/action/replication_record"}},"created_at":"2026-07-05T11:24:28.950415+00:00","updated_at":"2026-07-05T11:24:28.950415+00:00"}