{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:DVVBJCOMJYJ2RHDKKEB6JLYUBY","short_pith_number":"pith:DVVBJCOM","canonical_record":{"source":{"id":"1409.1136","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-09-03T16:00:58Z","cross_cats_sorted":[],"title_canon_sha256":"4446eb04b600ae566178e80d510306ede9349b01b1adcc0ac9f8282de98110bf","abstract_canon_sha256":"e8a07ff13b74116af8821bd49c6ef44cd842a2fcdcae16cd74c6f92446ac9a65"},"schema_version":"1.0"},"canonical_sha256":"1d6a1489cc4e13a89c6a5103e4af140e3b08a835e6589991c068e30488552e23","source":{"kind":"arxiv","id":"1409.1136","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.1136","created_at":"2026-05-18T02:32:38Z"},{"alias_kind":"arxiv_version","alias_value":"1409.1136v2","created_at":"2026-05-18T02:32:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.1136","created_at":"2026-05-18T02:32:38Z"},{"alias_kind":"pith_short_12","alias_value":"DVVBJCOMJYJ2","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DVVBJCOMJYJ2RHDK","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DVVBJCOM","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:DVVBJCOMJYJ2RHDKKEB6JLYUBY","target":"record","payload":{"canonical_record":{"source":{"id":"1409.1136","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-09-03T16:00:58Z","cross_cats_sorted":[],"title_canon_sha256":"4446eb04b600ae566178e80d510306ede9349b01b1adcc0ac9f8282de98110bf","abstract_canon_sha256":"e8a07ff13b74116af8821bd49c6ef44cd842a2fcdcae16cd74c6f92446ac9a65"},"schema_version":"1.0"},"canonical_sha256":"1d6a1489cc4e13a89c6a5103e4af140e3b08a835e6589991c068e30488552e23","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:38.473773Z","signature_b64":"qLdonIvLAHCEDLfERjTkiGPnTaOxiLaBVmYeYF+6LQdWke27YU9JItF/Pa0+QafAcNEz4P3hqGXOn0yixLLkDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d6a1489cc4e13a89c6a5103e4af140e3b08a835e6589991c068e30488552e23","last_reissued_at":"2026-05-18T02:32:38.473280Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:38.473280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.1136","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:32:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Dh8dUvNucv+s/qVrAr358paZCwLZuf+KzHxkfeM9KTm3ji5vEJ4Cfnl1Qtrkn1jheyjnXU4ia/+LXT8DBSzDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T06:00:29.802699Z"},"content_sha256":"5e539662d2aeebb3c560873c43b79d02054dae83d8f14b282d57f1b4cbeea686","schema_version":"1.0","event_id":"sha256:5e539662d2aeebb3c560873c43b79d02054dae83d8f14b282d57f1b4cbeea686"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:DVVBJCOMJYJ2RHDKKEB6JLYUBY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Weak and Nested Class Memory Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Andrzej Murawski, Conrad Cotton-Barratt, Luke Ong","submitted_at":"2014-09-03T16:00:58Z","abstract_excerpt":"Automata over infinite alphabets have recently come to be studied extensively as potentially useful tools for solving problems in verification and database theory. One popular model of automata studied is the Class Memory Automata (CMA), for which the emptiness problem is equivalent to Petri Net Reachability. We identify a restriction - which we call weakness - of CMA, and show that their emptiness problem is equivalent to Petri Net Coverability. Further, we show that in the deterministic case they are closed under all Boolean operations. We clarify the connections between weak CMA and existin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.1136","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:32:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wVFO4zX1V+tZvwyTQGcGnJeZIl62ev68L8DgOQDquZEX0VWa2/Mvt8TGJWY1G2sbsXWEOvZJ5jrhIl4h83J2Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T06:00:29.803038Z"},"content_sha256":"f45a5ce1b8462e175405341d1344555b522088d065f80d4bc7c78b451884c54f","schema_version":"1.0","event_id":"sha256:f45a5ce1b8462e175405341d1344555b522088d065f80d4bc7c78b451884c54f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DVVBJCOMJYJ2RHDKKEB6JLYUBY/bundle.json","state_url":"https://pith.science/pith/DVVBJCOMJYJ2RHDKKEB6JLYUBY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DVVBJCOMJYJ2RHDKKEB6JLYUBY/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-24T06:00:29Z","links":{"resolver":"https://pith.science/pith/DVVBJCOMJYJ2RHDKKEB6JLYUBY","bundle":"https://pith.science/pith/DVVBJCOMJYJ2RHDKKEB6JLYUBY/bundle.json","state":"https://pith.science/pith/DVVBJCOMJYJ2RHDKKEB6JLYUBY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DVVBJCOMJYJ2RHDKKEB6JLYUBY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:DVVBJCOMJYJ2RHDKKEB6JLYUBY","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":"e8a07ff13b74116af8821bd49c6ef44cd842a2fcdcae16cd74c6f92446ac9a65","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-09-03T16:00:58Z","title_canon_sha256":"4446eb04b600ae566178e80d510306ede9349b01b1adcc0ac9f8282de98110bf"},"schema_version":"1.0","source":{"id":"1409.1136","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.1136","created_at":"2026-05-18T02:32:38Z"},{"alias_kind":"arxiv_version","alias_value":"1409.1136v2","created_at":"2026-05-18T02:32:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.1136","created_at":"2026-05-18T02:32:38Z"},{"alias_kind":"pith_short_12","alias_value":"DVVBJCOMJYJ2","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DVVBJCOMJYJ2RHDK","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DVVBJCOM","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:f45a5ce1b8462e175405341d1344555b522088d065f80d4bc7c78b451884c54f","target":"graph","created_at":"2026-05-18T02:32: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":"Automata over infinite alphabets have recently come to be studied extensively as potentially useful tools for solving problems in verification and database theory. One popular model of automata studied is the Class Memory Automata (CMA), for which the emptiness problem is equivalent to Petri Net Reachability. We identify a restriction - which we call weakness - of CMA, and show that their emptiness problem is equivalent to Petri Net Coverability. Further, we show that in the deterministic case they are closed under all Boolean operations. We clarify the connections between weak CMA and existin","authors_text":"Andrzej Murawski, Conrad Cotton-Barratt, Luke Ong","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-09-03T16:00:58Z","title":"Weak and Nested Class Memory Automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.1136","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:5e539662d2aeebb3c560873c43b79d02054dae83d8f14b282d57f1b4cbeea686","target":"record","created_at":"2026-05-18T02:32: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":"e8a07ff13b74116af8821bd49c6ef44cd842a2fcdcae16cd74c6f92446ac9a65","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-09-03T16:00:58Z","title_canon_sha256":"4446eb04b600ae566178e80d510306ede9349b01b1adcc0ac9f8282de98110bf"},"schema_version":"1.0","source":{"id":"1409.1136","kind":"arxiv","version":2}},"canonical_sha256":"1d6a1489cc4e13a89c6a5103e4af140e3b08a835e6589991c068e30488552e23","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d6a1489cc4e13a89c6a5103e4af140e3b08a835e6589991c068e30488552e23","first_computed_at":"2026-05-18T02:32:38.473280Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:32:38.473280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qLdonIvLAHCEDLfERjTkiGPnTaOxiLaBVmYeYF+6LQdWke27YU9JItF/Pa0+QafAcNEz4P3hqGXOn0yixLLkDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:32:38.473773Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.1136","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5e539662d2aeebb3c560873c43b79d02054dae83d8f14b282d57f1b4cbeea686","sha256:f45a5ce1b8462e175405341d1344555b522088d065f80d4bc7c78b451884c54f"],"state_sha256":"c2faf73582129e9de7c7c56dd198f9689b5cf890d625e2f27afb0aaa8df32581"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xOZHhHUmZPPPVegtX82BeQVPXhUkwW8WYc6AyUjr4Xv+5WYrsaP2uAJlu1y39wpmgr6X8WOssb50PO6HsuWMBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T06:00:29.804868Z","bundle_sha256":"dbbad66298ac5cbc6e2ffd70fd2fc19b82197c766ef94030540944b9115e8e39"}}