{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:OD32OQOQALTU6PWFYPBOYYJCYG","short_pith_number":"pith:OD32OQOQ","schema_version":"1.0","canonical_sha256":"70f7a741d002e74f3ec5c3c2ec6122c181174fa6732ed8c6acf82554f52f3bf7","source":{"kind":"arxiv","id":"1912.04007","version":5},"attestation_state":"computed","paper":{"title":"Subspace power method for symmetric tensor decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.OC"],"primary_cat":"math.NA","authors_text":"Jo\\~ao M. Pereira, Joe Kileel","submitted_at":"2019-12-09T12:52:14Z","abstract_excerpt":"We introduce the Subspace Power Method (SPM) for calculating the CP decomposition of low-rank real symmetric tensors. This algorithm calculates one new CP component at a time, alternating between applying the shifted symmetric higher-order power method (SS-HOPM) to a certain modified tensor, constructed from a matrix flattening of the original tensor; and using appropriate deflation steps. We obtain rigorous guarantees for SPM regarding convergence and global optima for input tensors of dimension $d$ and order $m$ of CP rank up to $O(d^{\\lfloor m/2\\rfloor})$, via results in classical algebraic"},"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":"1912.04007","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-12-09T12:52:14Z","cross_cats_sorted":["cs.NA","math.OC"],"title_canon_sha256":"f3553c3688471595b476ee946e4dc30b74fa189262e3a22ca641b11e037de636","abstract_canon_sha256":"c0f396b0500af8d210a55883627b6afb03578abc746c8029f1cb6c9c14804ba8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:45:01.247790Z","signature_b64":"FaFro1hl500Cc59ffUWsESb4efP3M0tFp/E0w5lpREf22ry+/1UKTAahUx1bTgfMipT9He3m/pkG0eODBdrCAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70f7a741d002e74f3ec5c3c2ec6122c181174fa6732ed8c6acf82554f52f3bf7","last_reissued_at":"2026-07-05T10:45:01.247255Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:45:01.247255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Subspace power method for symmetric tensor decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.OC"],"primary_cat":"math.NA","authors_text":"Jo\\~ao M. Pereira, Joe Kileel","submitted_at":"2019-12-09T12:52:14Z","abstract_excerpt":"We introduce the Subspace Power Method (SPM) for calculating the CP decomposition of low-rank real symmetric tensors. This algorithm calculates one new CP component at a time, alternating between applying the shifted symmetric higher-order power method (SS-HOPM) to a certain modified tensor, constructed from a matrix flattening of the original tensor; and using appropriate deflation steps. We obtain rigorous guarantees for SPM regarding convergence and global optima for input tensors of dimension $d$ and order $m$ of CP rank up to $O(d^{\\lfloor m/2\\rfloor})$, via results in classical algebraic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.04007","kind":"arxiv","version":5},"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/1912.04007/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":"1912.04007","created_at":"2026-07-05T10:45:01.247322+00:00"},{"alias_kind":"arxiv_version","alias_value":"1912.04007v5","created_at":"2026-07-05T10:45:01.247322+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.04007","created_at":"2026-07-05T10:45:01.247322+00:00"},{"alias_kind":"pith_short_12","alias_value":"OD32OQOQALTU","created_at":"2026-07-05T10:45:01.247322+00:00"},{"alias_kind":"pith_short_16","alias_value":"OD32OQOQALTU6PWF","created_at":"2026-07-05T10:45:01.247322+00:00"},{"alias_kind":"pith_short_8","alias_value":"OD32OQOQ","created_at":"2026-07-05T10:45:01.247322+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.22564","citing_title":"Efficient Tensor Decomposition via Moment Matrix Extension","ref_index":45,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OD32OQOQALTU6PWFYPBOYYJCYG","json":"https://pith.science/pith/OD32OQOQALTU6PWFYPBOYYJCYG.json","graph_json":"https://pith.science/api/pith-number/OD32OQOQALTU6PWFYPBOYYJCYG/graph.json","events_json":"https://pith.science/api/pith-number/OD32OQOQALTU6PWFYPBOYYJCYG/events.json","paper":"https://pith.science/paper/OD32OQOQ"},"agent_actions":{"view_html":"https://pith.science/pith/OD32OQOQALTU6PWFYPBOYYJCYG","download_json":"https://pith.science/pith/OD32OQOQALTU6PWFYPBOYYJCYG.json","view_paper":"https://pith.science/paper/OD32OQOQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1912.04007&json=true","fetch_graph":"https://pith.science/api/pith-number/OD32OQOQALTU6PWFYPBOYYJCYG/graph.json","fetch_events":"https://pith.science/api/pith-number/OD32OQOQALTU6PWFYPBOYYJCYG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OD32OQOQALTU6PWFYPBOYYJCYG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OD32OQOQALTU6PWFYPBOYYJCYG/action/storage_attestation","attest_author":"https://pith.science/pith/OD32OQOQALTU6PWFYPBOYYJCYG/action/author_attestation","sign_citation":"https://pith.science/pith/OD32OQOQALTU6PWFYPBOYYJCYG/action/citation_signature","submit_replication":"https://pith.science/pith/OD32OQOQALTU6PWFYPBOYYJCYG/action/replication_record"}},"created_at":"2026-07-05T10:45:01.247322+00:00","updated_at":"2026-07-05T10:45:01.247322+00:00"}