{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:BOW2UWSERK4DUCSLQMAYR6OWQ3","short_pith_number":"pith:BOW2UWSE","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"},"canonical_sha256":"0badaa5a448ab83a0a4b830188f9d686fc69ec7ebd4234d6b27e6f0ffadd0d89","source":{"kind":"arxiv","id":"2606.08291","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.08291","created_at":"2026-06-09T01:05:32Z"},{"alias_kind":"arxiv_version","alias_value":"2606.08291v1","created_at":"2026-06-09T01:05:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.08291","created_at":"2026-06-09T01:05:32Z"},{"alias_kind":"pith_short_12","alias_value":"BOW2UWSERK4D","created_at":"2026-06-09T01:05:32Z"},{"alias_kind":"pith_short_16","alias_value":"BOW2UWSERK4DUCSL","created_at":"2026-06-09T01:05:32Z"},{"alias_kind":"pith_short_8","alias_value":"BOW2UWSE","created_at":"2026-06-09T01:05:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:BOW2UWSERK4DUCSLQMAYR6OWQ3","target":"record","payload":{"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"},"canonical_sha256":"0badaa5a448ab83a0a4b830188f9d686fc69ec7ebd4234d6b27e6f0ffadd0d89","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"},"source_kind":"arxiv","source_id":"2606.08291","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-06-09T01:05:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2mZIyNXuTgvQtRGZH7Te0V3WnQteo6TtIAk59VftwCnzhb2fy0u9ME2CIaxVClRbwnjwvyOTAK5nUXxlfSCDAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T04:00:17.835708Z"},"content_sha256":"04f09cfe334780e1d5bf89084e62d2ac878a15df47a80992e145b202af666d04","schema_version":"1.0","event_id":"sha256:04f09cfe334780e1d5bf89084e62d2ac878a15df47a80992e145b202af666d04"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:BOW2UWSERK4DUCSLQMAYR6OWQ3","target":"graph","payload":{"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"},"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-06-09T01:05:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lHU7R0NRB1ZYTh9izo7DFLGg7aIupFgmlo+y5Ww05VPhTI8Kw4ZJKdrU/Nnrlk/XEH9e1PVReNcdw1q7HKGxBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T04:00:17.836083Z"},"content_sha256":"5a5283169ab17705b498489669dd3f56e90b82a008bbf3292b88d7ac53d7347d","schema_version":"1.0","event_id":"sha256:5a5283169ab17705b498489669dd3f56e90b82a008bbf3292b88d7ac53d7347d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BOW2UWSERK4DUCSLQMAYR6OWQ3/bundle.json","state_url":"https://pith.science/pith/BOW2UWSERK4DUCSLQMAYR6OWQ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BOW2UWSERK4DUCSLQMAYR6OWQ3/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-06-20T04:00:17Z","links":{"resolver":"https://pith.science/pith/BOW2UWSERK4DUCSLQMAYR6OWQ3","bundle":"https://pith.science/pith/BOW2UWSERK4DUCSLQMAYR6OWQ3/bundle.json","state":"https://pith.science/pith/BOW2UWSERK4DUCSLQMAYR6OWQ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BOW2UWSERK4DUCSLQMAYR6OWQ3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:BOW2UWSERK4DUCSLQMAYR6OWQ3","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":"4822cab41c6c1345d508c8810b4245e1c69c6e89328618d881fef3ffdb62af73","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-06T18:26:48Z","title_canon_sha256":"a4017d6bea640c9e7fec82b125729b3cf1c851d34c97060d2ca53cb9e5d07c43"},"schema_version":"1.0","source":{"id":"2606.08291","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.08291","created_at":"2026-06-09T01:05:32Z"},{"alias_kind":"arxiv_version","alias_value":"2606.08291v1","created_at":"2026-06-09T01:05:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.08291","created_at":"2026-06-09T01:05:32Z"},{"alias_kind":"pith_short_12","alias_value":"BOW2UWSERK4D","created_at":"2026-06-09T01:05:32Z"},{"alias_kind":"pith_short_16","alias_value":"BOW2UWSERK4DUCSL","created_at":"2026-06-09T01:05:32Z"},{"alias_kind":"pith_short_8","alias_value":"BOW2UWSE","created_at":"2026-06-09T01:05:32Z"}],"graph_snapshots":[{"event_id":"sha256:5a5283169ab17705b498489669dd3f56e90b82a008bbf3292b88d7ac53d7347d","target":"graph","created_at":"2026-06-09T01:05:32Z","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/2606.08291/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Andrej Kastrin, Gregor Papa, Janez Povh, Rok Hribar","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-06T18:26:48Z","title":"On solving symmetric multi-type orthogonal non-negative matrix tri-factorization problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.08291","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:04f09cfe334780e1d5bf89084e62d2ac878a15df47a80992e145b202af666d04","target":"record","created_at":"2026-06-09T01:05:32Z","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":"4822cab41c6c1345d508c8810b4245e1c69c6e89328618d881fef3ffdb62af73","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-06T18:26:48Z","title_canon_sha256":"a4017d6bea640c9e7fec82b125729b3cf1c851d34c97060d2ca53cb9e5d07c43"},"schema_version":"1.0","source":{"id":"2606.08291","kind":"arxiv","version":1}},"canonical_sha256":"0badaa5a448ab83a0a4b830188f9d686fc69ec7ebd4234d6b27e6f0ffadd0d89","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0badaa5a448ab83a0a4b830188f9d686fc69ec7ebd4234d6b27e6f0ffadd0d89","first_computed_at":"2026-06-09T01:05:32.776246Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-09T01:05:32.776246Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"45CQNGACpLirBdxTo1YzSWhXm+KWab0Uelg0UUh32c2QoDW0L+gOM/QxXWjs6lXSJnwy99/2vfInraKHs2wnDQ==","signature_status":"signed_v1","signed_at":"2026-06-09T01:05:32.776659Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.08291","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:04f09cfe334780e1d5bf89084e62d2ac878a15df47a80992e145b202af666d04","sha256:5a5283169ab17705b498489669dd3f56e90b82a008bbf3292b88d7ac53d7347d"],"state_sha256":"4f33fb3ae7e5a0cc9192256eec0cea3bb810732bd974f0461d30022d43687c22"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o2ZkTGIJwl4noucPlFp/ElGUq1YDCT60m2l4lPt1z90NB2b2V2EX9Z2UWAcBi6NCNbH8vo6fcuBdbcv/rzauAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T04:00:17.838128Z","bundle_sha256":"35eecfd96f140f1ba00af596f72ded0a4a0e997700ce21a9e571a015efe42914"}}