{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:NT6LRYQZCP5FHT2STOPXFL5BW6","short_pith_number":"pith:NT6LRYQZ","schema_version":"1.0","canonical_sha256":"6cfcb8e21913fa53cf529b9f72afa1b7aa9706dcb2c73ede9bcf5fa99574bf6a","source":{"kind":"arxiv","id":"2105.12419","version":2},"attestation_state":"computed","paper":{"title":"Adversarial Attack Framework on Graph Embedding Models with Limited Knowledge","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.SI"],"primary_cat":"cs.LG","authors_text":"Heng Chang, Honglei Zhang, Junzhou Huang, Peng Cui, Tingyang Xu, Wenbing Huang, Wenwu Zhu, Xin Wang, Yu Rong","submitted_at":"2021-05-26T09:18:58Z","abstract_excerpt":"With the success of the graph embedding model in both academic and industry areas, the robustness of graph embedding against adversarial attack inevitably becomes a crucial problem in graph learning. Existing works usually perform the attack in a white-box fashion: they need to access the predictions/labels to construct their adversarial loss. However, the inaccessibility of predictions/labels makes the white-box attack impractical to a real graph learning system. This paper promotes current frameworks in a more general and flexible sense -- we demand to attack various kinds of graph embedding"},"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":"2105.12419","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-05-26T09:18:58Z","cross_cats_sorted":["cs.CR","cs.SI"],"title_canon_sha256":"5df94a9059f21a6b2243888b65090bac7476383f68ea91fbab0059a1fc097636","abstract_canon_sha256":"ae5927fec543ee6d955f1b1c05509c772e31fe66fa73f5e2e3d67a527c40a975"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:00:53.142452Z","signature_b64":"3Klh+NDgtFxtG81hEOiSISbvrmBsslLvwxF8XD1MPq1Cn2/ut6BCrz0h1hWwEU3h1ErV0OtpVX01l+hk7hwtCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6cfcb8e21913fa53cf529b9f72afa1b7aa9706dcb2c73ede9bcf5fa99574bf6a","last_reissued_at":"2026-07-05T04:00:53.141953Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:00:53.141953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adversarial Attack Framework on Graph Embedding Models with Limited Knowledge","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.SI"],"primary_cat":"cs.LG","authors_text":"Heng Chang, Honglei Zhang, Junzhou Huang, Peng Cui, Tingyang Xu, Wenbing Huang, Wenwu Zhu, Xin Wang, Yu Rong","submitted_at":"2021-05-26T09:18:58Z","abstract_excerpt":"With the success of the graph embedding model in both academic and industry areas, the robustness of graph embedding against adversarial attack inevitably becomes a crucial problem in graph learning. Existing works usually perform the attack in a white-box fashion: they need to access the predictions/labels to construct their adversarial loss. However, the inaccessibility of predictions/labels makes the white-box attack impractical to a real graph learning system. This paper promotes current frameworks in a more general and flexible sense -- we demand to attack various kinds of graph embedding"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.12419","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2105.12419/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":"2105.12419","created_at":"2026-07-05T04:00:53.142011+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.12419v2","created_at":"2026-07-05T04:00:53.142011+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.12419","created_at":"2026-07-05T04:00:53.142011+00:00"},{"alias_kind":"pith_short_12","alias_value":"NT6LRYQZCP5F","created_at":"2026-07-05T04:00:53.142011+00:00"},{"alias_kind":"pith_short_16","alias_value":"NT6LRYQZCP5FHT2S","created_at":"2026-07-05T04:00:53.142011+00:00"},{"alias_kind":"pith_short_8","alias_value":"NT6LRYQZ","created_at":"2026-07-05T04:00:53.142011+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/NT6LRYQZCP5FHT2STOPXFL5BW6","json":"https://pith.science/pith/NT6LRYQZCP5FHT2STOPXFL5BW6.json","graph_json":"https://pith.science/api/pith-number/NT6LRYQZCP5FHT2STOPXFL5BW6/graph.json","events_json":"https://pith.science/api/pith-number/NT6LRYQZCP5FHT2STOPXFL5BW6/events.json","paper":"https://pith.science/paper/NT6LRYQZ"},"agent_actions":{"view_html":"https://pith.science/pith/NT6LRYQZCP5FHT2STOPXFL5BW6","download_json":"https://pith.science/pith/NT6LRYQZCP5FHT2STOPXFL5BW6.json","view_paper":"https://pith.science/paper/NT6LRYQZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.12419&json=true","fetch_graph":"https://pith.science/api/pith-number/NT6LRYQZCP5FHT2STOPXFL5BW6/graph.json","fetch_events":"https://pith.science/api/pith-number/NT6LRYQZCP5FHT2STOPXFL5BW6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NT6LRYQZCP5FHT2STOPXFL5BW6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NT6LRYQZCP5FHT2STOPXFL5BW6/action/storage_attestation","attest_author":"https://pith.science/pith/NT6LRYQZCP5FHT2STOPXFL5BW6/action/author_attestation","sign_citation":"https://pith.science/pith/NT6LRYQZCP5FHT2STOPXFL5BW6/action/citation_signature","submit_replication":"https://pith.science/pith/NT6LRYQZCP5FHT2STOPXFL5BW6/action/replication_record"}},"created_at":"2026-07-05T04:00:53.142011+00:00","updated_at":"2026-07-05T04:00:53.142011+00:00"}