{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:4XMRERJIJPD4A5JSVQZMEI2YKW","short_pith_number":"pith:4XMRERJI","canonical_record":{"source":{"id":"1605.00371","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2016-05-02T07:15:16Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"4b555ba6ec4e2110dea821cf912a8fa9ea79b4ab1c2995b5bfd8c0fb6d7e242f","abstract_canon_sha256":"d0285f541b7879c5f5abc2d8bf1ee16e4c81d4804114c504ce6f4906c3e5426d"},"schema_version":"1.0"},"canonical_sha256":"e5d91245284bc7c07532ac32c22358559abd33bbed8aa8f1ee2bfde1241a16f1","source":{"kind":"arxiv","id":"1605.00371","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.00371","created_at":"2026-05-18T01:15:56Z"},{"alias_kind":"arxiv_version","alias_value":"1605.00371v1","created_at":"2026-05-18T01:15:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.00371","created_at":"2026-05-18T01:15:56Z"},{"alias_kind":"pith_short_12","alias_value":"4XMRERJIJPD4","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4XMRERJIJPD4A5JS","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4XMRERJI","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:4XMRERJIJPD4A5JSVQZMEI2YKW","target":"record","payload":{"canonical_record":{"source":{"id":"1605.00371","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2016-05-02T07:15:16Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"4b555ba6ec4e2110dea821cf912a8fa9ea79b4ab1c2995b5bfd8c0fb6d7e242f","abstract_canon_sha256":"d0285f541b7879c5f5abc2d8bf1ee16e4c81d4804114c504ce6f4906c3e5426d"},"schema_version":"1.0"},"canonical_sha256":"e5d91245284bc7c07532ac32c22358559abd33bbed8aa8f1ee2bfde1241a16f1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:56.010902Z","signature_b64":"BYisPtWGGUCei+OyDza0a47JPRze99GwyrTnGWC0lGf3cU/BGv1qWhDLmDVgbUwWvdop3Fub3kjFIUjBoVCTAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5d91245284bc7c07532ac32c22358559abd33bbed8aa8f1ee2bfde1241a16f1","last_reissued_at":"2026-05-18T01:15:56.010206Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:56.010206Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.00371","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-05-18T01:15:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sB7kxPQNxNolEv3XJ0JPjxKwlxpFCoMYUAl3T4ANhHQlvgv/vBzanBuuMpxbep5RQBzD1aFExBmj0tEmBkoyBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:26:54.964378Z"},"content_sha256":"1bb607011d9532163156a4bb69e6d7633f1be775e2ce28bc3ebed33a18497dae","schema_version":"1.0","event_id":"sha256:1bb607011d9532163156a4bb69e6d7633f1be775e2ce28bc3ebed33a18497dae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:4XMRERJIJPD4A5JSVQZMEI2YKW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Diagonal Problem for Higher-Order Recursion Schemes is Decidable","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Igor Walukiewicz, Lorenzo Clemente, Pawe{\\l} Parys, Sylvain Salvati","submitted_at":"2016-05-02T07:15:16Z","abstract_excerpt":"A non-deterministic recursion scheme recognizes a language of finite trees. This very expressive model can simulate, among others, higher-order pushdown automata with collapse. We show decidability of the diagonal problem for schemes. This result has several interesting consequences. In particular, it gives an algorithm that computes the downward closure of languages of words recognized by schemes. In turn, this has immediate application to separability problems and reachability analysis of concurrent systems."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.00371","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":""},"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-05-18T01:15:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6+2tg+j4x+STDgJSoKRQKoIxEEtXrScK0OFTC9VEKgiS+nVMGiBIVuoatrMwWRpOWQNDY/oytE9SUU5/LHxNDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:26:54.964733Z"},"content_sha256":"a33ff811f56aed2aad2945524d36f378d59a42c5ae92a7b34bd4135b2ff261b7","schema_version":"1.0","event_id":"sha256:a33ff811f56aed2aad2945524d36f378d59a42c5ae92a7b34bd4135b2ff261b7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4XMRERJIJPD4A5JSVQZMEI2YKW/bundle.json","state_url":"https://pith.science/pith/4XMRERJIJPD4A5JSVQZMEI2YKW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4XMRERJIJPD4A5JSVQZMEI2YKW/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-05-28T03:26:54Z","links":{"resolver":"https://pith.science/pith/4XMRERJIJPD4A5JSVQZMEI2YKW","bundle":"https://pith.science/pith/4XMRERJIJPD4A5JSVQZMEI2YKW/bundle.json","state":"https://pith.science/pith/4XMRERJIJPD4A5JSVQZMEI2YKW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4XMRERJIJPD4A5JSVQZMEI2YKW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:4XMRERJIJPD4A5JSVQZMEI2YKW","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":"d0285f541b7879c5f5abc2d8bf1ee16e4c81d4804114c504ce6f4906c3e5426d","cross_cats_sorted":["cs.LO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2016-05-02T07:15:16Z","title_canon_sha256":"4b555ba6ec4e2110dea821cf912a8fa9ea79b4ab1c2995b5bfd8c0fb6d7e242f"},"schema_version":"1.0","source":{"id":"1605.00371","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.00371","created_at":"2026-05-18T01:15:56Z"},{"alias_kind":"arxiv_version","alias_value":"1605.00371v1","created_at":"2026-05-18T01:15:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.00371","created_at":"2026-05-18T01:15:56Z"},{"alias_kind":"pith_short_12","alias_value":"4XMRERJIJPD4","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4XMRERJIJPD4A5JS","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4XMRERJI","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:a33ff811f56aed2aad2945524d36f378d59a42c5ae92a7b34bd4135b2ff261b7","target":"graph","created_at":"2026-05-18T01:15:56Z","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"},"paper":{"abstract_excerpt":"A non-deterministic recursion scheme recognizes a language of finite trees. This very expressive model can simulate, among others, higher-order pushdown automata with collapse. We show decidability of the diagonal problem for schemes. This result has several interesting consequences. In particular, it gives an algorithm that computes the downward closure of languages of words recognized by schemes. In turn, this has immediate application to separability problems and reachability analysis of concurrent systems.","authors_text":"Igor Walukiewicz, Lorenzo Clemente, Pawe{\\l} Parys, Sylvain Salvati","cross_cats":["cs.LO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2016-05-02T07:15:16Z","title":"The Diagonal Problem for Higher-Order Recursion Schemes is Decidable"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.00371","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:1bb607011d9532163156a4bb69e6d7633f1be775e2ce28bc3ebed33a18497dae","target":"record","created_at":"2026-05-18T01:15:56Z","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":"d0285f541b7879c5f5abc2d8bf1ee16e4c81d4804114c504ce6f4906c3e5426d","cross_cats_sorted":["cs.LO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2016-05-02T07:15:16Z","title_canon_sha256":"4b555ba6ec4e2110dea821cf912a8fa9ea79b4ab1c2995b5bfd8c0fb6d7e242f"},"schema_version":"1.0","source":{"id":"1605.00371","kind":"arxiv","version":1}},"canonical_sha256":"e5d91245284bc7c07532ac32c22358559abd33bbed8aa8f1ee2bfde1241a16f1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e5d91245284bc7c07532ac32c22358559abd33bbed8aa8f1ee2bfde1241a16f1","first_computed_at":"2026-05-18T01:15:56.010206Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:56.010206Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BYisPtWGGUCei+OyDza0a47JPRze99GwyrTnGWC0lGf3cU/BGv1qWhDLmDVgbUwWvdop3Fub3kjFIUjBoVCTAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:56.010902Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.00371","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1bb607011d9532163156a4bb69e6d7633f1be775e2ce28bc3ebed33a18497dae","sha256:a33ff811f56aed2aad2945524d36f378d59a42c5ae92a7b34bd4135b2ff261b7"],"state_sha256":"b5b0accd3b9cc16dc1216770c90a2890d6d321d61c576129d88cb94b5806ba28"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f2sDn3CC4ZL9RfxdLuM0AQU/AmQ5eUfJgQ2uqs5VcR0kgX7RMED+RHNhVWbNFtlEZNEkuDa2SkyK1lsV0SKGAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T03:26:54.966803Z","bundle_sha256":"c6fc0a1acc03ac1333ae970872509b9ff55b6827db32a7086b7471e6678cb67c"}}