{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:7HG5E2D6HVXSQLVH5J74M6LRDS","short_pith_number":"pith:7HG5E2D6","schema_version":"1.0","canonical_sha256":"f9cdd2687e3d6f282ea7ea7fc679711ca85704746c451240e2069eff6be437b4","source":{"kind":"arxiv","id":"1603.01566","version":3},"attestation_state":"computed","paper":{"title":"Identifiability of an X-rank decomposition of polynomial maps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.NA","stat.ML"],"primary_cat":"cs.IT","authors_text":"Konstantin Usevich, Pierre Comon, Yang Qi","submitted_at":"2016-03-04T18:50:40Z","abstract_excerpt":"In this paper, we study a polynomial decomposition model that arises in problems of system identification, signal processing and machine learning. We show that this decomposition is a special case of the X-rank decomposition --- a powerful novel concept in algebraic geometry that generalizes the tensor CP decomposition. We prove new results on generic/maximal rank and on identifiability of a particular polynomial decomposition model. In the paper, we try to make results and basic tools accessible for general audience (assuming no knowledge of algebraic geometry or its prerequisites)."},"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":"1603.01566","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-04T18:50:40Z","cross_cats_sorted":["math.IT","math.NA","stat.ML"],"title_canon_sha256":"7ad23ff6ff1fd4fe577523340b65e06188380c6d5b827b4743dee3864a5f7337","abstract_canon_sha256":"61cd755f27c9d7e8f981b6bbafd4b470d272ce900b02ef423cde66a1bac1c6be"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:55.790821Z","signature_b64":"6X6xuMWkIDT+ovbt45so8rKeRweUQ8DBk3U83a5os7YNP0pEtKEHTZFD0uoWN3RqFsupyM+bYyvuiMYvS57kBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9cdd2687e3d6f282ea7ea7fc679711ca85704746c451240e2069eff6be437b4","last_reissued_at":"2026-05-18T00:46:55.790439Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:55.790439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Identifiability of an X-rank decomposition of polynomial maps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.NA","stat.ML"],"primary_cat":"cs.IT","authors_text":"Konstantin Usevich, Pierre Comon, Yang Qi","submitted_at":"2016-03-04T18:50:40Z","abstract_excerpt":"In this paper, we study a polynomial decomposition model that arises in problems of system identification, signal processing and machine learning. We show that this decomposition is a special case of the X-rank decomposition --- a powerful novel concept in algebraic geometry that generalizes the tensor CP decomposition. We prove new results on generic/maximal rank and on identifiability of a particular polynomial decomposition model. In the paper, we try to make results and basic tools accessible for general audience (assuming no knowledge of algebraic geometry or its prerequisites)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.01566","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1603.01566","created_at":"2026-05-18T00:46:55.790500+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.01566v3","created_at":"2026-05-18T00:46:55.790500+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.01566","created_at":"2026-05-18T00:46:55.790500+00:00"},{"alias_kind":"pith_short_12","alias_value":"7HG5E2D6HVXS","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"7HG5E2D6HVXSQLVH","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"7HG5E2D6","created_at":"2026-05-18T12:30:04.600751+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/7HG5E2D6HVXSQLVH5J74M6LRDS","json":"https://pith.science/pith/7HG5E2D6HVXSQLVH5J74M6LRDS.json","graph_json":"https://pith.science/api/pith-number/7HG5E2D6HVXSQLVH5J74M6LRDS/graph.json","events_json":"https://pith.science/api/pith-number/7HG5E2D6HVXSQLVH5J74M6LRDS/events.json","paper":"https://pith.science/paper/7HG5E2D6"},"agent_actions":{"view_html":"https://pith.science/pith/7HG5E2D6HVXSQLVH5J74M6LRDS","download_json":"https://pith.science/pith/7HG5E2D6HVXSQLVH5J74M6LRDS.json","view_paper":"https://pith.science/paper/7HG5E2D6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.01566&json=true","fetch_graph":"https://pith.science/api/pith-number/7HG5E2D6HVXSQLVH5J74M6LRDS/graph.json","fetch_events":"https://pith.science/api/pith-number/7HG5E2D6HVXSQLVH5J74M6LRDS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7HG5E2D6HVXSQLVH5J74M6LRDS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7HG5E2D6HVXSQLVH5J74M6LRDS/action/storage_attestation","attest_author":"https://pith.science/pith/7HG5E2D6HVXSQLVH5J74M6LRDS/action/author_attestation","sign_citation":"https://pith.science/pith/7HG5E2D6HVXSQLVH5J74M6LRDS/action/citation_signature","submit_replication":"https://pith.science/pith/7HG5E2D6HVXSQLVH5J74M6LRDS/action/replication_record"}},"created_at":"2026-05-18T00:46:55.790500+00:00","updated_at":"2026-05-18T00:46:55.790500+00:00"}