{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:F7P6LZW2BVGNUHMIQVLN7AMQRP","short_pith_number":"pith:F7P6LZW2","canonical_record":{"source":{"id":"2307.03561","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2023-07-07T12:50:47Z","cross_cats_sorted":[],"title_canon_sha256":"74e9e2b61919d2076afc8110b24d121781f120718ce8e52f3175fd39c4a3ba91","abstract_canon_sha256":"bf6ee7d9a3e84d00fa7f49d08393c294538890fc3054d7bb9b8d7e1a0a43b050"},"schema_version":"1.0"},"canonical_sha256":"2fdfe5e6da0d4cda1d888556df81908bd17b00d5e134a812d90aafe5884981d0","source":{"kind":"arxiv","id":"2307.03561","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.03561","created_at":"2026-07-05T06:28:44Z"},{"alias_kind":"arxiv_version","alias_value":"2307.03561v1","created_at":"2026-07-05T06:28:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.03561","created_at":"2026-07-05T06:28:44Z"},{"alias_kind":"pith_short_12","alias_value":"F7P6LZW2BVGN","created_at":"2026-07-05T06:28:44Z"},{"alias_kind":"pith_short_16","alias_value":"F7P6LZW2BVGNUHMI","created_at":"2026-07-05T06:28:44Z"},{"alias_kind":"pith_short_8","alias_value":"F7P6LZW2","created_at":"2026-07-05T06:28:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:F7P6LZW2BVGNUHMIQVLN7AMQRP","target":"record","payload":{"canonical_record":{"source":{"id":"2307.03561","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2023-07-07T12:50:47Z","cross_cats_sorted":[],"title_canon_sha256":"74e9e2b61919d2076afc8110b24d121781f120718ce8e52f3175fd39c4a3ba91","abstract_canon_sha256":"bf6ee7d9a3e84d00fa7f49d08393c294538890fc3054d7bb9b8d7e1a0a43b050"},"schema_version":"1.0"},"canonical_sha256":"2fdfe5e6da0d4cda1d888556df81908bd17b00d5e134a812d90aafe5884981d0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:28:44.404400Z","signature_b64":"Q83CMGGDutn8BsK2yqmVaGwAvUhYOAidpq5ZwphyDcylfvBLoe4FLo4m+OYQgKltuFIpwMxfnWV6w3ryk4UDDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2fdfe5e6da0d4cda1d888556df81908bd17b00d5e134a812d90aafe5884981d0","last_reissued_at":"2026-07-05T06:28:44.403873Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:28:44.403873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2307.03561","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-07-05T06:28:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kwE34DRwIBe/rH4Ooa8+MG4g1PBqVmbhjCsPGEaTxn0D+sufBw4nvFphPQ78IkDq2yW9E4xW1NmLwswOw75nCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T03:30:03.175893Z"},"content_sha256":"ae9f57c52ba1e3c2d17b91726b09239b0a6209149961b8c3714a65411d141adc","schema_version":"1.0","event_id":"sha256:ae9f57c52ba1e3c2d17b91726b09239b0a6209149961b8c3714a65411d141adc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:F7P6LZW2BVGNUHMIQVLN7AMQRP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complexity of Membership and Non-Emptiness Problems in Unbounded Memory Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Cinzia Di Giusto (C&A), Cl\\'ement Bertrand, Damien Regnault (IBISC), Hanna Klaudel (IBISC)","submitted_at":"2023-07-07T12:50:47Z","abstract_excerpt":"We study the complexity relationship between three models of unbounded memory automata: nu-automata ($\\nu$-A), Layered Memory Automata (LaMA)and History-Register Automata (HRA). These are all extensions of finite state automata with unbounded memory over infinite alphabets. We prove that the membership problem is NP-complete for all of them, while they fall into different classes for what concerns non-emptiness. The problem of non-emptiness is known to be Ackermann-complete for HRA, we prove that it is PSPACE-complete for $\\nu$-A."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.03561","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2307.03561/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T06:28:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yt+Vxy6U/Ik4y8mHqI0LQknShcZCaYOKbA8k1p6I0T11P7CgVDO3gtfo1PyzL3RP9uNXSnP6LSdkjV17vjmODw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T03:30:03.176384Z"},"content_sha256":"6940feb76751c9ea5d8de92b71d46bf3de69c17f5e141386d9d7704bfa4bd4c3","schema_version":"1.0","event_id":"sha256:6940feb76751c9ea5d8de92b71d46bf3de69c17f5e141386d9d7704bfa4bd4c3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F7P6LZW2BVGNUHMIQVLN7AMQRP/bundle.json","state_url":"https://pith.science/pith/F7P6LZW2BVGNUHMIQVLN7AMQRP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F7P6LZW2BVGNUHMIQVLN7AMQRP/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-08-21T03:30:03Z","links":{"resolver":"https://pith.science/pith/F7P6LZW2BVGNUHMIQVLN7AMQRP","bundle":"https://pith.science/pith/F7P6LZW2BVGNUHMIQVLN7AMQRP/bundle.json","state":"https://pith.science/pith/F7P6LZW2BVGNUHMIQVLN7AMQRP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F7P6LZW2BVGNUHMIQVLN7AMQRP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:F7P6LZW2BVGNUHMIQVLN7AMQRP","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":"bf6ee7d9a3e84d00fa7f49d08393c294538890fc3054d7bb9b8d7e1a0a43b050","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2023-07-07T12:50:47Z","title_canon_sha256":"74e9e2b61919d2076afc8110b24d121781f120718ce8e52f3175fd39c4a3ba91"},"schema_version":"1.0","source":{"id":"2307.03561","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.03561","created_at":"2026-07-05T06:28:44Z"},{"alias_kind":"arxiv_version","alias_value":"2307.03561v1","created_at":"2026-07-05T06:28:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.03561","created_at":"2026-07-05T06:28:44Z"},{"alias_kind":"pith_short_12","alias_value":"F7P6LZW2BVGN","created_at":"2026-07-05T06:28:44Z"},{"alias_kind":"pith_short_16","alias_value":"F7P6LZW2BVGNUHMI","created_at":"2026-07-05T06:28:44Z"},{"alias_kind":"pith_short_8","alias_value":"F7P6LZW2","created_at":"2026-07-05T06:28:44Z"}],"graph_snapshots":[{"event_id":"sha256:6940feb76751c9ea5d8de92b71d46bf3de69c17f5e141386d9d7704bfa4bd4c3","target":"graph","created_at":"2026-07-05T06:28:44Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2307.03561/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the complexity relationship between three models of unbounded memory automata: nu-automata ($\\nu$-A), Layered Memory Automata (LaMA)and History-Register Automata (HRA). These are all extensions of finite state automata with unbounded memory over infinite alphabets. We prove that the membership problem is NP-complete for all of them, while they fall into different classes for what concerns non-emptiness. The problem of non-emptiness is known to be Ackermann-complete for HRA, we prove that it is PSPACE-complete for $\\nu$-A.","authors_text":"Cinzia Di Giusto (C&A), Cl\\'ement Bertrand, Damien Regnault (IBISC), Hanna Klaudel (IBISC)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2023-07-07T12:50:47Z","title":"Complexity of Membership and Non-Emptiness Problems in Unbounded Memory Automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.03561","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:ae9f57c52ba1e3c2d17b91726b09239b0a6209149961b8c3714a65411d141adc","target":"record","created_at":"2026-07-05T06:28:44Z","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":"bf6ee7d9a3e84d00fa7f49d08393c294538890fc3054d7bb9b8d7e1a0a43b050","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2023-07-07T12:50:47Z","title_canon_sha256":"74e9e2b61919d2076afc8110b24d121781f120718ce8e52f3175fd39c4a3ba91"},"schema_version":"1.0","source":{"id":"2307.03561","kind":"arxiv","version":1}},"canonical_sha256":"2fdfe5e6da0d4cda1d888556df81908bd17b00d5e134a812d90aafe5884981d0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2fdfe5e6da0d4cda1d888556df81908bd17b00d5e134a812d90aafe5884981d0","first_computed_at":"2026-07-05T06:28:44.403873Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:28:44.403873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Q83CMGGDutn8BsK2yqmVaGwAvUhYOAidpq5ZwphyDcylfvBLoe4FLo4m+OYQgKltuFIpwMxfnWV6w3ryk4UDDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T06:28:44.404400Z","signed_message":"canonical_sha256_bytes"},"source_id":"2307.03561","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae9f57c52ba1e3c2d17b91726b09239b0a6209149961b8c3714a65411d141adc","sha256:6940feb76751c9ea5d8de92b71d46bf3de69c17f5e141386d9d7704bfa4bd4c3"],"state_sha256":"76748b5930c1372f82ee2e35691ec20af2402f9905f70bc357d914227538018c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7drhqwmA+snMMvenxTBB1x/ZUsPm6Dm7ZmgG00PLVI2EsCZKGksUgEUf0ZBAJWlXBVdAzHgq1kGWMv6nXqMjAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T03:30:03.181430Z","bundle_sha256":"0e108f536715f25269787c1806992f0c81e833baa357d09c79a9a4113a19b452"}}