{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:HX4DBOZTP7JP7QCPTLPYL2GN34","short_pith_number":"pith:HX4DBOZT","canonical_record":{"source":{"id":"2103.14698","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2021-03-02T03:36:58Z","cross_cats_sorted":[],"title_canon_sha256":"b942ae1caffdcd854c0439252e2031cb5b29b33d5d73558e5888aa1bf8df7227","abstract_canon_sha256":"9b46cd24b1451941d713b6e7ec52384df51c0526c199681942361c34c3d442c4"},"schema_version":"1.0"},"canonical_sha256":"3df830bb337fd2ffc04f9adf85e8cddf24e98620803bbe46c169198c96242052","source":{"kind":"arxiv","id":"2103.14698","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2103.14698","created_at":"2026-07-05T02:26:58Z"},{"alias_kind":"arxiv_version","alias_value":"2103.14698v1","created_at":"2026-07-05T02:26:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.14698","created_at":"2026-07-05T02:26:58Z"},{"alias_kind":"pith_short_12","alias_value":"HX4DBOZTP7JP","created_at":"2026-07-05T02:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"HX4DBOZTP7JP7QCP","created_at":"2026-07-05T02:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"HX4DBOZT","created_at":"2026-07-05T02:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:HX4DBOZTP7JP7QCPTLPYL2GN34","target":"record","payload":{"canonical_record":{"source":{"id":"2103.14698","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2021-03-02T03:36:58Z","cross_cats_sorted":[],"title_canon_sha256":"b942ae1caffdcd854c0439252e2031cb5b29b33d5d73558e5888aa1bf8df7227","abstract_canon_sha256":"9b46cd24b1451941d713b6e7ec52384df51c0526c199681942361c34c3d442c4"},"schema_version":"1.0"},"canonical_sha256":"3df830bb337fd2ffc04f9adf85e8cddf24e98620803bbe46c169198c96242052","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:26:58.505062Z","signature_b64":"9f3quo7Wms21Gij7tafxBOYPeM6ihMhBIZ2fZzNyV0Xlrkf6Kwz01uRf+a3a7fcRYOc/7GXPeoczJc3u0Q/GDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3df830bb337fd2ffc04f9adf85e8cddf24e98620803bbe46c169198c96242052","last_reissued_at":"2026-07-05T02:26:58.504665Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:26:58.504665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2103.14698","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-05T02:26:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NpWOVLiV9HpRZOpbSEv8nk+WVLKYRDz2A1pOP8WvIp1qB82DmMr2xVARZ8vXlFFrLQI3IL+Zo6Wkh0P2KE+OCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T11:28:27.710894Z"},"content_sha256":"940508fe22a5d675ae4dfab0c005da5ae151a6c80b6b883ac5553044f61a50ff","schema_version":"1.0","event_id":"sha256:940508fe22a5d675ae4dfab0c005da5ae151a6c80b6b883ac5553044f61a50ff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:HX4DBOZTP7JP7QCPTLPYL2GN34","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Implementing G-Machine in HyperLMNtal","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Jin Sano","submitted_at":"2021-03-02T03:36:58Z","abstract_excerpt":"Since language processing systems generally allocate/discard memory with complex reference relationships, including circular and indirect references, their implementation is often not trivial. Here, the allocated memory and the references can be abstracted to the labeled vertices and edges of a graph. And there exists a graph rewriting language, a programming language or a calculation model that can handle graph intuitively, safely and efficiently. Therefore, the implementation of a language processing system can be highly expected as an application field of graph rewriting language. To show t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.14698","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/2103.14698/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-05T02:26:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VExnku2vT+SX4PDAyAhm+/Yd69Pz+rUpxp/IEvFUeKkgc10hfYoRZs/rx44tNVQyai1mEbXBrcjw5n/bP6FDDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T11:28:27.711799Z"},"content_sha256":"c5b57399ae37caaa66c39ba183b116048d4023744e4f98b31e74dc95f2d41cd1","schema_version":"1.0","event_id":"sha256:c5b57399ae37caaa66c39ba183b116048d4023744e4f98b31e74dc95f2d41cd1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HX4DBOZTP7JP7QCPTLPYL2GN34/bundle.json","state_url":"https://pith.science/pith/HX4DBOZTP7JP7QCPTLPYL2GN34/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HX4DBOZTP7JP7QCPTLPYL2GN34/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-08-06T11:28:27Z","links":{"resolver":"https://pith.science/pith/HX4DBOZTP7JP7QCPTLPYL2GN34","bundle":"https://pith.science/pith/HX4DBOZTP7JP7QCPTLPYL2GN34/bundle.json","state":"https://pith.science/pith/HX4DBOZTP7JP7QCPTLPYL2GN34/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HX4DBOZTP7JP7QCPTLPYL2GN34/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:HX4DBOZTP7JP7QCPTLPYL2GN34","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":"9b46cd24b1451941d713b6e7ec52384df51c0526c199681942361c34c3d442c4","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2021-03-02T03:36:58Z","title_canon_sha256":"b942ae1caffdcd854c0439252e2031cb5b29b33d5d73558e5888aa1bf8df7227"},"schema_version":"1.0","source":{"id":"2103.14698","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2103.14698","created_at":"2026-07-05T02:26:58Z"},{"alias_kind":"arxiv_version","alias_value":"2103.14698v1","created_at":"2026-07-05T02:26:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.14698","created_at":"2026-07-05T02:26:58Z"},{"alias_kind":"pith_short_12","alias_value":"HX4DBOZTP7JP","created_at":"2026-07-05T02:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"HX4DBOZTP7JP7QCP","created_at":"2026-07-05T02:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"HX4DBOZT","created_at":"2026-07-05T02:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:c5b57399ae37caaa66c39ba183b116048d4023744e4f98b31e74dc95f2d41cd1","target":"graph","created_at":"2026-07-05T02:26:58Z","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/2103.14698/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Since language processing systems generally allocate/discard memory with complex reference relationships, including circular and indirect references, their implementation is often not trivial. Here, the allocated memory and the references can be abstracted to the labeled vertices and edges of a graph. And there exists a graph rewriting language, a programming language or a calculation model that can handle graph intuitively, safely and efficiently. Therefore, the implementation of a language processing system can be highly expected as an application field of graph rewriting language. To show t","authors_text":"Jin Sano","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2021-03-02T03:36:58Z","title":"Implementing G-Machine in HyperLMNtal"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.14698","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:940508fe22a5d675ae4dfab0c005da5ae151a6c80b6b883ac5553044f61a50ff","target":"record","created_at":"2026-07-05T02:26:58Z","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":"9b46cd24b1451941d713b6e7ec52384df51c0526c199681942361c34c3d442c4","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2021-03-02T03:36:58Z","title_canon_sha256":"b942ae1caffdcd854c0439252e2031cb5b29b33d5d73558e5888aa1bf8df7227"},"schema_version":"1.0","source":{"id":"2103.14698","kind":"arxiv","version":1}},"canonical_sha256":"3df830bb337fd2ffc04f9adf85e8cddf24e98620803bbe46c169198c96242052","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3df830bb337fd2ffc04f9adf85e8cddf24e98620803bbe46c169198c96242052","first_computed_at":"2026-07-05T02:26:58.504665Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:26:58.504665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9f3quo7Wms21Gij7tafxBOYPeM6ihMhBIZ2fZzNyV0Xlrkf6Kwz01uRf+a3a7fcRYOc/7GXPeoczJc3u0Q/GDw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:26:58.505062Z","signed_message":"canonical_sha256_bytes"},"source_id":"2103.14698","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:940508fe22a5d675ae4dfab0c005da5ae151a6c80b6b883ac5553044f61a50ff","sha256:c5b57399ae37caaa66c39ba183b116048d4023744e4f98b31e74dc95f2d41cd1"],"state_sha256":"d7dd13ec3ea8ed0f506c0567807df5938bc2960cd8023329b7ae5e03120f17f7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v2GSsN5ewHnUh9IZQin489UHxQwwinuVzCNHdHq6LTKO1Bv+K/OaXjD0RxzNgCjLKu8gW98+/Yn3SDB4GytPDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T11:28:27.717167Z","bundle_sha256":"267de8c51ba66b30ece6ceefe4c468b2101c6d41479d2de616dfd94c484ff7ee"}}