{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:2BKQCB5GPCACZP5XT5JFZAFOSA","short_pith_number":"pith:2BKQCB5G","schema_version":"1.0","canonical_sha256":"d0550107a678802cbfb79f525c80ae9018fbebae47bc53365b1d41e1807851fe","source":{"kind":"arxiv","id":"1703.02637","version":1},"attestation_state":"computed","paper":{"title":"Effective identifiability criteria for tensors and polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.AG","authors_text":"Alex Massarenti, Giovanni Staglian\\`o, Massimiliano Mella","submitted_at":"2017-03-07T23:22:46Z","abstract_excerpt":"A tensor $T$, in a given tensor space, is said to be $h$-identifiable if it admits a unique decomposition as a sum of $h$ rank one tensors. A criterion for $h$-identifiability is called effective if it is satisfied in a dense, open subset of the set of rank $h$ tensors. In this paper we give effective $h$-identifiability criteria for a large class of tensors. We then improve these criteria for some symmetric tensors. For instance, this allows us to give a complete set of effective identifiability criteria for ternary quintic polynomial. Finally, we implement our identifiability algorithms in M"},"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":"1703.02637","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2017-03-07T23:22:46Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"d96a1bf6ab54230506d38f0e5845c13e1cffc9bd12cb7ab0846ad9222dd8c498","abstract_canon_sha256":"b9c128d79500250362103190329e23c4fe02be1c09ea416c7a46ef4440a4e747"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:05.985382Z","signature_b64":"YRO9EimlK/9EP82oBR0Lo1jH3/FeM/OZ0lC12DtnGTa1NQsSSMWdXDrQYqjYWeuqRO5bjwlFtu052hW8Tm5+Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0550107a678802cbfb79f525c80ae9018fbebae47bc53365b1d41e1807851fe","last_reissued_at":"2026-05-18T00:49:05.984936Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:05.984936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Effective identifiability criteria for tensors and polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.AG","authors_text":"Alex Massarenti, Giovanni Staglian\\`o, Massimiliano Mella","submitted_at":"2017-03-07T23:22:46Z","abstract_excerpt":"A tensor $T$, in a given tensor space, is said to be $h$-identifiable if it admits a unique decomposition as a sum of $h$ rank one tensors. A criterion for $h$-identifiability is called effective if it is satisfied in a dense, open subset of the set of rank $h$ tensors. In this paper we give effective $h$-identifiability criteria for a large class of tensors. We then improve these criteria for some symmetric tensors. For instance, this allows us to give a complete set of effective identifiability criteria for ternary quintic polynomial. Finally, we implement our identifiability algorithms in M"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.02637","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":""},"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":"1703.02637","created_at":"2026-05-18T00:49:05.984995+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.02637v1","created_at":"2026-05-18T00:49:05.984995+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.02637","created_at":"2026-05-18T00:49:05.984995+00:00"},{"alias_kind":"pith_short_12","alias_value":"2BKQCB5GPCAC","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"2BKQCB5GPCACZP5X","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"2BKQCB5G","created_at":"2026-05-18T12:30:55.937587+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/2BKQCB5GPCACZP5XT5JFZAFOSA","json":"https://pith.science/pith/2BKQCB5GPCACZP5XT5JFZAFOSA.json","graph_json":"https://pith.science/api/pith-number/2BKQCB5GPCACZP5XT5JFZAFOSA/graph.json","events_json":"https://pith.science/api/pith-number/2BKQCB5GPCACZP5XT5JFZAFOSA/events.json","paper":"https://pith.science/paper/2BKQCB5G"},"agent_actions":{"view_html":"https://pith.science/pith/2BKQCB5GPCACZP5XT5JFZAFOSA","download_json":"https://pith.science/pith/2BKQCB5GPCACZP5XT5JFZAFOSA.json","view_paper":"https://pith.science/paper/2BKQCB5G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.02637&json=true","fetch_graph":"https://pith.science/api/pith-number/2BKQCB5GPCACZP5XT5JFZAFOSA/graph.json","fetch_events":"https://pith.science/api/pith-number/2BKQCB5GPCACZP5XT5JFZAFOSA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2BKQCB5GPCACZP5XT5JFZAFOSA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2BKQCB5GPCACZP5XT5JFZAFOSA/action/storage_attestation","attest_author":"https://pith.science/pith/2BKQCB5GPCACZP5XT5JFZAFOSA/action/author_attestation","sign_citation":"https://pith.science/pith/2BKQCB5GPCACZP5XT5JFZAFOSA/action/citation_signature","submit_replication":"https://pith.science/pith/2BKQCB5GPCACZP5XT5JFZAFOSA/action/replication_record"}},"created_at":"2026-05-18T00:49:05.984995+00:00","updated_at":"2026-05-18T00:49:05.984995+00:00"}