{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:MCSOU3QX3QMXFKJGJFS3ROVEHB","short_pith_number":"pith:MCSOU3QX","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"},"canonical_sha256":"60a4ea6e17dc1972a9264965b8baa438773458962faa7a1237122521faef4744","source":{"kind":"arxiv","id":"2209.05149","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2209.05149","created_at":"2026-07-05T04:56:27Z"},{"alias_kind":"arxiv_version","alias_value":"2209.05149v1","created_at":"2026-07-05T04:56:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.05149","created_at":"2026-07-05T04:56:27Z"},{"alias_kind":"pith_short_12","alias_value":"MCSOU3QX3QMX","created_at":"2026-07-05T04:56:27Z"},{"alias_kind":"pith_short_16","alias_value":"MCSOU3QX3QMXFKJG","created_at":"2026-07-05T04:56:27Z"},{"alias_kind":"pith_short_8","alias_value":"MCSOU3QX","created_at":"2026-07-05T04:56:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:MCSOU3QX3QMXFKJGJFS3ROVEHB","target":"record","payload":{"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"},"canonical_sha256":"60a4ea6e17dc1972a9264965b8baa438773458962faa7a1237122521faef4744","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"},"source_kind":"arxiv","source_id":"2209.05149","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-07-05T04:56:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HwlECa6q+Q+63ViYQI0Acdl2zPJhpKzASKm+YBQajRXa16lSC6O4ifxOAMQypcejqtag70SWySztse9jtwofCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T02:41:53.963861Z"},"content_sha256":"68f80436eca2114091af4ebc5a167114477264a4873d8e4e22886c0db76bf829","schema_version":"1.0","event_id":"sha256:68f80436eca2114091af4ebc5a167114477264a4873d8e4e22886c0db76bf829"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:MCSOU3QX3QMXFKJGJFS3ROVEHB","target":"graph","payload":{"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"},"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-07-05T04:56:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E4Mn4lR3rNQ50FzLPHCzR1Oygv7p+0S1WAZrMzaL6KKUx/0zdK/7auocvvxsQnTp3NKO+Ku/xKJwg/w45gdlDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T02:41:53.964232Z"},"content_sha256":"4ede7a8475994037cc09e3f677c9d93dd0509d722ac0c2e9848576f02ec0b9ae","schema_version":"1.0","event_id":"sha256:4ede7a8475994037cc09e3f677c9d93dd0509d722ac0c2e9848576f02ec0b9ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MCSOU3QX3QMXFKJGJFS3ROVEHB/bundle.json","state_url":"https://pith.science/pith/MCSOU3QX3QMXFKJGJFS3ROVEHB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MCSOU3QX3QMXFKJGJFS3ROVEHB/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-07-09T02:41:53Z","links":{"resolver":"https://pith.science/pith/MCSOU3QX3QMXFKJGJFS3ROVEHB","bundle":"https://pith.science/pith/MCSOU3QX3QMXFKJGJFS3ROVEHB/bundle.json","state":"https://pith.science/pith/MCSOU3QX3QMXFKJGJFS3ROVEHB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MCSOU3QX3QMXFKJGJFS3ROVEHB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:MCSOU3QX3QMXFKJGJFS3ROVEHB","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":"73558fb8d75f4d8f2ec45d441e4784d8f947a6a8a0b9942e28a067852d04d749","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2022-09-12T11:09:47Z","title_canon_sha256":"3e64f1c7c66e569c813910ca1f0a482aa520fec1a93018ff650570ae30c14c82"},"schema_version":"1.0","source":{"id":"2209.05149","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2209.05149","created_at":"2026-07-05T04:56:27Z"},{"alias_kind":"arxiv_version","alias_value":"2209.05149v1","created_at":"2026-07-05T04:56:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.05149","created_at":"2026-07-05T04:56:27Z"},{"alias_kind":"pith_short_12","alias_value":"MCSOU3QX3QMX","created_at":"2026-07-05T04:56:27Z"},{"alias_kind":"pith_short_16","alias_value":"MCSOU3QX3QMXFKJG","created_at":"2026-07-05T04:56:27Z"},{"alias_kind":"pith_short_8","alias_value":"MCSOU3QX","created_at":"2026-07-05T04:56:27Z"}],"graph_snapshots":[{"event_id":"sha256:4ede7a8475994037cc09e3f677c9d93dd0509d722ac0c2e9848576f02ec0b9ae","target":"graph","created_at":"2026-07-05T04:56:27Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2209.05149/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Jin Sano, Kazunori Ueda, Naoki Yamamoto","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2022-09-12T11:09:47Z","title":"Type checking data structures more complex than trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.05149","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:68f80436eca2114091af4ebc5a167114477264a4873d8e4e22886c0db76bf829","target":"record","created_at":"2026-07-05T04:56:27Z","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":"73558fb8d75f4d8f2ec45d441e4784d8f947a6a8a0b9942e28a067852d04d749","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2022-09-12T11:09:47Z","title_canon_sha256":"3e64f1c7c66e569c813910ca1f0a482aa520fec1a93018ff650570ae30c14c82"},"schema_version":"1.0","source":{"id":"2209.05149","kind":"arxiv","version":1}},"canonical_sha256":"60a4ea6e17dc1972a9264965b8baa438773458962faa7a1237122521faef4744","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"60a4ea6e17dc1972a9264965b8baa438773458962faa7a1237122521faef4744","first_computed_at":"2026-07-05T04:56:27.442698Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:56:27.442698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RrdFZYDpQHC8UzIHAwnMOKw8ClJe6299woUOpSvfih4Wc7ba+8QGznvwNMbLpQqnxaT6uYe28LJ9XEEh0HXzDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:56:27.443052Z","signed_message":"canonical_sha256_bytes"},"source_id":"2209.05149","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:68f80436eca2114091af4ebc5a167114477264a4873d8e4e22886c0db76bf829","sha256:4ede7a8475994037cc09e3f677c9d93dd0509d722ac0c2e9848576f02ec0b9ae"],"state_sha256":"fdafbbc143c0f02836b352a186ac0fdf6eeef14ab057a196ca4a83d5ce7b5894"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mdr3+Gwa++umIuJyLpcuP+P3WK85937Wh0oSZgdEsN3OaG3FxUZxq3xmR1pHV4keCcBeYF3DaUqVFja53U8iCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-09T02:41:53.966276Z","bundle_sha256":"1def490fb376ba8eef541c13c2258d8785585cc24248d0811386ea2d291a33e2"}}