{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:NZ345WHND4HXMYIUXQPAUQK5YR","short_pith_number":"pith:NZ345WHN","schema_version":"1.0","canonical_sha256":"6e77ced8ed1f0f766114bc1e0a415dc4724a09ae052d584f29b7f1835ae8b479","source":{"kind":"arxiv","id":"2310.03605","version":3},"attestation_state":"computed","paper":{"title":"FASER: Binary Code Similarity Search through the use of Intermediate Representations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.IR","cs.LG"],"primary_cat":"cs.CR","authors_text":"Iain Phillips, Josh Collyer, Tim Watson","submitted_at":"2023-10-05T15:36:35Z","abstract_excerpt":"Being able to identify functions of interest in cross-architecture software is useful whether you are analysing for malware, securing the software supply chain or conducting vulnerability research. Cross-Architecture Binary Code Similarity Search has been explored in numerous studies and has used a wide range of different data sources to achieve its goals. The data sources typically used draw on common structures derived from binaries such as function control flow graphs or binary level call graphs, the output of the disassembly process or the outputs of a dynamic analysis approach. One data 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":"2310.03605","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2023-10-05T15:36:35Z","cross_cats_sorted":["cs.AI","cs.IR","cs.LG"],"title_canon_sha256":"b20c9e455755c8b442fa453529c78132f83e007f82659087d05e34c30e05fa35","abstract_canon_sha256":"8fac39bd500303cb28fdb7aa9d8757afc46065b0bce329222c9a0407b6d15463"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:18:12.065927Z","signature_b64":"Ig6Yq15aEyaJqxKnaQxCaskN6AFk+8xGC0plU2qk9lL5mZ+/M0SHITcXCu8bD7RyudyBkVCooWP6UCuCnAWRAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e77ced8ed1f0f766114bc1e0a415dc4724a09ae052d584f29b7f1835ae8b479","last_reissued_at":"2026-07-05T07:18:12.065415Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:18:12.065415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FASER: Binary Code Similarity Search through the use of Intermediate Representations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.IR","cs.LG"],"primary_cat":"cs.CR","authors_text":"Iain Phillips, Josh Collyer, Tim Watson","submitted_at":"2023-10-05T15:36:35Z","abstract_excerpt":"Being able to identify functions of interest in cross-architecture software is useful whether you are analysing for malware, securing the software supply chain or conducting vulnerability research. Cross-Architecture Binary Code Similarity Search has been explored in numerous studies and has used a wide range of different data sources to achieve its goals. The data sources typically used draw on common structures derived from binaries such as function control flow graphs or binary level call graphs, the output of the disassembly process or the outputs of a dynamic analysis approach. One data s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.03605","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/2310.03605/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":"2310.03605","created_at":"2026-07-05T07:18:12.065475+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.03605v3","created_at":"2026-07-05T07:18:12.065475+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.03605","created_at":"2026-07-05T07:18:12.065475+00:00"},{"alias_kind":"pith_short_12","alias_value":"NZ345WHND4HX","created_at":"2026-07-05T07:18:12.065475+00:00"},{"alias_kind":"pith_short_16","alias_value":"NZ345WHND4HXMYIU","created_at":"2026-07-05T07:18:12.065475+00:00"},{"alias_kind":"pith_short_8","alias_value":"NZ345WHN","created_at":"2026-07-05T07:18:12.065475+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.06854","citing_title":"Can Large Language Models Understand Intermediate Representations in Compilers?","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NZ345WHND4HXMYIUXQPAUQK5YR","json":"https://pith.science/pith/NZ345WHND4HXMYIUXQPAUQK5YR.json","graph_json":"https://pith.science/api/pith-number/NZ345WHND4HXMYIUXQPAUQK5YR/graph.json","events_json":"https://pith.science/api/pith-number/NZ345WHND4HXMYIUXQPAUQK5YR/events.json","paper":"https://pith.science/paper/NZ345WHN"},"agent_actions":{"view_html":"https://pith.science/pith/NZ345WHND4HXMYIUXQPAUQK5YR","download_json":"https://pith.science/pith/NZ345WHND4HXMYIUXQPAUQK5YR.json","view_paper":"https://pith.science/paper/NZ345WHN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.03605&json=true","fetch_graph":"https://pith.science/api/pith-number/NZ345WHND4HXMYIUXQPAUQK5YR/graph.json","fetch_events":"https://pith.science/api/pith-number/NZ345WHND4HXMYIUXQPAUQK5YR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NZ345WHND4HXMYIUXQPAUQK5YR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NZ345WHND4HXMYIUXQPAUQK5YR/action/storage_attestation","attest_author":"https://pith.science/pith/NZ345WHND4HXMYIUXQPAUQK5YR/action/author_attestation","sign_citation":"https://pith.science/pith/NZ345WHND4HXMYIUXQPAUQK5YR/action/citation_signature","submit_replication":"https://pith.science/pith/NZ345WHND4HXMYIUXQPAUQK5YR/action/replication_record"}},"created_at":"2026-07-05T07:18:12.065475+00:00","updated_at":"2026-07-05T07:18:12.065475+00:00"}