{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ZAYM4OSG7UUJLPDIVGL2HYAF7W","short_pith_number":"pith:ZAYM4OSG","canonical_record":{"source":{"id":"1611.00692","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-11-02T17:36:19Z","cross_cats_sorted":[],"title_canon_sha256":"47269af8a9dc3a58d14619166579ed7fe1656a7f50fb32e230152181458ca2f9","abstract_canon_sha256":"16a7db1abe17e30fb71dcf580f93435ec9b8a6b96af19ffbee7edd99bfcda7bd"},"schema_version":"1.0"},"canonical_sha256":"c830ce3a46fd2895bc68a997a3e005fd92d158be64dfcefefb8a4bcbd6997f50","source":{"kind":"arxiv","id":"1611.00692","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.00692","created_at":"2026-05-18T01:00:32Z"},{"alias_kind":"arxiv_version","alias_value":"1611.00692v1","created_at":"2026-05-18T01:00:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00692","created_at":"2026-05-18T01:00:32Z"},{"alias_kind":"pith_short_12","alias_value":"ZAYM4OSG7UUJ","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"ZAYM4OSG7UUJLPDI","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"ZAYM4OSG","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ZAYM4OSG7UUJLPDIVGL2HYAF7W","target":"record","payload":{"canonical_record":{"source":{"id":"1611.00692","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-11-02T17:36:19Z","cross_cats_sorted":[],"title_canon_sha256":"47269af8a9dc3a58d14619166579ed7fe1656a7f50fb32e230152181458ca2f9","abstract_canon_sha256":"16a7db1abe17e30fb71dcf580f93435ec9b8a6b96af19ffbee7edd99bfcda7bd"},"schema_version":"1.0"},"canonical_sha256":"c830ce3a46fd2895bc68a997a3e005fd92d158be64dfcefefb8a4bcbd6997f50","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:32.102132Z","signature_b64":"1aBRDJBA3dn0gf1FSptZdSTLWWiGwCbAd+FRMkzhBH//TvF1dUXWohTL0BgEKrsL7J39DjSfIjpKXt6J4X5KDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c830ce3a46fd2895bc68a997a3e005fd92d158be64dfcefefb8a4bcbd6997f50","last_reissued_at":"2026-05-18T01:00:32.101529Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:32.101529Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.00692","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-18T01:00:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3JQzUGehgoAz2QvYAt6HsmrxkCmcViwtGRp6oxB0jHqdlCGB59Hbl6wXeaNcm23hwZzgGKviGXSk5ZLERNAzAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:16:38.969806Z"},"content_sha256":"e39a7263aaeeaf46fae3036e82dabda074922db58f2af0a8fda1d4362e32debf","schema_version":"1.0","event_id":"sha256:e39a7263aaeeaf46fae3036e82dabda074922db58f2af0a8fda1d4362e32debf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ZAYM4OSG7UUJLPDIVGL2HYAF7W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards Automatic Resource Bound Analysis for OCaml","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Ankush Das, Jan Hoffmann, Shu-Chun Weng","submitted_at":"2016-11-02T17:36:19Z","abstract_excerpt":"This article presents a resource analysis system for OCaml programs. This system automatically derives worst-case resource bounds for higher-order polymorphic programs with user-defined inductive types. The technique is parametric in the resource and can derive bounds for time, memory allocations and energy usage. The derived bounds are multivariate resource polynomials which are functions of different size parameters that depend on the standard OCaml types. Bound inference is fully automatic and reduced to a linear optimization problem that is passed to an off-the-shelf LP solver. Technically"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.00692","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-18T01:00:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yo0T3/4R0zhSxO8ykTGgnx7MirwopYVKgx30dYX3ewiYeG+RIn+8QVmRZ9N2reuE1NqzAmf061nku4m8tVmJBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:16:38.970143Z"},"content_sha256":"00b86f34cec39c466d6544725a700a2fe473834e67ef7c7a5dafdeca907cc5c0","schema_version":"1.0","event_id":"sha256:00b86f34cec39c466d6544725a700a2fe473834e67ef7c7a5dafdeca907cc5c0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZAYM4OSG7UUJLPDIVGL2HYAF7W/bundle.json","state_url":"https://pith.science/pith/ZAYM4OSG7UUJLPDIVGL2HYAF7W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZAYM4OSG7UUJLPDIVGL2HYAF7W/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-02T04:16:38Z","links":{"resolver":"https://pith.science/pith/ZAYM4OSG7UUJLPDIVGL2HYAF7W","bundle":"https://pith.science/pith/ZAYM4OSG7UUJLPDIVGL2HYAF7W/bundle.json","state":"https://pith.science/pith/ZAYM4OSG7UUJLPDIVGL2HYAF7W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZAYM4OSG7UUJLPDIVGL2HYAF7W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ZAYM4OSG7UUJLPDIVGL2HYAF7W","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":"16a7db1abe17e30fb71dcf580f93435ec9b8a6b96af19ffbee7edd99bfcda7bd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-11-02T17:36:19Z","title_canon_sha256":"47269af8a9dc3a58d14619166579ed7fe1656a7f50fb32e230152181458ca2f9"},"schema_version":"1.0","source":{"id":"1611.00692","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.00692","created_at":"2026-05-18T01:00:32Z"},{"alias_kind":"arxiv_version","alias_value":"1611.00692v1","created_at":"2026-05-18T01:00:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00692","created_at":"2026-05-18T01:00:32Z"},{"alias_kind":"pith_short_12","alias_value":"ZAYM4OSG7UUJ","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"ZAYM4OSG7UUJLPDI","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"ZAYM4OSG","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:00b86f34cec39c466d6544725a700a2fe473834e67ef7c7a5dafdeca907cc5c0","target":"graph","created_at":"2026-05-18T01:00:32Z","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 article presents a resource analysis system for OCaml programs. This system automatically derives worst-case resource bounds for higher-order polymorphic programs with user-defined inductive types. The technique is parametric in the resource and can derive bounds for time, memory allocations and energy usage. The derived bounds are multivariate resource polynomials which are functions of different size parameters that depend on the standard OCaml types. Bound inference is fully automatic and reduced to a linear optimization problem that is passed to an off-the-shelf LP solver. Technically","authors_text":"Ankush Das, Jan Hoffmann, Shu-Chun Weng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-11-02T17:36:19Z","title":"Towards Automatic Resource Bound Analysis for OCaml"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.00692","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:e39a7263aaeeaf46fae3036e82dabda074922db58f2af0a8fda1d4362e32debf","target":"record","created_at":"2026-05-18T01:00:32Z","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":"16a7db1abe17e30fb71dcf580f93435ec9b8a6b96af19ffbee7edd99bfcda7bd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-11-02T17:36:19Z","title_canon_sha256":"47269af8a9dc3a58d14619166579ed7fe1656a7f50fb32e230152181458ca2f9"},"schema_version":"1.0","source":{"id":"1611.00692","kind":"arxiv","version":1}},"canonical_sha256":"c830ce3a46fd2895bc68a997a3e005fd92d158be64dfcefefb8a4bcbd6997f50","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c830ce3a46fd2895bc68a997a3e005fd92d158be64dfcefefb8a4bcbd6997f50","first_computed_at":"2026-05-18T01:00:32.101529Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:32.101529Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1aBRDJBA3dn0gf1FSptZdSTLWWiGwCbAd+FRMkzhBH//TvF1dUXWohTL0BgEKrsL7J39DjSfIjpKXt6J4X5KDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:32.102132Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.00692","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e39a7263aaeeaf46fae3036e82dabda074922db58f2af0a8fda1d4362e32debf","sha256:00b86f34cec39c466d6544725a700a2fe473834e67ef7c7a5dafdeca907cc5c0"],"state_sha256":"60035c891c9ae901c023acb11f25f6064c2a8f2908204a1a36f47bcf673e0432"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yuC209/cUb7Kbpz0M66uhpNlNr6e2M1PdHkYIckBgtRSJpoKe3rSMuybw1kRf3oIlpPM0JXeqQqwTUCg6ZruAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T04:16:38.972390Z","bundle_sha256":"67708ca748ba6b3f77d7c1f904638d16bde66b57901eb5563467645435080de1"}}