{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:BEMA6K7KQJTMZPEWLE5R5POLJW","short_pith_number":"pith:BEMA6K7K","schema_version":"1.0","canonical_sha256":"09180f2bea8266ccbc96593b1ebdcb4db8cc076abe4ab543677ca22a6e9028c5","source":{"kind":"arxiv","id":"1908.01297","version":5},"attestation_state":"computed","paper":{"title":"A Restricted Black-box Adversarial Framework Towards Attacking Graph Embedding Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.LG","stat.ML"],"primary_cat":"cs.SI","authors_text":"Heng Chang, Honglei Zhang, Junzhou Huang, Peng Cui, Tingyang Xu, Wenbing Huang, Wenwu Zhu, Yu Rong","submitted_at":"2019-08-04T09:03:20Z","abstract_excerpt":"With the great success of graph embedding model on both academic and industry area, the robustness of graph embedding against adversarial attack inevitably becomes a central problem in graph learning domain. Regardless of the fruitful progress, most of the current works perform the attack in a white-box fashion: they need to access the model predictions and labels to construct their adversarial loss. However, the inaccessibility of model predictions in real systems makes the white-box attack impractical to real graph learning system. This paper promotes current frameworks in a more general and"},"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":"1908.01297","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-08-04T09:03:20Z","cross_cats_sorted":["cs.CR","cs.LG","stat.ML"],"title_canon_sha256":"cab4ffe927ea3718ba7b0204e71d33a894392e9db60a678f0456624c9cc005b1","abstract_canon_sha256":"29f3f699405dc1b6787c8e8bc90b81fcc4943669ef4ea4e930b573a78df5dd69"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:26:58.124255Z","signature_b64":"H0TUvzxdEveoVTen6svPk8PBWGlOc9k0yJ7CvwDY46xYFEbzZiM0kSlYH8m+0ZsT3L/h+Q3+RPQsfRgXPJB6CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09180f2bea8266ccbc96593b1ebdcb4db8cc076abe4ab543677ca22a6e9028c5","last_reissued_at":"2026-07-05T00:26:58.123818Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:26:58.123818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Restricted Black-box Adversarial Framework Towards Attacking Graph Embedding Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.LG","stat.ML"],"primary_cat":"cs.SI","authors_text":"Heng Chang, Honglei Zhang, Junzhou Huang, Peng Cui, Tingyang Xu, Wenbing Huang, Wenwu Zhu, Yu Rong","submitted_at":"2019-08-04T09:03:20Z","abstract_excerpt":"With the great success of graph embedding model on both academic and industry area, the robustness of graph embedding against adversarial attack inevitably becomes a central problem in graph learning domain. Regardless of the fruitful progress, most of the current works perform the attack in a white-box fashion: they need to access the model predictions and labels to construct their adversarial loss. However, the inaccessibility of model predictions in real systems makes the white-box attack impractical to real graph learning system. This paper promotes current frameworks in a more general and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.01297","kind":"arxiv","version":5},"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/1908.01297/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":"1908.01297","created_at":"2026-07-05T00:26:58.123883+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.01297v5","created_at":"2026-07-05T00:26:58.123883+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.01297","created_at":"2026-07-05T00:26:58.123883+00:00"},{"alias_kind":"pith_short_12","alias_value":"BEMA6K7KQJTM","created_at":"2026-07-05T00:26:58.123883+00:00"},{"alias_kind":"pith_short_16","alias_value":"BEMA6K7KQJTMZPEW","created_at":"2026-07-05T00:26:58.123883+00:00"},{"alias_kind":"pith_short_8","alias_value":"BEMA6K7K","created_at":"2026-07-05T00:26:58.123883+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/BEMA6K7KQJTMZPEWLE5R5POLJW","json":"https://pith.science/pith/BEMA6K7KQJTMZPEWLE5R5POLJW.json","graph_json":"https://pith.science/api/pith-number/BEMA6K7KQJTMZPEWLE5R5POLJW/graph.json","events_json":"https://pith.science/api/pith-number/BEMA6K7KQJTMZPEWLE5R5POLJW/events.json","paper":"https://pith.science/paper/BEMA6K7K"},"agent_actions":{"view_html":"https://pith.science/pith/BEMA6K7KQJTMZPEWLE5R5POLJW","download_json":"https://pith.science/pith/BEMA6K7KQJTMZPEWLE5R5POLJW.json","view_paper":"https://pith.science/paper/BEMA6K7K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.01297&json=true","fetch_graph":"https://pith.science/api/pith-number/BEMA6K7KQJTMZPEWLE5R5POLJW/graph.json","fetch_events":"https://pith.science/api/pith-number/BEMA6K7KQJTMZPEWLE5R5POLJW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BEMA6K7KQJTMZPEWLE5R5POLJW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BEMA6K7KQJTMZPEWLE5R5POLJW/action/storage_attestation","attest_author":"https://pith.science/pith/BEMA6K7KQJTMZPEWLE5R5POLJW/action/author_attestation","sign_citation":"https://pith.science/pith/BEMA6K7KQJTMZPEWLE5R5POLJW/action/citation_signature","submit_replication":"https://pith.science/pith/BEMA6K7KQJTMZPEWLE5R5POLJW/action/replication_record"}},"created_at":"2026-07-05T00:26:58.123883+00:00","updated_at":"2026-07-05T00:26:58.123883+00:00"}