{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FPYTIZMZTICZIKGEWFUBHCRZUD","short_pith_number":"pith:FPYTIZMZ","canonical_record":{"source":{"id":"1805.11873","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-05-30T09:15:03Z","cross_cats_sorted":[],"title_canon_sha256":"9b21a6d6812c5e99d2ac44570704773b393fab46e3e016843756d9ee322092cb","abstract_canon_sha256":"5978384da843323646d04961b92815fb8198312b6ee65519cf0544ba951fba2b"},"schema_version":"1.0"},"canonical_sha256":"2bf13465999a059428c4b168138a39a0cc7aabd1851e95e709c721a2d8dd13f9","source":{"kind":"arxiv","id":"1805.11873","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.11873","created_at":"2026-05-18T00:14:35Z"},{"alias_kind":"arxiv_version","alias_value":"1805.11873v1","created_at":"2026-05-18T00:14:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.11873","created_at":"2026-05-18T00:14:35Z"},{"alias_kind":"pith_short_12","alias_value":"FPYTIZMZTICZ","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"FPYTIZMZTICZIKGE","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"FPYTIZMZ","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FPYTIZMZTICZIKGEWFUBHCRZUD","target":"record","payload":{"canonical_record":{"source":{"id":"1805.11873","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-05-30T09:15:03Z","cross_cats_sorted":[],"title_canon_sha256":"9b21a6d6812c5e99d2ac44570704773b393fab46e3e016843756d9ee322092cb","abstract_canon_sha256":"5978384da843323646d04961b92815fb8198312b6ee65519cf0544ba951fba2b"},"schema_version":"1.0"},"canonical_sha256":"2bf13465999a059428c4b168138a39a0cc7aabd1851e95e709c721a2d8dd13f9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:35.990785Z","signature_b64":"kmkVOkayvebQaarGYcYJEl6wcR2z1ErD2A1zPJZp5pySjY+vK2LU1ByPhOxWAuJVufGbI0UtaT0OUK9AsjAFDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2bf13465999a059428c4b168138a39a0cc7aabd1851e95e709c721a2d8dd13f9","last_reissued_at":"2026-05-18T00:14:35.990082Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:35.990082Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.11873","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-18T00:14:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WhY+mttOqijQtGidO0Duy7Erks60LvJxG30zw6J9rXbQz84IfDKX2f0/Vf4TJjzaaPi+PrIxiOVBYfYx2aydAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:52:37.634573Z"},"content_sha256":"bad7853446ae0041ce24b5ecc8864c093b0650c1ef827d28bf35ca2b95c78aa1","schema_version":"1.0","event_id":"sha256:bad7853446ae0041ce24b5ecc8864c093b0650c1ef827d28bf35ca2b95c78aa1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FPYTIZMZTICZIKGEWFUBHCRZUD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Emptiness of Stack Automata is NEXPTIME-complete: A Correction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Arnaud Carayol, Christopher Broadbent, Matthew Hague, Olivier Serre","submitted_at":"2018-05-30T09:15:03Z","abstract_excerpt":"A saturation algorithm for collapsible pushdown systems was published in ICALP 2012. This work introduced a class of stack automata used to recognised regular sets of collapsible pushdown configurations. It was shown that these automata form an effective boolean algebra, have a linear time membership problem, and are equivalent to an alternative automata representation appearing in LICS 2010. It was also claimed that the emptiness problem for stack automata is PSPACE-complete. Unfortunately, this claim is not true. We show that the problem is in fact NEXPTIME-complete when the stacks being acc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.11873","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-18T00:14:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yktihQQ8/xiQIjqGWdwR/LEjvlFG6Ka5v/D8IvuXjG9zpipuwO7yqFGGio6tnOJuC46t/OqRaVqDMV3cSmiQAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:52:37.635253Z"},"content_sha256":"c7147afb8d4039456d48cc20d819d6a0f855f22c17a4d6d48b5aae4d436b50a4","schema_version":"1.0","event_id":"sha256:c7147afb8d4039456d48cc20d819d6a0f855f22c17a4d6d48b5aae4d436b50a4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FPYTIZMZTICZIKGEWFUBHCRZUD/bundle.json","state_url":"https://pith.science/pith/FPYTIZMZTICZIKGEWFUBHCRZUD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FPYTIZMZTICZIKGEWFUBHCRZUD/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-08T17:52:37Z","links":{"resolver":"https://pith.science/pith/FPYTIZMZTICZIKGEWFUBHCRZUD","bundle":"https://pith.science/pith/FPYTIZMZTICZIKGEWFUBHCRZUD/bundle.json","state":"https://pith.science/pith/FPYTIZMZTICZIKGEWFUBHCRZUD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FPYTIZMZTICZIKGEWFUBHCRZUD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FPYTIZMZTICZIKGEWFUBHCRZUD","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":"5978384da843323646d04961b92815fb8198312b6ee65519cf0544ba951fba2b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-05-30T09:15:03Z","title_canon_sha256":"9b21a6d6812c5e99d2ac44570704773b393fab46e3e016843756d9ee322092cb"},"schema_version":"1.0","source":{"id":"1805.11873","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.11873","created_at":"2026-05-18T00:14:35Z"},{"alias_kind":"arxiv_version","alias_value":"1805.11873v1","created_at":"2026-05-18T00:14:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.11873","created_at":"2026-05-18T00:14:35Z"},{"alias_kind":"pith_short_12","alias_value":"FPYTIZMZTICZ","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"FPYTIZMZTICZIKGE","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"FPYTIZMZ","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:c7147afb8d4039456d48cc20d819d6a0f855f22c17a4d6d48b5aae4d436b50a4","target":"graph","created_at":"2026-05-18T00:14:35Z","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":"A saturation algorithm for collapsible pushdown systems was published in ICALP 2012. This work introduced a class of stack automata used to recognised regular sets of collapsible pushdown configurations. It was shown that these automata form an effective boolean algebra, have a linear time membership problem, and are equivalent to an alternative automata representation appearing in LICS 2010. It was also claimed that the emptiness problem for stack automata is PSPACE-complete. Unfortunately, this claim is not true. We show that the problem is in fact NEXPTIME-complete when the stacks being acc","authors_text":"Arnaud Carayol, Christopher Broadbent, Matthew Hague, Olivier Serre","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-05-30T09:15:03Z","title":"Emptiness of Stack Automata is NEXPTIME-complete: A Correction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.11873","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:bad7853446ae0041ce24b5ecc8864c093b0650c1ef827d28bf35ca2b95c78aa1","target":"record","created_at":"2026-05-18T00:14:35Z","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":"5978384da843323646d04961b92815fb8198312b6ee65519cf0544ba951fba2b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-05-30T09:15:03Z","title_canon_sha256":"9b21a6d6812c5e99d2ac44570704773b393fab46e3e016843756d9ee322092cb"},"schema_version":"1.0","source":{"id":"1805.11873","kind":"arxiv","version":1}},"canonical_sha256":"2bf13465999a059428c4b168138a39a0cc7aabd1851e95e709c721a2d8dd13f9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2bf13465999a059428c4b168138a39a0cc7aabd1851e95e709c721a2d8dd13f9","first_computed_at":"2026-05-18T00:14:35.990082Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:35.990082Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kmkVOkayvebQaarGYcYJEl6wcR2z1ErD2A1zPJZp5pySjY+vK2LU1ByPhOxWAuJVufGbI0UtaT0OUK9AsjAFDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:35.990785Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.11873","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bad7853446ae0041ce24b5ecc8864c093b0650c1ef827d28bf35ca2b95c78aa1","sha256:c7147afb8d4039456d48cc20d819d6a0f855f22c17a4d6d48b5aae4d436b50a4"],"state_sha256":"c09af2bc8bbc36e5a44b7491c23e4390cf12de7fdac0ec9506ded1aed2029189"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3UXodGDVQ9M0DXmZjc2E+4lMAkP77HHQWHtEBaL4EsIYY+wUIa+aaPIkK/1dzLFiLJWD73RpNrE1vTxsHL4KAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T17:52:37.639158Z","bundle_sha256":"b3eb9bfd6da67eb7c809a8d8b092751d17834d0fe99f47dda6da018b34ecfa55"}}