{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ILECLGVHFRAJMGRJPG4V7VP2Q6","short_pith_number":"pith:ILECLGVH","schema_version":"1.0","canonical_sha256":"42c8259aa72c40961a2979b95fd5fa87871e220bb20022b1e22d335f44720174","source":{"kind":"arxiv","id":"1401.7886","version":2},"attestation_state":"computed","paper":{"title":"Balancing lists: a proof pearl","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.DS","authors_text":"Arnaud Spiwack, Guyslain Naves","submitted_at":"2014-01-30T15:40:18Z","abstract_excerpt":"Starting with an algorithm to turn lists into full trees which uses non-obvious invariants and partial functions, we progressively encode the invariants in the types of the data, removing most of the burden of a correctness proof.\n  The invariants are encoded using non-uniform inductive types which parallel numerical representations in a style advertised by Okasaki, and a small amount of dependent types."},"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":"1401.7886","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DS","submitted_at":"2014-01-30T15:40:18Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"a51ac70c62fb0719b59a4570fa98bf24b23b87ca0ed247f81264637f72d50b70","abstract_canon_sha256":"c8b2dacf81b585519a5b4e9060406701e5b62e70e875c4aaa770656d4551c055"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:47.014029Z","signature_b64":"xyb/AzGVi8zSf7JqnOheqyZnmIIzTnbhhRBA5bZEZYS+2WXR7z/D5GPWpQLaUGUAZ6R9l/6C/bhFyNQMYmXXDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42c8259aa72c40961a2979b95fd5fa87871e220bb20022b1e22d335f44720174","last_reissued_at":"2026-05-18T02:49:47.013662Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:47.013662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Balancing lists: a proof pearl","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.DS","authors_text":"Arnaud Spiwack, Guyslain Naves","submitted_at":"2014-01-30T15:40:18Z","abstract_excerpt":"Starting with an algorithm to turn lists into full trees which uses non-obvious invariants and partial functions, we progressively encode the invariants in the types of the data, removing most of the burden of a correctness proof.\n  The invariants are encoded using non-uniform inductive types which parallel numerical representations in a style advertised by Okasaki, and a small amount of dependent types."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.7886","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":""},"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":"1401.7886","created_at":"2026-05-18T02:49:47.013722+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.7886v2","created_at":"2026-05-18T02:49:47.013722+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.7886","created_at":"2026-05-18T02:49:47.013722+00:00"},{"alias_kind":"pith_short_12","alias_value":"ILECLGVHFRAJ","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"ILECLGVHFRAJMGRJ","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"ILECLGVH","created_at":"2026-05-18T12:28:33.132498+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/ILECLGVHFRAJMGRJPG4V7VP2Q6","json":"https://pith.science/pith/ILECLGVHFRAJMGRJPG4V7VP2Q6.json","graph_json":"https://pith.science/api/pith-number/ILECLGVHFRAJMGRJPG4V7VP2Q6/graph.json","events_json":"https://pith.science/api/pith-number/ILECLGVHFRAJMGRJPG4V7VP2Q6/events.json","paper":"https://pith.science/paper/ILECLGVH"},"agent_actions":{"view_html":"https://pith.science/pith/ILECLGVHFRAJMGRJPG4V7VP2Q6","download_json":"https://pith.science/pith/ILECLGVHFRAJMGRJPG4V7VP2Q6.json","view_paper":"https://pith.science/paper/ILECLGVH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.7886&json=true","fetch_graph":"https://pith.science/api/pith-number/ILECLGVHFRAJMGRJPG4V7VP2Q6/graph.json","fetch_events":"https://pith.science/api/pith-number/ILECLGVHFRAJMGRJPG4V7VP2Q6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ILECLGVHFRAJMGRJPG4V7VP2Q6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ILECLGVHFRAJMGRJPG4V7VP2Q6/action/storage_attestation","attest_author":"https://pith.science/pith/ILECLGVHFRAJMGRJPG4V7VP2Q6/action/author_attestation","sign_citation":"https://pith.science/pith/ILECLGVHFRAJMGRJPG4V7VP2Q6/action/citation_signature","submit_replication":"https://pith.science/pith/ILECLGVHFRAJMGRJPG4V7VP2Q6/action/replication_record"}},"created_at":"2026-05-18T02:49:47.013722+00:00","updated_at":"2026-05-18T02:49:47.013722+00:00"}