{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:3DSEGPZEN65BSGZFML45CCTCA2","short_pith_number":"pith:3DSEGPZE","schema_version":"1.0","canonical_sha256":"d8e4433f246fba191b2562f9d10a6206bd15cf490c593db7772f85d59c406798","source":{"kind":"arxiv","id":"1808.02211","version":1},"attestation_state":"computed","paper":{"title":"Completely Positive Binary Tensors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anwa Zhou, Jiawang Nie, Jinyan Fan","submitted_at":"2018-08-07T04:58:23Z","abstract_excerpt":"A symmetric tensor is completely positive (CP) if it is a sum of tensor powers of nonnegative vectors. This paper characterizes completely positive binary tensors. We show that a binary tensor is completely positive if and only if it satisfies two linear matrix inequalities. This result can be used to determine whether a binary tensor is completely positive or not. When it is, we give an algorithm for computing its cp-rank and the decomposition. When the order is odd, we show that the cp-rank decomposition is unique. When the order is even, we completely characterize when the cp-rank decomposi"},"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":"1808.02211","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-07T04:58:23Z","cross_cats_sorted":[],"title_canon_sha256":"d56f6454c2238c9c4b6e622d224ef8ea69400b76cdb3cbc44bb370ccd1e5f7d0","abstract_canon_sha256":"4a225ba34194721f1e33f5ebbc9e8a400f8bf7554f0eeb85296f7b5b6715a422"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:47.222635Z","signature_b64":"jf8PLcrDLgN/CHTrwiEKXnJSb/FATcw3ydmlwZ1LCGLnRv46S/49fN6QmcdTamOpfIm1/MbYFV5YPG3BV6v9Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8e4433f246fba191b2562f9d10a6206bd15cf490c593db7772f85d59c406798","last_reissued_at":"2026-05-18T00:08:47.222043Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:47.222043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Completely Positive Binary Tensors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anwa Zhou, Jiawang Nie, Jinyan Fan","submitted_at":"2018-08-07T04:58:23Z","abstract_excerpt":"A symmetric tensor is completely positive (CP) if it is a sum of tensor powers of nonnegative vectors. This paper characterizes completely positive binary tensors. We show that a binary tensor is completely positive if and only if it satisfies two linear matrix inequalities. This result can be used to determine whether a binary tensor is completely positive or not. When it is, we give an algorithm for computing its cp-rank and the decomposition. When the order is odd, we show that the cp-rank decomposition is unique. When the order is even, we completely characterize when the cp-rank decomposi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.02211","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":"1808.02211","created_at":"2026-05-18T00:08:47.222122+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.02211v1","created_at":"2026-05-18T00:08:47.222122+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.02211","created_at":"2026-05-18T00:08:47.222122+00:00"},{"alias_kind":"pith_short_12","alias_value":"3DSEGPZEN65B","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"3DSEGPZEN65BSGZF","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"3DSEGPZE","created_at":"2026-05-18T12:32:02.567920+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/3DSEGPZEN65BSGZFML45CCTCA2","json":"https://pith.science/pith/3DSEGPZEN65BSGZFML45CCTCA2.json","graph_json":"https://pith.science/api/pith-number/3DSEGPZEN65BSGZFML45CCTCA2/graph.json","events_json":"https://pith.science/api/pith-number/3DSEGPZEN65BSGZFML45CCTCA2/events.json","paper":"https://pith.science/paper/3DSEGPZE"},"agent_actions":{"view_html":"https://pith.science/pith/3DSEGPZEN65BSGZFML45CCTCA2","download_json":"https://pith.science/pith/3DSEGPZEN65BSGZFML45CCTCA2.json","view_paper":"https://pith.science/paper/3DSEGPZE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.02211&json=true","fetch_graph":"https://pith.science/api/pith-number/3DSEGPZEN65BSGZFML45CCTCA2/graph.json","fetch_events":"https://pith.science/api/pith-number/3DSEGPZEN65BSGZFML45CCTCA2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3DSEGPZEN65BSGZFML45CCTCA2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3DSEGPZEN65BSGZFML45CCTCA2/action/storage_attestation","attest_author":"https://pith.science/pith/3DSEGPZEN65BSGZFML45CCTCA2/action/author_attestation","sign_citation":"https://pith.science/pith/3DSEGPZEN65BSGZFML45CCTCA2/action/citation_signature","submit_replication":"https://pith.science/pith/3DSEGPZEN65BSGZFML45CCTCA2/action/replication_record"}},"created_at":"2026-05-18T00:08:47.222122+00:00","updated_at":"2026-05-18T00:08:47.222122+00:00"}