{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:OR6K6TD25J3TJ3ZEITN6MHHLEP","short_pith_number":"pith:OR6K6TD2","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"},"canonical_sha256":"747caf4c7aea7734ef2444dbe61ceb23d7bf8887bf066d85801dd433c9d7b18d","source":{"kind":"arxiv","id":"2505.15056","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.15056","created_at":"2026-07-05T11:06:39Z"},{"alias_kind":"arxiv_version","alias_value":"2505.15056v1","created_at":"2026-07-05T11:06:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.15056","created_at":"2026-07-05T11:06:39Z"},{"alias_kind":"pith_short_12","alias_value":"OR6K6TD25J3T","created_at":"2026-07-05T11:06:39Z"},{"alias_kind":"pith_short_16","alias_value":"OR6K6TD25J3TJ3ZE","created_at":"2026-07-05T11:06:39Z"},{"alias_kind":"pith_short_8","alias_value":"OR6K6TD2","created_at":"2026-07-05T11:06:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:OR6K6TD25J3TJ3ZEITN6MHHLEP","target":"record","payload":{"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"},"canonical_sha256":"747caf4c7aea7734ef2444dbe61ceb23d7bf8887bf066d85801dd433c9d7b18d","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"},"source_kind":"arxiv","source_id":"2505.15056","source_version":1,"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-07-05T11:06:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a49gImYCpmxGjr4Ey0MUYSV9x4A32LNcRwyUnfGXCfwPP4mzXhJPRr5TFFWeU0IgKpW4oXzzyCEsILJWrUUKDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T05:39:59.380007Z"},"content_sha256":"0bec20923623dcb94a68d5a7295e1777e73cc85590271b0b71332e842e5a50b7","schema_version":"1.0","event_id":"sha256:0bec20923623dcb94a68d5a7295e1777e73cc85590271b0b71332e842e5a50b7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:OR6K6TD25J3TJ3ZEITN6MHHLEP","target":"graph","payload":{"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"},"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-07-05T11:06:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fGtTyTbJZ+cEzMPEoq5S/AM0qPEMhhQhig85jTN9fcwFsW8pB4z41s3L9KVX6JRpiYmwVEIqqlLU7NHdCeGGAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T05:39:59.380947Z"},"content_sha256":"40fe05ab954b54b4a83f266f63224113d4c3d15a6356666e907b0fdfec99f4e7","schema_version":"1.0","event_id":"sha256:40fe05ab954b54b4a83f266f63224113d4c3d15a6356666e907b0fdfec99f4e7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OR6K6TD25J3TJ3ZEITN6MHHLEP/bundle.json","state_url":"https://pith.science/pith/OR6K6TD25J3TJ3ZEITN6MHHLEP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OR6K6TD25J3TJ3ZEITN6MHHLEP/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-08-10T05:39:59Z","links":{"resolver":"https://pith.science/pith/OR6K6TD25J3TJ3ZEITN6MHHLEP","bundle":"https://pith.science/pith/OR6K6TD25J3TJ3ZEITN6MHHLEP/bundle.json","state":"https://pith.science/pith/OR6K6TD25J3TJ3ZEITN6MHHLEP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OR6K6TD25J3TJ3ZEITN6MHHLEP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:OR6K6TD25J3TJ3ZEITN6MHHLEP","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":"9ed049e9d8d60a8d903c178d95dd03d0917e00d762c0e301182ffd8f2a08ae31","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-21T03:26:08Z","title_canon_sha256":"c01bf98cec117c5c988be39c1268dfc9a0054d03017c6f9dd021128ad78ee062"},"schema_version":"1.0","source":{"id":"2505.15056","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.15056","created_at":"2026-07-05T11:06:39Z"},{"alias_kind":"arxiv_version","alias_value":"2505.15056v1","created_at":"2026-07-05T11:06:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.15056","created_at":"2026-07-05T11:06:39Z"},{"alias_kind":"pith_short_12","alias_value":"OR6K6TD25J3T","created_at":"2026-07-05T11:06:39Z"},{"alias_kind":"pith_short_16","alias_value":"OR6K6TD25J3TJ3ZE","created_at":"2026-07-05T11:06:39Z"},{"alias_kind":"pith_short_8","alias_value":"OR6K6TD2","created_at":"2026-07-05T11:06:39Z"}],"graph_snapshots":[{"event_id":"sha256:40fe05ab954b54b4a83f266f63224113d4c3d15a6356666e907b0fdfec99f4e7","target":"graph","created_at":"2026-07-05T11:06:39Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2505.15056/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Minru Bai, Pengfei Huang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-21T03:26:08Z","title":"An ideal-sparse generalized moment problem reformulation for completely positive tensor decomposition exploiting maximal cliques of multi-hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.15056","kind":"arxiv","version":1},"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:0bec20923623dcb94a68d5a7295e1777e73cc85590271b0b71332e842e5a50b7","target":"record","created_at":"2026-07-05T11:06:39Z","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":"9ed049e9d8d60a8d903c178d95dd03d0917e00d762c0e301182ffd8f2a08ae31","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-21T03:26:08Z","title_canon_sha256":"c01bf98cec117c5c988be39c1268dfc9a0054d03017c6f9dd021128ad78ee062"},"schema_version":"1.0","source":{"id":"2505.15056","kind":"arxiv","version":1}},"canonical_sha256":"747caf4c7aea7734ef2444dbe61ceb23d7bf8887bf066d85801dd433c9d7b18d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"747caf4c7aea7734ef2444dbe61ceb23d7bf8887bf066d85801dd433c9d7b18d","first_computed_at":"2026-07-05T11:06:39.876960Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:06:39.876960Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nGKgmjtVbnEa87UTQix6VftMjjB9qMX8ePatw0LawOJY6jp0o9MsqB+B1LhAl+OCjn7ikkfzz35IX3GGamDGDg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:06:39.877429Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.15056","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0bec20923623dcb94a68d5a7295e1777e73cc85590271b0b71332e842e5a50b7","sha256:40fe05ab954b54b4a83f266f63224113d4c3d15a6356666e907b0fdfec99f4e7"],"state_sha256":"42334b98b07dc9b47b98c6af22eff3ea8ccf1441821716c2cf1897de2139d47b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OV/ACv7ksqtmfsebCIRGg0bUd7UVyS5W9t4TRV+KSxeOjPJMBLKX0Cs5oSCG3zwRLh5S8EpOuyE6unj6UZBjCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T05:39:59.387499Z","bundle_sha256":"3cdde7bbf4f04af43f84da17b5cc0205794d7ea01a97dd68534ac2c9da48ab8e"}}