{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:FYQDAFJK3K2ZS4FOXT4IK6R3O7","short_pith_number":"pith:FYQDAFJK","schema_version":"1.0","canonical_sha256":"2e2030152adab59970aebcf8857a3b77c48a7a91cfc50bb3aa6efb75a2e8c5e3","source":{"kind":"arxiv","id":"1603.05495","version":2},"attestation_state":"computed","paper":{"title":"Polymorphic Type Inference for Machine Code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Alexey Loginov, David Cok, Matthew Noonan","submitted_at":"2016-03-17T14:09:14Z","abstract_excerpt":"For many compiled languages, source-level types are erased very early in the compilation process. As a result, further compiler passes may convert type-safe source into type-unsafe machine code. Type-unsafe idioms in the original source and type-unsafe optimizations mean that type information in a stripped binary is essentially nonexistent. The problem of recovering high-level types by performing type inference over stripped machine code is called type reconstruction, and offers a useful capability in support of reverse engineering and decompilation.\n  In this paper, we motivate and develop a "},"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":"1603.05495","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-03-17T14:09:14Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"321e87b6327fa78fb8f7bb3b3bb1fa9a35608994fb4914e77b7b085c4fd4d7c4","abstract_canon_sha256":"51e9112241393832c77fb3bac4dda9829b0d1ca986c1d60e679bfb91e909d8d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:52.073876Z","signature_b64":"41y53sokBVJ9CHO3LV6ztloUzPOQ3KbZNeJve7EMo7ZOLKbPP0sUZH51w5S5mnZ5LLP4ezDd+fi0vmek+my7AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e2030152adab59970aebcf8857a3b77c48a7a91cfc50bb3aa6efb75a2e8c5e3","last_reissued_at":"2026-05-18T01:18:52.073373Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:52.073373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polymorphic Type Inference for Machine Code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Alexey Loginov, David Cok, Matthew Noonan","submitted_at":"2016-03-17T14:09:14Z","abstract_excerpt":"For many compiled languages, source-level types are erased very early in the compilation process. As a result, further compiler passes may convert type-safe source into type-unsafe machine code. Type-unsafe idioms in the original source and type-unsafe optimizations mean that type information in a stripped binary is essentially nonexistent. The problem of recovering high-level types by performing type inference over stripped machine code is called type reconstruction, and offers a useful capability in support of reverse engineering and decompilation.\n  In this paper, we motivate and develop a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.05495","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1603.05495","created_at":"2026-05-18T01:18:52.073450+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.05495v2","created_at":"2026-05-18T01:18:52.073450+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05495","created_at":"2026-05-18T01:18:52.073450+00:00"},{"alias_kind":"pith_short_12","alias_value":"FYQDAFJK3K2Z","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"FYQDAFJK3K2ZS4FO","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"FYQDAFJK","created_at":"2026-05-18T12:30:15.759754+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.03286","citing_title":"NotDec: WebAssembly Decompilation With Inter-Procedural Type Recovery","ref_index":27,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FYQDAFJK3K2ZS4FOXT4IK6R3O7","json":"https://pith.science/pith/FYQDAFJK3K2ZS4FOXT4IK6R3O7.json","graph_json":"https://pith.science/api/pith-number/FYQDAFJK3K2ZS4FOXT4IK6R3O7/graph.json","events_json":"https://pith.science/api/pith-number/FYQDAFJK3K2ZS4FOXT4IK6R3O7/events.json","paper":"https://pith.science/paper/FYQDAFJK"},"agent_actions":{"view_html":"https://pith.science/pith/FYQDAFJK3K2ZS4FOXT4IK6R3O7","download_json":"https://pith.science/pith/FYQDAFJK3K2ZS4FOXT4IK6R3O7.json","view_paper":"https://pith.science/paper/FYQDAFJK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.05495&json=true","fetch_graph":"https://pith.science/api/pith-number/FYQDAFJK3K2ZS4FOXT4IK6R3O7/graph.json","fetch_events":"https://pith.science/api/pith-number/FYQDAFJK3K2ZS4FOXT4IK6R3O7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FYQDAFJK3K2ZS4FOXT4IK6R3O7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FYQDAFJK3K2ZS4FOXT4IK6R3O7/action/storage_attestation","attest_author":"https://pith.science/pith/FYQDAFJK3K2ZS4FOXT4IK6R3O7/action/author_attestation","sign_citation":"https://pith.science/pith/FYQDAFJK3K2ZS4FOXT4IK6R3O7/action/citation_signature","submit_replication":"https://pith.science/pith/FYQDAFJK3K2ZS4FOXT4IK6R3O7/action/replication_record"}},"created_at":"2026-05-18T01:18:52.073450+00:00","updated_at":"2026-05-18T01:18:52.073450+00:00"}