{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:52D7ZS2UQKNTFEBBFJUFGLPWPD","short_pith_number":"pith:52D7ZS2U","canonical_record":{"source":{"id":"1809.08353","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-09-22T00:25:20Z","cross_cats_sorted":["cs.LG","cs.SI","eess.SP"],"title_canon_sha256":"95f16a2a2dc73bf2eee5f9bb6e0164adadbcb50e3536805d61a6b3ca0712fbaa","abstract_canon_sha256":"20f6fda8cd99a252db7b8cf1b49f9ce160eb1926f6d8560c307a6588c137c18e"},"schema_version":"1.0"},"canonical_sha256":"ee87fccb54829b3290212a68532df678ca1900968496cabf04d1c4c1cfc89662","source":{"kind":"arxiv","id":"1809.08353","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.08353","created_at":"2026-05-17T23:44:43Z"},{"alias_kind":"arxiv_version","alias_value":"1809.08353v2","created_at":"2026-05-17T23:44:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.08353","created_at":"2026-05-17T23:44:43Z"},{"alias_kind":"pith_short_12","alias_value":"52D7ZS2UQKNT","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"52D7ZS2UQKNTFEBB","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"52D7ZS2U","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:52D7ZS2UQKNTFEBBFJUFGLPWPD","target":"record","payload":{"canonical_record":{"source":{"id":"1809.08353","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-09-22T00:25:20Z","cross_cats_sorted":["cs.LG","cs.SI","eess.SP"],"title_canon_sha256":"95f16a2a2dc73bf2eee5f9bb6e0164adadbcb50e3536805d61a6b3ca0712fbaa","abstract_canon_sha256":"20f6fda8cd99a252db7b8cf1b49f9ce160eb1926f6d8560c307a6588c137c18e"},"schema_version":"1.0"},"canonical_sha256":"ee87fccb54829b3290212a68532df678ca1900968496cabf04d1c4c1cfc89662","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:43.016423Z","signature_b64":"NBHarFaNi11utNNcv6ENlT1fBCA+i/AirWEVdJxTn39mQ1fK1Ek25rkg0i7szCInTMc9SE6E/sQw91/XDvTdBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee87fccb54829b3290212a68532df678ca1900968496cabf04d1c4c1cfc89662","last_reissued_at":"2026-05-17T23:44:43.015796Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:43.015796Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.08353","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-17T23:44:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NCN4NggjdM9HVzVOG93GOygRuLbDbo0kgk1XUSg501nQLbUvCgBq9LEdN8/xTNEh5K147PtHKKesTjwnXzaOBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:18:21.418636Z"},"content_sha256":"337ee28bd870401d4cb10b852697d983d59b75589db857eee22715dabf71df2f","schema_version":"1.0","event_id":"sha256:337ee28bd870401d4cb10b852697d983d59b75589db857eee22715dabf71df2f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:52D7ZS2UQKNTFEBBFJUFGLPWPD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Coupled Graphs and Tensor Factorization for Recommender Systems and Community Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SI","eess.SP"],"primary_cat":"stat.ML","authors_text":"Ahmed S. Zamzam, Georgios B. Giannakis, Nicholas D. Sidiropoulos, Vassilis N. Ioannidis","submitted_at":"2018-09-22T00:25:20Z","abstract_excerpt":"Joint analysis of data from multiple information repositories facilitates uncovering the underlying structure in heterogeneous datasets. Single and coupled matrix-tensor factorization (CMTF) has been widely used in this context for imputation-based recommendation from ratings, social network, and other user-item data. When this side information is in the form of item-item correlation matrices or graphs, existing CMTF algorithms may fall short. Alleviating current limitations, we introduce a novel model coined coupled graph-tensor factorization (CGTF) that judiciously accounts for graph-related"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.08353","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-17T23:44:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4E9zIXzdnpDD9bzOEAfX3Hn6lKQg+N6BGb2lMPIQ5gIfyAnrzd3NfAm4VX3qMx2SugCeenxnqf7druwKT/zyCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:18:21.419161Z"},"content_sha256":"d0f71456cdc161d0317e462a2ed86bb0053f563ab9429a12d6aa27aa755a1b25","schema_version":"1.0","event_id":"sha256:d0f71456cdc161d0317e462a2ed86bb0053f563ab9429a12d6aa27aa755a1b25"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/52D7ZS2UQKNTFEBBFJUFGLPWPD/bundle.json","state_url":"https://pith.science/pith/52D7ZS2UQKNTFEBBFJUFGLPWPD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/52D7ZS2UQKNTFEBBFJUFGLPWPD/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-05-26T12:18:21Z","links":{"resolver":"https://pith.science/pith/52D7ZS2UQKNTFEBBFJUFGLPWPD","bundle":"https://pith.science/pith/52D7ZS2UQKNTFEBBFJUFGLPWPD/bundle.json","state":"https://pith.science/pith/52D7ZS2UQKNTFEBBFJUFGLPWPD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/52D7ZS2UQKNTFEBBFJUFGLPWPD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:52D7ZS2UQKNTFEBBFJUFGLPWPD","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":"20f6fda8cd99a252db7b8cf1b49f9ce160eb1926f6d8560c307a6588c137c18e","cross_cats_sorted":["cs.LG","cs.SI","eess.SP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-09-22T00:25:20Z","title_canon_sha256":"95f16a2a2dc73bf2eee5f9bb6e0164adadbcb50e3536805d61a6b3ca0712fbaa"},"schema_version":"1.0","source":{"id":"1809.08353","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.08353","created_at":"2026-05-17T23:44:43Z"},{"alias_kind":"arxiv_version","alias_value":"1809.08353v2","created_at":"2026-05-17T23:44:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.08353","created_at":"2026-05-17T23:44:43Z"},{"alias_kind":"pith_short_12","alias_value":"52D7ZS2UQKNT","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"52D7ZS2UQKNTFEBB","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"52D7ZS2U","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:d0f71456cdc161d0317e462a2ed86bb0053f563ab9429a12d6aa27aa755a1b25","target":"graph","created_at":"2026-05-17T23:44:43Z","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":"Joint analysis of data from multiple information repositories facilitates uncovering the underlying structure in heterogeneous datasets. Single and coupled matrix-tensor factorization (CMTF) has been widely used in this context for imputation-based recommendation from ratings, social network, and other user-item data. When this side information is in the form of item-item correlation matrices or graphs, existing CMTF algorithms may fall short. Alleviating current limitations, we introduce a novel model coined coupled graph-tensor factorization (CGTF) that judiciously accounts for graph-related","authors_text":"Ahmed S. Zamzam, Georgios B. Giannakis, Nicholas D. Sidiropoulos, Vassilis N. Ioannidis","cross_cats":["cs.LG","cs.SI","eess.SP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-09-22T00:25:20Z","title":"Coupled Graphs and Tensor Factorization for Recommender Systems and Community Detection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.08353","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:337ee28bd870401d4cb10b852697d983d59b75589db857eee22715dabf71df2f","target":"record","created_at":"2026-05-17T23:44:43Z","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":"20f6fda8cd99a252db7b8cf1b49f9ce160eb1926f6d8560c307a6588c137c18e","cross_cats_sorted":["cs.LG","cs.SI","eess.SP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-09-22T00:25:20Z","title_canon_sha256":"95f16a2a2dc73bf2eee5f9bb6e0164adadbcb50e3536805d61a6b3ca0712fbaa"},"schema_version":"1.0","source":{"id":"1809.08353","kind":"arxiv","version":2}},"canonical_sha256":"ee87fccb54829b3290212a68532df678ca1900968496cabf04d1c4c1cfc89662","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee87fccb54829b3290212a68532df678ca1900968496cabf04d1c4c1cfc89662","first_computed_at":"2026-05-17T23:44:43.015796Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:43.015796Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NBHarFaNi11utNNcv6ENlT1fBCA+i/AirWEVdJxTn39mQ1fK1Ek25rkg0i7szCInTMc9SE6E/sQw91/XDvTdBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:43.016423Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.08353","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:337ee28bd870401d4cb10b852697d983d59b75589db857eee22715dabf71df2f","sha256:d0f71456cdc161d0317e462a2ed86bb0053f563ab9429a12d6aa27aa755a1b25"],"state_sha256":"a06e9a7cca3a98c1cf45a53c09ec0ca52d005563cdc3bc0a08b72e05fde5cd88"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MKLFfSd5YjzWUVu+Vhs5xbu+77zg66B/XDPFM3ClojtfJY5yufzBxc4wSwDeqayLn6cavWqSXfW4w7qxN2m4Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T12:18:21.422892Z","bundle_sha256":"2bd59aaa98f96c14158ce22b1f7ff1281d23fb3587507f5a6a30080712fba5b6"}}