{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:HVYFH6PAIR23FJDVKPKETHPFLN","short_pith_number":"pith:HVYFH6PA","schema_version":"1.0","canonical_sha256":"3d7053f9e04475b2a47553d4499de55b7ac5793eb07a01bc803b0da8bbf096e9","source":{"kind":"arxiv","id":"1706.08007","version":1},"attestation_state":"computed","paper":{"title":"Local Refinement Typing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Benjamin Cosman, Ranjit Jhala","submitted_at":"2017-06-24T22:06:23Z","abstract_excerpt":"We introduce the Fusion algorithm for local refinement type inference, yielding a new SMT-based method for verifying programs with polymorphic data types and higher-order functions. Fusion is concise as the programmer need only write signatures for (externally exported) top-level functions and places with cyclic (recursive) dependencies, after which Fusion can predictably synthesize the most precise refinement types for all intermediate terms (expressible in the decidable refinement logic), thereby checking the program without false alarms. We have implemented Fusion and evaluated it on the be"},"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":"1706.08007","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2017-06-24T22:06:23Z","cross_cats_sorted":[],"title_canon_sha256":"0d24e45b1b2b733f923d9281a61f1a37379258742d2237af00671f1ac9d5f63f","abstract_canon_sha256":"9d5174c820d249070344cc181663a9346b3335a82cc3eee85c63e7fee6a3502e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:43.896982Z","signature_b64":"MRIa4nxUFrkvnp6N4Z6x4ZM5LsRjZUpF2jDnf3halAjAXEqFs7K6Id9/hOlsRKRwLeh2jiwZVJn0yQZzDcVHCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d7053f9e04475b2a47553d4499de55b7ac5793eb07a01bc803b0da8bbf096e9","last_reissued_at":"2026-05-18T00:41:43.896387Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:43.896387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Local Refinement Typing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Benjamin Cosman, Ranjit Jhala","submitted_at":"2017-06-24T22:06:23Z","abstract_excerpt":"We introduce the Fusion algorithm for local refinement type inference, yielding a new SMT-based method for verifying programs with polymorphic data types and higher-order functions. Fusion is concise as the programmer need only write signatures for (externally exported) top-level functions and places with cyclic (recursive) dependencies, after which Fusion can predictably synthesize the most precise refinement types for all intermediate terms (expressible in the decidable refinement logic), thereby checking the program without false alarms. We have implemented Fusion and evaluated it on the be"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.08007","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":"1706.08007","created_at":"2026-05-18T00:41:43.896472+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.08007v1","created_at":"2026-05-18T00:41:43.896472+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08007","created_at":"2026-05-18T00:41:43.896472+00:00"},{"alias_kind":"pith_short_12","alias_value":"HVYFH6PAIR23","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"HVYFH6PAIR23FJDV","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"HVYFH6PA","created_at":"2026-05-18T12:31:21.493067+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HVYFH6PAIR23FJDVKPKETHPFLN","json":"https://pith.science/pith/HVYFH6PAIR23FJDVKPKETHPFLN.json","graph_json":"https://pith.science/api/pith-number/HVYFH6PAIR23FJDVKPKETHPFLN/graph.json","events_json":"https://pith.science/api/pith-number/HVYFH6PAIR23FJDVKPKETHPFLN/events.json","paper":"https://pith.science/paper/HVYFH6PA"},"agent_actions":{"view_html":"https://pith.science/pith/HVYFH6PAIR23FJDVKPKETHPFLN","download_json":"https://pith.science/pith/HVYFH6PAIR23FJDVKPKETHPFLN.json","view_paper":"https://pith.science/paper/HVYFH6PA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.08007&json=true","fetch_graph":"https://pith.science/api/pith-number/HVYFH6PAIR23FJDVKPKETHPFLN/graph.json","fetch_events":"https://pith.science/api/pith-number/HVYFH6PAIR23FJDVKPKETHPFLN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HVYFH6PAIR23FJDVKPKETHPFLN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HVYFH6PAIR23FJDVKPKETHPFLN/action/storage_attestation","attest_author":"https://pith.science/pith/HVYFH6PAIR23FJDVKPKETHPFLN/action/author_attestation","sign_citation":"https://pith.science/pith/HVYFH6PAIR23FJDVKPKETHPFLN/action/citation_signature","submit_replication":"https://pith.science/pith/HVYFH6PAIR23FJDVKPKETHPFLN/action/replication_record"}},"created_at":"2026-05-18T00:41:43.896472+00:00","updated_at":"2026-05-18T00:41:43.896472+00:00"}