{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:OOOUACN37UCKGOY4FAZYFQNM7J","short_pith_number":"pith:OOOUACN3","canonical_record":{"source":{"id":"1612.00750","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-12-01T04:39:30Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"737f81fb35c40dfe1cd528b2d26867827083dfcaea056e90d813c7f9021e982b","abstract_canon_sha256":"2c00107550d403b5f67fa11c78ced161b9ade774e7935ff53b523c3089037400"},"schema_version":"1.0"},"canonical_sha256":"739d4009bbfd04a33b1c283382c1acfa55e2401740ec39fccf5e0da8537a5364","source":{"kind":"arxiv","id":"1612.00750","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.00750","created_at":"2026-05-18T00:52:03Z"},{"alias_kind":"arxiv_version","alias_value":"1612.00750v2","created_at":"2026-05-18T00:52:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.00750","created_at":"2026-05-18T00:52:03Z"},{"alias_kind":"pith_short_12","alias_value":"OOOUACN37UCK","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OOOUACN37UCKGOY4","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OOOUACN3","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:OOOUACN37UCKGOY4FAZYFQNM7J","target":"record","payload":{"canonical_record":{"source":{"id":"1612.00750","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-12-01T04:39:30Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"737f81fb35c40dfe1cd528b2d26867827083dfcaea056e90d813c7f9021e982b","abstract_canon_sha256":"2c00107550d403b5f67fa11c78ced161b9ade774e7935ff53b523c3089037400"},"schema_version":"1.0"},"canonical_sha256":"739d4009bbfd04a33b1c283382c1acfa55e2401740ec39fccf5e0da8537a5364","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:03.705713Z","signature_b64":"XH5NUwz9lNANHpLpkwiRhYyf2ygwSrWzgzuCUZa5GUxc+dPbEbbtLqit0X9MbcAp4r735QgxHMQJyeoOv96NAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"739d4009bbfd04a33b1c283382c1acfa55e2401740ec39fccf5e0da8537a5364","last_reissued_at":"2026-05-18T00:52:03.704996Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:03.704996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.00750","source_version":2,"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-05-18T00:52:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H33yJhnUh5+4gQR0k9mH5B/Gg+9HtlpeSGuz6bgBe+2GZJCYJPFJuLEQeKmgRuZCE09s82XkujqMapx0LbM7CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T16:57:38.160492Z"},"content_sha256":"0cd63a213b19e90b9efaf04c8bd88da4a5da13dbb91926e8eb84367249732282","schema_version":"1.0","event_id":"sha256:0cd63a213b19e90b9efaf04c8bd88da4a5da13dbb91926e8eb84367249732282"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:OOOUACN37UCKGOY4FAZYFQNM7J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Non-Negative Matrix Factorizations for Multiplex Network Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.SI","authors_text":"Stefanos Zafeiriou, Vladimir Gligorijevic, Yannis Panagakis","submitted_at":"2016-12-01T04:39:30Z","abstract_excerpt":"Networks have been a general tool for representing, analyzing, and modeling relational data arising in several domains. One of the most important aspect of network analysis is community detection or network clustering. Until recently, the major focus have been on discovering community structure in single (i.e., monoplex) networks. However, with the advent of relational data with multiple modalities, multiplex networks, i.e., networks composed of multiple layers representing different aspects of relations, have emerged. Consequently, community detection in multiplex network, i.e., detecting clu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.00750","kind":"arxiv","version":2},"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"},"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-05-18T00:52:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uOWgClDsA/uT//U/csLQO37RE694ScS90l2NSVfGt4IBGd3I2TOHb+EBxw7E8CORwKFHdgZ3KwIaMp2BS2w1AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T16:57:38.161145Z"},"content_sha256":"a8c43b7ac11e0bebc7ba032d3c8ef9996d38338faaa70c980d1853682d476f40","schema_version":"1.0","event_id":"sha256:a8c43b7ac11e0bebc7ba032d3c8ef9996d38338faaa70c980d1853682d476f40"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OOOUACN37UCKGOY4FAZYFQNM7J/bundle.json","state_url":"https://pith.science/pith/OOOUACN37UCKGOY4FAZYFQNM7J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OOOUACN37UCKGOY4FAZYFQNM7J/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-07T16:57:38Z","links":{"resolver":"https://pith.science/pith/OOOUACN37UCKGOY4FAZYFQNM7J","bundle":"https://pith.science/pith/OOOUACN37UCKGOY4FAZYFQNM7J/bundle.json","state":"https://pith.science/pith/OOOUACN37UCKGOY4FAZYFQNM7J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OOOUACN37UCKGOY4FAZYFQNM7J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:OOOUACN37UCKGOY4FAZYFQNM7J","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":"2c00107550d403b5f67fa11c78ced161b9ade774e7935ff53b523c3089037400","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-12-01T04:39:30Z","title_canon_sha256":"737f81fb35c40dfe1cd528b2d26867827083dfcaea056e90d813c7f9021e982b"},"schema_version":"1.0","source":{"id":"1612.00750","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.00750","created_at":"2026-05-18T00:52:03Z"},{"alias_kind":"arxiv_version","alias_value":"1612.00750v2","created_at":"2026-05-18T00:52:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.00750","created_at":"2026-05-18T00:52:03Z"},{"alias_kind":"pith_short_12","alias_value":"OOOUACN37UCK","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OOOUACN37UCKGOY4","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OOOUACN3","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:a8c43b7ac11e0bebc7ba032d3c8ef9996d38338faaa70c980d1853682d476f40","target":"graph","created_at":"2026-05-18T00:52:03Z","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"},"paper":{"abstract_excerpt":"Networks have been a general tool for representing, analyzing, and modeling relational data arising in several domains. One of the most important aspect of network analysis is community detection or network clustering. Until recently, the major focus have been on discovering community structure in single (i.e., monoplex) networks. However, with the advent of relational data with multiple modalities, multiplex networks, i.e., networks composed of multiple layers representing different aspects of relations, have emerged. Consequently, community detection in multiplex network, i.e., detecting clu","authors_text":"Stefanos Zafeiriou, Vladimir Gligorijevic, Yannis Panagakis","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-12-01T04:39:30Z","title":"Non-Negative Matrix Factorizations for Multiplex Network Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.00750","kind":"arxiv","version":2},"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:0cd63a213b19e90b9efaf04c8bd88da4a5da13dbb91926e8eb84367249732282","target":"record","created_at":"2026-05-18T00:52:03Z","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":"2c00107550d403b5f67fa11c78ced161b9ade774e7935ff53b523c3089037400","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-12-01T04:39:30Z","title_canon_sha256":"737f81fb35c40dfe1cd528b2d26867827083dfcaea056e90d813c7f9021e982b"},"schema_version":"1.0","source":{"id":"1612.00750","kind":"arxiv","version":2}},"canonical_sha256":"739d4009bbfd04a33b1c283382c1acfa55e2401740ec39fccf5e0da8537a5364","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"739d4009bbfd04a33b1c283382c1acfa55e2401740ec39fccf5e0da8537a5364","first_computed_at":"2026-05-18T00:52:03.704996Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:03.704996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XH5NUwz9lNANHpLpkwiRhYyf2ygwSrWzgzuCUZa5GUxc+dPbEbbtLqit0X9MbcAp4r735QgxHMQJyeoOv96NAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:03.705713Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.00750","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0cd63a213b19e90b9efaf04c8bd88da4a5da13dbb91926e8eb84367249732282","sha256:a8c43b7ac11e0bebc7ba032d3c8ef9996d38338faaa70c980d1853682d476f40"],"state_sha256":"90a01bce2f0136e4b17b16283cfe7cb21d5bdbf5bbdb4097e5a156e928ddff4e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qs6lTHUKvXTk8EKx/FxC5YO7SFGejwoBYHdF6Hpmlmrmf6+/OaiVcUX95gYB731EPHy/MLCBIBYJCGHJhyuvDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T16:57:38.166846Z","bundle_sha256":"f7496af6a75fdcfcbee988c631df46350b344d4e48a18f13e5652d02da6b11fc"}}