{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:TFKRJXTPDL6BSDVPO6F763TKSL","short_pith_number":"pith:TFKRJXTP","canonical_record":{"source":{"id":"1801.01896","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-01-05T19:10:44Z","cross_cats_sorted":[],"title_canon_sha256":"52d4d51df729e63bf32ce58754ee8da82a38e6ce052b08ccc47e25fb1c868b95","abstract_canon_sha256":"7b9787d39a901e441dac9b2f281610838094a43612b7465e27be2a2d1e892c88"},"schema_version":"1.0"},"canonical_sha256":"995514de6f1afc190eaf778bff6e6a92c9641d1744345d6d49fdb67d3112ed8d","source":{"kind":"arxiv","id":"1801.01896","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.01896","created_at":"2026-05-18T00:26:40Z"},{"alias_kind":"arxiv_version","alias_value":"1801.01896v1","created_at":"2026-05-18T00:26:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.01896","created_at":"2026-05-18T00:26:40Z"},{"alias_kind":"pith_short_12","alias_value":"TFKRJXTPDL6B","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"TFKRJXTPDL6BSDVP","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"TFKRJXTP","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:TFKRJXTPDL6BSDVPO6F763TKSL","target":"record","payload":{"canonical_record":{"source":{"id":"1801.01896","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-01-05T19:10:44Z","cross_cats_sorted":[],"title_canon_sha256":"52d4d51df729e63bf32ce58754ee8da82a38e6ce052b08ccc47e25fb1c868b95","abstract_canon_sha256":"7b9787d39a901e441dac9b2f281610838094a43612b7465e27be2a2d1e892c88"},"schema_version":"1.0"},"canonical_sha256":"995514de6f1afc190eaf778bff6e6a92c9641d1744345d6d49fdb67d3112ed8d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:40.637966Z","signature_b64":"JCpxES73GMp51iUbZoaJSlmMVHUSrBEsOppGoZ+SMeIrcMqUrkrGUgayaRcEDFYVDGShExx0K7ycqqsT6RDgAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"995514de6f1afc190eaf778bff6e6a92c9641d1744345d6d49fdb67d3112ed8d","last_reissued_at":"2026-05-18T00:26:40.637455Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:40.637455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.01896","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:26:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aFczu/kjsFQBVcKPWvKEE8LBsTibMeUS2dT1BcXFAhRXQKV89wUJQB99CQf2yg7enkA7UkrACcJJvCGk/+LTDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T02:43:46.652791Z"},"content_sha256":"edd62db4991a94a51cdc6568112f0b39de0bc66b17d1f45f733db2b59033f26e","schema_version":"1.0","event_id":"sha256:edd62db4991a94a51cdc6568112f0b39de0bc66b17d1f45f733db2b59033f26e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:TFKRJXTPDL6BSDVPO6F763TKSL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Verifying and Synthesizing Constant-Resource Implementations with Types","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Jan Hoffmann, Mario Dehesa-Azuara, Matthew Fredrikson, Van Chan Ngo","submitted_at":"2018-01-05T19:10:44Z","abstract_excerpt":"We propose a novel type system for verifying that programs correctly implement constant-resource behavior. Our type system extends recent work on automatic amortized resource analysis (AARA), a set of techniques that automatically derive provable upper bounds on the resource consumption of programs. We devise new techniques that build on the potential method to achieve compositionality, precision, and automation.\n  A strict global requirement that a program always maintains constant resource usage is too restrictive for most practical applications. It is sufficient to require that the program'"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.01896","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:26:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JtZU3cOv42BbeginBU9IQQva+BpCSBc8vmWvdrQkZfYMNU4lyf4ryZMmdhAIZsPIST2BcgVvh37BXpnk7tvgBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T02:43:46.653259Z"},"content_sha256":"3fc4634f1c15c108cb6ca3de8843a1a490e640c1c0dde3d809acadf67a262005","schema_version":"1.0","event_id":"sha256:3fc4634f1c15c108cb6ca3de8843a1a490e640c1c0dde3d809acadf67a262005"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TFKRJXTPDL6BSDVPO6F763TKSL/bundle.json","state_url":"https://pith.science/pith/TFKRJXTPDL6BSDVPO6F763TKSL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TFKRJXTPDL6BSDVPO6F763TKSL/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-23T02:43:46Z","links":{"resolver":"https://pith.science/pith/TFKRJXTPDL6BSDVPO6F763TKSL","bundle":"https://pith.science/pith/TFKRJXTPDL6BSDVPO6F763TKSL/bundle.json","state":"https://pith.science/pith/TFKRJXTPDL6BSDVPO6F763TKSL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TFKRJXTPDL6BSDVPO6F763TKSL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:TFKRJXTPDL6BSDVPO6F763TKSL","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":"7b9787d39a901e441dac9b2f281610838094a43612b7465e27be2a2d1e892c88","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-01-05T19:10:44Z","title_canon_sha256":"52d4d51df729e63bf32ce58754ee8da82a38e6ce052b08ccc47e25fb1c868b95"},"schema_version":"1.0","source":{"id":"1801.01896","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.01896","created_at":"2026-05-18T00:26:40Z"},{"alias_kind":"arxiv_version","alias_value":"1801.01896v1","created_at":"2026-05-18T00:26:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.01896","created_at":"2026-05-18T00:26:40Z"},{"alias_kind":"pith_short_12","alias_value":"TFKRJXTPDL6B","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"TFKRJXTPDL6BSDVP","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"TFKRJXTP","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:3fc4634f1c15c108cb6ca3de8843a1a490e640c1c0dde3d809acadf67a262005","target":"graph","created_at":"2026-05-18T00:26:40Z","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":"We propose a novel type system for verifying that programs correctly implement constant-resource behavior. Our type system extends recent work on automatic amortized resource analysis (AARA), a set of techniques that automatically derive provable upper bounds on the resource consumption of programs. We devise new techniques that build on the potential method to achieve compositionality, precision, and automation.\n  A strict global requirement that a program always maintains constant resource usage is too restrictive for most practical applications. It is sufficient to require that the program'","authors_text":"Jan Hoffmann, Mario Dehesa-Azuara, Matthew Fredrikson, Van Chan Ngo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-01-05T19:10:44Z","title":"Verifying and Synthesizing Constant-Resource Implementations with Types"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.01896","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:edd62db4991a94a51cdc6568112f0b39de0bc66b17d1f45f733db2b59033f26e","target":"record","created_at":"2026-05-18T00:26:40Z","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":"7b9787d39a901e441dac9b2f281610838094a43612b7465e27be2a2d1e892c88","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-01-05T19:10:44Z","title_canon_sha256":"52d4d51df729e63bf32ce58754ee8da82a38e6ce052b08ccc47e25fb1c868b95"},"schema_version":"1.0","source":{"id":"1801.01896","kind":"arxiv","version":1}},"canonical_sha256":"995514de6f1afc190eaf778bff6e6a92c9641d1744345d6d49fdb67d3112ed8d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"995514de6f1afc190eaf778bff6e6a92c9641d1744345d6d49fdb67d3112ed8d","first_computed_at":"2026-05-18T00:26:40.637455Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:40.637455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JCpxES73GMp51iUbZoaJSlmMVHUSrBEsOppGoZ+SMeIrcMqUrkrGUgayaRcEDFYVDGShExx0K7ycqqsT6RDgAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:40.637966Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.01896","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:edd62db4991a94a51cdc6568112f0b39de0bc66b17d1f45f733db2b59033f26e","sha256:3fc4634f1c15c108cb6ca3de8843a1a490e640c1c0dde3d809acadf67a262005"],"state_sha256":"310ffa3929512ef44e41231690652981a4a1e5de5817cbf884cb17de2a08da51"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qrDqu4Tn3HazcOr9Mw4Wwgqjoof01deIniDX26hJVzOwrwXl8wI+0gBeTUyDitigeXfg//JZwXttFVQLGJi+CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T02:43:46.656716Z","bundle_sha256":"eb19cfae85c1881bb96be13177e6bec580db5f23616973798e7828e5f607941b"}}