{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:3VJ6FZRYL4RQHIDRDQOBSGQQIQ","short_pith_number":"pith:3VJ6FZRY","canonical_record":{"source":{"id":"1502.05873","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-02-20T13:54:39Z","cross_cats_sorted":[],"title_canon_sha256":"0252712c884e37e1a14f7debb4fdce9074a3752da7bb292c28dc12d01bebf572","abstract_canon_sha256":"227d3def2031a1ba2677a646a09b1779bbb71ec34d172a9af609d145c8cabf18"},"schema_version":"1.0"},"canonical_sha256":"dd53e2e6385f2303a0711c1c191a104428e60b27c1a21ccb2b1a8ea47ce05692","source":{"kind":"arxiv","id":"1502.05873","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.05873","created_at":"2026-05-18T02:26:12Z"},{"alias_kind":"arxiv_version","alias_value":"1502.05873v2","created_at":"2026-05-18T02:26:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.05873","created_at":"2026-05-18T02:26:12Z"},{"alias_kind":"pith_short_12","alias_value":"3VJ6FZRYL4RQ","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3VJ6FZRYL4RQHIDR","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3VJ6FZRY","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:3VJ6FZRYL4RQHIDRDQOBSGQQIQ","target":"record","payload":{"canonical_record":{"source":{"id":"1502.05873","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-02-20T13:54:39Z","cross_cats_sorted":[],"title_canon_sha256":"0252712c884e37e1a14f7debb4fdce9074a3752da7bb292c28dc12d01bebf572","abstract_canon_sha256":"227d3def2031a1ba2677a646a09b1779bbb71ec34d172a9af609d145c8cabf18"},"schema_version":"1.0"},"canonical_sha256":"dd53e2e6385f2303a0711c1c191a104428e60b27c1a21ccb2b1a8ea47ce05692","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:12.282278Z","signature_b64":"KndwHOpoa7AiGfe+eikFUJppez9iP2ZSizlmeUk/lxbd/JzEXbeYn9ecq2YTTmV4zqG81hwm6/BZJeKz6h3pAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd53e2e6385f2303a0711c1c191a104428e60b27c1a21ccb2b1a8ea47ce05692","last_reissued_at":"2026-05-18T02:26:12.281621Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:12.281621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.05873","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-18T02:26:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ytly6SFXgk68sEYYSWldzSFCIPH5JUrC1qxSKtRoeKkdfrIhvr9yji+XUqkniVhN7qeqvLrlZQWhWPZHOWrNAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:16:40.979997Z"},"content_sha256":"9b3452625db13a76361c213a22ff6777614621cead58dd388574c7dca51a4771","schema_version":"1.0","event_id":"sha256:9b3452625db13a76361c213a22ff6777614621cead58dd388574c7dca51a4771"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:3VJ6FZRYL4RQHIDRDQOBSGQQIQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Annotated Stack Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Matthew Hague, Vincent Penelle","submitted_at":"2015-02-20T13:54:39Z","abstract_excerpt":"Annotated pushdown automata provide an automaton model of higher-order recursion schemes, which may in turn be used to model higher-order programs for the purposes of verification. We study Ground Annotated Stack Tree Rewrite Systems -- a tree rewrite system where each node is labelled by the configuration of an annotated pushdown automaton. This allows the modelling of fork and join constructs in higher-order programs and is a generalisation of higher-order stack trees recently introduced by Penelle.\n  We show that, given a regular set of annotated stack trees, the set of trees that can reach"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.05873","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-18T02:26:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CUjQ+RZhippCqt4mV9b3U7CYNeg9bLZs1cJCtPijVHJFBEX/Ff7LcwcuoNt/Oy/WfJNRbF7OD/ujWZhbhf8fAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:16:40.980752Z"},"content_sha256":"9c7c6c0768f8d1a76947098616389cd452bd470e60cc6f5953243141c7bc0180","schema_version":"1.0","event_id":"sha256:9c7c6c0768f8d1a76947098616389cd452bd470e60cc6f5953243141c7bc0180"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3VJ6FZRYL4RQHIDRDQOBSGQQIQ/bundle.json","state_url":"https://pith.science/pith/3VJ6FZRYL4RQHIDRDQOBSGQQIQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3VJ6FZRYL4RQHIDRDQOBSGQQIQ/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-30T12:16:40Z","links":{"resolver":"https://pith.science/pith/3VJ6FZRYL4RQHIDRDQOBSGQQIQ","bundle":"https://pith.science/pith/3VJ6FZRYL4RQHIDRDQOBSGQQIQ/bundle.json","state":"https://pith.science/pith/3VJ6FZRYL4RQHIDRDQOBSGQQIQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3VJ6FZRYL4RQHIDRDQOBSGQQIQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:3VJ6FZRYL4RQHIDRDQOBSGQQIQ","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":"227d3def2031a1ba2677a646a09b1779bbb71ec34d172a9af609d145c8cabf18","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-02-20T13:54:39Z","title_canon_sha256":"0252712c884e37e1a14f7debb4fdce9074a3752da7bb292c28dc12d01bebf572"},"schema_version":"1.0","source":{"id":"1502.05873","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.05873","created_at":"2026-05-18T02:26:12Z"},{"alias_kind":"arxiv_version","alias_value":"1502.05873v2","created_at":"2026-05-18T02:26:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.05873","created_at":"2026-05-18T02:26:12Z"},{"alias_kind":"pith_short_12","alias_value":"3VJ6FZRYL4RQ","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3VJ6FZRYL4RQHIDR","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3VJ6FZRY","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:9c7c6c0768f8d1a76947098616389cd452bd470e60cc6f5953243141c7bc0180","target":"graph","created_at":"2026-05-18T02:26:12Z","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":"Annotated pushdown automata provide an automaton model of higher-order recursion schemes, which may in turn be used to model higher-order programs for the purposes of verification. We study Ground Annotated Stack Tree Rewrite Systems -- a tree rewrite system where each node is labelled by the configuration of an annotated pushdown automaton. This allows the modelling of fork and join constructs in higher-order programs and is a generalisation of higher-order stack trees recently introduced by Penelle.\n  We show that, given a regular set of annotated stack trees, the set of trees that can reach","authors_text":"Matthew Hague, Vincent Penelle","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-02-20T13:54:39Z","title":"Annotated Stack Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.05873","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:9b3452625db13a76361c213a22ff6777614621cead58dd388574c7dca51a4771","target":"record","created_at":"2026-05-18T02:26:12Z","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":"227d3def2031a1ba2677a646a09b1779bbb71ec34d172a9af609d145c8cabf18","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-02-20T13:54:39Z","title_canon_sha256":"0252712c884e37e1a14f7debb4fdce9074a3752da7bb292c28dc12d01bebf572"},"schema_version":"1.0","source":{"id":"1502.05873","kind":"arxiv","version":2}},"canonical_sha256":"dd53e2e6385f2303a0711c1c191a104428e60b27c1a21ccb2b1a8ea47ce05692","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dd53e2e6385f2303a0711c1c191a104428e60b27c1a21ccb2b1a8ea47ce05692","first_computed_at":"2026-05-18T02:26:12.281621Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:26:12.281621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KndwHOpoa7AiGfe+eikFUJppez9iP2ZSizlmeUk/lxbd/JzEXbeYn9ecq2YTTmV4zqG81hwm6/BZJeKz6h3pAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:26:12.282278Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.05873","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9b3452625db13a76361c213a22ff6777614621cead58dd388574c7dca51a4771","sha256:9c7c6c0768f8d1a76947098616389cd452bd470e60cc6f5953243141c7bc0180"],"state_sha256":"4986d6f11a94a55ab33cad1f30c066fea780583086b0e8849943f4db824cbfde"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vQqKu1LdUAyozDG8M36xCr792m5LYNH5lduEuBUydlmJfyJrXy1agsQlgWNfxokeFzY/M4do5xYQ/zzntKZEBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T12:16:40.984816Z","bundle_sha256":"7c19cb7af5edc46ac8f0ecdf8a3a4da7116b5cf496b5ca3a98f27cb01f5a918e"}}