{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:RDKWSCFXKNCPB7O4PMS25FD2ZG","short_pith_number":"pith:RDKWSCFX","schema_version":"1.0","canonical_sha256":"88d56908b75344f0fddc7b25ae947ac99ade80ce28f300c41f08568962a43eb3","source":{"kind":"arxiv","id":"2211.12923","version":1},"attestation_state":"computed","paper":{"title":"A Calculus for Amortized Expected Runtimes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Benjamin Lucien Kaminski, Christoph Matheja, Joost-Pieter Katoen, Kevin Batz, Lena Verscht","submitted_at":"2022-11-23T12:55:14Z","abstract_excerpt":"We develop a weakest-precondition-style calculus \\`a la Dijkstra for reasoning about amortized expected runtimes of randomized algorithms with access to dynamic memory - the $\\textsf{aert}$ calculus. Our calculus is truly quantitative, i.e. instead of Boolean valued predicates, it manipulates real-valued functions.\n  En route to the $\\textsf{aert}$ calculus, we study the $\\textsf{ert}$ calculus for reasoning about expected runtimes of Kaminski et al. [2018] extended by capabilities for handling dynamic memory, thus enabling compositional and local reasoning about randomized data structures. Th"},"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":"2211.12923","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2022-11-23T12:55:14Z","cross_cats_sorted":[],"title_canon_sha256":"5e6f10f1b8dbee02365c15011f817b9835afd544fc5fd8e38b1583bf24fe6201","abstract_canon_sha256":"ed0383be2b22cc4116cb3b6d07523f83ba0a82de3dcafbe780736da903988887"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:18:56.481174Z","signature_b64":"8jYlPV9usELA7hyE+OupGdeH5rCQrfZPDFiyW/U1LtxxGI8yzgv6XKIzb3nvZi7g0drNPEHKpEsiqJVhcFn/Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88d56908b75344f0fddc7b25ae947ac99ade80ce28f300c41f08568962a43eb3","last_reissued_at":"2026-07-05T05:18:56.480766Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:18:56.480766Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Calculus for Amortized Expected Runtimes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Benjamin Lucien Kaminski, Christoph Matheja, Joost-Pieter Katoen, Kevin Batz, Lena Verscht","submitted_at":"2022-11-23T12:55:14Z","abstract_excerpt":"We develop a weakest-precondition-style calculus \\`a la Dijkstra for reasoning about amortized expected runtimes of randomized algorithms with access to dynamic memory - the $\\textsf{aert}$ calculus. Our calculus is truly quantitative, i.e. instead of Boolean valued predicates, it manipulates real-valued functions.\n  En route to the $\\textsf{aert}$ calculus, we study the $\\textsf{ert}$ calculus for reasoning about expected runtimes of Kaminski et al. [2018] extended by capabilities for handling dynamic memory, thus enabling compositional and local reasoning about randomized data structures. Th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.12923","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2211.12923/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2211.12923","created_at":"2026-07-05T05:18:56.480820+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.12923v1","created_at":"2026-07-05T05:18:56.480820+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.12923","created_at":"2026-07-05T05:18:56.480820+00:00"},{"alias_kind":"pith_short_12","alias_value":"RDKWSCFXKNCP","created_at":"2026-07-05T05:18:56.480820+00:00"},{"alias_kind":"pith_short_16","alias_value":"RDKWSCFXKNCPB7O4","created_at":"2026-07-05T05:18:56.480820+00:00"},{"alias_kind":"pith_short_8","alias_value":"RDKWSCFX","created_at":"2026-07-05T05:18:56.480820+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/RDKWSCFXKNCPB7O4PMS25FD2ZG","json":"https://pith.science/pith/RDKWSCFXKNCPB7O4PMS25FD2ZG.json","graph_json":"https://pith.science/api/pith-number/RDKWSCFXKNCPB7O4PMS25FD2ZG/graph.json","events_json":"https://pith.science/api/pith-number/RDKWSCFXKNCPB7O4PMS25FD2ZG/events.json","paper":"https://pith.science/paper/RDKWSCFX"},"agent_actions":{"view_html":"https://pith.science/pith/RDKWSCFXKNCPB7O4PMS25FD2ZG","download_json":"https://pith.science/pith/RDKWSCFXKNCPB7O4PMS25FD2ZG.json","view_paper":"https://pith.science/paper/RDKWSCFX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.12923&json=true","fetch_graph":"https://pith.science/api/pith-number/RDKWSCFXKNCPB7O4PMS25FD2ZG/graph.json","fetch_events":"https://pith.science/api/pith-number/RDKWSCFXKNCPB7O4PMS25FD2ZG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RDKWSCFXKNCPB7O4PMS25FD2ZG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RDKWSCFXKNCPB7O4PMS25FD2ZG/action/storage_attestation","attest_author":"https://pith.science/pith/RDKWSCFXKNCPB7O4PMS25FD2ZG/action/author_attestation","sign_citation":"https://pith.science/pith/RDKWSCFXKNCPB7O4PMS25FD2ZG/action/citation_signature","submit_replication":"https://pith.science/pith/RDKWSCFXKNCPB7O4PMS25FD2ZG/action/replication_record"}},"created_at":"2026-07-05T05:18:56.480820+00:00","updated_at":"2026-07-05T05:18:56.480820+00:00"}