{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:IF4E4SYG22BIFIUIMBBJWTFM65","short_pith_number":"pith:IF4E4SYG","canonical_record":{"source":{"id":"2608.11766","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.SE","submitted_at":"2026-08-12T08:07:26Z","cross_cats_sorted":["cs.AI","cs.CR"],"title_canon_sha256":"ae1c6d0df193d6327807e5ee7cc38d16bf15fba20c02e770d77138dda8dda5ef","abstract_canon_sha256":"890b6637dfc32b1ade5d47dbbfcd717fc80a38efcfc89325c3da1eac5cd3bba4"},"schema_version":"1.0"},"canonical_sha256":"41784e4b06d68282a28860429b4cacf77c4ee1f3e172969d041c10694df3ad8d","source":{"kind":"arxiv","id":"2608.11766","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.11766","created_at":"2026-08-13T01:28:07Z"},{"alias_kind":"arxiv_version","alias_value":"2608.11766v1","created_at":"2026-08-13T01:28:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.11766","created_at":"2026-08-13T01:28:07Z"},{"alias_kind":"pith_short_12","alias_value":"IF4E4SYG22BI","created_at":"2026-08-13T01:28:07Z"},{"alias_kind":"pith_short_16","alias_value":"IF4E4SYG22BIFIUI","created_at":"2026-08-13T01:28:07Z"},{"alias_kind":"pith_short_8","alias_value":"IF4E4SYG","created_at":"2026-08-13T01:28:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:IF4E4SYG22BIFIUIMBBJWTFM65","target":"record","payload":{"canonical_record":{"source":{"id":"2608.11766","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.SE","submitted_at":"2026-08-12T08:07:26Z","cross_cats_sorted":["cs.AI","cs.CR"],"title_canon_sha256":"ae1c6d0df193d6327807e5ee7cc38d16bf15fba20c02e770d77138dda8dda5ef","abstract_canon_sha256":"890b6637dfc32b1ade5d47dbbfcd717fc80a38efcfc89325c3da1eac5cd3bba4"},"schema_version":"1.0"},"canonical_sha256":"41784e4b06d68282a28860429b4cacf77c4ee1f3e172969d041c10694df3ad8d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-13T01:28:07.873800Z","signature_b64":"/iRBIJnpAzBW0gA5LjX3319JzRD8PRVwsvbrJdRvtg62d6RaH+dtWWjRmbEQCLxomqBhPXWem7bWdHySnKMYCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41784e4b06d68282a28860429b4cacf77c4ee1f3e172969d041c10694df3ad8d","last_reissued_at":"2026-08-13T01:28:07.871474Z","signature_status":"signed_v1","first_computed_at":"2026-08-13T01:28:07.871474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2608.11766","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-08-13T01:28:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LOET7vu8SWkvXSl4HQUVhQZ+W7FBQzfcVz0MNa/MjMaNSEXeY2vbzgEN0KG6grLowdd2utqGwmPTGvQSQAdrCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T14:24:19.370193Z"},"content_sha256":"2eeb3aae42073358157a473f2766b0aafc200f03840465db257abeed4ed5de59","schema_version":"1.0","event_id":"sha256:2eeb3aae42073358157a473f2766b0aafc200f03840465db257abeed4ed5de59"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:IF4E4SYG22BIFIUIMBBJWTFM65","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Instruction Alignment for Binary Code Representation Learning","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI","cs.CR"],"primary_cat":"cs.SE","authors_text":"Huaijin Wang, Shuai Wang","submitted_at":"2026-08-12T08:07:26Z","abstract_excerpt":"Binary code representation learning is a fundamental problem in software security and reverse engineering. Existing methods mainly learn function-level embeddings that capture coarse-grained semantic relationships between binary functions, but they largely ignore fine-grained instruction-level correspondences. This limitation misses valuable supervision signals available from compiler debug information, which can support the learning of more accurate and interpretable binary code representations.\n  We propose to leverage instruction alignment knowledge to further improve binary code representa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.11766","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2608.11766/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"},"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-08-13T01:28:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PKy26ic6at9eqZbYWDnaL6W91KQpHB4q9zZ+k2+WxLYrfYl+3kCMO8v6Ybhaegg2rfauag47FdrK+VkFKPUMDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T14:24:19.370728Z"},"content_sha256":"19257a59577f06c468b283bd55f37739f19d6e77ec34f9895d5a57deb18de5d8","schema_version":"1.0","event_id":"sha256:19257a59577f06c468b283bd55f37739f19d6e77ec34f9895d5a57deb18de5d8"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:IF4E4SYG22BIFIUIMBBJWTFM65","target":"integrity","payload":{"note":"Identifier '10.1145/3832164' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","snippet":"Liu Zhibo, Wang Huaijin, and Wang Shuai. 2026. The Unseen Delta: Characteriz- ing the Compiler Optimization Landscape via Top-Down Differential Analysis. In Proceedings of the 2026 International Symposium on Software Testing and Analysis (I","arxiv_id":"2608.11766","detector":"doi_compliance","evidence":{"doi":"10.1145/3832164","arxiv_id":null,"ref_index":74,"raw_excerpt":"Liu Zhibo, Wang Huaijin, and Wang Shuai. 2026. The Unseen Delta: Characteriz- ing the Compiler Optimization Landscape via Top-Down Differential Analysis. In Proceedings of the 2026 International Symposium on Software Testing and Analysis (ISSTA ’26). doi:10.1145/3832164","parse_status":"well_formed","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"],"resolution_status":"hard_miss"},"severity":"critical","ref_index":74,"audited_at":"2026-08-16T00:58:03.854453Z","event_type":"pith.integrity.v1","detected_doi":"10.1145/3832164","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"e3badeb0f547ef9d7cab7d650383cf51ac374c3a36d96f095b1a61e44b8a234c","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":20277,"payload_sha256":"33f37b381a48b907fa62621d4127f6b36be809c4b0189d64aec05cb04ea0094b","signature_b64":"sOfXAOr3Sz8aEv39lY3vt0RAwKMUcwQhozJUF2So/kluHijweaSNMo1OaWkKHEWBzCLqeTFT7SoTneNkdRqDBA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-16T00:58:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VaM3jFUX5TU0ARrPjhWW2CLYi1Xr6+BsUb1qqGdARZpx7TR87Yz9JCAz1hUB+2IU31X92bB0IWiTR4QsNHOzDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T14:24:19.373296Z"},"content_sha256":"3f4d71b014494c120f3c347087a60c7d7c059441f9a685506bbee2fea988d0dc","schema_version":"1.0","event_id":"sha256:3f4d71b014494c120f3c347087a60c7d7c059441f9a685506bbee2fea988d0dc"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:IF4E4SYG22BIFIUIMBBJWTFM65","target":"integrity","payload":{"note":"Identifier '10.1145/3832245' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","snippet":"Wong Wai Kin, Wu Daoyuan, Liu Zhibo, Wang Huaijin, Li Zongjie, and Wang Shuai. 2026. BinRAG: An RAG-Based Decompilation Framework Fusing Name Prediction and Calling Context. InProceedings of the 2026 International Symposium on Software Test","arxiv_id":"2608.11766","detector":"doi_compliance","evidence":{"doi":"10.1145/3832245","arxiv_id":null,"ref_index":52,"raw_excerpt":"Wong Wai Kin, Wu Daoyuan, Liu Zhibo, Wang Huaijin, Li Zongjie, and Wang Shuai. 2026. BinRAG: An RAG-Based Decompilation Framework Fusing Name Prediction and Calling Context. InProceedings of the 2026 International Symposium on Software Testing and Analysis (ISSTA ’26). doi:10.1145/3832245","parse_status":"well_formed","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"],"resolution_status":"hard_miss"},"severity":"critical","ref_index":52,"audited_at":"2026-08-16T00:58:03.854453Z","event_type":"pith.integrity.v1","detected_doi":"10.1145/3832245","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"f037ebfd8944d4039f007c9259ba393868421feb469ec6c46506eecc4313d046","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":20276,"payload_sha256":"b633867e9821a75e80a4a18f0effa29272bbd9c602d9bd2df6f028f06b8947a8","signature_b64":"7BVV4TKndIHUDSWqbFB4DhUSTitsMPE7UydAnuyjSqqXbehKXtXCqtYKNXFf4J5hIuSB8GugW7f+B+R+bWNmCg==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-16T00:58:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wp9duc5DgmlxQiJmATstYyjn6kQ/8jDMTIryrSfJro70LULKp+joAMwTVirMnzTiNoXHBGeF+Dz7lwRp+PeOBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T14:24:19.373700Z"},"content_sha256":"c3c22f08e98a58900fb7a63f35f46b05cd375e47af0c7324dbad4d560b420423","schema_version":"1.0","event_id":"sha256:c3c22f08e98a58900fb7a63f35f46b05cd375e47af0c7324dbad4d560b420423"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IF4E4SYG22BIFIUIMBBJWTFM65/bundle.json","state_url":"https://pith.science/pith/IF4E4SYG22BIFIUIMBBJWTFM65/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IF4E4SYG22BIFIUIMBBJWTFM65/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-08-23T14:24:19Z","links":{"resolver":"https://pith.science/pith/IF4E4SYG22BIFIUIMBBJWTFM65","bundle":"https://pith.science/pith/IF4E4SYG22BIFIUIMBBJWTFM65/bundle.json","state":"https://pith.science/pith/IF4E4SYG22BIFIUIMBBJWTFM65/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IF4E4SYG22BIFIUIMBBJWTFM65/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:IF4E4SYG22BIFIUIMBBJWTFM65","merge_version":"pith-open-graph-merge-v1","event_count":4,"valid_event_count":4,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"890b6637dfc32b1ade5d47dbbfcd717fc80a38efcfc89325c3da1eac5cd3bba4","cross_cats_sorted":["cs.AI","cs.CR"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.SE","submitted_at":"2026-08-12T08:07:26Z","title_canon_sha256":"ae1c6d0df193d6327807e5ee7cc38d16bf15fba20c02e770d77138dda8dda5ef"},"schema_version":"1.0","source":{"id":"2608.11766","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.11766","created_at":"2026-08-13T01:28:07Z"},{"alias_kind":"arxiv_version","alias_value":"2608.11766v1","created_at":"2026-08-13T01:28:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.11766","created_at":"2026-08-13T01:28:07Z"},{"alias_kind":"pith_short_12","alias_value":"IF4E4SYG22BI","created_at":"2026-08-13T01:28:07Z"},{"alias_kind":"pith_short_16","alias_value":"IF4E4SYG22BIFIUI","created_at":"2026-08-13T01:28:07Z"},{"alias_kind":"pith_short_8","alias_value":"IF4E4SYG","created_at":"2026-08-13T01:28:07Z"}],"graph_snapshots":[{"event_id":"sha256:19257a59577f06c468b283bd55f37739f19d6e77ec34f9895d5a57deb18de5d8","target":"graph","created_at":"2026-08-13T01:28:07Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2608.11766/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Binary code representation learning is a fundamental problem in software security and reverse engineering. Existing methods mainly learn function-level embeddings that capture coarse-grained semantic relationships between binary functions, but they largely ignore fine-grained instruction-level correspondences. This limitation misses valuable supervision signals available from compiler debug information, which can support the learning of more accurate and interpretable binary code representations.\n  We propose to leverage instruction alignment knowledge to further improve binary code representa","authors_text":"Huaijin Wang, Shuai Wang","cross_cats":["cs.AI","cs.CR"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.SE","submitted_at":"2026-08-12T08:07:26Z","title":"Instruction Alignment for Binary Code Representation Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.11766","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:2eeb3aae42073358157a473f2766b0aafc200f03840465db257abeed4ed5de59","target":"record","created_at":"2026-08-13T01:28:07Z","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":"890b6637dfc32b1ade5d47dbbfcd717fc80a38efcfc89325c3da1eac5cd3bba4","cross_cats_sorted":["cs.AI","cs.CR"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.SE","submitted_at":"2026-08-12T08:07:26Z","title_canon_sha256":"ae1c6d0df193d6327807e5ee7cc38d16bf15fba20c02e770d77138dda8dda5ef"},"schema_version":"1.0","source":{"id":"2608.11766","kind":"arxiv","version":1}},"canonical_sha256":"41784e4b06d68282a28860429b4cacf77c4ee1f3e172969d041c10694df3ad8d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"41784e4b06d68282a28860429b4cacf77c4ee1f3e172969d041c10694df3ad8d","first_computed_at":"2026-08-13T01:28:07.871474Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-13T01:28:07.871474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/iRBIJnpAzBW0gA5LjX3319JzRD8PRVwsvbrJdRvtg62d6RaH+dtWWjRmbEQCLxomqBhPXWem7bWdHySnKMYCQ==","signature_status":"signed_v1","signed_at":"2026-08-13T01:28:07.873800Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.11766","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:3f4d71b014494c120f3c347087a60c7d7c059441f9a685506bbee2fea988d0dc","sha256:c3c22f08e98a58900fb7a63f35f46b05cd375e47af0c7324dbad4d560b420423"]}],"invalid_events":[],"applied_event_ids":["sha256:2eeb3aae42073358157a473f2766b0aafc200f03840465db257abeed4ed5de59","sha256:19257a59577f06c468b283bd55f37739f19d6e77ec34f9895d5a57deb18de5d8"],"state_sha256":"9bfe5166c25a9b73201d6a4ca5602dad15930a532d79b55f1598ae403cf6d19b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"afKx2qaB2fCdXlMwfCVny7r6HPk4HzAPv/Hu9h1ELuJ39jWWpZXOx+2iBEUbZOQ6gx7wzESKXup27m/kGmwlDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T14:24:19.376397Z","bundle_sha256":"68c84a298e8546e0cee8b6ceb5fe48750c6cbd3103e4ebd1acf02306dda74bc1"}}