{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:52D7ZS2UQKNTFEBBFJUFGLPWPD","short_pith_number":"pith:52D7ZS2U","schema_version":"1.0","canonical_sha256":"ee87fccb54829b3290212a68532df678ca1900968496cabf04d1c4c1cfc89662","source":{"kind":"arxiv","id":"1809.08353","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1809.08353","created_at":"2026-05-17T23:44:43.015899+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.08353v2","created_at":"2026-05-17T23:44:43.015899+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.08353","created_at":"2026-05-17T23:44:43.015899+00:00"},{"alias_kind":"pith_short_12","alias_value":"52D7ZS2UQKNT","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"52D7ZS2UQKNTFEBB","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"52D7ZS2U","created_at":"2026-05-18T12:32:05.422762+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/52D7ZS2UQKNTFEBBFJUFGLPWPD","json":"https://pith.science/pith/52D7ZS2UQKNTFEBBFJUFGLPWPD.json","graph_json":"https://pith.science/api/pith-number/52D7ZS2UQKNTFEBBFJUFGLPWPD/graph.json","events_json":"https://pith.science/api/pith-number/52D7ZS2UQKNTFEBBFJUFGLPWPD/events.json","paper":"https://pith.science/paper/52D7ZS2U"},"agent_actions":{"view_html":"https://pith.science/pith/52D7ZS2UQKNTFEBBFJUFGLPWPD","download_json":"https://pith.science/pith/52D7ZS2UQKNTFEBBFJUFGLPWPD.json","view_paper":"https://pith.science/paper/52D7ZS2U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.08353&json=true","fetch_graph":"https://pith.science/api/pith-number/52D7ZS2UQKNTFEBBFJUFGLPWPD/graph.json","fetch_events":"https://pith.science/api/pith-number/52D7ZS2UQKNTFEBBFJUFGLPWPD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/52D7ZS2UQKNTFEBBFJUFGLPWPD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/52D7ZS2UQKNTFEBBFJUFGLPWPD/action/storage_attestation","attest_author":"https://pith.science/pith/52D7ZS2UQKNTFEBBFJUFGLPWPD/action/author_attestation","sign_citation":"https://pith.science/pith/52D7ZS2UQKNTFEBBFJUFGLPWPD/action/citation_signature","submit_replication":"https://pith.science/pith/52D7ZS2UQKNTFEBBFJUFGLPWPD/action/replication_record"}},"created_at":"2026-05-17T23:44:43.015899+00:00","updated_at":"2026-05-17T23:44:43.015899+00:00"}