{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:I3YNTKW6WW3CEUUFUMHXMRDA5H","short_pith_number":"pith:I3YNTKW6","canonical_record":{"source":{"id":"1410.4065","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-10-15T13:55:21Z","cross_cats_sorted":[],"title_canon_sha256":"bcaa42fb2d73d4e8cc94c63ae7f67c35b1b6e3df67d30bfdda2a68c9c3df6f0a","abstract_canon_sha256":"6d740eb5a5a9d5c44c574d1c8520639cac2c2465ef344344026991fd368c3b1d"},"schema_version":"1.0"},"canonical_sha256":"46f0d9aadeb5b6225285a30f764460e9d21a7ab236de631d819309548ddee470","source":{"kind":"arxiv","id":"1410.4065","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.4065","created_at":"2026-05-18T02:40:02Z"},{"alias_kind":"arxiv_version","alias_value":"1410.4065v1","created_at":"2026-05-18T02:40:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4065","created_at":"2026-05-18T02:40:02Z"},{"alias_kind":"pith_short_12","alias_value":"I3YNTKW6WW3C","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"I3YNTKW6WW3CEUUF","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"I3YNTKW6","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:I3YNTKW6WW3CEUUFUMHXMRDA5H","target":"record","payload":{"canonical_record":{"source":{"id":"1410.4065","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-10-15T13:55:21Z","cross_cats_sorted":[],"title_canon_sha256":"bcaa42fb2d73d4e8cc94c63ae7f67c35b1b6e3df67d30bfdda2a68c9c3df6f0a","abstract_canon_sha256":"6d740eb5a5a9d5c44c574d1c8520639cac2c2465ef344344026991fd368c3b1d"},"schema_version":"1.0"},"canonical_sha256":"46f0d9aadeb5b6225285a30f764460e9d21a7ab236de631d819309548ddee470","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:40:02.739549Z","signature_b64":"wkLe2bSajUBGo2pVxpvTmxFoAo7M8Dt+Gqu3aVgAirqO5Y3/uqNl58USlxafR8ifwNzMdf6cWRjQHf9VAoWxBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46f0d9aadeb5b6225285a30f764460e9d21a7ab236de631d819309548ddee470","last_reissued_at":"2026-05-18T02:40:02.739055Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:40:02.739055Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.4065","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-18T02:40:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IaxXDMV8/F/Z92mqgqVvhsmq+/saun8R6pEWKnl/eR0UqTY1+t6SiP7JBip1JQuQOKmELcslS6wG9c8PV5ZVBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T20:03:47.640194Z"},"content_sha256":"49f1935f156d035e20f022193be01ffb162960d4b0d00d0c1f667a72cc3e9188","schema_version":"1.0","event_id":"sha256:49f1935f156d035e20f022193be01ffb162960d4b0d00d0c1f667a72cc3e9188"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:I3YNTKW6WW3CEUUFUMHXMRDA5H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unified Analysis of Collapsible and Ordered Pushdown Automata via Term Rewriting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Lorenzo Clemente","submitted_at":"2014-10-15T13:55:21Z","abstract_excerpt":"We model collapsible and ordered pushdown systems with term rewriting, by encoding higher-order stacks and multiple stacks into trees. We show a uniform inverse preservation of recognizability result for the resulting class of term rewriting systems, which is obtained by extending the classic saturation-based approach. This result subsumes and unifies similar analyses on collapsible and ordered pushdown systems. Despite the rich literature on inverse preservation of recognizability for term rewrite systems, our result does not seem to follow from any previous study."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4065","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-18T02:40:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xyd9VYhYtYCCgPTKCA0mJUqT2VlW0rdIKluiD+Q+8pKBCZjk6Ogreoduq6SIac8vbeqBumB0iA2gQSMZ5ep9AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T20:03:47.640557Z"},"content_sha256":"3a85e9fb5f5d7754881a46568525b16d5da8350a987f40e639d05340c233f8de","schema_version":"1.0","event_id":"sha256:3a85e9fb5f5d7754881a46568525b16d5da8350a987f40e639d05340c233f8de"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I3YNTKW6WW3CEUUFUMHXMRDA5H/bundle.json","state_url":"https://pith.science/pith/I3YNTKW6WW3CEUUFUMHXMRDA5H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I3YNTKW6WW3CEUUFUMHXMRDA5H/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-25T20:03:47Z","links":{"resolver":"https://pith.science/pith/I3YNTKW6WW3CEUUFUMHXMRDA5H","bundle":"https://pith.science/pith/I3YNTKW6WW3CEUUFUMHXMRDA5H/bundle.json","state":"https://pith.science/pith/I3YNTKW6WW3CEUUFUMHXMRDA5H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I3YNTKW6WW3CEUUFUMHXMRDA5H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:I3YNTKW6WW3CEUUFUMHXMRDA5H","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":"6d740eb5a5a9d5c44c574d1c8520639cac2c2465ef344344026991fd368c3b1d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-10-15T13:55:21Z","title_canon_sha256":"bcaa42fb2d73d4e8cc94c63ae7f67c35b1b6e3df67d30bfdda2a68c9c3df6f0a"},"schema_version":"1.0","source":{"id":"1410.4065","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.4065","created_at":"2026-05-18T02:40:02Z"},{"alias_kind":"arxiv_version","alias_value":"1410.4065v1","created_at":"2026-05-18T02:40:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4065","created_at":"2026-05-18T02:40:02Z"},{"alias_kind":"pith_short_12","alias_value":"I3YNTKW6WW3C","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"I3YNTKW6WW3CEUUF","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"I3YNTKW6","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:3a85e9fb5f5d7754881a46568525b16d5da8350a987f40e639d05340c233f8de","target":"graph","created_at":"2026-05-18T02:40:02Z","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 model collapsible and ordered pushdown systems with term rewriting, by encoding higher-order stacks and multiple stacks into trees. We show a uniform inverse preservation of recognizability result for the resulting class of term rewriting systems, which is obtained by extending the classic saturation-based approach. This result subsumes and unifies similar analyses on collapsible and ordered pushdown systems. Despite the rich literature on inverse preservation of recognizability for term rewrite systems, our result does not seem to follow from any previous study.","authors_text":"Lorenzo Clemente","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-10-15T13:55:21Z","title":"Unified Analysis of Collapsible and Ordered Pushdown Automata via Term Rewriting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4065","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:49f1935f156d035e20f022193be01ffb162960d4b0d00d0c1f667a72cc3e9188","target":"record","created_at":"2026-05-18T02:40:02Z","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":"6d740eb5a5a9d5c44c574d1c8520639cac2c2465ef344344026991fd368c3b1d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-10-15T13:55:21Z","title_canon_sha256":"bcaa42fb2d73d4e8cc94c63ae7f67c35b1b6e3df67d30bfdda2a68c9c3df6f0a"},"schema_version":"1.0","source":{"id":"1410.4065","kind":"arxiv","version":1}},"canonical_sha256":"46f0d9aadeb5b6225285a30f764460e9d21a7ab236de631d819309548ddee470","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"46f0d9aadeb5b6225285a30f764460e9d21a7ab236de631d819309548ddee470","first_computed_at":"2026-05-18T02:40:02.739055Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:40:02.739055Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wkLe2bSajUBGo2pVxpvTmxFoAo7M8Dt+Gqu3aVgAirqO5Y3/uqNl58USlxafR8ifwNzMdf6cWRjQHf9VAoWxBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:40:02.739549Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.4065","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:49f1935f156d035e20f022193be01ffb162960d4b0d00d0c1f667a72cc3e9188","sha256:3a85e9fb5f5d7754881a46568525b16d5da8350a987f40e639d05340c233f8de"],"state_sha256":"85f0873d6e36c6208ed0198509d6afc9b518a3cc58fa6b12e11c8b9a35a08f4c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lh16rmD5LUbvCtZakAxRdalDo7Ijo1yHkL0n+RzcyaBJKUKw6OySnVadXrPUgAfekbqt2mFW+qXVw69sJ8MrBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T20:03:47.642611Z","bundle_sha256":"1c86fe415fb6fc6cde1acf1d25f199ae87c675653bba750f3dff9ce5ee75a9b6"}}