{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:WLCFTX7N3G237U57S2LAEQVJZT","short_pith_number":"pith:WLCFTX7N","schema_version":"1.0","canonical_sha256":"b2c459dfedd9b5bfd3bf96960242a9ccc886a748803f429d8fbed666502ce101","source":{"kind":"arxiv","id":"1708.09056","version":1},"attestation_state":"computed","paper":{"title":"Practical Attacks Against Graph-based Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CR","authors_text":"Athanasios Kountouras, Fabian Monrose, Manos Antonakakis, Nikolaos Vasiloglou, Roberto Perdisci, Yacin Nadji, Yizheng Chen","submitted_at":"2017-08-29T23:22:31Z","abstract_excerpt":"Graph modeling allows numerous security problems to be tackled in a general way, however, little work has been done to understand their ability to withstand adversarial attacks. We design and evaluate two novel graph attacks against a state-of-the-art network-level, graph-based detection system. Our work highlights areas in adversarial machine learning that have not yet been addressed, specifically: graph-based clustering techniques, and a global feature space where realistic attackers without perfect knowledge must be accounted for (by the defenders) in order to be practical. Even though less"},"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":"1708.09056","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2017-08-29T23:22:31Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"9865ed614a0d36f27fbe21933c549bcaf642587f64abad625d74cb6e14e631cb","abstract_canon_sha256":"fc968381be2faf9cc083f108972c79ac48c1bd08e007f97a2ccca71620e0f5a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:21.152743Z","signature_b64":"09ZfrhG6Ux+B7PdXpSJhW60zK8LgKVH/f5hrtykg+8LWl+Zm1DyGmkWKSekWlai3SUQPL5V6ahRZyAQUTLfAAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b2c459dfedd9b5bfd3bf96960242a9ccc886a748803f429d8fbed666502ce101","last_reissued_at":"2026-05-18T00:36:21.152031Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:21.152031Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Practical Attacks Against Graph-based Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CR","authors_text":"Athanasios Kountouras, Fabian Monrose, Manos Antonakakis, Nikolaos Vasiloglou, Roberto Perdisci, Yacin Nadji, Yizheng Chen","submitted_at":"2017-08-29T23:22:31Z","abstract_excerpt":"Graph modeling allows numerous security problems to be tackled in a general way, however, little work has been done to understand their ability to withstand adversarial attacks. We design and evaluate two novel graph attacks against a state-of-the-art network-level, graph-based detection system. Our work highlights areas in adversarial machine learning that have not yet been addressed, specifically: graph-based clustering techniques, and a global feature space where realistic attackers without perfect knowledge must be accounted for (by the defenders) in order to be practical. Even though less"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.09056","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":"1708.09056","created_at":"2026-05-18T00:36:21.152142+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.09056v1","created_at":"2026-05-18T00:36:21.152142+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09056","created_at":"2026-05-18T00:36:21.152142+00:00"},{"alias_kind":"pith_short_12","alias_value":"WLCFTX7N3G23","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"WLCFTX7N3G237U57","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"WLCFTX7N","created_at":"2026-05-18T12:31:53.515858+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/WLCFTX7N3G237U57S2LAEQVJZT","json":"https://pith.science/pith/WLCFTX7N3G237U57S2LAEQVJZT.json","graph_json":"https://pith.science/api/pith-number/WLCFTX7N3G237U57S2LAEQVJZT/graph.json","events_json":"https://pith.science/api/pith-number/WLCFTX7N3G237U57S2LAEQVJZT/events.json","paper":"https://pith.science/paper/WLCFTX7N"},"agent_actions":{"view_html":"https://pith.science/pith/WLCFTX7N3G237U57S2LAEQVJZT","download_json":"https://pith.science/pith/WLCFTX7N3G237U57S2LAEQVJZT.json","view_paper":"https://pith.science/paper/WLCFTX7N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.09056&json=true","fetch_graph":"https://pith.science/api/pith-number/WLCFTX7N3G237U57S2LAEQVJZT/graph.json","fetch_events":"https://pith.science/api/pith-number/WLCFTX7N3G237U57S2LAEQVJZT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WLCFTX7N3G237U57S2LAEQVJZT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WLCFTX7N3G237U57S2LAEQVJZT/action/storage_attestation","attest_author":"https://pith.science/pith/WLCFTX7N3G237U57S2LAEQVJZT/action/author_attestation","sign_citation":"https://pith.science/pith/WLCFTX7N3G237U57S2LAEQVJZT/action/citation_signature","submit_replication":"https://pith.science/pith/WLCFTX7N3G237U57S2LAEQVJZT/action/replication_record"}},"created_at":"2026-05-18T00:36:21.152142+00:00","updated_at":"2026-05-18T00:36:21.152142+00:00"}