{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:C6HSIT4JLZZS4BIPDP4AN2IDPQ","short_pith_number":"pith:C6HSIT4J","schema_version":"1.0","canonical_sha256":"178f244f895e732e050f1bf806e9037c215f9252a0c0d67722bb6432352bfb2f","source":{"kind":"arxiv","id":"2309.11056","version":2},"attestation_state":"computed","paper":{"title":"A Verified Cost Analysis of Joinable Red-Black Trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.PL","authors_text":"Harrison Grodin (1), Robert Harper (1) ((1) Carnegie Mellon University), Runming Li (1)","submitted_at":"2023-09-20T04:29:05Z","abstract_excerpt":"Ordered sequences of data, specified with a join operation to combine sequences, serve as a foundation for the implementation of parallel functional algorithms. This abstract data type can be elegantly and efficiently implemented using balanced binary trees, where a join operation is provided to combine two trees and rebalance as necessary. In this work, we present a verified implementation and cost analysis of joinable red-black trees in $\\textbf{calf}$, a dependent type theory for cost analysis. We implement red-black trees and auxiliary intermediate data structures in such a way that all co"},"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":"2309.11056","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2023-09-20T04:29:05Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"f7181e84fa60130ccba923c4c9b97816c367b7de44407a53bb2aa4f7ac2e61b3","abstract_canon_sha256":"bee51284169be9d664345066340954f5a6ce6dbc9f1f8499c7e85f879711067c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:53:45.237160Z","signature_b64":"37K/9IVTu2t3d7p6FAbP6qDWDGtwwZE5jxsfJafOIGnCN5rmU64b7OyHWvIdiNfaFTEx6AdP9xOrD/N1n98gAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"178f244f895e732e050f1bf806e9037c215f9252a0c0d67722bb6432352bfb2f","last_reissued_at":"2026-07-05T06:53:45.236749Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:53:45.236749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Verified Cost Analysis of Joinable Red-Black Trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.PL","authors_text":"Harrison Grodin (1), Robert Harper (1) ((1) Carnegie Mellon University), Runming Li (1)","submitted_at":"2023-09-20T04:29:05Z","abstract_excerpt":"Ordered sequences of data, specified with a join operation to combine sequences, serve as a foundation for the implementation of parallel functional algorithms. This abstract data type can be elegantly and efficiently implemented using balanced binary trees, where a join operation is provided to combine two trees and rebalance as necessary. In this work, we present a verified implementation and cost analysis of joinable red-black trees in $\\textbf{calf}$, a dependent type theory for cost analysis. We implement red-black trees and auxiliary intermediate data structures in such a way that all co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.11056","kind":"arxiv","version":2},"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/2309.11056/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":"2309.11056","created_at":"2026-07-05T06:53:45.236817+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.11056v2","created_at":"2026-07-05T06:53:45.236817+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.11056","created_at":"2026-07-05T06:53:45.236817+00:00"},{"alias_kind":"pith_short_12","alias_value":"C6HSIT4JLZZS","created_at":"2026-07-05T06:53:45.236817+00:00"},{"alias_kind":"pith_short_16","alias_value":"C6HSIT4JLZZS4BIP","created_at":"2026-07-05T06:53:45.236817+00:00"},{"alias_kind":"pith_short_8","alias_value":"C6HSIT4J","created_at":"2026-07-05T06:53:45.236817+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.12464","citing_title":"Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability","ref_index":2023,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/C6HSIT4JLZZS4BIPDP4AN2IDPQ","json":"https://pith.science/pith/C6HSIT4JLZZS4BIPDP4AN2IDPQ.json","graph_json":"https://pith.science/api/pith-number/C6HSIT4JLZZS4BIPDP4AN2IDPQ/graph.json","events_json":"https://pith.science/api/pith-number/C6HSIT4JLZZS4BIPDP4AN2IDPQ/events.json","paper":"https://pith.science/paper/C6HSIT4J"},"agent_actions":{"view_html":"https://pith.science/pith/C6HSIT4JLZZS4BIPDP4AN2IDPQ","download_json":"https://pith.science/pith/C6HSIT4JLZZS4BIPDP4AN2IDPQ.json","view_paper":"https://pith.science/paper/C6HSIT4J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.11056&json=true","fetch_graph":"https://pith.science/api/pith-number/C6HSIT4JLZZS4BIPDP4AN2IDPQ/graph.json","fetch_events":"https://pith.science/api/pith-number/C6HSIT4JLZZS4BIPDP4AN2IDPQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C6HSIT4JLZZS4BIPDP4AN2IDPQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C6HSIT4JLZZS4BIPDP4AN2IDPQ/action/storage_attestation","attest_author":"https://pith.science/pith/C6HSIT4JLZZS4BIPDP4AN2IDPQ/action/author_attestation","sign_citation":"https://pith.science/pith/C6HSIT4JLZZS4BIPDP4AN2IDPQ/action/citation_signature","submit_replication":"https://pith.science/pith/C6HSIT4JLZZS4BIPDP4AN2IDPQ/action/replication_record"}},"created_at":"2026-07-05T06:53:45.236817+00:00","updated_at":"2026-07-05T06:53:45.236817+00:00"}