{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:LFLFBBNLURYC7EYIO2MRXZAEF7","short_pith_number":"pith:LFLFBBNL","canonical_record":{"source":{"id":"1502.04653","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-02-16T18:17:14Z","cross_cats_sorted":[],"title_canon_sha256":"379783c6bcc811aa419d1eeefffef73e3d1e257c980517ff5c22310467ff55fa","abstract_canon_sha256":"8241b7cdfad8fddce0983bfba1d11741fc4be4e10af41e80efb5e3e534bba4f7"},"schema_version":"1.0"},"canonical_sha256":"59565085aba4702f930876991be4042feac23f08227fbb4bb697a49f1b6fbad7","source":{"kind":"arxiv","id":"1502.04653","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.04653","created_at":"2026-05-18T02:26:59Z"},{"alias_kind":"arxiv_version","alias_value":"1502.04653v1","created_at":"2026-05-18T02:26:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04653","created_at":"2026-05-18T02:26:59Z"},{"alias_kind":"pith_short_12","alias_value":"LFLFBBNLURYC","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LFLFBBNLURYC7EYI","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LFLFBBNL","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:LFLFBBNLURYC7EYIO2MRXZAEF7","target":"record","payload":{"canonical_record":{"source":{"id":"1502.04653","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-02-16T18:17:14Z","cross_cats_sorted":[],"title_canon_sha256":"379783c6bcc811aa419d1eeefffef73e3d1e257c980517ff5c22310467ff55fa","abstract_canon_sha256":"8241b7cdfad8fddce0983bfba1d11741fc4be4e10af41e80efb5e3e534bba4f7"},"schema_version":"1.0"},"canonical_sha256":"59565085aba4702f930876991be4042feac23f08227fbb4bb697a49f1b6fbad7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:59.417259Z","signature_b64":"7AYUGKY6mEMVzCUrpqTQ1TeebT+9S4uN8jU2kQaC+yLOfwcyMagcMt28xxuqouG7v8s6hv0uWA1vbdPdRWfvBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59565085aba4702f930876991be4042feac23f08227fbb4bb697a49f1b6fbad7","last_reissued_at":"2026-05-18T02:26:59.416893Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:59.416893Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.04653","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:26:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3KtTyZCndTvR24rFxrk4/Jc/aO4fzOp4MvkhgpZdXARz21TuyZbD23Um+87Y5ohCkHymWvQHr8y/88hmmsi+BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:52:37.765572Z"},"content_sha256":"2b6c3c3bed3ab5eade71d12eb1ef5892d4e33308ba86e3657e8c6019a55eaba2","schema_version":"1.0","event_id":"sha256:2b6c3c3bed3ab5eade71d12eb1ef5892d4e33308ba86e3657e8c6019a55eaba2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:LFLFBBNLURYC7EYIO2MRXZAEF7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rewriting Higher-Order Stack Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Vincent Penelle","submitted_at":"2015-02-16T18:17:14Z","abstract_excerpt":"Higher-order pushdown systems and ground tree rewriting systems can be seen as extensions of suffix word rewriting systems. Both classes generate infinite graphs with interesting logical properties. Indeed, the model-checking problem for monadic second order logic (respectively first order logic with a reachability predicate) is decidable on such graphs. We unify both models by introducing the notion of stack trees, trees whose nodes are labelled by higher-order stacks, and define the corresponding class of higher-order ground tree rewriting systems. We show that these graphs retain the decida"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.04653","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:26:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/mAkQzsqtoHqMLUiC5NuLAu8p9S+E0TvTHo0aAEJ1SPdzQmcZTP1H86GhGaAWrbXcz6wuR0x6JFqWYyHYDaeCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:52:37.766256Z"},"content_sha256":"f6df59edcfbdcd6e4bbe9c93c3f06e2ec82e1de008da78fa12677ada24dfab04","schema_version":"1.0","event_id":"sha256:f6df59edcfbdcd6e4bbe9c93c3f06e2ec82e1de008da78fa12677ada24dfab04"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LFLFBBNLURYC7EYIO2MRXZAEF7/bundle.json","state_url":"https://pith.science/pith/LFLFBBNLURYC7EYIO2MRXZAEF7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LFLFBBNLURYC7EYIO2MRXZAEF7/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-26T16:52:37Z","links":{"resolver":"https://pith.science/pith/LFLFBBNLURYC7EYIO2MRXZAEF7","bundle":"https://pith.science/pith/LFLFBBNLURYC7EYIO2MRXZAEF7/bundle.json","state":"https://pith.science/pith/LFLFBBNLURYC7EYIO2MRXZAEF7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LFLFBBNLURYC7EYIO2MRXZAEF7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LFLFBBNLURYC7EYIO2MRXZAEF7","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":"8241b7cdfad8fddce0983bfba1d11741fc4be4e10af41e80efb5e3e534bba4f7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-02-16T18:17:14Z","title_canon_sha256":"379783c6bcc811aa419d1eeefffef73e3d1e257c980517ff5c22310467ff55fa"},"schema_version":"1.0","source":{"id":"1502.04653","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.04653","created_at":"2026-05-18T02:26:59Z"},{"alias_kind":"arxiv_version","alias_value":"1502.04653v1","created_at":"2026-05-18T02:26:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04653","created_at":"2026-05-18T02:26:59Z"},{"alias_kind":"pith_short_12","alias_value":"LFLFBBNLURYC","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LFLFBBNLURYC7EYI","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LFLFBBNL","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:f6df59edcfbdcd6e4bbe9c93c3f06e2ec82e1de008da78fa12677ada24dfab04","target":"graph","created_at":"2026-05-18T02:26:59Z","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":"Higher-order pushdown systems and ground tree rewriting systems can be seen as extensions of suffix word rewriting systems. Both classes generate infinite graphs with interesting logical properties. Indeed, the model-checking problem for monadic second order logic (respectively first order logic with a reachability predicate) is decidable on such graphs. We unify both models by introducing the notion of stack trees, trees whose nodes are labelled by higher-order stacks, and define the corresponding class of higher-order ground tree rewriting systems. We show that these graphs retain the decida","authors_text":"Vincent Penelle","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-02-16T18:17:14Z","title":"Rewriting Higher-Order Stack Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.04653","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:2b6c3c3bed3ab5eade71d12eb1ef5892d4e33308ba86e3657e8c6019a55eaba2","target":"record","created_at":"2026-05-18T02:26:59Z","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":"8241b7cdfad8fddce0983bfba1d11741fc4be4e10af41e80efb5e3e534bba4f7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-02-16T18:17:14Z","title_canon_sha256":"379783c6bcc811aa419d1eeefffef73e3d1e257c980517ff5c22310467ff55fa"},"schema_version":"1.0","source":{"id":"1502.04653","kind":"arxiv","version":1}},"canonical_sha256":"59565085aba4702f930876991be4042feac23f08227fbb4bb697a49f1b6fbad7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"59565085aba4702f930876991be4042feac23f08227fbb4bb697a49f1b6fbad7","first_computed_at":"2026-05-18T02:26:59.416893Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:26:59.416893Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7AYUGKY6mEMVzCUrpqTQ1TeebT+9S4uN8jU2kQaC+yLOfwcyMagcMt28xxuqouG7v8s6hv0uWA1vbdPdRWfvBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:26:59.417259Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.04653","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2b6c3c3bed3ab5eade71d12eb1ef5892d4e33308ba86e3657e8c6019a55eaba2","sha256:f6df59edcfbdcd6e4bbe9c93c3f06e2ec82e1de008da78fa12677ada24dfab04"],"state_sha256":"e927237fb2c68966d99b6cd5f94f732f8046f2d7a2faf05044520871f8fb5e14"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5gVujtKAdhiljZkPwYCTMNQ1818R1JGvoXDTGP9AXbxm/XOFj6Ic3CMQEH2jenxUUXsxV3KOVep1W7B9xzGLDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T16:52:37.769552Z","bundle_sha256":"4c06431413f525fce1a9f6423a845e83caf53092899b10880eca42f772d750fd"}}