{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:KV6IHKB6KNNDGVNVFJTON5BOR5","short_pith_number":"pith:KV6IHKB6","schema_version":"1.0","canonical_sha256":"557c83a83e535a3355b52a66e6f42e8f7d072b75be12c72ed738fa25c819e5c7","source":{"kind":"arxiv","id":"1807.02358","version":1},"attestation_state":"computed","paper":{"title":"Tight Typings and Split Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Beniamino Accattoli, Delia Kesner, St\\'ephane Graham-Lengrand","submitted_at":"2018-07-06T11:20:52Z","abstract_excerpt":"Multi types---aka non-idempotent intersection types---have been used to obtain quantitative bounds on higher-order programs, as pioneered by de Carvalho. Notably, they bound at the same time the number of evaluation steps and the size of the result. Recent results show that the number of steps can be taken as a reasonable time complexity measure. At the same time, however, these results suggest that multi types provide quite lax complexity bounds, because the size of the result can be exponentially bigger than the number of steps.\n  Starting from this observation, we refine and generalise a te"},"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":"1807.02358","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-07-06T11:20:52Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"794aad17600f59f524641731f4fa1c951f9906f0a943b986cbb66ccfcdeb34ab","abstract_canon_sha256":"7bae01c0727f7c2703697117b6cbd2f9eca7f889cf8c0ed8dbbee7be38ecc2d3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:22.340893Z","signature_b64":"x+DY1wRyo0uCxl4351nNTG+edjoLhtrGNjqMctEAAmLAqi+5PVo6NXosvLp5nXOo/DZ3S9/hRZK2YXGqwza6Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"557c83a83e535a3355b52a66e6f42e8f7d072b75be12c72ed738fa25c819e5c7","last_reissued_at":"2026-05-18T00:11:22.340167Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:22.340167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight Typings and Split Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Beniamino Accattoli, Delia Kesner, St\\'ephane Graham-Lengrand","submitted_at":"2018-07-06T11:20:52Z","abstract_excerpt":"Multi types---aka non-idempotent intersection types---have been used to obtain quantitative bounds on higher-order programs, as pioneered by de Carvalho. Notably, they bound at the same time the number of evaluation steps and the size of the result. Recent results show that the number of steps can be taken as a reasonable time complexity measure. At the same time, however, these results suggest that multi types provide quite lax complexity bounds, because the size of the result can be exponentially bigger than the number of steps.\n  Starting from this observation, we refine and generalise a te"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.02358","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":"1807.02358","created_at":"2026-05-18T00:11:22.340282+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.02358v1","created_at":"2026-05-18T00:11:22.340282+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.02358","created_at":"2026-05-18T00:11:22.340282+00:00"},{"alias_kind":"pith_short_12","alias_value":"KV6IHKB6KNND","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"KV6IHKB6KNNDGVNV","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"KV6IHKB6","created_at":"2026-05-18T12:32:33.847187+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/KV6IHKB6KNNDGVNVFJTON5BOR5","json":"https://pith.science/pith/KV6IHKB6KNNDGVNVFJTON5BOR5.json","graph_json":"https://pith.science/api/pith-number/KV6IHKB6KNNDGVNVFJTON5BOR5/graph.json","events_json":"https://pith.science/api/pith-number/KV6IHKB6KNNDGVNVFJTON5BOR5/events.json","paper":"https://pith.science/paper/KV6IHKB6"},"agent_actions":{"view_html":"https://pith.science/pith/KV6IHKB6KNNDGVNVFJTON5BOR5","download_json":"https://pith.science/pith/KV6IHKB6KNNDGVNVFJTON5BOR5.json","view_paper":"https://pith.science/paper/KV6IHKB6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.02358&json=true","fetch_graph":"https://pith.science/api/pith-number/KV6IHKB6KNNDGVNVFJTON5BOR5/graph.json","fetch_events":"https://pith.science/api/pith-number/KV6IHKB6KNNDGVNVFJTON5BOR5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KV6IHKB6KNNDGVNVFJTON5BOR5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KV6IHKB6KNNDGVNVFJTON5BOR5/action/storage_attestation","attest_author":"https://pith.science/pith/KV6IHKB6KNNDGVNVFJTON5BOR5/action/author_attestation","sign_citation":"https://pith.science/pith/KV6IHKB6KNNDGVNVFJTON5BOR5/action/citation_signature","submit_replication":"https://pith.science/pith/KV6IHKB6KNNDGVNVFJTON5BOR5/action/replication_record"}},"created_at":"2026-05-18T00:11:22.340282+00:00","updated_at":"2026-05-18T00:11:22.340282+00:00"}