{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:BCUXZS75VO4K7HW3W46AYMKDBY","short_pith_number":"pith:BCUXZS75","schema_version":"1.0","canonical_sha256":"08a97ccbfdabb8af9edbb73c0c31430e2e82ac1d1cedb99dfd3e91d89bbad3f2","source":{"kind":"arxiv","id":"1906.07318","version":3},"attestation_state":"computed","paper":{"title":"Deep Active Learning for Anchor User Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Anfeng Cheng, Chuan Zhou, Hong Yang, Jianlong Tan, Jia Wu, Lei Li, Li Guo","submitted_at":"2019-06-18T00:31:59Z","abstract_excerpt":"Predicting pairs of anchor users plays an important role in the cross-network analysis. Due to the expensive costs of labeling anchor users for training prediction models, we consider in this paper the problem of minimizing the number of user pairs across multiple networks for labeling as to improve the accuracy of the prediction. To this end, we present a deep active learning model for anchor user prediction (DALAUP for short). However, active learning for anchor user sampling meets the challenges of non-i.i.d. user pair data caused by network structures and the correlation among anchor or no"},"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":"1906.07318","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-18T00:31:59Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"cf5a3e67363b5af567d797a308f22fc316767c3683fa52a77cfded2f68e54630","abstract_canon_sha256":"78fcc61c4b9ac80f7ed6565b6c94e652aefdbf65ef5051833b9f1a0960a10be8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:17:51.896785Z","signature_b64":"on2RgYovGo6HImrh80zcfcP6CK6cyYjjImslIZCVt2PIBjiHbIkGvtCaGCnVrnwPTwLjp+q2jPaiDFFy+AF4CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08a97ccbfdabb8af9edbb73c0c31430e2e82ac1d1cedb99dfd3e91d89bbad3f2","last_reissued_at":"2026-07-05T00:17:51.896333Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:17:51.896333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deep Active Learning for Anchor User Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Anfeng Cheng, Chuan Zhou, Hong Yang, Jianlong Tan, Jia Wu, Lei Li, Li Guo","submitted_at":"2019-06-18T00:31:59Z","abstract_excerpt":"Predicting pairs of anchor users plays an important role in the cross-network analysis. Due to the expensive costs of labeling anchor users for training prediction models, we consider in this paper the problem of minimizing the number of user pairs across multiple networks for labeling as to improve the accuracy of the prediction. To this end, we present a deep active learning model for anchor user prediction (DALAUP for short). However, active learning for anchor user sampling meets the challenges of non-i.i.d. user pair data caused by network structures and the correlation among anchor or no"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.07318","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1906.07318/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":"1906.07318","created_at":"2026-07-05T00:17:51.896391+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.07318v3","created_at":"2026-07-05T00:17:51.896391+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.07318","created_at":"2026-07-05T00:17:51.896391+00:00"},{"alias_kind":"pith_short_12","alias_value":"BCUXZS75VO4K","created_at":"2026-07-05T00:17:51.896391+00:00"},{"alias_kind":"pith_short_16","alias_value":"BCUXZS75VO4K7HW3","created_at":"2026-07-05T00:17:51.896391+00:00"},{"alias_kind":"pith_short_8","alias_value":"BCUXZS75","created_at":"2026-07-05T00:17:51.896391+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.22434","citing_title":"RANA: Robust Active Learning for Noisy Network Alignment","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BCUXZS75VO4K7HW3W46AYMKDBY","json":"https://pith.science/pith/BCUXZS75VO4K7HW3W46AYMKDBY.json","graph_json":"https://pith.science/api/pith-number/BCUXZS75VO4K7HW3W46AYMKDBY/graph.json","events_json":"https://pith.science/api/pith-number/BCUXZS75VO4K7HW3W46AYMKDBY/events.json","paper":"https://pith.science/paper/BCUXZS75"},"agent_actions":{"view_html":"https://pith.science/pith/BCUXZS75VO4K7HW3W46AYMKDBY","download_json":"https://pith.science/pith/BCUXZS75VO4K7HW3W46AYMKDBY.json","view_paper":"https://pith.science/paper/BCUXZS75","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.07318&json=true","fetch_graph":"https://pith.science/api/pith-number/BCUXZS75VO4K7HW3W46AYMKDBY/graph.json","fetch_events":"https://pith.science/api/pith-number/BCUXZS75VO4K7HW3W46AYMKDBY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BCUXZS75VO4K7HW3W46AYMKDBY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BCUXZS75VO4K7HW3W46AYMKDBY/action/storage_attestation","attest_author":"https://pith.science/pith/BCUXZS75VO4K7HW3W46AYMKDBY/action/author_attestation","sign_citation":"https://pith.science/pith/BCUXZS75VO4K7HW3W46AYMKDBY/action/citation_signature","submit_replication":"https://pith.science/pith/BCUXZS75VO4K7HW3W46AYMKDBY/action/replication_record"}},"created_at":"2026-07-05T00:17:51.896391+00:00","updated_at":"2026-07-05T00:17:51.896391+00:00"}