{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:ODRD4OF4F46FVPDMCZMPYWAQY5","short_pith_number":"pith:ODRD4OF4","schema_version":"1.0","canonical_sha256":"70e23e38bc2f3c5abc6c1658fc5810c753a915aa6478904438c366fb3136201f","source":{"kind":"arxiv","id":"1311.3732","version":1},"attestation_state":"computed","paper":{"title":"Exploiting Direct and Indirect Information for Friend Suggestion in ZingMe","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Kien Duy Nguyen, Quang Nhat Nguyen, Thanh Trung Nguyen, Tuan Pham Minh","submitted_at":"2013-11-15T05:56:48Z","abstract_excerpt":"Friend suggestion is a fundamental problem in social networks with the goal of assisting users in creating more relationships, and thereby enhances interest of users to the social networks. This problem is often considered to be the link prediction problem in the network. ZingMe is one of the largest social networks in Vietnam. In this paper, we analyze the current approach for the friend suggestion problem in ZingMe, showing its limitations and disadvantages. We propose a new efficient approach for friend suggestion that uses information from the network structure, attributes and interactions"},"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":"1311.3732","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2013-11-15T05:56:48Z","cross_cats_sorted":["cs.IR","physics.soc-ph"],"title_canon_sha256":"c93fe2e241f70c90f40da02052688eefa7ca3557dda714dde87750fe99308b89","abstract_canon_sha256":"018d3637a999e2e9da857075ae18915cce66d9e902ec9836b45fbf1192bcefc5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:07:03.152451Z","signature_b64":"iaajBvGRBBFxvg3CXXGPuXBXdOcEgHItnPtaKR5BTyGCLwxp2RCoJBf1oStn6x8WoDsKm59ZSoVSKZMgG94FDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70e23e38bc2f3c5abc6c1658fc5810c753a915aa6478904438c366fb3136201f","last_reissued_at":"2026-05-18T03:07:03.151938Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:07:03.151938Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exploiting Direct and Indirect Information for Friend Suggestion in ZingMe","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Kien Duy Nguyen, Quang Nhat Nguyen, Thanh Trung Nguyen, Tuan Pham Minh","submitted_at":"2013-11-15T05:56:48Z","abstract_excerpt":"Friend suggestion is a fundamental problem in social networks with the goal of assisting users in creating more relationships, and thereby enhances interest of users to the social networks. This problem is often considered to be the link prediction problem in the network. ZingMe is one of the largest social networks in Vietnam. In this paper, we analyze the current approach for the friend suggestion problem in ZingMe, showing its limitations and disadvantages. We propose a new efficient approach for friend suggestion that uses information from the network structure, attributes and interactions"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.3732","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":""},"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":"1311.3732","created_at":"2026-05-18T03:07:03.152018+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.3732v1","created_at":"2026-05-18T03:07:03.152018+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.3732","created_at":"2026-05-18T03:07:03.152018+00:00"},{"alias_kind":"pith_short_12","alias_value":"ODRD4OF4F46F","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"ODRD4OF4F46FVPDM","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"ODRD4OF4","created_at":"2026-05-18T12:27:54.935989+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/ODRD4OF4F46FVPDMCZMPYWAQY5","json":"https://pith.science/pith/ODRD4OF4F46FVPDMCZMPYWAQY5.json","graph_json":"https://pith.science/api/pith-number/ODRD4OF4F46FVPDMCZMPYWAQY5/graph.json","events_json":"https://pith.science/api/pith-number/ODRD4OF4F46FVPDMCZMPYWAQY5/events.json","paper":"https://pith.science/paper/ODRD4OF4"},"agent_actions":{"view_html":"https://pith.science/pith/ODRD4OF4F46FVPDMCZMPYWAQY5","download_json":"https://pith.science/pith/ODRD4OF4F46FVPDMCZMPYWAQY5.json","view_paper":"https://pith.science/paper/ODRD4OF4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.3732&json=true","fetch_graph":"https://pith.science/api/pith-number/ODRD4OF4F46FVPDMCZMPYWAQY5/graph.json","fetch_events":"https://pith.science/api/pith-number/ODRD4OF4F46FVPDMCZMPYWAQY5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ODRD4OF4F46FVPDMCZMPYWAQY5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ODRD4OF4F46FVPDMCZMPYWAQY5/action/storage_attestation","attest_author":"https://pith.science/pith/ODRD4OF4F46FVPDMCZMPYWAQY5/action/author_attestation","sign_citation":"https://pith.science/pith/ODRD4OF4F46FVPDMCZMPYWAQY5/action/citation_signature","submit_replication":"https://pith.science/pith/ODRD4OF4F46FVPDMCZMPYWAQY5/action/replication_record"}},"created_at":"2026-05-18T03:07:03.152018+00:00","updated_at":"2026-05-18T03:07:03.152018+00:00"}