{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:HPCAIGY4B3M6E5V4ABKL53GRTU","short_pith_number":"pith:HPCAIGY4","schema_version":"1.0","canonical_sha256":"3bc4041b1c0ed9e276bc0054beecd19d1f63e9613b799feaa89e236dbf97d689","source":{"kind":"arxiv","id":"2506.13323","version":1},"attestation_state":"computed","paper":{"title":"Tady: A Neural Disassembler without Structural Constraint Violations","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.SE"],"primary_cat":"cs.CR","authors_text":"Bolun Zhang, Chao Zhang, Fengrui Yang, Hao Wang, Kai Chen, Siliang Qin, Zeyu Gao","submitted_at":"2025-06-16T10:11:43Z","abstract_excerpt":"Disassembly is a crucial yet challenging step in binary analysis. While emerging neural disassemblers show promise for efficiency and accuracy, they frequently generate outputs violating fundamental structural constraints, which significantly compromise their practical usability. To address this critical problem, we regularize the disassembly solution space by formalizing and applying key structural constraints based on post-dominance relations. This approach systematically detects widespread errors in existing neural disassemblers' outputs. These errors often originate from models' limited co"},"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":"2506.13323","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CR","submitted_at":"2025-06-16T10:11:43Z","cross_cats_sorted":["cs.AI","cs.LG","cs.SE"],"title_canon_sha256":"7db8759026d08127f3a35dca8b9bd26fc0ef852192ce507b59eb2b3cc2193409","abstract_canon_sha256":"07c08c8c0dbdbbc42dde9f36b9b63545c0d450f1a257527a856b22a5f9035721"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:22:08.776914Z","signature_b64":"AS0A53XFSYc2mA6oFq6Cbr8JG0r84IMC4zxes+8iShjYHK3xjHH4+KjnMJIdC/a8qhaOjWHZ7SnvTpC3B8hoAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3bc4041b1c0ed9e276bc0054beecd19d1f63e9613b799feaa89e236dbf97d689","last_reissued_at":"2026-07-05T11:22:08.776442Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:22:08.776442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tady: A Neural Disassembler without Structural Constraint Violations","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.SE"],"primary_cat":"cs.CR","authors_text":"Bolun Zhang, Chao Zhang, Fengrui Yang, Hao Wang, Kai Chen, Siliang Qin, Zeyu Gao","submitted_at":"2025-06-16T10:11:43Z","abstract_excerpt":"Disassembly is a crucial yet challenging step in binary analysis. While emerging neural disassemblers show promise for efficiency and accuracy, they frequently generate outputs violating fundamental structural constraints, which significantly compromise their practical usability. To address this critical problem, we regularize the disassembly solution space by formalizing and applying key structural constraints based on post-dominance relations. This approach systematically detects widespread errors in existing neural disassemblers' outputs. These errors often originate from models' limited co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.13323","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/2506.13323/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":"2506.13323","created_at":"2026-07-05T11:22:08.776501+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.13323v1","created_at":"2026-07-05T11:22:08.776501+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.13323","created_at":"2026-07-05T11:22:08.776501+00:00"},{"alias_kind":"pith_short_12","alias_value":"HPCAIGY4B3M6","created_at":"2026-07-05T11:22:08.776501+00:00"},{"alias_kind":"pith_short_16","alias_value":"HPCAIGY4B3M6E5V4","created_at":"2026-07-05T11:22:08.776501+00:00"},{"alias_kind":"pith_short_8","alias_value":"HPCAIGY4","created_at":"2026-07-05T11:22:08.776501+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.28929","citing_title":"Cybersecurity is the True Frontier for Generative AI Success or Failure","ref_index":68,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HPCAIGY4B3M6E5V4ABKL53GRTU","json":"https://pith.science/pith/HPCAIGY4B3M6E5V4ABKL53GRTU.json","graph_json":"https://pith.science/api/pith-number/HPCAIGY4B3M6E5V4ABKL53GRTU/graph.json","events_json":"https://pith.science/api/pith-number/HPCAIGY4B3M6E5V4ABKL53GRTU/events.json","paper":"https://pith.science/paper/HPCAIGY4"},"agent_actions":{"view_html":"https://pith.science/pith/HPCAIGY4B3M6E5V4ABKL53GRTU","download_json":"https://pith.science/pith/HPCAIGY4B3M6E5V4ABKL53GRTU.json","view_paper":"https://pith.science/paper/HPCAIGY4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.13323&json=true","fetch_graph":"https://pith.science/api/pith-number/HPCAIGY4B3M6E5V4ABKL53GRTU/graph.json","fetch_events":"https://pith.science/api/pith-number/HPCAIGY4B3M6E5V4ABKL53GRTU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HPCAIGY4B3M6E5V4ABKL53GRTU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HPCAIGY4B3M6E5V4ABKL53GRTU/action/storage_attestation","attest_author":"https://pith.science/pith/HPCAIGY4B3M6E5V4ABKL53GRTU/action/author_attestation","sign_citation":"https://pith.science/pith/HPCAIGY4B3M6E5V4ABKL53GRTU/action/citation_signature","submit_replication":"https://pith.science/pith/HPCAIGY4B3M6E5V4ABKL53GRTU/action/replication_record"}},"created_at":"2026-07-05T11:22:08.776501+00:00","updated_at":"2026-07-05T11:22:08.776501+00:00"}