{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:MCSOU3QX3QMXFKJGJFS3ROVEHB","short_pith_number":"pith:MCSOU3QX","schema_version":"1.0","canonical_sha256":"60a4ea6e17dc1972a9264965b8baa438773458962faa7a1237122521faef4744","source":{"kind":"arxiv","id":"2209.05149","version":1},"attestation_state":"computed","paper":{"title":"Type checking data structures more complex than trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Jin Sano, Kazunori Ueda, Naoki Yamamoto","submitted_at":"2022-09-12T11:09:47Z","abstract_excerpt":"Graphs are a generalized concept that encompasses more complex data structures than trees, such as difference lists, doubly-linked lists, skip lists, and leaf-linked trees. Normally, these structures are handled with destructive assignments to heaps, which is opposed to a purely functional programming style and makes verification difficult. We propose a new purely functional language, $\\lambda_{GT}$, that handles graphs as immutable, first-class data structures with a pattern matching mechanism based on Graph Transformation and developed a new type system, $F_{GT}$, for the language. Our appro"},"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":"2209.05149","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2022-09-12T11:09:47Z","cross_cats_sorted":[],"title_canon_sha256":"3e64f1c7c66e569c813910ca1f0a482aa520fec1a93018ff650570ae30c14c82","abstract_canon_sha256":"73558fb8d75f4d8f2ec45d441e4784d8f947a6a8a0b9942e28a067852d04d749"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:56:27.443052Z","signature_b64":"RrdFZYDpQHC8UzIHAwnMOKw8ClJe6299woUOpSvfih4Wc7ba+8QGznvwNMbLpQqnxaT6uYe28LJ9XEEh0HXzDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60a4ea6e17dc1972a9264965b8baa438773458962faa7a1237122521faef4744","last_reissued_at":"2026-07-05T04:56:27.442698Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:56:27.442698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Type checking data structures more complex than trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Jin Sano, Kazunori Ueda, Naoki Yamamoto","submitted_at":"2022-09-12T11:09:47Z","abstract_excerpt":"Graphs are a generalized concept that encompasses more complex data structures than trees, such as difference lists, doubly-linked lists, skip lists, and leaf-linked trees. Normally, these structures are handled with destructive assignments to heaps, which is opposed to a purely functional programming style and makes verification difficult. We propose a new purely functional language, $\\lambda_{GT}$, that handles graphs as immutable, first-class data structures with a pattern matching mechanism based on Graph Transformation and developed a new type system, $F_{GT}$, for the language. Our appro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.05149","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/2209.05149/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":"2209.05149","created_at":"2026-07-05T04:56:27.442758+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.05149v1","created_at":"2026-07-05T04:56:27.442758+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.05149","created_at":"2026-07-05T04:56:27.442758+00:00"},{"alias_kind":"pith_short_12","alias_value":"MCSOU3QX3QMX","created_at":"2026-07-05T04:56:27.442758+00:00"},{"alias_kind":"pith_short_16","alias_value":"MCSOU3QX3QMXFKJG","created_at":"2026-07-05T04:56:27.442758+00:00"},{"alias_kind":"pith_short_8","alias_value":"MCSOU3QX","created_at":"2026-07-05T04:56:27.442758+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/MCSOU3QX3QMXFKJGJFS3ROVEHB","json":"https://pith.science/pith/MCSOU3QX3QMXFKJGJFS3ROVEHB.json","graph_json":"https://pith.science/api/pith-number/MCSOU3QX3QMXFKJGJFS3ROVEHB/graph.json","events_json":"https://pith.science/api/pith-number/MCSOU3QX3QMXFKJGJFS3ROVEHB/events.json","paper":"https://pith.science/paper/MCSOU3QX"},"agent_actions":{"view_html":"https://pith.science/pith/MCSOU3QX3QMXFKJGJFS3ROVEHB","download_json":"https://pith.science/pith/MCSOU3QX3QMXFKJGJFS3ROVEHB.json","view_paper":"https://pith.science/paper/MCSOU3QX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.05149&json=true","fetch_graph":"https://pith.science/api/pith-number/MCSOU3QX3QMXFKJGJFS3ROVEHB/graph.json","fetch_events":"https://pith.science/api/pith-number/MCSOU3QX3QMXFKJGJFS3ROVEHB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MCSOU3QX3QMXFKJGJFS3ROVEHB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MCSOU3QX3QMXFKJGJFS3ROVEHB/action/storage_attestation","attest_author":"https://pith.science/pith/MCSOU3QX3QMXFKJGJFS3ROVEHB/action/author_attestation","sign_citation":"https://pith.science/pith/MCSOU3QX3QMXFKJGJFS3ROVEHB/action/citation_signature","submit_replication":"https://pith.science/pith/MCSOU3QX3QMXFKJGJFS3ROVEHB/action/replication_record"}},"created_at":"2026-07-05T04:56:27.442758+00:00","updated_at":"2026-07-05T04:56:27.442758+00:00"}