{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:FXARTHGP52BBQIR6YGL6NKJI2Y","short_pith_number":"pith:FXARTHGP","canonical_record":{"source":{"id":"1907.01374","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-07-01T08:41:21Z","cross_cats_sorted":[],"title_canon_sha256":"0a30bc66342e08ac727bf62095b722887fb2da5d5c335498ca9094b50718ce99","abstract_canon_sha256":"6520afe08c33dc6fbb212db6cc869ba98f64570842dc592a6b6595ae5a7eaa59"},"schema_version":"1.0"},"canonical_sha256":"2dc1199ccfee8218223ec197e6a928d637740db250c1bf150dcd9f99eec1d06c","source":{"kind":"arxiv","id":"1907.01374","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.01374","created_at":"2026-05-17T23:41:40Z"},{"alias_kind":"arxiv_version","alias_value":"1907.01374v1","created_at":"2026-05-17T23:41:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.01374","created_at":"2026-05-17T23:41:40Z"},{"alias_kind":"pith_short_12","alias_value":"FXARTHGP52BB","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"FXARTHGP52BBQIR6","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"FXARTHGP","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:FXARTHGP52BBQIR6YGL6NKJI2Y","target":"record","payload":{"canonical_record":{"source":{"id":"1907.01374","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-07-01T08:41:21Z","cross_cats_sorted":[],"title_canon_sha256":"0a30bc66342e08ac727bf62095b722887fb2da5d5c335498ca9094b50718ce99","abstract_canon_sha256":"6520afe08c33dc6fbb212db6cc869ba98f64570842dc592a6b6595ae5a7eaa59"},"schema_version":"1.0"},"canonical_sha256":"2dc1199ccfee8218223ec197e6a928d637740db250c1bf150dcd9f99eec1d06c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:40.565827Z","signature_b64":"+a4uwF6W/D4hEwBpZY8nJy8nSCxzUHoL/13SPugY6cq2TO+mTgAMZPg5DIDef7BtpqUhnBoz1J8w9uvpB1yfAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2dc1199ccfee8218223ec197e6a928d637740db250c1bf150dcd9f99eec1d06c","last_reissued_at":"2026-05-17T23:41:40.565277Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:40.565277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.01374","source_version":1,"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-17T23:41:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rPGHRrRdEon0KBx28SuIlspKBnaHk41iqhQFBdkDxbYglKHJpGM5rLRctaR2WGKMv2BYubrr8JNofoVgO7SiAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:21:54.375385Z"},"content_sha256":"76cdeb839e2e5d4781860dc46d0c5eb89449d95cf998cf07e6ffaaefd2e5a57b","schema_version":"1.0","event_id":"sha256:76cdeb839e2e5d4781860dc46d0c5eb89449d95cf998cf07e6ffaaefd2e5a57b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:FXARTHGP52BBQIR6YGL6NKJI2Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Semantics-Based Hybrid Approach on Binary Code Similarity Comparison","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Bodong Li, Dawu Gu, Hui Wang, Yikun Hu, Yuanyuan Zhang","submitted_at":"2019-07-01T08:41:21Z","abstract_excerpt":"Binary code similarity comparison is a methodology for identifying similar or identical code fragments in binary programs. It is indispensable in fields of software engineering and security, which has many important applications (e.g., plagiarism detection, bug detection). With the widespread of smart and IoT (Internet of Things) devices, an increasing number of programs are ported to multiple architectures (e.g. ARM, MIPS). It becomes necessary to detect similar binary code across architectures as well. The main challenge of this topic lies in the semantics-equivalent code transformation resu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.01374","kind":"arxiv","version":1},"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-17T23:41:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rF3NNtrvr1dOPb/4BdSqArUWA46XEMVpFKe6WJutl0kDhSa8xtciZdeLt8AEME22AlwwN1KGTLKYf5iS5M3zBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:21:54.375738Z"},"content_sha256":"e2a7cbce6684e942763280a206c761aee1a0675373b7dd66a6859280409bada8","schema_version":"1.0","event_id":"sha256:e2a7cbce6684e942763280a206c761aee1a0675373b7dd66a6859280409bada8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FXARTHGP52BBQIR6YGL6NKJI2Y/bundle.json","state_url":"https://pith.science/pith/FXARTHGP52BBQIR6YGL6NKJI2Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FXARTHGP52BBQIR6YGL6NKJI2Y/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-05T16:21:54Z","links":{"resolver":"https://pith.science/pith/FXARTHGP52BBQIR6YGL6NKJI2Y","bundle":"https://pith.science/pith/FXARTHGP52BBQIR6YGL6NKJI2Y/bundle.json","state":"https://pith.science/pith/FXARTHGP52BBQIR6YGL6NKJI2Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FXARTHGP52BBQIR6YGL6NKJI2Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:FXARTHGP52BBQIR6YGL6NKJI2Y","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":"6520afe08c33dc6fbb212db6cc869ba98f64570842dc592a6b6595ae5a7eaa59","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-07-01T08:41:21Z","title_canon_sha256":"0a30bc66342e08ac727bf62095b722887fb2da5d5c335498ca9094b50718ce99"},"schema_version":"1.0","source":{"id":"1907.01374","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.01374","created_at":"2026-05-17T23:41:40Z"},{"alias_kind":"arxiv_version","alias_value":"1907.01374v1","created_at":"2026-05-17T23:41:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.01374","created_at":"2026-05-17T23:41:40Z"},{"alias_kind":"pith_short_12","alias_value":"FXARTHGP52BB","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"FXARTHGP52BBQIR6","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"FXARTHGP","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:e2a7cbce6684e942763280a206c761aee1a0675373b7dd66a6859280409bada8","target":"graph","created_at":"2026-05-17T23:41:40Z","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":"Binary code similarity comparison is a methodology for identifying similar or identical code fragments in binary programs. It is indispensable in fields of software engineering and security, which has many important applications (e.g., plagiarism detection, bug detection). With the widespread of smart and IoT (Internet of Things) devices, an increasing number of programs are ported to multiple architectures (e.g. ARM, MIPS). It becomes necessary to detect similar binary code across architectures as well. The main challenge of this topic lies in the semantics-equivalent code transformation resu","authors_text":"Bodong Li, Dawu Gu, Hui Wang, Yikun Hu, Yuanyuan Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-07-01T08:41:21Z","title":"A Semantics-Based Hybrid Approach on Binary Code Similarity Comparison"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.01374","kind":"arxiv","version":1},"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:76cdeb839e2e5d4781860dc46d0c5eb89449d95cf998cf07e6ffaaefd2e5a57b","target":"record","created_at":"2026-05-17T23:41:40Z","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":"6520afe08c33dc6fbb212db6cc869ba98f64570842dc592a6b6595ae5a7eaa59","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-07-01T08:41:21Z","title_canon_sha256":"0a30bc66342e08ac727bf62095b722887fb2da5d5c335498ca9094b50718ce99"},"schema_version":"1.0","source":{"id":"1907.01374","kind":"arxiv","version":1}},"canonical_sha256":"2dc1199ccfee8218223ec197e6a928d637740db250c1bf150dcd9f99eec1d06c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2dc1199ccfee8218223ec197e6a928d637740db250c1bf150dcd9f99eec1d06c","first_computed_at":"2026-05-17T23:41:40.565277Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:40.565277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+a4uwF6W/D4hEwBpZY8nJy8nSCxzUHoL/13SPugY6cq2TO+mTgAMZPg5DIDef7BtpqUhnBoz1J8w9uvpB1yfAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:40.565827Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.01374","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:76cdeb839e2e5d4781860dc46d0c5eb89449d95cf998cf07e6ffaaefd2e5a57b","sha256:e2a7cbce6684e942763280a206c761aee1a0675373b7dd66a6859280409bada8"],"state_sha256":"c429b568f2b487f31ef7cab6890920a61a9e7334a6f36847184ca532185dc997"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TCsDaNUIhikbvTh3G4sWJAXXhXqFczYRI5jUnUopM0uIKwlPbOA4vU7828e3RXuleu5uBGLJG9NtqPFt28K8BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T16:21:54.377823Z","bundle_sha256":"1dc62b42e2275e65e22e65e153a04e202078629e6356677f179cff1e3c0c5410"}}