{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:W3Y7WPRIPNTI32FPJINHXVVNZ7","short_pith_number":"pith:W3Y7WPRI","canonical_record":{"source":{"id":"1708.06525","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2017-08-22T07:53:51Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"6a123625becbe7e2de92183a925611d57f0509df15539c9d96f07de6c359d3c2","abstract_canon_sha256":"7d2977a1153e17bb5fc99f157bb81135b43d16d3b364f18f01633c20038fd335"},"schema_version":"1.0"},"canonical_sha256":"b6f1fb3e287b668de8af4a1a7bd6adcfc942f49699ef26ed49c9be5096d875b1","source":{"kind":"arxiv","id":"1708.06525","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.06525","created_at":"2026-05-18T00:09:42Z"},{"alias_kind":"arxiv_version","alias_value":"1708.06525v4","created_at":"2026-05-18T00:09:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06525","created_at":"2026-05-18T00:09:42Z"},{"alias_kind":"pith_short_12","alias_value":"W3Y7WPRIPNTI","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"W3Y7WPRIPNTI32FP","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"W3Y7WPRI","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:W3Y7WPRIPNTI32FPJINHXVVNZ7","target":"record","payload":{"canonical_record":{"source":{"id":"1708.06525","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2017-08-22T07:53:51Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"6a123625becbe7e2de92183a925611d57f0509df15539c9d96f07de6c359d3c2","abstract_canon_sha256":"7d2977a1153e17bb5fc99f157bb81135b43d16d3b364f18f01633c20038fd335"},"schema_version":"1.0"},"canonical_sha256":"b6f1fb3e287b668de8af4a1a7bd6adcfc942f49699ef26ed49c9be5096d875b1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:42.143825Z","signature_b64":"rGAzGu6ZL88Y+LQGp6LDCUyNRPuwSyxuFidPEhOCsMlxDNk0zbNKnmEwEh6L5QJsdjiXeED7KDeXAWdgIZo9BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6f1fb3e287b668de8af4a1a7bd6adcfc942f49699ef26ed49c9be5096d875b1","last_reissued_at":"2026-05-18T00:09:42.143024Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:42.143024Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.06525","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:09:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wGLtAwE59ODapbmiwvfDj8qHUoI33cLeVj9vyGgHoW/mgN74CxfG202YvVujb6f/LBUQa0zkkIrj/aOQNSS4Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:51:17.278823Z"},"content_sha256":"fa968e12a7883d4cd1ca2cc3015efb4acb62c5c44129e3e1d73e73bcb0775dfa","schema_version":"1.0","event_id":"sha256:fa968e12a7883d4cd1ca2cc3015efb4acb62c5c44129e3e1d73e73bcb0775dfa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:W3Y7WPRIPNTI32FPJINHXVVNZ7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Neural Network-based Graph Embedding for Cross-Platform Binary Code Similarity Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.CR","authors_text":"Chang Liu, Dawn Song, Heng Yin, Le Song, Qian Feng, Xiaojun Xu","submitted_at":"2017-08-22T07:53:51Z","abstract_excerpt":"The problem of cross-platform binary code similarity detection aims at detecting whether two binary functions coming from different platforms are similar or not. It has many security applications, including plagiarism detection, malware detection, vulnerability search, etc. Existing approaches rely on approximate graph matching algorithms, which are inevitably slow and sometimes inaccurate, and hard to adapt to a new task. To address these issues, in this work, we propose a novel neural network-based approach to compute the embedding, i.e., a numeric vector, based on the control flow graph of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06525","kind":"arxiv","version":4},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:09:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"INZNzoA5VGTOGzVNaP+qiKQf4fySV/tM1S3NprWVHDEsK6exni7WnRq5OJqnHIxF4FR+EXi2Y7v8siSOTyCnAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:51:17.279455Z"},"content_sha256":"b6219142223d6749deadf4e9727f057db372c00bd2524bae1fc4d47fcabed251","schema_version":"1.0","event_id":"sha256:b6219142223d6749deadf4e9727f057db372c00bd2524bae1fc4d47fcabed251"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W3Y7WPRIPNTI32FPJINHXVVNZ7/bundle.json","state_url":"https://pith.science/pith/W3Y7WPRIPNTI32FPJINHXVVNZ7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W3Y7WPRIPNTI32FPJINHXVVNZ7/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T05:51:17Z","links":{"resolver":"https://pith.science/pith/W3Y7WPRIPNTI32FPJINHXVVNZ7","bundle":"https://pith.science/pith/W3Y7WPRIPNTI32FPJINHXVVNZ7/bundle.json","state":"https://pith.science/pith/W3Y7WPRIPNTI32FPJINHXVVNZ7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W3Y7WPRIPNTI32FPJINHXVVNZ7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:W3Y7WPRIPNTI32FPJINHXVVNZ7","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"7d2977a1153e17bb5fc99f157bb81135b43d16d3b364f18f01633c20038fd335","cross_cats_sorted":["cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2017-08-22T07:53:51Z","title_canon_sha256":"6a123625becbe7e2de92183a925611d57f0509df15539c9d96f07de6c359d3c2"},"schema_version":"1.0","source":{"id":"1708.06525","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.06525","created_at":"2026-05-18T00:09:42Z"},{"alias_kind":"arxiv_version","alias_value":"1708.06525v4","created_at":"2026-05-18T00:09:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06525","created_at":"2026-05-18T00:09:42Z"},{"alias_kind":"pith_short_12","alias_value":"W3Y7WPRIPNTI","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"W3Y7WPRIPNTI32FP","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"W3Y7WPRI","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:b6219142223d6749deadf4e9727f057db372c00bd2524bae1fc4d47fcabed251","target":"graph","created_at":"2026-05-18T00:09:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"The problem of cross-platform binary code similarity detection aims at detecting whether two binary functions coming from different platforms are similar or not. It has many security applications, including plagiarism detection, malware detection, vulnerability search, etc. Existing approaches rely on approximate graph matching algorithms, which are inevitably slow and sometimes inaccurate, and hard to adapt to a new task. To address these issues, in this work, we propose a novel neural network-based approach to compute the embedding, i.e., a numeric vector, based on the control flow graph of ","authors_text":"Chang Liu, Dawn Song, Heng Yin, Le Song, Qian Feng, Xiaojun Xu","cross_cats":["cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2017-08-22T07:53:51Z","title":"Neural Network-based Graph Embedding for Cross-Platform Binary Code Similarity Detection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06525","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:fa968e12a7883d4cd1ca2cc3015efb4acb62c5c44129e3e1d73e73bcb0775dfa","target":"record","created_at":"2026-05-18T00:09:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"7d2977a1153e17bb5fc99f157bb81135b43d16d3b364f18f01633c20038fd335","cross_cats_sorted":["cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2017-08-22T07:53:51Z","title_canon_sha256":"6a123625becbe7e2de92183a925611d57f0509df15539c9d96f07de6c359d3c2"},"schema_version":"1.0","source":{"id":"1708.06525","kind":"arxiv","version":4}},"canonical_sha256":"b6f1fb3e287b668de8af4a1a7bd6adcfc942f49699ef26ed49c9be5096d875b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b6f1fb3e287b668de8af4a1a7bd6adcfc942f49699ef26ed49c9be5096d875b1","first_computed_at":"2026-05-18T00:09:42.143024Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:42.143024Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rGAzGu6ZL88Y+LQGp6LDCUyNRPuwSyxuFidPEhOCsMlxDNk0zbNKnmEwEh6L5QJsdjiXeED7KDeXAWdgIZo9BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:42.143825Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.06525","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa968e12a7883d4cd1ca2cc3015efb4acb62c5c44129e3e1d73e73bcb0775dfa","sha256:b6219142223d6749deadf4e9727f057db372c00bd2524bae1fc4d47fcabed251"],"state_sha256":"2ca8b8a88482494045eadc8c01468624a8b19e7a184ac9780e26809cc6228511"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uAZhe/OQjVmXBRUxkgSEgkDY6y1oLq001JnR1SXNOI3s/0KqD4R6LLpk2bqEEzceqymdo4n/pDTFZ6SvVWiCCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T05:51:17.282043Z","bundle_sha256":"5c09116db41cfef8ba023fba1cfe108c5a5bc82195c32ea2f8039f91ade1578b"}}