{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:7FU6E7GJJLMANONARYCHFSZQLJ","short_pith_number":"pith:7FU6E7GJ","schema_version":"1.0","canonical_sha256":"f969e27cc94ad806b9a08e0472cb305a405e3f5c72bff365caccbc53cb6852bb","source":{"kind":"arxiv","id":"1811.05296","version":4},"attestation_state":"computed","paper":{"title":"SAFE: Self-Attentive Function Embeddings for Binary Similarity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CR","authors_text":"Fabio Petroni, Giuseppe Antonio Di Luna, Leonardo Querzoni, Luca Massarelli, Roberto Baldoni","submitted_at":"2018-11-13T14:01:16Z","abstract_excerpt":"The binary similarity problem consists in determining if two functions are similar by only considering their compiled form. Advanced techniques for binary similarity recently gained momentum as they can be applied in several fields, such as copyright disputes, malware analysis, vulnerability detection, etc., and thus have an immediate practical impact. Current solutions compare functions by first transforming their binary code in multi-dimensional vector representations (embeddings), and then comparing vectors through simple and efficient geometric operations. However, embeddings are usually d"},"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":"1811.05296","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-11-13T14:01:16Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"dc778d973f2b49159a8156a6dcae0e0eb6451f9945f145f6c0c291ebf77b4213","abstract_canon_sha256":"28f86112940aaf4d6fae53a453d238f4855b9ed73a447a73cca25e5eee2b6600"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:27:15.457161Z","signature_b64":"uqBgCpDphwTcab/lhaVJ7j8nYjo410xi/L5IT7QfaKkl0O+M7r2h+ehUbqKzGhxIyXtUN0P0AIl+6KO5AeYCBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f969e27cc94ad806b9a08e0472cb305a405e3f5c72bff365caccbc53cb6852bb","last_reissued_at":"2026-07-05T00:27:15.456726Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:27:15.456726Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SAFE: Self-Attentive Function Embeddings for Binary Similarity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CR","authors_text":"Fabio Petroni, Giuseppe Antonio Di Luna, Leonardo Querzoni, Luca Massarelli, Roberto Baldoni","submitted_at":"2018-11-13T14:01:16Z","abstract_excerpt":"The binary similarity problem consists in determining if two functions are similar by only considering their compiled form. Advanced techniques for binary similarity recently gained momentum as they can be applied in several fields, such as copyright disputes, malware analysis, vulnerability detection, etc., and thus have an immediate practical impact. Current solutions compare functions by first transforming their binary code in multi-dimensional vector representations (embeddings), and then comparing vectors through simple and efficient geometric operations. However, embeddings are usually d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.05296","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1811.05296/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":"1811.05296","created_at":"2026-07-05T00:27:15.456788+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.05296v4","created_at":"2026-07-05T00:27:15.456788+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.05296","created_at":"2026-07-05T00:27:15.456788+00:00"},{"alias_kind":"pith_short_12","alias_value":"7FU6E7GJJLMA","created_at":"2026-07-05T00:27:15.456788+00:00"},{"alias_kind":"pith_short_16","alias_value":"7FU6E7GJJLMANONA","created_at":"2026-07-05T00:27:15.456788+00:00"},{"alias_kind":"pith_short_8","alias_value":"7FU6E7GJ","created_at":"2026-07-05T00:27:15.456788+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.21615","citing_title":"ASSEMBLAGE-DEEPHISTORY: A Cross-Build Binary Dataset with Temporal Coverage","ref_index":57,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7FU6E7GJJLMANONARYCHFSZQLJ","json":"https://pith.science/pith/7FU6E7GJJLMANONARYCHFSZQLJ.json","graph_json":"https://pith.science/api/pith-number/7FU6E7GJJLMANONARYCHFSZQLJ/graph.json","events_json":"https://pith.science/api/pith-number/7FU6E7GJJLMANONARYCHFSZQLJ/events.json","paper":"https://pith.science/paper/7FU6E7GJ"},"agent_actions":{"view_html":"https://pith.science/pith/7FU6E7GJJLMANONARYCHFSZQLJ","download_json":"https://pith.science/pith/7FU6E7GJJLMANONARYCHFSZQLJ.json","view_paper":"https://pith.science/paper/7FU6E7GJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.05296&json=true","fetch_graph":"https://pith.science/api/pith-number/7FU6E7GJJLMANONARYCHFSZQLJ/graph.json","fetch_events":"https://pith.science/api/pith-number/7FU6E7GJJLMANONARYCHFSZQLJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7FU6E7GJJLMANONARYCHFSZQLJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7FU6E7GJJLMANONARYCHFSZQLJ/action/storage_attestation","attest_author":"https://pith.science/pith/7FU6E7GJJLMANONARYCHFSZQLJ/action/author_attestation","sign_citation":"https://pith.science/pith/7FU6E7GJJLMANONARYCHFSZQLJ/action/citation_signature","submit_replication":"https://pith.science/pith/7FU6E7GJJLMANONARYCHFSZQLJ/action/replication_record"}},"created_at":"2026-07-05T00:27:15.456788+00:00","updated_at":"2026-07-05T00:27:15.456788+00:00"}