{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:2IKDCPMXWL7ILGY7GAN6QQ5NUG","short_pith_number":"pith:2IKDCPMX","schema_version":"1.0","canonical_sha256":"d214313d97b2fe859b1f301be843ada19f8e382a38e992143127760fcefbf65e","source":{"kind":"arxiv","id":"1604.02474","version":4},"attestation_state":"computed","paper":{"title":"Space-Efficient Latent Contracts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Michael Greenberg","submitted_at":"2016-04-08T20:30:12Z","abstract_excerpt":"Standard higher-order contract monitoring breaks tail recursion and leads to space leaks that can change a program's asymptotic complexity; space-efficiency restores tail recursion and bounds the amount of space used by contracts. Space-efficient contract monitoring for contracts enforcing simple type disciplines (a/k/a gradual typing) is well studied. Prior work establishes a space-efficient semantics for manifest contracts without dependency (Greenberg 2015); we adapt that work to a latent calculus with dependency. We guarantee space efficiency when no dependency is used; we cannot generally"},"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":"1604.02474","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-04-08T20:30:12Z","cross_cats_sorted":[],"title_canon_sha256":"662e74ac1da9f61df1990ae4a40b96b90407cf2695fba9873684a545ede7dfea","abstract_canon_sha256":"69e58ca97a284505fa0e71fd91a41a07e7af4c1e63669b5918ef333a1146340c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:02.955446Z","signature_b64":"Hg+M2SqxuVGSH5KlFguU1IZ6eZHIws7a6WgvCl6rDkG8VJN7teAu9r9E0GTzrUbGSEqh6IZdCCV6iJPzunczBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d214313d97b2fe859b1f301be843ada19f8e382a38e992143127760fcefbf65e","last_reissued_at":"2026-05-18T00:43:02.954641Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:02.954641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Space-Efficient Latent Contracts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Michael Greenberg","submitted_at":"2016-04-08T20:30:12Z","abstract_excerpt":"Standard higher-order contract monitoring breaks tail recursion and leads to space leaks that can change a program's asymptotic complexity; space-efficiency restores tail recursion and bounds the amount of space used by contracts. Space-efficient contract monitoring for contracts enforcing simple type disciplines (a/k/a gradual typing) is well studied. Prior work establishes a space-efficient semantics for manifest contracts without dependency (Greenberg 2015); we adapt that work to a latent calculus with dependency. We guarantee space efficiency when no dependency is used; we cannot generally"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.02474","kind":"arxiv","version":4},"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":"1604.02474","created_at":"2026-05-18T00:43:02.954755+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.02474v4","created_at":"2026-05-18T00:43:02.954755+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02474","created_at":"2026-05-18T00:43:02.954755+00:00"},{"alias_kind":"pith_short_12","alias_value":"2IKDCPMXWL7I","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"2IKDCPMXWL7ILGY7","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"2IKDCPMX","created_at":"2026-05-18T12:29:55.572404+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/2IKDCPMXWL7ILGY7GAN6QQ5NUG","json":"https://pith.science/pith/2IKDCPMXWL7ILGY7GAN6QQ5NUG.json","graph_json":"https://pith.science/api/pith-number/2IKDCPMXWL7ILGY7GAN6QQ5NUG/graph.json","events_json":"https://pith.science/api/pith-number/2IKDCPMXWL7ILGY7GAN6QQ5NUG/events.json","paper":"https://pith.science/paper/2IKDCPMX"},"agent_actions":{"view_html":"https://pith.science/pith/2IKDCPMXWL7ILGY7GAN6QQ5NUG","download_json":"https://pith.science/pith/2IKDCPMXWL7ILGY7GAN6QQ5NUG.json","view_paper":"https://pith.science/paper/2IKDCPMX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.02474&json=true","fetch_graph":"https://pith.science/api/pith-number/2IKDCPMXWL7ILGY7GAN6QQ5NUG/graph.json","fetch_events":"https://pith.science/api/pith-number/2IKDCPMXWL7ILGY7GAN6QQ5NUG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2IKDCPMXWL7ILGY7GAN6QQ5NUG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2IKDCPMXWL7ILGY7GAN6QQ5NUG/action/storage_attestation","attest_author":"https://pith.science/pith/2IKDCPMXWL7ILGY7GAN6QQ5NUG/action/author_attestation","sign_citation":"https://pith.science/pith/2IKDCPMXWL7ILGY7GAN6QQ5NUG/action/citation_signature","submit_replication":"https://pith.science/pith/2IKDCPMXWL7ILGY7GAN6QQ5NUG/action/replication_record"}},"created_at":"2026-05-18T00:43:02.954755+00:00","updated_at":"2026-05-18T00:43:02.954755+00:00"}