{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:OR6K6TD25J3TJ3ZEITN6MHHLEP","short_pith_number":"pith:OR6K6TD2","schema_version":"1.0","canonical_sha256":"747caf4c7aea7734ef2444dbe61ceb23d7bf8887bf066d85801dd433c9d7b18d","source":{"kind":"arxiv","id":"2505.15056","version":1},"attestation_state":"computed","paper":{"title":"An ideal-sparse generalized moment problem reformulation for completely positive tensor decomposition exploiting maximal cliques of multi-hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Minru Bai, Pengfei Huang","submitted_at":"2025-05-21T03:26:08Z","abstract_excerpt":"In this paper, we consider the completely positive tensor decomposition problem with ideal-sparsity. First, we propose an algorithm to generate the maximal cliques of multi-hypergraphs associated with completely positive tensors. This also leads to a necessary condition for tensors to be completely positive. Then, the completely positive tensor decomposition problem is reformulated into an ideal-sparse generalized moment problem. It optimizes over several lower dimensional measure variables supported on the maximal cliques of a multi-hypergraph. The moment-based relaxations are applied to solv"},"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":"2505.15056","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-21T03:26:08Z","cross_cats_sorted":[],"title_canon_sha256":"c01bf98cec117c5c988be39c1268dfc9a0054d03017c6f9dd021128ad78ee062","abstract_canon_sha256":"9ed049e9d8d60a8d903c178d95dd03d0917e00d762c0e301182ffd8f2a08ae31"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:06:39.877429Z","signature_b64":"nGKgmjtVbnEa87UTQix6VftMjjB9qMX8ePatw0LawOJY6jp0o9MsqB+B1LhAl+OCjn7ikkfzz35IX3GGamDGDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"747caf4c7aea7734ef2444dbe61ceb23d7bf8887bf066d85801dd433c9d7b18d","last_reissued_at":"2026-07-05T11:06:39.876960Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:06:39.876960Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An ideal-sparse generalized moment problem reformulation for completely positive tensor decomposition exploiting maximal cliques of multi-hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Minru Bai, Pengfei Huang","submitted_at":"2025-05-21T03:26:08Z","abstract_excerpt":"In this paper, we consider the completely positive tensor decomposition problem with ideal-sparsity. First, we propose an algorithm to generate the maximal cliques of multi-hypergraphs associated with completely positive tensors. This also leads to a necessary condition for tensors to be completely positive. Then, the completely positive tensor decomposition problem is reformulated into an ideal-sparse generalized moment problem. It optimizes over several lower dimensional measure variables supported on the maximal cliques of a multi-hypergraph. The moment-based relaxations are applied to solv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.15056","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.15056/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2505.15056","created_at":"2026-07-05T11:06:39.877017+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.15056v1","created_at":"2026-07-05T11:06:39.877017+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.15056","created_at":"2026-07-05T11:06:39.877017+00:00"},{"alias_kind":"pith_short_12","alias_value":"OR6K6TD25J3T","created_at":"2026-07-05T11:06:39.877017+00:00"},{"alias_kind":"pith_short_16","alias_value":"OR6K6TD25J3TJ3ZE","created_at":"2026-07-05T11:06:39.877017+00:00"},{"alias_kind":"pith_short_8","alias_value":"OR6K6TD2","created_at":"2026-07-05T11:06:39.877017+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.15970","citing_title":"Copositive Matrices with Ordered Off-Diagonal Entries","ref_index":198,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12509","citing_title":"Representing Higher-Order Networks: A Survey of Graph-Based Frameworks","ref_index":126,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12509","citing_title":"Representing Higher-Order Networks: A Survey of Graph-Based Frameworks","ref_index":110,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OR6K6TD25J3TJ3ZEITN6MHHLEP","json":"https://pith.science/pith/OR6K6TD25J3TJ3ZEITN6MHHLEP.json","graph_json":"https://pith.science/api/pith-number/OR6K6TD25J3TJ3ZEITN6MHHLEP/graph.json","events_json":"https://pith.science/api/pith-number/OR6K6TD25J3TJ3ZEITN6MHHLEP/events.json","paper":"https://pith.science/paper/OR6K6TD2"},"agent_actions":{"view_html":"https://pith.science/pith/OR6K6TD25J3TJ3ZEITN6MHHLEP","download_json":"https://pith.science/pith/OR6K6TD25J3TJ3ZEITN6MHHLEP.json","view_paper":"https://pith.science/paper/OR6K6TD2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.15056&json=true","fetch_graph":"https://pith.science/api/pith-number/OR6K6TD25J3TJ3ZEITN6MHHLEP/graph.json","fetch_events":"https://pith.science/api/pith-number/OR6K6TD25J3TJ3ZEITN6MHHLEP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OR6K6TD25J3TJ3ZEITN6MHHLEP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OR6K6TD25J3TJ3ZEITN6MHHLEP/action/storage_attestation","attest_author":"https://pith.science/pith/OR6K6TD25J3TJ3ZEITN6MHHLEP/action/author_attestation","sign_citation":"https://pith.science/pith/OR6K6TD25J3TJ3ZEITN6MHHLEP/action/citation_signature","submit_replication":"https://pith.science/pith/OR6K6TD25J3TJ3ZEITN6MHHLEP/action/replication_record"}},"created_at":"2026-07-05T11:06:39.877017+00:00","updated_at":"2026-07-05T11:06:39.877017+00:00"}