{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:IA7NLCMU6RPASNSXMWSYMGUVIZ","short_pith_number":"pith:IA7NLCMU","canonical_record":{"source":{"id":"1010.4760","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-10-22T17:20:28Z","cross_cats_sorted":[],"title_canon_sha256":"40c71e9b68e9c0b3f949959fef30b1170d5a381db88a10dc256d572c7388a97e","abstract_canon_sha256":"7e546bd996e4c56ebedf066b56179e30143e20f7f108e7428cbeb1996d064b38"},"schema_version":"1.0"},"canonical_sha256":"403ed58994f45e09365765a5861a9546568bf0a0b400f19e6f2ff356707b64fd","source":{"kind":"arxiv","id":"1010.4760","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.4760","created_at":"2026-05-18T04:27:06Z"},{"alias_kind":"arxiv_version","alias_value":"1010.4760v4","created_at":"2026-05-18T04:27:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.4760","created_at":"2026-05-18T04:27:06Z"},{"alias_kind":"pith_short_12","alias_value":"IA7NLCMU6RPA","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"IA7NLCMU6RPASNSX","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"IA7NLCMU","created_at":"2026-05-18T12:26:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:IA7NLCMU6RPASNSXMWSYMGUVIZ","target":"record","payload":{"canonical_record":{"source":{"id":"1010.4760","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-10-22T17:20:28Z","cross_cats_sorted":[],"title_canon_sha256":"40c71e9b68e9c0b3f949959fef30b1170d5a381db88a10dc256d572c7388a97e","abstract_canon_sha256":"7e546bd996e4c56ebedf066b56179e30143e20f7f108e7428cbeb1996d064b38"},"schema_version":"1.0"},"canonical_sha256":"403ed58994f45e09365765a5861a9546568bf0a0b400f19e6f2ff356707b64fd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:27:06.496712Z","signature_b64":"wrXecVG8cVIfqM2Tn+MQrk6AKAGt+TjAodNzyOZtf8A/1hXtYMIEq3x3fubuJ0yCVIsHNK8QlaO143d1B00KDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"403ed58994f45e09365765a5861a9546568bf0a0b400f19e6f2ff356707b64fd","last_reissued_at":"2026-05-18T04:27:06.496085Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:27:06.496085Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1010.4760","source_version":4,"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:27:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I4jNUPN6Iyt3tnZN4G95gfg2JKdeh4YFSQJRVvBJLkW79MizL07Vu+v/KKvQCmth7Yiz3iBmRj+9rs/Tl8LiBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:22:31.913361Z"},"content_sha256":"6d8f6b7b620b9fc8590f698133b10298b345defe02231853e748d07b520740ae","schema_version":"1.0","event_id":"sha256:6d8f6b7b620b9fc8590f698133b10298b345defe02231853e748d07b520740ae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:IA7NLCMU6RPASNSXMWSYMGUVIZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Short Decidability Proof for DPDA Language Equivalence via First-Order Grammars","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Petr Jancar","submitted_at":"2010-10-22T17:20:28Z","abstract_excerpt":"The main aim of the paper is to give a short self-contained proof of the decidability of language equivalence for deterministic pushdown automata, which is the famous problem solved by G. Senizergues, for which C. Stirling has derived a primitive recursive complexity upper bound. The proof here is given in the framework of first-order grammars, which seems to be particularly apt for the aim. An appendix presents a modification of Stirling's approach, yielding a complexity bound of the form tetr(2,g(n)) where tetr is the (nonelementary) operator of iterated exponentiation (tetration) and g is a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.4760","kind":"arxiv","version":4},"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:27:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XLMzItllp9NfbWXwNieNtbQb6Uh46XIDrrIiK1/QKAVFNCULU/MYzRB5KrTaebe1DPuG2S73Vy0kP7fqW/4JBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:22:31.913992Z"},"content_sha256":"44899e849eef6f28b057886ed75e896b05936e53bbd7dd4d9e7497c8d83132a9","schema_version":"1.0","event_id":"sha256:44899e849eef6f28b057886ed75e896b05936e53bbd7dd4d9e7497c8d83132a9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IA7NLCMU6RPASNSXMWSYMGUVIZ/bundle.json","state_url":"https://pith.science/pith/IA7NLCMU6RPASNSXMWSYMGUVIZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IA7NLCMU6RPASNSXMWSYMGUVIZ/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-26T14:22:31Z","links":{"resolver":"https://pith.science/pith/IA7NLCMU6RPASNSXMWSYMGUVIZ","bundle":"https://pith.science/pith/IA7NLCMU6RPASNSXMWSYMGUVIZ/bundle.json","state":"https://pith.science/pith/IA7NLCMU6RPASNSXMWSYMGUVIZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IA7NLCMU6RPASNSXMWSYMGUVIZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:IA7NLCMU6RPASNSXMWSYMGUVIZ","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":"7e546bd996e4c56ebedf066b56179e30143e20f7f108e7428cbeb1996d064b38","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-10-22T17:20:28Z","title_canon_sha256":"40c71e9b68e9c0b3f949959fef30b1170d5a381db88a10dc256d572c7388a97e"},"schema_version":"1.0","source":{"id":"1010.4760","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.4760","created_at":"2026-05-18T04:27:06Z"},{"alias_kind":"arxiv_version","alias_value":"1010.4760v4","created_at":"2026-05-18T04:27:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.4760","created_at":"2026-05-18T04:27:06Z"},{"alias_kind":"pith_short_12","alias_value":"IA7NLCMU6RPA","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"IA7NLCMU6RPASNSX","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"IA7NLCMU","created_at":"2026-05-18T12:26:09Z"}],"graph_snapshots":[{"event_id":"sha256:44899e849eef6f28b057886ed75e896b05936e53bbd7dd4d9e7497c8d83132a9","target":"graph","created_at":"2026-05-18T04:27:06Z","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":"The main aim of the paper is to give a short self-contained proof of the decidability of language equivalence for deterministic pushdown automata, which is the famous problem solved by G. Senizergues, for which C. Stirling has derived a primitive recursive complexity upper bound. The proof here is given in the framework of first-order grammars, which seems to be particularly apt for the aim. An appendix presents a modification of Stirling's approach, yielding a complexity bound of the form tetr(2,g(n)) where tetr is the (nonelementary) operator of iterated exponentiation (tetration) and g is a","authors_text":"Petr Jancar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-10-22T17:20:28Z","title":"A Short Decidability Proof for DPDA Language Equivalence via First-Order Grammars"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.4760","kind":"arxiv","version":4},"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:6d8f6b7b620b9fc8590f698133b10298b345defe02231853e748d07b520740ae","target":"record","created_at":"2026-05-18T04:27:06Z","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":"7e546bd996e4c56ebedf066b56179e30143e20f7f108e7428cbeb1996d064b38","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-10-22T17:20:28Z","title_canon_sha256":"40c71e9b68e9c0b3f949959fef30b1170d5a381db88a10dc256d572c7388a97e"},"schema_version":"1.0","source":{"id":"1010.4760","kind":"arxiv","version":4}},"canonical_sha256":"403ed58994f45e09365765a5861a9546568bf0a0b400f19e6f2ff356707b64fd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"403ed58994f45e09365765a5861a9546568bf0a0b400f19e6f2ff356707b64fd","first_computed_at":"2026-05-18T04:27:06.496085Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:27:06.496085Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wrXecVG8cVIfqM2Tn+MQrk6AKAGt+TjAodNzyOZtf8A/1hXtYMIEq3x3fubuJ0yCVIsHNK8QlaO143d1B00KDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:27:06.496712Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.4760","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6d8f6b7b620b9fc8590f698133b10298b345defe02231853e748d07b520740ae","sha256:44899e849eef6f28b057886ed75e896b05936e53bbd7dd4d9e7497c8d83132a9"],"state_sha256":"fc90f05da79f8fe75fdb2b63a134ad89f2ecfa6fa0780cfbb920aaf036b1e83b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Y11toRk2h7GLxiYaXd0xbFI+dGMYK7c7Gqv9DP9rQj5Oq/VQdW5KqDWIFky9+7DiTKpXyFrwWBxEuWdSqv1Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T14:22:31.917204Z","bundle_sha256":"c00e0d3bc1de4b11fd92a2a234595d3d681823b5e47009734e0534c9b02a01bc"}}