{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:EG2V46PAUYTCGI4LJLURYDXADA","short_pith_number":"pith:EG2V46PA","schema_version":"1.0","canonical_sha256":"21b55e79e0a62623238b4ae91c0ee0181bf2ce9b80c862eaa6abab668f2c90c9","source":{"kind":"arxiv","id":"2208.00122","version":1},"attestation_state":"computed","paper":{"title":"Polynomial-Time Power-Sum Decomposition of Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Jeff Xu, Jun-Ting Hsieh, Mitali Bafna, Pravesh K. Kothari","submitted_at":"2022-07-30T02:20:42Z","abstract_excerpt":"We give efficient algorithms for finding power-sum decomposition of an input polynomial $P(x)= \\sum_{i\\leq m} p_i(x)^d$ with component $p_i$s. The case of linear $p_i$s is equivalent to the well-studied tensor decomposition problem while the quadratic case occurs naturally in studying identifiability of non-spherical Gaussian mixtures from low-order moments.\n  Unlike tensor decomposition, both the unique identifiability and algorithms for this problem are not well-understood. For the simplest setting of quadratic $p_i$s and $d=3$, prior work of Ge, Huang and Kakade yields an algorithm only whe"},"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":"2208.00122","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-07-30T02:20:42Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"10ac61d83fb9289321cb336e9768094ec29718b5272e7f831f5e915e802184a1","abstract_canon_sha256":"f07768b9a85edcbd7095066f80a27bcef4b54e9a4553cb68cfbe61fc4d0fa68c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:44:48.008950Z","signature_b64":"OuKbl2gUFRg//VvJOl3ct5ABKLKPteKnNh0ZgoXfri/d+d082IBflrUucKpJQd2CH7fUtKISpx/TlVO/DWV2AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21b55e79e0a62623238b4ae91c0ee0181bf2ce9b80c862eaa6abab668f2c90c9","last_reissued_at":"2026-07-05T04:44:48.008547Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:44:48.008547Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polynomial-Time Power-Sum Decomposition of Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Jeff Xu, Jun-Ting Hsieh, Mitali Bafna, Pravesh K. Kothari","submitted_at":"2022-07-30T02:20:42Z","abstract_excerpt":"We give efficient algorithms for finding power-sum decomposition of an input polynomial $P(x)= \\sum_{i\\leq m} p_i(x)^d$ with component $p_i$s. The case of linear $p_i$s is equivalent to the well-studied tensor decomposition problem while the quadratic case occurs naturally in studying identifiability of non-spherical Gaussian mixtures from low-order moments.\n  Unlike tensor decomposition, both the unique identifiability and algorithms for this problem are not well-understood. For the simplest setting of quadratic $p_i$s and $d=3$, prior work of Ge, Huang and Kakade yields an algorithm only whe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.00122","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/2208.00122/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":"2208.00122","created_at":"2026-07-05T04:44:48.008603+00:00"},{"alias_kind":"arxiv_version","alias_value":"2208.00122v1","created_at":"2026-07-05T04:44:48.008603+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.00122","created_at":"2026-07-05T04:44:48.008603+00:00"},{"alias_kind":"pith_short_12","alias_value":"EG2V46PAUYTC","created_at":"2026-07-05T04:44:48.008603+00:00"},{"alias_kind":"pith_short_16","alias_value":"EG2V46PAUYTCGI4L","created_at":"2026-07-05T04:44:48.008603+00:00"},{"alias_kind":"pith_short_8","alias_value":"EG2V46PA","created_at":"2026-07-05T04:44:48.008603+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EG2V46PAUYTCGI4LJLURYDXADA","json":"https://pith.science/pith/EG2V46PAUYTCGI4LJLURYDXADA.json","graph_json":"https://pith.science/api/pith-number/EG2V46PAUYTCGI4LJLURYDXADA/graph.json","events_json":"https://pith.science/api/pith-number/EG2V46PAUYTCGI4LJLURYDXADA/events.json","paper":"https://pith.science/paper/EG2V46PA"},"agent_actions":{"view_html":"https://pith.science/pith/EG2V46PAUYTCGI4LJLURYDXADA","download_json":"https://pith.science/pith/EG2V46PAUYTCGI4LJLURYDXADA.json","view_paper":"https://pith.science/paper/EG2V46PA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2208.00122&json=true","fetch_graph":"https://pith.science/api/pith-number/EG2V46PAUYTCGI4LJLURYDXADA/graph.json","fetch_events":"https://pith.science/api/pith-number/EG2V46PAUYTCGI4LJLURYDXADA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EG2V46PAUYTCGI4LJLURYDXADA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EG2V46PAUYTCGI4LJLURYDXADA/action/storage_attestation","attest_author":"https://pith.science/pith/EG2V46PAUYTCGI4LJLURYDXADA/action/author_attestation","sign_citation":"https://pith.science/pith/EG2V46PAUYTCGI4LJLURYDXADA/action/citation_signature","submit_replication":"https://pith.science/pith/EG2V46PAUYTCGI4LJLURYDXADA/action/replication_record"}},"created_at":"2026-07-05T04:44:48.008603+00:00","updated_at":"2026-07-05T04:44:48.008603+00:00"}