{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ABRVCWPB444KQXRODZ2SANC6HU","short_pith_number":"pith:ABRVCWPB","schema_version":"1.0","canonical_sha256":"00635159e1e738a85e2e1e7520345e3d2e51e94bdfeff2a41e6b1266075e93ed","source":{"kind":"arxiv","id":"1811.02616","version":3},"attestation_state":"computed","paper":{"title":"Multi-View Network Embedding Via Graph Factorization Clustering and Co-Regularized Multi-View Agreement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Ngot Bui, Tsung-Yu Hsieh, Vasant Honavar, Yiwei Sun","submitted_at":"2018-11-06T20:19:06Z","abstract_excerpt":"Real-world social networks and digital platforms are comprised of individuals (nodes) that are linked to other individuals or entities through multiple types of relationships (links). Sub-networks of such a network based on each type of link correspond to distinct views of the underlying network. In real-world applications, each node is typically linked to only a small subset of other nodes. Hence, practical approaches to problems such as node labeling have to cope with the resulting sparse networks. While low-dimensional network embeddings offer a promising approach to this problem, most of t"},"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":"1811.02616","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-06T20:19:06Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"7335a676c92d62d768a0b9b810a305c07f8bb6e0b77da373af638b302caeee10","abstract_canon_sha256":"5274cda4a33abf5d9460b0fbfef228ec6edda0576b7cbf6f45fa720eb35f00b0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:50.274364Z","signature_b64":"hMU+j3az8xkbIT6JQ4TxV1E1uTdZnuhyt1/YboZK5AxOplaynt/vLQ6R/FP3Kp889QE2jwiLZmB81gOO6VAOAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00635159e1e738a85e2e1e7520345e3d2e51e94bdfeff2a41e6b1266075e93ed","last_reissued_at":"2026-05-17T23:53:50.273644Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:50.273644Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-View Network Embedding Via Graph Factorization Clustering and Co-Regularized Multi-View Agreement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Ngot Bui, Tsung-Yu Hsieh, Vasant Honavar, Yiwei Sun","submitted_at":"2018-11-06T20:19:06Z","abstract_excerpt":"Real-world social networks and digital platforms are comprised of individuals (nodes) that are linked to other individuals or entities through multiple types of relationships (links). Sub-networks of such a network based on each type of link correspond to distinct views of the underlying network. In real-world applications, each node is typically linked to only a small subset of other nodes. Hence, practical approaches to problems such as node labeling have to cope with the resulting sparse networks. While low-dimensional network embeddings offer a promising approach to this problem, most of t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02616","kind":"arxiv","version":3},"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":"1811.02616","created_at":"2026-05-17T23:53:50.273755+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.02616v3","created_at":"2026-05-17T23:53:50.273755+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02616","created_at":"2026-05-17T23:53:50.273755+00:00"},{"alias_kind":"pith_short_12","alias_value":"ABRVCWPB444K","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"ABRVCWPB444KQXRO","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"ABRVCWPB","created_at":"2026-05-18T12:32:13.499390+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/ABRVCWPB444KQXRODZ2SANC6HU","json":"https://pith.science/pith/ABRVCWPB444KQXRODZ2SANC6HU.json","graph_json":"https://pith.science/api/pith-number/ABRVCWPB444KQXRODZ2SANC6HU/graph.json","events_json":"https://pith.science/api/pith-number/ABRVCWPB444KQXRODZ2SANC6HU/events.json","paper":"https://pith.science/paper/ABRVCWPB"},"agent_actions":{"view_html":"https://pith.science/pith/ABRVCWPB444KQXRODZ2SANC6HU","download_json":"https://pith.science/pith/ABRVCWPB444KQXRODZ2SANC6HU.json","view_paper":"https://pith.science/paper/ABRVCWPB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.02616&json=true","fetch_graph":"https://pith.science/api/pith-number/ABRVCWPB444KQXRODZ2SANC6HU/graph.json","fetch_events":"https://pith.science/api/pith-number/ABRVCWPB444KQXRODZ2SANC6HU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ABRVCWPB444KQXRODZ2SANC6HU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ABRVCWPB444KQXRODZ2SANC6HU/action/storage_attestation","attest_author":"https://pith.science/pith/ABRVCWPB444KQXRODZ2SANC6HU/action/author_attestation","sign_citation":"https://pith.science/pith/ABRVCWPB444KQXRODZ2SANC6HU/action/citation_signature","submit_replication":"https://pith.science/pith/ABRVCWPB444KQXRODZ2SANC6HU/action/replication_record"}},"created_at":"2026-05-17T23:53:50.273755+00:00","updated_at":"2026-05-17T23:53:50.273755+00:00"}