{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:5A75WD5QRUSEYKTCDD4NK5RLPL","short_pith_number":"pith:5A75WD5Q","schema_version":"1.0","canonical_sha256":"e83fdb0fb08d244c2a6218f8d5762b7afbe953a0405d7c5ac11ff0490af4b0bc","source":{"kind":"arxiv","id":"2308.13176","version":1},"attestation_state":"computed","paper":{"title":"Using Adamic-Adar Index Algorithm to Predict Volunteer Collaboration: Less is More","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SI","authors_text":"Baiqiao Yin, Changhong Zou, Chao Wu, Chen Jiang, Chunwang Lui, Di Yu, Peng Chen, Zijuan Lin","submitted_at":"2023-08-25T04:52:54Z","abstract_excerpt":"Social networks exhibit a complex graph-like structure due to the uncertainty surrounding potential collaborations among participants. Machine learning algorithms possess generic outstanding performance in multiple real-world prediction tasks. However, whether machine learning algorithms outperform specific algorithms designed for graph link prediction remains unknown to us. To address this issue, the Adamic-Adar Index (AAI), Jaccard Coefficient (JC) and common neighbour centrality (CNC) as representatives of graph-specific algorithms were applied to predict potential collaborations, utilizing"},"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":"2308.13176","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.SI","submitted_at":"2023-08-25T04:52:54Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"713ac8e4fe311c8129ef816deb9f557df9fea110c32bb8ab80fc7ae2745bbb1b","abstract_canon_sha256":"081b30f7b552c4b9b52f356d9ad9616da9047ba45111d2637bc35065fa735894"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:44:39.784898Z","signature_b64":"4zwO7Td3zRJCDTrP9iwK8IJjBt4P+/5vUnBfmkWKO3V0VkKqWNBm4zy/JEu7vVX4ke16S6jlNhc8L06Q5Iw7Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e83fdb0fb08d244c2a6218f8d5762b7afbe953a0405d7c5ac11ff0490af4b0bc","last_reissued_at":"2026-07-05T06:44:39.784408Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:44:39.784408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Using Adamic-Adar Index Algorithm to Predict Volunteer Collaboration: Less is More","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SI","authors_text":"Baiqiao Yin, Changhong Zou, Chao Wu, Chen Jiang, Chunwang Lui, Di Yu, Peng Chen, Zijuan Lin","submitted_at":"2023-08-25T04:52:54Z","abstract_excerpt":"Social networks exhibit a complex graph-like structure due to the uncertainty surrounding potential collaborations among participants. Machine learning algorithms possess generic outstanding performance in multiple real-world prediction tasks. However, whether machine learning algorithms outperform specific algorithms designed for graph link prediction remains unknown to us. To address this issue, the Adamic-Adar Index (AAI), Jaccard Coefficient (JC) and common neighbour centrality (CNC) as representatives of graph-specific algorithms were applied to predict potential collaborations, utilizing"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.13176","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2308.13176/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2308.13176","created_at":"2026-07-05T06:44:39.784468+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.13176v1","created_at":"2026-07-05T06:44:39.784468+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.13176","created_at":"2026-07-05T06:44:39.784468+00:00"},{"alias_kind":"pith_short_12","alias_value":"5A75WD5QRUSE","created_at":"2026-07-05T06:44:39.784468+00:00"},{"alias_kind":"pith_short_16","alias_value":"5A75WD5QRUSEYKTC","created_at":"2026-07-05T06:44:39.784468+00:00"},{"alias_kind":"pith_short_8","alias_value":"5A75WD5Q","created_at":"2026-07-05T06:44:39.784468+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/5A75WD5QRUSEYKTCDD4NK5RLPL","json":"https://pith.science/pith/5A75WD5QRUSEYKTCDD4NK5RLPL.json","graph_json":"https://pith.science/api/pith-number/5A75WD5QRUSEYKTCDD4NK5RLPL/graph.json","events_json":"https://pith.science/api/pith-number/5A75WD5QRUSEYKTCDD4NK5RLPL/events.json","paper":"https://pith.science/paper/5A75WD5Q"},"agent_actions":{"view_html":"https://pith.science/pith/5A75WD5QRUSEYKTCDD4NK5RLPL","download_json":"https://pith.science/pith/5A75WD5QRUSEYKTCDD4NK5RLPL.json","view_paper":"https://pith.science/paper/5A75WD5Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.13176&json=true","fetch_graph":"https://pith.science/api/pith-number/5A75WD5QRUSEYKTCDD4NK5RLPL/graph.json","fetch_events":"https://pith.science/api/pith-number/5A75WD5QRUSEYKTCDD4NK5RLPL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5A75WD5QRUSEYKTCDD4NK5RLPL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5A75WD5QRUSEYKTCDD4NK5RLPL/action/storage_attestation","attest_author":"https://pith.science/pith/5A75WD5QRUSEYKTCDD4NK5RLPL/action/author_attestation","sign_citation":"https://pith.science/pith/5A75WD5QRUSEYKTCDD4NK5RLPL/action/citation_signature","submit_replication":"https://pith.science/pith/5A75WD5QRUSEYKTCDD4NK5RLPL/action/replication_record"}},"created_at":"2026-07-05T06:44:39.784468+00:00","updated_at":"2026-07-05T06:44:39.784468+00:00"}