{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:7HG5E2D6HVXSQLVH5J74M6LRDS","short_pith_number":"pith:7HG5E2D6","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"},"canonical_sha256":"f9cdd2687e3d6f282ea7ea7fc679711ca85704746c451240e2069eff6be437b4","source":{"kind":"arxiv","id":"1603.01566","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.01566","created_at":"2026-05-18T00:46:55Z"},{"alias_kind":"arxiv_version","alias_value":"1603.01566v3","created_at":"2026-05-18T00:46:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.01566","created_at":"2026-05-18T00:46:55Z"},{"alias_kind":"pith_short_12","alias_value":"7HG5E2D6HVXS","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7HG5E2D6HVXSQLVH","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7HG5E2D6","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:7HG5E2D6HVXSQLVH5J74M6LRDS","target":"record","payload":{"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"},"canonical_sha256":"f9cdd2687e3d6f282ea7ea7fc679711ca85704746c451240e2069eff6be437b4","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"},"source_kind":"arxiv","source_id":"1603.01566","source_version":3,"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-05-18T00:46:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ugVkp0060TPsdr4vNotGL5gxnzFPOsvp4ZXDRevp71uGBKP1GiWEu1Yflngkcwxa+opf9SAnX7FAOHSAdedeAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T03:46:20.053541Z"},"content_sha256":"82883b7d65910a061339e813fdf840a9de37ca0cf160a70a086c146ae6fa3dde","schema_version":"1.0","event_id":"sha256:82883b7d65910a061339e813fdf840a9de37ca0cf160a70a086c146ae6fa3dde"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:7HG5E2D6HVXSQLVH5J74M6LRDS","target":"graph","payload":{"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"},"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-05-18T00:46:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H80F+bOGT3kAoEEc6U5z8Urtj2rWrecl+1k2tRhJeFwLxrRqUOJnjt0SiaRfIDut20oDXRINJSouNJVFwoBcDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T03:46:20.054211Z"},"content_sha256":"777395f743cf6f089af59d9a5e4e396544f1f3809f143c9556552aa6263e64a0","schema_version":"1.0","event_id":"sha256:777395f743cf6f089af59d9a5e4e396544f1f3809f143c9556552aa6263e64a0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7HG5E2D6HVXSQLVH5J74M6LRDS/bundle.json","state_url":"https://pith.science/pith/7HG5E2D6HVXSQLVH5J74M6LRDS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7HG5E2D6HVXSQLVH5J74M6LRDS/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-05-30T03:46:20Z","links":{"resolver":"https://pith.science/pith/7HG5E2D6HVXSQLVH5J74M6LRDS","bundle":"https://pith.science/pith/7HG5E2D6HVXSQLVH5J74M6LRDS/bundle.json","state":"https://pith.science/pith/7HG5E2D6HVXSQLVH5J74M6LRDS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7HG5E2D6HVXSQLVH5J74M6LRDS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:7HG5E2D6HVXSQLVH5J74M6LRDS","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":"61cd755f27c9d7e8f981b6bbafd4b470d272ce900b02ef423cde66a1bac1c6be","cross_cats_sorted":["math.IT","math.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-04T18:50:40Z","title_canon_sha256":"7ad23ff6ff1fd4fe577523340b65e06188380c6d5b827b4743dee3864a5f7337"},"schema_version":"1.0","source":{"id":"1603.01566","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.01566","created_at":"2026-05-18T00:46:55Z"},{"alias_kind":"arxiv_version","alias_value":"1603.01566v3","created_at":"2026-05-18T00:46:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.01566","created_at":"2026-05-18T00:46:55Z"},{"alias_kind":"pith_short_12","alias_value":"7HG5E2D6HVXS","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7HG5E2D6HVXSQLVH","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7HG5E2D6","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:777395f743cf6f089af59d9a5e4e396544f1f3809f143c9556552aa6263e64a0","target":"graph","created_at":"2026-05-18T00:46:55Z","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"},"paper":{"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).","authors_text":"Konstantin Usevich, Pierre Comon, Yang Qi","cross_cats":["math.IT","math.NA","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-04T18:50:40Z","title":"Identifiability of an X-rank decomposition of polynomial maps"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.01566","kind":"arxiv","version":3},"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:82883b7d65910a061339e813fdf840a9de37ca0cf160a70a086c146ae6fa3dde","target":"record","created_at":"2026-05-18T00:46:55Z","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":"61cd755f27c9d7e8f981b6bbafd4b470d272ce900b02ef423cde66a1bac1c6be","cross_cats_sorted":["math.IT","math.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-04T18:50:40Z","title_canon_sha256":"7ad23ff6ff1fd4fe577523340b65e06188380c6d5b827b4743dee3864a5f7337"},"schema_version":"1.0","source":{"id":"1603.01566","kind":"arxiv","version":3}},"canonical_sha256":"f9cdd2687e3d6f282ea7ea7fc679711ca85704746c451240e2069eff6be437b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f9cdd2687e3d6f282ea7ea7fc679711ca85704746c451240e2069eff6be437b4","first_computed_at":"2026-05-18T00:46:55.790439Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:55.790439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6X6xuMWkIDT+ovbt45so8rKeRweUQ8DBk3U83a5os7YNP0pEtKEHTZFD0uoWN3RqFsupyM+bYyvuiMYvS57kBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:55.790821Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.01566","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:82883b7d65910a061339e813fdf840a9de37ca0cf160a70a086c146ae6fa3dde","sha256:777395f743cf6f089af59d9a5e4e396544f1f3809f143c9556552aa6263e64a0"],"state_sha256":"83cddd355b95f9cd8215de02f32079cd038b6035cfb96b8fb6410c4fd4a3602c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aWki5xd8VvH3xVDc3Wtcz3/sPj8NkHAmSG7bdehEJG5SqwDdrumkjEOtW87Lh/Ep7awh21VN2X4u0iKz/nrdAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T03:46:20.057549Z","bundle_sha256":"50ff4339ab172efccc9429596f0a77cc4f3385fff4da152d0ac51deb23119163"}}