{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:RBOUKWY73DFUAHHTYUEGCRGK4N","short_pith_number":"pith:RBOUKWY7","schema_version":"1.0","canonical_sha256":"885d455b1fd8cb401cf3c5086144cae34651b503706c075a97d1d66459346f5e","source":{"kind":"arxiv","id":"1411.5149","version":1},"attestation_state":"computed","paper":{"title":"Completely positive tensor decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anwa Zhou, Jinyan Fan","submitted_at":"2014-11-19T09:10:23Z","abstract_excerpt":"A symmetric tensor, which has a symmetric nonnegative decomposition, is called a completely positive tensor. We consider the completely positive tensor decomposition problem. A semidefinite algorithm is presented for checking whether a symmetric tensor is completely positive. If it is not completely positive, a certificate for it can be obtained; if it is completely positive, a nonnegative decomposition can be obtained."},"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":"1411.5149","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-11-19T09:10:23Z","cross_cats_sorted":[],"title_canon_sha256":"73925ff7a635fe00738c46f5919f6e62e26d017af8f6e5d9910fb7cde296d859","abstract_canon_sha256":"f496b78e5f2aaa24f5c73b71736a109c0dd1b2d90b4bd2e28407195c750fc565"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:34:44.282454Z","signature_b64":"rlkSpNgYpww4t+OzQ55EuE2lmgvk34swtKr2BKX7go9tY+Abya/p89VCk0ju2zyUG5CoJUnc21F+PU1MAxhVBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"885d455b1fd8cb401cf3c5086144cae34651b503706c075a97d1d66459346f5e","last_reissued_at":"2026-05-18T02:34:44.282041Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:34:44.282041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Completely positive tensor decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anwa Zhou, Jinyan Fan","submitted_at":"2014-11-19T09:10:23Z","abstract_excerpt":"A symmetric tensor, which has a symmetric nonnegative decomposition, is called a completely positive tensor. We consider the completely positive tensor decomposition problem. A semidefinite algorithm is presented for checking whether a symmetric tensor is completely positive. If it is not completely positive, a certificate for it can be obtained; if it is completely positive, a nonnegative decomposition can be obtained."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.5149","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":"1411.5149","created_at":"2026-05-18T02:34:44.282112+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.5149v1","created_at":"2026-05-18T02:34:44.282112+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.5149","created_at":"2026-05-18T02:34:44.282112+00:00"},{"alias_kind":"pith_short_12","alias_value":"RBOUKWY73DFU","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"RBOUKWY73DFUAHHT","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"RBOUKWY7","created_at":"2026-05-18T12:28:46.137349+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/RBOUKWY73DFUAHHTYUEGCRGK4N","json":"https://pith.science/pith/RBOUKWY73DFUAHHTYUEGCRGK4N.json","graph_json":"https://pith.science/api/pith-number/RBOUKWY73DFUAHHTYUEGCRGK4N/graph.json","events_json":"https://pith.science/api/pith-number/RBOUKWY73DFUAHHTYUEGCRGK4N/events.json","paper":"https://pith.science/paper/RBOUKWY7"},"agent_actions":{"view_html":"https://pith.science/pith/RBOUKWY73DFUAHHTYUEGCRGK4N","download_json":"https://pith.science/pith/RBOUKWY73DFUAHHTYUEGCRGK4N.json","view_paper":"https://pith.science/paper/RBOUKWY7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.5149&json=true","fetch_graph":"https://pith.science/api/pith-number/RBOUKWY73DFUAHHTYUEGCRGK4N/graph.json","fetch_events":"https://pith.science/api/pith-number/RBOUKWY73DFUAHHTYUEGCRGK4N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RBOUKWY73DFUAHHTYUEGCRGK4N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RBOUKWY73DFUAHHTYUEGCRGK4N/action/storage_attestation","attest_author":"https://pith.science/pith/RBOUKWY73DFUAHHTYUEGCRGK4N/action/author_attestation","sign_citation":"https://pith.science/pith/RBOUKWY73DFUAHHTYUEGCRGK4N/action/citation_signature","submit_replication":"https://pith.science/pith/RBOUKWY73DFUAHHTYUEGCRGK4N/action/replication_record"}},"created_at":"2026-05-18T02:34:44.282112+00:00","updated_at":"2026-05-18T02:34:44.282112+00:00"}