{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:BOW2UWSERK4DUCSLQMAYR6OWQ3","short_pith_number":"pith:BOW2UWSE","schema_version":"1.0","canonical_sha256":"0badaa5a448ab83a0a4b830188f9d686fc69ec7ebd4234d6b27e6f0ffadd0d89","source":{"kind":"arxiv","id":"2606.08291","version":1},"attestation_state":"computed","paper":{"title":"On solving symmetric multi-type orthogonal non-negative matrix tri-factorization problem","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Andrej Kastrin, Gregor Papa, Janez Povh, Rok Hribar","submitted_at":"2026-06-06T18:26:48Z","abstract_excerpt":"We study the symmetric multi-type orthogonal non-negative matrix tri-factorization problem, where several symmetric non-negative matrices are simultaneously approximated by factors of the form $GS_{i}G^{\\top}$, with a shared non-negative and orthogonal factor $G$. This model is motivated by clustering and network analysis, where non-negativity improves interpretability and orthogonality gives a natural assignment-type structure to the latent factor. Since the resulting optimization problem is highly non-convex, we develop two heuristic algorithms for computing high-quality local solutions. The"},"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":"2606.08291","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-06T18:26:48Z","cross_cats_sorted":[],"title_canon_sha256":"a4017d6bea640c9e7fec82b125729b3cf1c851d34c97060d2ca53cb9e5d07c43","abstract_canon_sha256":"4822cab41c6c1345d508c8810b4245e1c69c6e89328618d881fef3ffdb62af73"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T01:05:32.776659Z","signature_b64":"45CQNGACpLirBdxTo1YzSWhXm+KWab0Uelg0UUh32c2QoDW0L+gOM/QxXWjs6lXSJnwy99/2vfInraKHs2wnDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0badaa5a448ab83a0a4b830188f9d686fc69ec7ebd4234d6b27e6f0ffadd0d89","last_reissued_at":"2026-06-09T01:05:32.776246Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T01:05:32.776246Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On solving symmetric multi-type orthogonal non-negative matrix tri-factorization problem","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Andrej Kastrin, Gregor Papa, Janez Povh, Rok Hribar","submitted_at":"2026-06-06T18:26:48Z","abstract_excerpt":"We study the symmetric multi-type orthogonal non-negative matrix tri-factorization problem, where several symmetric non-negative matrices are simultaneously approximated by factors of the form $GS_{i}G^{\\top}$, with a shared non-negative and orthogonal factor $G$. This model is motivated by clustering and network analysis, where non-negativity improves interpretability and orthogonality gives a natural assignment-type structure to the latent factor. Since the resulting optimization problem is highly non-convex, we develop two heuristic algorithms for computing high-quality local solutions. The"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.08291","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/2606.08291/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":"2606.08291","created_at":"2026-06-09T01:05:32.776307+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.08291v1","created_at":"2026-06-09T01:05:32.776307+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.08291","created_at":"2026-06-09T01:05:32.776307+00:00"},{"alias_kind":"pith_short_12","alias_value":"BOW2UWSERK4D","created_at":"2026-06-09T01:05:32.776307+00:00"},{"alias_kind":"pith_short_16","alias_value":"BOW2UWSERK4DUCSL","created_at":"2026-06-09T01:05:32.776307+00:00"},{"alias_kind":"pith_short_8","alias_value":"BOW2UWSE","created_at":"2026-06-09T01:05:32.776307+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/BOW2UWSERK4DUCSLQMAYR6OWQ3","json":"https://pith.science/pith/BOW2UWSERK4DUCSLQMAYR6OWQ3.json","graph_json":"https://pith.science/api/pith-number/BOW2UWSERK4DUCSLQMAYR6OWQ3/graph.json","events_json":"https://pith.science/api/pith-number/BOW2UWSERK4DUCSLQMAYR6OWQ3/events.json","paper":"https://pith.science/paper/BOW2UWSE"},"agent_actions":{"view_html":"https://pith.science/pith/BOW2UWSERK4DUCSLQMAYR6OWQ3","download_json":"https://pith.science/pith/BOW2UWSERK4DUCSLQMAYR6OWQ3.json","view_paper":"https://pith.science/paper/BOW2UWSE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.08291&json=true","fetch_graph":"https://pith.science/api/pith-number/BOW2UWSERK4DUCSLQMAYR6OWQ3/graph.json","fetch_events":"https://pith.science/api/pith-number/BOW2UWSERK4DUCSLQMAYR6OWQ3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BOW2UWSERK4DUCSLQMAYR6OWQ3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BOW2UWSERK4DUCSLQMAYR6OWQ3/action/storage_attestation","attest_author":"https://pith.science/pith/BOW2UWSERK4DUCSLQMAYR6OWQ3/action/author_attestation","sign_citation":"https://pith.science/pith/BOW2UWSERK4DUCSLQMAYR6OWQ3/action/citation_signature","submit_replication":"https://pith.science/pith/BOW2UWSERK4DUCSLQMAYR6OWQ3/action/replication_record"}},"created_at":"2026-06-09T01:05:32.776307+00:00","updated_at":"2026-06-09T01:05:32.776307+00:00"}