{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:YW7TMSSRONDIVB2JIRJKYN6ZLT","short_pith_number":"pith:YW7TMSSR","canonical_record":{"source":{"id":"1704.05585","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-04-19T02:19:27Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"8944d41a0db5371b9b83df859fa0bbf4136a4ed897eeeb41eecad5c8bb8a04e7","abstract_canon_sha256":"44d0a60dc80d0d5942da4032df9daf30aeb371eaa6e78c473af84a280d292c30"},"schema_version":"1.0"},"canonical_sha256":"c5bf364a5173468a87494452ac37d95cc34d0e00f3cbf80fc0606408030fbc1b","source":{"kind":"arxiv","id":"1704.05585","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.05585","created_at":"2026-05-18T00:46:07Z"},{"alias_kind":"arxiv_version","alias_value":"1704.05585v1","created_at":"2026-05-18T00:46:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05585","created_at":"2026-05-18T00:46:07Z"},{"alias_kind":"pith_short_12","alias_value":"YW7TMSSRONDI","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YW7TMSSRONDIVB2J","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YW7TMSSR","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:YW7TMSSRONDIVB2JIRJKYN6ZLT","target":"record","payload":{"canonical_record":{"source":{"id":"1704.05585","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-04-19T02:19:27Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"8944d41a0db5371b9b83df859fa0bbf4136a4ed897eeeb41eecad5c8bb8a04e7","abstract_canon_sha256":"44d0a60dc80d0d5942da4032df9daf30aeb371eaa6e78c473af84a280d292c30"},"schema_version":"1.0"},"canonical_sha256":"c5bf364a5173468a87494452ac37d95cc34d0e00f3cbf80fc0606408030fbc1b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:07.048432Z","signature_b64":"blElM5MHOuNSu6aZ8Q2qpyMA1dC8GYwNZeMornNxB3O9mu0DJh3DZIxDuF5Dcr0Ktq53BH6z67RSxMHI0giqCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5bf364a5173468a87494452ac37d95cc34d0e00f3cbf80fc0606408030fbc1b","last_reissued_at":"2026-05-18T00:46:07.048063Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:07.048063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.05585","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:46:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i0vopyLKmHQGCf41TBYrJUe2hUS3g8QspKmQwlAkQ2x2bVsjTGwmuoZKHtgvewaFhCcSbZkKNAgYYQoi4ynCCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:30:48.399306Z"},"content_sha256":"eb654f351c2257ad2d2b58509cbd35953dc42eec0a4e37acab7ac2d7f59f45c1","schema_version":"1.0","event_id":"sha256:eb654f351c2257ad2d2b58509cbd35953dc42eec0a4e37acab7ac2d7f59f45c1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:YW7TMSSRONDIVB2JIRJKYN6ZLT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Automated Sized-Type Inference and Complexity Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"INRIA), Martin Avanzini (University of Innsbruck), Ugo Dal Lago (University of Bologna","submitted_at":"2017-04-19T02:19:27Z","abstract_excerpt":"This paper introduces a new methodology for the complexity analysis of higher-order functional programs, which is based on three components: a powerful type system for size analysis and a sound type inference procedure for it, a ticking monadic transformation and a concrete tool for constraint solving. Noticeably, the presented methodology can be fully automated, and is able to analyse a series of examples which cannot be handled by most competitor methodologies. This is possible due to various key ingredients, and in particular an abstract index language and index polymorphism at higher ranks"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.05585","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:46:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ROfhrzQnxKVO+2k0VKuT/EJrr95PyRAhz40rJMQ7x7QpQFDoKMNY9W6lMMu8cHZOmYXIygyap7XX6LSL1/crCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:30:48.399677Z"},"content_sha256":"e82c84cf0cf80b9c94fbc89e043c42b85795842a5f554be1c4fe42b9e9f59a80","schema_version":"1.0","event_id":"sha256:e82c84cf0cf80b9c94fbc89e043c42b85795842a5f554be1c4fe42b9e9f59a80"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YW7TMSSRONDIVB2JIRJKYN6ZLT/bundle.json","state_url":"https://pith.science/pith/YW7TMSSRONDIVB2JIRJKYN6ZLT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YW7TMSSRONDIVB2JIRJKYN6ZLT/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T06:30:48Z","links":{"resolver":"https://pith.science/pith/YW7TMSSRONDIVB2JIRJKYN6ZLT","bundle":"https://pith.science/pith/YW7TMSSRONDIVB2JIRJKYN6ZLT/bundle.json","state":"https://pith.science/pith/YW7TMSSRONDIVB2JIRJKYN6ZLT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YW7TMSSRONDIVB2JIRJKYN6ZLT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YW7TMSSRONDIVB2JIRJKYN6ZLT","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"44d0a60dc80d0d5942da4032df9daf30aeb371eaa6e78c473af84a280d292c30","cross_cats_sorted":["cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-04-19T02:19:27Z","title_canon_sha256":"8944d41a0db5371b9b83df859fa0bbf4136a4ed897eeeb41eecad5c8bb8a04e7"},"schema_version":"1.0","source":{"id":"1704.05585","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.05585","created_at":"2026-05-18T00:46:07Z"},{"alias_kind":"arxiv_version","alias_value":"1704.05585v1","created_at":"2026-05-18T00:46:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05585","created_at":"2026-05-18T00:46:07Z"},{"alias_kind":"pith_short_12","alias_value":"YW7TMSSRONDI","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YW7TMSSRONDIVB2J","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YW7TMSSR","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:e82c84cf0cf80b9c94fbc89e043c42b85795842a5f554be1c4fe42b9e9f59a80","target":"graph","created_at":"2026-05-18T00:46:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"This paper introduces a new methodology for the complexity analysis of higher-order functional programs, which is based on three components: a powerful type system for size analysis and a sound type inference procedure for it, a ticking monadic transformation and a concrete tool for constraint solving. Noticeably, the presented methodology can be fully automated, and is able to analyse a series of examples which cannot be handled by most competitor methodologies. This is possible due to various key ingredients, and in particular an abstract index language and index polymorphism at higher ranks","authors_text":"INRIA), Martin Avanzini (University of Innsbruck), Ugo Dal Lago (University of Bologna","cross_cats":["cs.PL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-04-19T02:19:27Z","title":"Automated Sized-Type Inference and Complexity Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.05585","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:eb654f351c2257ad2d2b58509cbd35953dc42eec0a4e37acab7ac2d7f59f45c1","target":"record","created_at":"2026-05-18T00:46:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"44d0a60dc80d0d5942da4032df9daf30aeb371eaa6e78c473af84a280d292c30","cross_cats_sorted":["cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-04-19T02:19:27Z","title_canon_sha256":"8944d41a0db5371b9b83df859fa0bbf4136a4ed897eeeb41eecad5c8bb8a04e7"},"schema_version":"1.0","source":{"id":"1704.05585","kind":"arxiv","version":1}},"canonical_sha256":"c5bf364a5173468a87494452ac37d95cc34d0e00f3cbf80fc0606408030fbc1b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c5bf364a5173468a87494452ac37d95cc34d0e00f3cbf80fc0606408030fbc1b","first_computed_at":"2026-05-18T00:46:07.048063Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:07.048063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"blElM5MHOuNSu6aZ8Q2qpyMA1dC8GYwNZeMornNxB3O9mu0DJh3DZIxDuF5Dcr0Ktq53BH6z67RSxMHI0giqCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:07.048432Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.05585","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb654f351c2257ad2d2b58509cbd35953dc42eec0a4e37acab7ac2d7f59f45c1","sha256:e82c84cf0cf80b9c94fbc89e043c42b85795842a5f554be1c4fe42b9e9f59a80"],"state_sha256":"5f7c2ad46c879f2a437a4a8445bb7b95a2aa10feb142a1570653c61e82b6e9be"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u0sk/dV9ivG0or0W2doIUuQEPXa3ttx/+o5iwTXJu90oiL3Hw6YjtjVLjgnWhK421MurRQ5Sj7SSjE4itlJ1AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T06:30:48.401668Z","bundle_sha256":"54aaa158efaff06739a92afa16804022f68f7e6ce054c1e4954b177ce00620c1"}}