{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:Y4YIMHN3IRDBHL5W752LBVCOVB","short_pith_number":"pith:Y4YIMHN3","schema_version":"1.0","canonical_sha256":"c730861dbb444613afb6ff74b0d44ea873ce1cb598df7a224f7151f51392da40","source":{"kind":"arxiv","id":"2007.00772","version":3},"attestation_state":"computed","paper":{"title":"Robust and Accurate Authorship Attribution via Program Normalization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ke Wang, Mihai Christodorescu, Mohannad Alhanahnah, Somesh Jha, Yizhen Wang","submitted_at":"2020-07-01T21:27:38Z","abstract_excerpt":"Source code attribution approaches have achieved remarkable accuracy thanks to the rapid advances in deep learning. However, recent studies shed light on their vulnerability to adversarial attacks. In particular, they can be easily deceived by adversaries who attempt to either create a forgery of another author or to mask the original author. To address these emerging issues, we formulate this security challenge into a general threat model, the $\\textit{relational adversary}$, that allows an arbitrary number of the semantics-preserving transformations to be applied to an input in any problem s"},"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":"2007.00772","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-01T21:27:38Z","cross_cats_sorted":["cs.CR","stat.ML"],"title_canon_sha256":"a4901a7097e0d1ac2781c4322c6f0da9cb80cb3e05e8643f51f7255b41fb9bd9","abstract_canon_sha256":"6c731a3ed9ebcb983cfcd5520e705351f20704c37077b331e94336cd842e88f5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:00:11.555055Z","signature_b64":"3JcRM5iFSdOv7TjTwwCmpLmULBmLGiuTcftV9ZxiHa4QpW+x5UiDa7LBEt+0Ikf3gYu+rNq09OuTwk2ctoQwDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c730861dbb444613afb6ff74b0d44ea873ce1cb598df7a224f7151f51392da40","last_reissued_at":"2026-07-05T04:00:11.554655Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:00:11.554655Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust and Accurate Authorship Attribution via Program Normalization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ke Wang, Mihai Christodorescu, Mohannad Alhanahnah, Somesh Jha, Yizhen Wang","submitted_at":"2020-07-01T21:27:38Z","abstract_excerpt":"Source code attribution approaches have achieved remarkable accuracy thanks to the rapid advances in deep learning. However, recent studies shed light on their vulnerability to adversarial attacks. In particular, they can be easily deceived by adversaries who attempt to either create a forgery of another author or to mask the original author. To address these emerging issues, we formulate this security challenge into a general threat model, the $\\textit{relational adversary}$, that allows an arbitrary number of the semantics-preserving transformations to be applied to an input in any problem s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.00772","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/2007.00772/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":"2007.00772","created_at":"2026-07-05T04:00:11.554711+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.00772v3","created_at":"2026-07-05T04:00:11.554711+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.00772","created_at":"2026-07-05T04:00:11.554711+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y4YIMHN3IRDB","created_at":"2026-07-05T04:00:11.554711+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y4YIMHN3IRDBHL5W","created_at":"2026-07-05T04:00:11.554711+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y4YIMHN3","created_at":"2026-07-05T04:00:11.554711+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.02695","citing_title":"Stylometric Defenses Against Author Impersonation in Software Repositories","ref_index":54,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Y4YIMHN3IRDBHL5W752LBVCOVB","json":"https://pith.science/pith/Y4YIMHN3IRDBHL5W752LBVCOVB.json","graph_json":"https://pith.science/api/pith-number/Y4YIMHN3IRDBHL5W752LBVCOVB/graph.json","events_json":"https://pith.science/api/pith-number/Y4YIMHN3IRDBHL5W752LBVCOVB/events.json","paper":"https://pith.science/paper/Y4YIMHN3"},"agent_actions":{"view_html":"https://pith.science/pith/Y4YIMHN3IRDBHL5W752LBVCOVB","download_json":"https://pith.science/pith/Y4YIMHN3IRDBHL5W752LBVCOVB.json","view_paper":"https://pith.science/paper/Y4YIMHN3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.00772&json=true","fetch_graph":"https://pith.science/api/pith-number/Y4YIMHN3IRDBHL5W752LBVCOVB/graph.json","fetch_events":"https://pith.science/api/pith-number/Y4YIMHN3IRDBHL5W752LBVCOVB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y4YIMHN3IRDBHL5W752LBVCOVB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y4YIMHN3IRDBHL5W752LBVCOVB/action/storage_attestation","attest_author":"https://pith.science/pith/Y4YIMHN3IRDBHL5W752LBVCOVB/action/author_attestation","sign_citation":"https://pith.science/pith/Y4YIMHN3IRDBHL5W752LBVCOVB/action/citation_signature","submit_replication":"https://pith.science/pith/Y4YIMHN3IRDBHL5W752LBVCOVB/action/replication_record"}},"created_at":"2026-07-05T04:00:11.554711+00:00","updated_at":"2026-07-05T04:00:11.554711+00:00"}