{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:4EI7A2SKHEU6DL5HRDLJEVHXKR","short_pith_number":"pith:4EI7A2SK","canonical_record":{"source":{"id":"1810.09683","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-23T06:45:54Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"7a2d1e7f65fafc896bf3330736029f39107706c8c5b111138731075b77be4a4c","abstract_canon_sha256":"2fa1130ca5c7a70b44b39f23d856f99e33fa0d290cde97a7e3a21bc5ae92654c"},"schema_version":"1.0"},"canonical_sha256":"e111f06a4a3929e1afa788d69254f7544560d1705958fb8607f236775fcaf78c","source":{"kind":"arxiv","id":"1810.09683","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.09683","created_at":"2026-05-18T00:00:47Z"},{"alias_kind":"arxiv_version","alias_value":"1810.09683v2","created_at":"2026-05-18T00:00:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.09683","created_at":"2026-05-18T00:00:47Z"},{"alias_kind":"pith_short_12","alias_value":"4EI7A2SKHEU6","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4EI7A2SKHEU6DL5H","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4EI7A2SK","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:4EI7A2SKHEU6DL5HRDLJEVHXKR","target":"record","payload":{"canonical_record":{"source":{"id":"1810.09683","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-23T06:45:54Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"7a2d1e7f65fafc896bf3330736029f39107706c8c5b111138731075b77be4a4c","abstract_canon_sha256":"2fa1130ca5c7a70b44b39f23d856f99e33fa0d290cde97a7e3a21bc5ae92654c"},"schema_version":"1.0"},"canonical_sha256":"e111f06a4a3929e1afa788d69254f7544560d1705958fb8607f236775fcaf78c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:47.133369Z","signature_b64":"yO68LlbHhLxPGJwU18sLcEDQJSDb6+Imwir4TfQOMlNqWOETHMBxbxnRY9JrTCGksh0fIoJpcs4qOucW343sCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e111f06a4a3929e1afa788d69254f7544560d1705958fb8607f236775fcaf78c","last_reissued_at":"2026-05-18T00:00:47.132963Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:47.132963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.09683","source_version":2,"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:00:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qc4og1XmSvpTunzgR7Zoup/Z0BowXA5Ys2sg/pbjdqgdprifD36HLmD+VWj+P/hL1/13VU/czDpPAWaGnnYUBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T13:14:52.731151Z"},"content_sha256":"b3820d9e1cf41bf88d80326c13f82c76de8bbda1f9ee7f98ef5a0260b9c6cd99","schema_version":"1.0","event_id":"sha256:b3820d9e1cf41bf88d80326c13f82c76de8bbda1f9ee7f98ef5a0260b9c6cd99"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:4EI7A2SKHEU6DL5HRDLJEVHXKR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unsupervised Features Extraction for Binary Similarity Using Graph Embedding Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LG","authors_text":"Fabio Petroni, Giuseppe Antonio Di Luna, Leonardo Querzoni, Luca Massarelli, Roberto Baldoni","submitted_at":"2018-10-23T06:45:54Z","abstract_excerpt":"In this paper we consider the binary similarity problem that consists in determining if two binary functions are similar only considering their compiled form. This problem is know to be crucial in several application scenarios, such as copyright disputes, malware analysis, vulnerability detection, etc. The current state-of-the-art solutions in this field work by creating an embedding model that maps binary functions into vectors in $\\mathbb{R}^{n}$. Such embedding model captures syntactic and semantic similarity between binaries, i.e., similar binary functions are mapped to points that are clo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.09683","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":""},"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:00:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6YlzY2t0+FeZMBU2+DCmiIpd3XL4FZtUejy6pDm3nteAWCTcEriS/0IqQ18NAh7r3COiwdlXSWFAlrIFasemDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T13:14:52.731935Z"},"content_sha256":"60a14a68dccd3ced224674a1c971ad7f5b038f5ddf391f75ae7349a8c5d95a4e","schema_version":"1.0","event_id":"sha256:60a14a68dccd3ced224674a1c971ad7f5b038f5ddf391f75ae7349a8c5d95a4e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4EI7A2SKHEU6DL5HRDLJEVHXKR/bundle.json","state_url":"https://pith.science/pith/4EI7A2SKHEU6DL5HRDLJEVHXKR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4EI7A2SKHEU6DL5HRDLJEVHXKR/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-06-10T13:14:52Z","links":{"resolver":"https://pith.science/pith/4EI7A2SKHEU6DL5HRDLJEVHXKR","bundle":"https://pith.science/pith/4EI7A2SKHEU6DL5HRDLJEVHXKR/bundle.json","state":"https://pith.science/pith/4EI7A2SKHEU6DL5HRDLJEVHXKR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4EI7A2SKHEU6DL5HRDLJEVHXKR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4EI7A2SKHEU6DL5HRDLJEVHXKR","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":"2fa1130ca5c7a70b44b39f23d856f99e33fa0d290cde97a7e3a21bc5ae92654c","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-23T06:45:54Z","title_canon_sha256":"7a2d1e7f65fafc896bf3330736029f39107706c8c5b111138731075b77be4a4c"},"schema_version":"1.0","source":{"id":"1810.09683","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.09683","created_at":"2026-05-18T00:00:47Z"},{"alias_kind":"arxiv_version","alias_value":"1810.09683v2","created_at":"2026-05-18T00:00:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.09683","created_at":"2026-05-18T00:00:47Z"},{"alias_kind":"pith_short_12","alias_value":"4EI7A2SKHEU6","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4EI7A2SKHEU6DL5H","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4EI7A2SK","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:60a14a68dccd3ced224674a1c971ad7f5b038f5ddf391f75ae7349a8c5d95a4e","target":"graph","created_at":"2026-05-18T00:00:47Z","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":"In this paper we consider the binary similarity problem that consists in determining if two binary functions are similar only considering their compiled form. This problem is know to be crucial in several application scenarios, such as copyright disputes, malware analysis, vulnerability detection, etc. The current state-of-the-art solutions in this field work by creating an embedding model that maps binary functions into vectors in $\\mathbb{R}^{n}$. Such embedding model captures syntactic and semantic similarity between binaries, i.e., similar binary functions are mapped to points that are clo","authors_text":"Fabio Petroni, Giuseppe Antonio Di Luna, Leonardo Querzoni, Luca Massarelli, Roberto Baldoni","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-23T06:45:54Z","title":"Unsupervised Features Extraction for Binary Similarity Using Graph Embedding Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.09683","kind":"arxiv","version":2},"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:b3820d9e1cf41bf88d80326c13f82c76de8bbda1f9ee7f98ef5a0260b9c6cd99","target":"record","created_at":"2026-05-18T00:00:47Z","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":"2fa1130ca5c7a70b44b39f23d856f99e33fa0d290cde97a7e3a21bc5ae92654c","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-23T06:45:54Z","title_canon_sha256":"7a2d1e7f65fafc896bf3330736029f39107706c8c5b111138731075b77be4a4c"},"schema_version":"1.0","source":{"id":"1810.09683","kind":"arxiv","version":2}},"canonical_sha256":"e111f06a4a3929e1afa788d69254f7544560d1705958fb8607f236775fcaf78c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e111f06a4a3929e1afa788d69254f7544560d1705958fb8607f236775fcaf78c","first_computed_at":"2026-05-18T00:00:47.132963Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:47.132963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yO68LlbHhLxPGJwU18sLcEDQJSDb6+Imwir4TfQOMlNqWOETHMBxbxnRY9JrTCGksh0fIoJpcs4qOucW343sCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:47.133369Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.09683","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b3820d9e1cf41bf88d80326c13f82c76de8bbda1f9ee7f98ef5a0260b9c6cd99","sha256:60a14a68dccd3ced224674a1c971ad7f5b038f5ddf391f75ae7349a8c5d95a4e"],"state_sha256":"8804f7120c1d3503fdb0a75eec3a17fd9eda86c8576cb2e72fa61b5b0f93b874"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bhP4+t+43CCKb2RwGsWSkmfxVhG3ke7JXVBiErb0YWKUJbth+56s/E3XTVDJF7YmGFU1zYhBgNqJh8uSsu9RDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T13:14:52.736412Z","bundle_sha256":"52f8ec8c5fa890ab6270765ad9312dcbab0d7f2be0fbc97cdb2ee87202ee1078"}}