{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ZMDIOBUQYELGZZQSZVSG3VQQEA","short_pith_number":"pith:ZMDIOBUQ","canonical_record":{"source":{"id":"1507.03304","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-07-13T01:53:06Z","cross_cats_sorted":[],"title_canon_sha256":"b3db523f275f05861e779fe795cb12877335117501e10fa864a6a5b15b849c4e","abstract_canon_sha256":"d0a39ae90ae02e60c6b3a20c80eea0ea5e94c9dc6e1d9096bc1c7e488a53a377"},"schema_version":"1.0"},"canonical_sha256":"cb06870690c1166ce612cd646dd6102028e741a341591db6092f6a8ed1bb6c28","source":{"kind":"arxiv","id":"1507.03304","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.03304","created_at":"2026-05-18T01:27:45Z"},{"alias_kind":"arxiv_version","alias_value":"1507.03304v2","created_at":"2026-05-18T01:27:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.03304","created_at":"2026-05-18T01:27:45Z"},{"alias_kind":"pith_short_12","alias_value":"ZMDIOBUQYELG","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZMDIOBUQYELGZZQS","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZMDIOBUQ","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ZMDIOBUQYELGZZQSZVSG3VQQEA","target":"record","payload":{"canonical_record":{"source":{"id":"1507.03304","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-07-13T01:53:06Z","cross_cats_sorted":[],"title_canon_sha256":"b3db523f275f05861e779fe795cb12877335117501e10fa864a6a5b15b849c4e","abstract_canon_sha256":"d0a39ae90ae02e60c6b3a20c80eea0ea5e94c9dc6e1d9096bc1c7e488a53a377"},"schema_version":"1.0"},"canonical_sha256":"cb06870690c1166ce612cd646dd6102028e741a341591db6092f6a8ed1bb6c28","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:45.833063Z","signature_b64":"77sxzlFTzZAs0OiDbWG1t5GXqTjT48A4wqCJyO5fNxNrVuq7ihWGPzORXSMNcnUl+nFxmnmhPG7WcQUDJ1EzCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb06870690c1166ce612cd646dd6102028e741a341591db6092f6a8ed1bb6c28","last_reissued_at":"2026-05-18T01:27:45.832432Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:45.832432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.03304","source_version":2,"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:27:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FJHgKS5oWl4LwJ80iZYKX4oeJoIvCcwhFifNZHiOJavHFT3oOMej7ZxuC2VPmS5IaReP3C0GN/P2pr14Iwz8Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T18:31:19.749863Z"},"content_sha256":"19aced7d60d11e7d82f04732ccd6c73fc31a6cf20ad177edaca08c375f3b02a2","schema_version":"1.0","event_id":"sha256:19aced7d60d11e7d82f04732ccd6c73fc31a6cf20ad177edaca08c375f3b02a2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ZMDIOBUQYELGZZQSZVSG3VQQEA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unboundedness and Downward Closures of Higher-Order Pushdown Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"C.-H. Luke Ong, Jonathan Kochems, Matthew Hague","submitted_at":"2015-07-13T01:53:06Z","abstract_excerpt":"We show the diagonal problem for higher-order pushdown automata (HOPDA), and hence the simultaneous unboundedness problem, is decidable. From recent work by Zetzsche this means that we can construct the downward closure of the set of words accepted by a given HOPDA. This also means we can construct the downward closure of the Parikh image of a HOPDA. Both of these consequences play an important role in verifying concurrent higher-order programs expressed as HOPDA or safe higher-order recursion schemes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.03304","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"},"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:27:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e1iCNXlzNT7O6KVyCuKAbhBMmkb2Kn8zOxx7YcVkYEy6M5DQJ0tUiGQymsYoLr46XiMlL5FGS5kYyWenuMauDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T18:31:19.750208Z"},"content_sha256":"3c9f5cefe258ba1a93e8b6180640b2705e9bf51a27952cdbd8b51ee8566435b8","schema_version":"1.0","event_id":"sha256:3c9f5cefe258ba1a93e8b6180640b2705e9bf51a27952cdbd8b51ee8566435b8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZMDIOBUQYELGZZQSZVSG3VQQEA/bundle.json","state_url":"https://pith.science/pith/ZMDIOBUQYELGZZQSZVSG3VQQEA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZMDIOBUQYELGZZQSZVSG3VQQEA/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-06-23T18:31:19Z","links":{"resolver":"https://pith.science/pith/ZMDIOBUQYELGZZQSZVSG3VQQEA","bundle":"https://pith.science/pith/ZMDIOBUQYELGZZQSZVSG3VQQEA/bundle.json","state":"https://pith.science/pith/ZMDIOBUQYELGZZQSZVSG3VQQEA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZMDIOBUQYELGZZQSZVSG3VQQEA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ZMDIOBUQYELGZZQSZVSG3VQQEA","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":"d0a39ae90ae02e60c6b3a20c80eea0ea5e94c9dc6e1d9096bc1c7e488a53a377","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-07-13T01:53:06Z","title_canon_sha256":"b3db523f275f05861e779fe795cb12877335117501e10fa864a6a5b15b849c4e"},"schema_version":"1.0","source":{"id":"1507.03304","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.03304","created_at":"2026-05-18T01:27:45Z"},{"alias_kind":"arxiv_version","alias_value":"1507.03304v2","created_at":"2026-05-18T01:27:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.03304","created_at":"2026-05-18T01:27:45Z"},{"alias_kind":"pith_short_12","alias_value":"ZMDIOBUQYELG","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZMDIOBUQYELGZZQS","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZMDIOBUQ","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:3c9f5cefe258ba1a93e8b6180640b2705e9bf51a27952cdbd8b51ee8566435b8","target":"graph","created_at":"2026-05-18T01:27:45Z","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":"We show the diagonal problem for higher-order pushdown automata (HOPDA), and hence the simultaneous unboundedness problem, is decidable. From recent work by Zetzsche this means that we can construct the downward closure of the set of words accepted by a given HOPDA. This also means we can construct the downward closure of the Parikh image of a HOPDA. Both of these consequences play an important role in verifying concurrent higher-order programs expressed as HOPDA or safe higher-order recursion schemes.","authors_text":"C.-H. Luke Ong, Jonathan Kochems, Matthew Hague","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-07-13T01:53:06Z","title":"Unboundedness and Downward Closures of Higher-Order Pushdown Automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.03304","kind":"arxiv","version":2},"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:19aced7d60d11e7d82f04732ccd6c73fc31a6cf20ad177edaca08c375f3b02a2","target":"record","created_at":"2026-05-18T01:27:45Z","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":"d0a39ae90ae02e60c6b3a20c80eea0ea5e94c9dc6e1d9096bc1c7e488a53a377","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-07-13T01:53:06Z","title_canon_sha256":"b3db523f275f05861e779fe795cb12877335117501e10fa864a6a5b15b849c4e"},"schema_version":"1.0","source":{"id":"1507.03304","kind":"arxiv","version":2}},"canonical_sha256":"cb06870690c1166ce612cd646dd6102028e741a341591db6092f6a8ed1bb6c28","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cb06870690c1166ce612cd646dd6102028e741a341591db6092f6a8ed1bb6c28","first_computed_at":"2026-05-18T01:27:45.832432Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:27:45.832432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"77sxzlFTzZAs0OiDbWG1t5GXqTjT48A4wqCJyO5fNxNrVuq7ihWGPzORXSMNcnUl+nFxmnmhPG7WcQUDJ1EzCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:27:45.833063Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.03304","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:19aced7d60d11e7d82f04732ccd6c73fc31a6cf20ad177edaca08c375f3b02a2","sha256:3c9f5cefe258ba1a93e8b6180640b2705e9bf51a27952cdbd8b51ee8566435b8"],"state_sha256":"75660e463bbad22a0f9c6b2aa3ab20ce7f5bece96cd559fbe897ab20199af859"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZEEB6XkiwSrZ/gWGGd6X5tts7wnT4tOZ3jjUEtFy7OAoyrbhPSLHD/4Jo5dnKqVVft1Agjqn3UYj6bCwMZ84AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T18:31:19.752170Z","bundle_sha256":"d2ce2ca3490e6d579a1a7d50a591b11b69f9541463b5955e3f9e8869272c727b"}}