{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:M6VGC75JKNC64NLUTNN6VJWBYJ","short_pith_number":"pith:M6VGC75J","canonical_record":{"source":{"id":"2203.04472","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2022-03-09T01:24:23Z","cross_cats_sorted":[],"title_canon_sha256":"e20cd8f147a5f52783525c94e09fac93a8b87c68ac293a9ca710ab7eb0a9d288","abstract_canon_sha256":"82977a29f7fb8ced163094756f41efe7022efc5fb2abf246e99b9cea7416f0a4"},"schema_version":"1.0"},"canonical_sha256":"67aa617fa95345ee35749b5beaa6c1c267f9e3a9830d63c9015491bfa637917b","source":{"kind":"arxiv","id":"2203.04472","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.04472","created_at":"2026-07-05T04:03:18Z"},{"alias_kind":"arxiv_version","alias_value":"2203.04472v1","created_at":"2026-07-05T04:03:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.04472","created_at":"2026-07-05T04:03:18Z"},{"alias_kind":"pith_short_12","alias_value":"M6VGC75JKNC6","created_at":"2026-07-05T04:03:18Z"},{"alias_kind":"pith_short_16","alias_value":"M6VGC75JKNC64NLU","created_at":"2026-07-05T04:03:18Z"},{"alias_kind":"pith_short_8","alias_value":"M6VGC75J","created_at":"2026-07-05T04:03:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:M6VGC75JKNC64NLUTNN6VJWBYJ","target":"record","payload":{"canonical_record":{"source":{"id":"2203.04472","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2022-03-09T01:24:23Z","cross_cats_sorted":[],"title_canon_sha256":"e20cd8f147a5f52783525c94e09fac93a8b87c68ac293a9ca710ab7eb0a9d288","abstract_canon_sha256":"82977a29f7fb8ced163094756f41efe7022efc5fb2abf246e99b9cea7416f0a4"},"schema_version":"1.0"},"canonical_sha256":"67aa617fa95345ee35749b5beaa6c1c267f9e3a9830d63c9015491bfa637917b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:03:18.697034Z","signature_b64":"r1j8ApwoIA9eHiu5suL52/yvjSNDW7pfe+EZJ0pNcoCWtFWhvGuJmi9WgQZQFIkziR2u/Zx7c458+QauGlkGAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67aa617fa95345ee35749b5beaa6c1c267f9e3a9830d63c9015491bfa637917b","last_reissued_at":"2026-07-05T04:03:18.696643Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:03:18.696643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2203.04472","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-07-05T04:03:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9BeDZWGN3PMcTU0iKR3yCdb5X/RxNZ+ortG6V3uEK4BZNUV1d0GSKmK7LCvlKRWkn0T8/6HuOm5HsqeJK6ttDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T14:33:46.145648Z"},"content_sha256":"2008b1f0a02ec24a7c841995a9c48f9c7473fb23b710dbb1a6052528f70dc977","schema_version":"1.0","event_id":"sha256:2008b1f0a02ec24a7c841995a9c48f9c7473fb23b710dbb1a6052528f70dc977"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:M6VGC75JKNC64NLUTNN6VJWBYJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"BinMLM: Binary Authorship Verification with Flow-aware Mixture-of-Shared Language Model","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Linshu Ouyang, Qige Song, Yige Chen, Yongzheng Zhang","submitted_at":"2022-03-09T01:24:23Z","abstract_excerpt":"Binary authorship analysis is a significant problem in many software engineering applications. In this paper, we formulate a binary authorship verification task to accurately reflect the real-world working process of software forensic experts. It aims to determine whether an anonymous binary is developed by a specific programmer with a small set of support samples, and the actual developer may not belong to the known candidate set but from the wild. We propose an effective binary authorship verification framework, BinMLM. BinMLM trains the RNN language model on consecutive opcode traces extrac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.04472","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/2203.04472/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-07-05T04:03:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8RXqsqowYu6Tz0sDPFnB1JMAvZ7mjB/6/OPTzAo4BxImawNfzqZ3LKGBvrC+Qvl15xG7pD9u8Qkwd5UUq2QcBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T14:33:46.146174Z"},"content_sha256":"4dd8745af28dafb6430d26e5aadb9baa4b11893a55b4530bdc7f591dcdc34aeb","schema_version":"1.0","event_id":"sha256:4dd8745af28dafb6430d26e5aadb9baa4b11893a55b4530bdc7f591dcdc34aeb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M6VGC75JKNC64NLUTNN6VJWBYJ/bundle.json","state_url":"https://pith.science/pith/M6VGC75JKNC64NLUTNN6VJWBYJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M6VGC75JKNC64NLUTNN6VJWBYJ/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-09T14:33:46Z","links":{"resolver":"https://pith.science/pith/M6VGC75JKNC64NLUTNN6VJWBYJ","bundle":"https://pith.science/pith/M6VGC75JKNC64NLUTNN6VJWBYJ/bundle.json","state":"https://pith.science/pith/M6VGC75JKNC64NLUTNN6VJWBYJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M6VGC75JKNC64NLUTNN6VJWBYJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:M6VGC75JKNC64NLUTNN6VJWBYJ","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":"82977a29f7fb8ced163094756f41efe7022efc5fb2abf246e99b9cea7416f0a4","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2022-03-09T01:24:23Z","title_canon_sha256":"e20cd8f147a5f52783525c94e09fac93a8b87c68ac293a9ca710ab7eb0a9d288"},"schema_version":"1.0","source":{"id":"2203.04472","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.04472","created_at":"2026-07-05T04:03:18Z"},{"alias_kind":"arxiv_version","alias_value":"2203.04472v1","created_at":"2026-07-05T04:03:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.04472","created_at":"2026-07-05T04:03:18Z"},{"alias_kind":"pith_short_12","alias_value":"M6VGC75JKNC6","created_at":"2026-07-05T04:03:18Z"},{"alias_kind":"pith_short_16","alias_value":"M6VGC75JKNC64NLU","created_at":"2026-07-05T04:03:18Z"},{"alias_kind":"pith_short_8","alias_value":"M6VGC75J","created_at":"2026-07-05T04:03:18Z"}],"graph_snapshots":[{"event_id":"sha256:4dd8745af28dafb6430d26e5aadb9baa4b11893a55b4530bdc7f591dcdc34aeb","target":"graph","created_at":"2026-07-05T04:03:18Z","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/2203.04472/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Binary authorship analysis is a significant problem in many software engineering applications. In this paper, we formulate a binary authorship verification task to accurately reflect the real-world working process of software forensic experts. It aims to determine whether an anonymous binary is developed by a specific programmer with a small set of support samples, and the actual developer may not belong to the known candidate set but from the wild. We propose an effective binary authorship verification framework, BinMLM. BinMLM trains the RNN language model on consecutive opcode traces extrac","authors_text":"Linshu Ouyang, Qige Song, Yige Chen, Yongzheng Zhang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2022-03-09T01:24:23Z","title":"BinMLM: Binary Authorship Verification with Flow-aware Mixture-of-Shared Language Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.04472","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:2008b1f0a02ec24a7c841995a9c48f9c7473fb23b710dbb1a6052528f70dc977","target":"record","created_at":"2026-07-05T04:03:18Z","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":"82977a29f7fb8ced163094756f41efe7022efc5fb2abf246e99b9cea7416f0a4","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2022-03-09T01:24:23Z","title_canon_sha256":"e20cd8f147a5f52783525c94e09fac93a8b87c68ac293a9ca710ab7eb0a9d288"},"schema_version":"1.0","source":{"id":"2203.04472","kind":"arxiv","version":1}},"canonical_sha256":"67aa617fa95345ee35749b5beaa6c1c267f9e3a9830d63c9015491bfa637917b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"67aa617fa95345ee35749b5beaa6c1c267f9e3a9830d63c9015491bfa637917b","first_computed_at":"2026-07-05T04:03:18.696643Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:03:18.696643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r1j8ApwoIA9eHiu5suL52/yvjSNDW7pfe+EZJ0pNcoCWtFWhvGuJmi9WgQZQFIkziR2u/Zx7c458+QauGlkGAw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:03:18.697034Z","signed_message":"canonical_sha256_bytes"},"source_id":"2203.04472","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2008b1f0a02ec24a7c841995a9c48f9c7473fb23b710dbb1a6052528f70dc977","sha256:4dd8745af28dafb6430d26e5aadb9baa4b11893a55b4530bdc7f591dcdc34aeb"],"state_sha256":"609ab1da5997928faaaf0caffa0116329eee932caf52e3f78f7691c104e2daac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NP2GaDMx1gvOA5sS4z+v1VSrBbHdpehSKirl01WOxGmi/G2eDGk6vLjPQuxwCjaVrPUrjnHqkfROQ5TfxZG/Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T14:33:46.151198Z","bundle_sha256":"25d805107bc0eef0df8e97549ad75fc321c8778e8ab787c3757b90960705ca7e"}}