{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:NAJNZBELOOJBZLPBTYLSP3JCDK","short_pith_number":"pith:NAJNZBEL","schema_version":"1.0","canonical_sha256":"6812dc848b73921cade19e1727ed221abe9114664cf26d28b0cdfaff47c30da4","source":{"kind":"arxiv","id":"1610.08476","version":1},"attestation_state":"computed","paper":{"title":"Gradual Typing in an Open World","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Jeremy G. Siek, Michael M. Vitousek","submitted_at":"2016-10-26T19:36:31Z","abstract_excerpt":"Gradual typing combines static and dynamic typing in the same language, offering the benefits of both to programmers. Static typing provides error detection and strong guarantees while dynamic typing enables rapid prototyping and flexible programming idioms. For programmers to fully take advantage of a gradual type system, however, they must be able to trust their type annotations, and so runtime checks must be performed at the boundaries of static and dynamic code to ensure that static types are respected. Higher order and mutable values cannot be completely checked at these boundaries, and s"},"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":"1610.08476","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-10-26T19:36:31Z","cross_cats_sorted":[],"title_canon_sha256":"e56f85a48adecf862364c0f5fa7a2368b6ac78a76f3690f75c3c063b171e1ce4","abstract_canon_sha256":"678ee818a63ffda5ce0391c4d3ef38aaa089bd6928bd9d7c9dfb1281d0a324c1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:09.339779Z","signature_b64":"ocuqCwrUnoPqNxxRyt28+edRC6Pj08Y3zY7IwAhW08E+EUxUABfGucLiBScVFWunXVdLUxOqY73z+Bn5LBACDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6812dc848b73921cade19e1727ed221abe9114664cf26d28b0cdfaff47c30da4","last_reissued_at":"2026-05-18T01:01:09.339111Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:09.339111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Gradual Typing in an Open World","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Jeremy G. Siek, Michael M. Vitousek","submitted_at":"2016-10-26T19:36:31Z","abstract_excerpt":"Gradual typing combines static and dynamic typing in the same language, offering the benefits of both to programmers. Static typing provides error detection and strong guarantees while dynamic typing enables rapid prototyping and flexible programming idioms. For programmers to fully take advantage of a gradual type system, however, they must be able to trust their type annotations, and so runtime checks must be performed at the boundaries of static and dynamic code to ensure that static types are respected. Higher order and mutable values cannot be completely checked at these boundaries, and s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.08476","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1610.08476","created_at":"2026-05-18T01:01:09.339225+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.08476v1","created_at":"2026-05-18T01:01:09.339225+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.08476","created_at":"2026-05-18T01:01:09.339225+00:00"},{"alias_kind":"pith_short_12","alias_value":"NAJNZBELOOJB","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"NAJNZBELOOJBZLPB","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"NAJNZBEL","created_at":"2026-05-18T12:30:32.724797+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.17514","citing_title":"Unlocking LLM Code Correction with Iterative Feedback Loops","ref_index":32,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NAJNZBELOOJBZLPBTYLSP3JCDK","json":"https://pith.science/pith/NAJNZBELOOJBZLPBTYLSP3JCDK.json","graph_json":"https://pith.science/api/pith-number/NAJNZBELOOJBZLPBTYLSP3JCDK/graph.json","events_json":"https://pith.science/api/pith-number/NAJNZBELOOJBZLPBTYLSP3JCDK/events.json","paper":"https://pith.science/paper/NAJNZBEL"},"agent_actions":{"view_html":"https://pith.science/pith/NAJNZBELOOJBZLPBTYLSP3JCDK","download_json":"https://pith.science/pith/NAJNZBELOOJBZLPBTYLSP3JCDK.json","view_paper":"https://pith.science/paper/NAJNZBEL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.08476&json=true","fetch_graph":"https://pith.science/api/pith-number/NAJNZBELOOJBZLPBTYLSP3JCDK/graph.json","fetch_events":"https://pith.science/api/pith-number/NAJNZBELOOJBZLPBTYLSP3JCDK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NAJNZBELOOJBZLPBTYLSP3JCDK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NAJNZBELOOJBZLPBTYLSP3JCDK/action/storage_attestation","attest_author":"https://pith.science/pith/NAJNZBELOOJBZLPBTYLSP3JCDK/action/author_attestation","sign_citation":"https://pith.science/pith/NAJNZBELOOJBZLPBTYLSP3JCDK/action/citation_signature","submit_replication":"https://pith.science/pith/NAJNZBELOOJBZLPBTYLSP3JCDK/action/replication_record"}},"created_at":"2026-05-18T01:01:09.339225+00:00","updated_at":"2026-05-18T01:01:09.339225+00:00"}