{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:GBJDM3QIHMMZNTZU76TZXYL3HF","short_pith_number":"pith:GBJDM3QI","canonical_record":{"source":{"id":"1202.1980","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-02-09T13:37:40Z","cross_cats_sorted":["cs.FL","math.LO"],"title_canon_sha256":"de2b9eada9a7bbecbed93569ec520aaa7d6a5e452555eb442d1f923057a35a37","abstract_canon_sha256":"6432b152f9abb6b7d15a8b1d4827692698a19b382f69cb9534d250f2a44fb208"},"schema_version":"1.0"},"canonical_sha256":"3052366e083b1996cf34ffa79be17b39536e93e60c879e544a4bfdf1bb9f639e","source":{"kind":"arxiv","id":"1202.1980","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.1980","created_at":"2026-05-18T04:02:38Z"},{"alias_kind":"arxiv_version","alias_value":"1202.1980v1","created_at":"2026-05-18T04:02:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.1980","created_at":"2026-05-18T04:02:38Z"},{"alias_kind":"pith_short_12","alias_value":"GBJDM3QIHMMZ","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GBJDM3QIHMMZNTZU","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GBJDM3QI","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:GBJDM3QIHMMZNTZU76TZXYL3HF","target":"record","payload":{"canonical_record":{"source":{"id":"1202.1980","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-02-09T13:37:40Z","cross_cats_sorted":["cs.FL","math.LO"],"title_canon_sha256":"de2b9eada9a7bbecbed93569ec520aaa7d6a5e452555eb442d1f923057a35a37","abstract_canon_sha256":"6432b152f9abb6b7d15a8b1d4827692698a19b382f69cb9534d250f2a44fb208"},"schema_version":"1.0"},"canonical_sha256":"3052366e083b1996cf34ffa79be17b39536e93e60c879e544a4bfdf1bb9f639e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:38.615707Z","signature_b64":"UCAfOYqCXAQ05VDunABgFBWJ1J15cnWbjeY2+TXb58A6Y1pNxvjXZKsmkVJOkjkCsjUzmlKnplEgqmaVtfwZDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3052366e083b1996cf34ffa79be17b39536e93e60c879e544a4bfdf1bb9f639e","last_reissued_at":"2026-05-18T04:02:38.615063Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:38.615063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.1980","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-18T04:02:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TC+4aVxGLkilRBpXqoWROFFlYX0qyLD5pbEEBHeGnmueHT+ECoWoYHWhSyNtGwEahw1k60U4T+IkxZvpGYg9Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T07:25:49.409267Z"},"content_sha256":"63d3fdb0f953aa1caf570775a77e8123d175716d4a0d4a91d195e4630687cca4","schema_version":"1.0","event_id":"sha256:63d3fdb0f953aa1caf570775a77e8123d175716d4a0d4a91d195e4630687cca4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:GBJDM3QIHMMZNTZU76TZXYL3HF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"First-Order Logic on Higher-Order Nested Pushdown Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","math.LO"],"primary_cat":"cs.LO","authors_text":"Alexander Kartzow","submitted_at":"2012-02-09T13:37:40Z","abstract_excerpt":"We introduce a new hierarchy of higher-order nested pushdown trees generalising Alur et al.'s concept of nested pushdown trees. Nested pushdown trees are useful representations of control flows in the verification of programs with recursive calls of first-order functions. Higher-order nested pushdown trees are expansions of unfoldings of graphs generated by higher-order pushdown systems. Moreover, the class of nested pushdown trees of level n is uniformly first-order interpretable in the class of collapsible pushdown graphs of level n+1. The relationship between the class of higher-order pushd"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.1980","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-18T04:02:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i+8Wu+EW+YxRDnA1CCa9JhFHuGHajFQVnkOrIuEf0jMBcD6puQj9vWf6kw8qR6qOr5AJOQaRqzjajYI2I1wRBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T07:25:49.409626Z"},"content_sha256":"0e44d7b8e572c76366e499487c7865506c7c8454bc42fc8d913a7917710f584b","schema_version":"1.0","event_id":"sha256:0e44d7b8e572c76366e499487c7865506c7c8454bc42fc8d913a7917710f584b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GBJDM3QIHMMZNTZU76TZXYL3HF/bundle.json","state_url":"https://pith.science/pith/GBJDM3QIHMMZNTZU76TZXYL3HF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GBJDM3QIHMMZNTZU76TZXYL3HF/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-28T07:25:49Z","links":{"resolver":"https://pith.science/pith/GBJDM3QIHMMZNTZU76TZXYL3HF","bundle":"https://pith.science/pith/GBJDM3QIHMMZNTZU76TZXYL3HF/bundle.json","state":"https://pith.science/pith/GBJDM3QIHMMZNTZU76TZXYL3HF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GBJDM3QIHMMZNTZU76TZXYL3HF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:GBJDM3QIHMMZNTZU76TZXYL3HF","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":"6432b152f9abb6b7d15a8b1d4827692698a19b382f69cb9534d250f2a44fb208","cross_cats_sorted":["cs.FL","math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-02-09T13:37:40Z","title_canon_sha256":"de2b9eada9a7bbecbed93569ec520aaa7d6a5e452555eb442d1f923057a35a37"},"schema_version":"1.0","source":{"id":"1202.1980","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.1980","created_at":"2026-05-18T04:02:38Z"},{"alias_kind":"arxiv_version","alias_value":"1202.1980v1","created_at":"2026-05-18T04:02:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.1980","created_at":"2026-05-18T04:02:38Z"},{"alias_kind":"pith_short_12","alias_value":"GBJDM3QIHMMZ","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GBJDM3QIHMMZNTZU","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GBJDM3QI","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:0e44d7b8e572c76366e499487c7865506c7c8454bc42fc8d913a7917710f584b","target":"graph","created_at":"2026-05-18T04:02:38Z","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 introduce a new hierarchy of higher-order nested pushdown trees generalising Alur et al.'s concept of nested pushdown trees. Nested pushdown trees are useful representations of control flows in the verification of programs with recursive calls of first-order functions. Higher-order nested pushdown trees are expansions of unfoldings of graphs generated by higher-order pushdown systems. Moreover, the class of nested pushdown trees of level n is uniformly first-order interpretable in the class of collapsible pushdown graphs of level n+1. The relationship between the class of higher-order pushd","authors_text":"Alexander Kartzow","cross_cats":["cs.FL","math.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-02-09T13:37:40Z","title":"First-Order Logic on Higher-Order Nested Pushdown Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.1980","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:63d3fdb0f953aa1caf570775a77e8123d175716d4a0d4a91d195e4630687cca4","target":"record","created_at":"2026-05-18T04:02:38Z","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":"6432b152f9abb6b7d15a8b1d4827692698a19b382f69cb9534d250f2a44fb208","cross_cats_sorted":["cs.FL","math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-02-09T13:37:40Z","title_canon_sha256":"de2b9eada9a7bbecbed93569ec520aaa7d6a5e452555eb442d1f923057a35a37"},"schema_version":"1.0","source":{"id":"1202.1980","kind":"arxiv","version":1}},"canonical_sha256":"3052366e083b1996cf34ffa79be17b39536e93e60c879e544a4bfdf1bb9f639e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3052366e083b1996cf34ffa79be17b39536e93e60c879e544a4bfdf1bb9f639e","first_computed_at":"2026-05-18T04:02:38.615063Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:02:38.615063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UCAfOYqCXAQ05VDunABgFBWJ1J15cnWbjeY2+TXb58A6Y1pNxvjXZKsmkVJOkjkCsjUzmlKnplEgqmaVtfwZDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:02:38.615707Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.1980","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:63d3fdb0f953aa1caf570775a77e8123d175716d4a0d4a91d195e4630687cca4","sha256:0e44d7b8e572c76366e499487c7865506c7c8454bc42fc8d913a7917710f584b"],"state_sha256":"5100ff81c0394a9045b629fd1e4f51d65d6a745c0fbef956455a8dbda9c6e585"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qrIOvoNl+0iteXRmzeBcVWasoQ4Viu5DtbyM5Qg1m7nRy0fhs8fedLHnPRdktqbkDFwdikCx7PHStd9dis1/DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T07:25:49.411437Z","bundle_sha256":"0ecd5f172c6e50bc756353291c68f77a8d48fa3d5d26683e5642826a9f760589"}}