{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:MFGIGLDFRHNPF6KOGIE4NXEPTQ","short_pith_number":"pith:MFGIGLDF","canonical_record":{"source":{"id":"1110.1221","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-10-06T10:54:25Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"d4f18b1bda01a59878ad6189922b68168b7178dbb570ccce2b528a47f701dfd1","abstract_canon_sha256":"ed7daff0e13e49fcaf1e64423e9e4fde094963208ff6c7d3510f466868f925ad"},"schema_version":"1.0"},"canonical_sha256":"614c832c6589daf2f94e3209c6dc8f9c038bc1ff1b9741c80bdf951c25995057","source":{"kind":"arxiv","id":"1110.1221","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.1221","created_at":"2026-05-18T02:21:35Z"},{"alias_kind":"arxiv_version","alias_value":"1110.1221v1","created_at":"2026-05-18T02:21:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.1221","created_at":"2026-05-18T02:21:35Z"},{"alias_kind":"pith_short_12","alias_value":"MFGIGLDFRHNP","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"MFGIGLDFRHNPF6KO","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"MFGIGLDF","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:MFGIGLDFRHNPF6KOGIE4NXEPTQ","target":"record","payload":{"canonical_record":{"source":{"id":"1110.1221","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-10-06T10:54:25Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"d4f18b1bda01a59878ad6189922b68168b7178dbb570ccce2b528a47f701dfd1","abstract_canon_sha256":"ed7daff0e13e49fcaf1e64423e9e4fde094963208ff6c7d3510f466868f925ad"},"schema_version":"1.0"},"canonical_sha256":"614c832c6589daf2f94e3209c6dc8f9c038bc1ff1b9741c80bdf951c25995057","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:35.486632Z","signature_b64":"RWIeU6aZ5tjFJyhMVnM2v2LCEU95v4clENdC9o+B0Z4Lq8bwn0S+lgPCNw8z3yL/heyevgzsVy9K71UfYWDkAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"614c832c6589daf2f94e3209c6dc8f9c038bc1ff1b9741c80bdf951c25995057","last_reissued_at":"2026-05-18T02:21:35.486027Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:35.486027Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1110.1221","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-18T02:21:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QI1kDWviT8bYTu0VnwyA1E1KuOZh2iTvG2I5gwdXyw1gE/L/8LCSpkWY5Ql/5KHrdgqJvwgtpT5qYMBkCQuPCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:28:45.105285Z"},"content_sha256":"ce52b2b5cfff6d78c762590841b0f8e02ba30cb8d2eb5d7c9bfeb08e4b289ae7","schema_version":"1.0","event_id":"sha256:ce52b2b5cfff6d78c762590841b0f8e02ba30cb8d2eb5d7c9bfeb08e4b289ae7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:MFGIGLDFRHNPF6KOGIE4NXEPTQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Feasible Automata for Two-Variable Logic with Successor on Data Words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Ahmet Kara, Thomas Schwentick, Tony Tan","submitted_at":"2011-10-06T10:54:25Z","abstract_excerpt":"We introduce an automata model for data words, that is words that carry at each position a symbol from a finite alphabet and a value from an unbounded data domain. The model is (semantically) a restriction of data automata, introduced by Bojanczyk, et. al. in 2006, therefore it is called weak data automata. It is strictly less expressive than data automata and the expressive power is incomparable with register automata. The expressive power of weak data automata corresponds exactly to existential monadic second order logic with successor +1 and data value equality \\sim, EMSO2(+1,\\sim). It foll"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.1221","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-18T02:21:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6ElJFoEtJQAXZ9hMlXdatyZjD8aAjDAb0/wH7U8NxAC6ElJg9RctZYJITccH1JxBUvp7/LRVEb58EZijdSSIBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:28:45.105645Z"},"content_sha256":"b7a3d0f50cc17873dfefe36169c7893c3202e87f7b61bd91e36d0522ad4b2035","schema_version":"1.0","event_id":"sha256:b7a3d0f50cc17873dfefe36169c7893c3202e87f7b61bd91e36d0522ad4b2035"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MFGIGLDFRHNPF6KOGIE4NXEPTQ/bundle.json","state_url":"https://pith.science/pith/MFGIGLDFRHNPF6KOGIE4NXEPTQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MFGIGLDFRHNPF6KOGIE4NXEPTQ/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-03T06:28:45Z","links":{"resolver":"https://pith.science/pith/MFGIGLDFRHNPF6KOGIE4NXEPTQ","bundle":"https://pith.science/pith/MFGIGLDFRHNPF6KOGIE4NXEPTQ/bundle.json","state":"https://pith.science/pith/MFGIGLDFRHNPF6KOGIE4NXEPTQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MFGIGLDFRHNPF6KOGIE4NXEPTQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:MFGIGLDFRHNPF6KOGIE4NXEPTQ","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":"ed7daff0e13e49fcaf1e64423e9e4fde094963208ff6c7d3510f466868f925ad","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-10-06T10:54:25Z","title_canon_sha256":"d4f18b1bda01a59878ad6189922b68168b7178dbb570ccce2b528a47f701dfd1"},"schema_version":"1.0","source":{"id":"1110.1221","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.1221","created_at":"2026-05-18T02:21:35Z"},{"alias_kind":"arxiv_version","alias_value":"1110.1221v1","created_at":"2026-05-18T02:21:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.1221","created_at":"2026-05-18T02:21:35Z"},{"alias_kind":"pith_short_12","alias_value":"MFGIGLDFRHNP","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"MFGIGLDFRHNPF6KO","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"MFGIGLDF","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:b7a3d0f50cc17873dfefe36169c7893c3202e87f7b61bd91e36d0522ad4b2035","target":"graph","created_at":"2026-05-18T02:21: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":"We introduce an automata model for data words, that is words that carry at each position a symbol from a finite alphabet and a value from an unbounded data domain. The model is (semantically) a restriction of data automata, introduced by Bojanczyk, et. al. in 2006, therefore it is called weak data automata. It is strictly less expressive than data automata and the expressive power is incomparable with register automata. The expressive power of weak data automata corresponds exactly to existential monadic second order logic with successor +1 and data value equality \\sim, EMSO2(+1,\\sim). It foll","authors_text":"Ahmet Kara, Thomas Schwentick, Tony Tan","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-10-06T10:54:25Z","title":"Feasible Automata for Two-Variable Logic with Successor on Data Words"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.1221","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:ce52b2b5cfff6d78c762590841b0f8e02ba30cb8d2eb5d7c9bfeb08e4b289ae7","target":"record","created_at":"2026-05-18T02:21: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":"ed7daff0e13e49fcaf1e64423e9e4fde094963208ff6c7d3510f466868f925ad","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-10-06T10:54:25Z","title_canon_sha256":"d4f18b1bda01a59878ad6189922b68168b7178dbb570ccce2b528a47f701dfd1"},"schema_version":"1.0","source":{"id":"1110.1221","kind":"arxiv","version":1}},"canonical_sha256":"614c832c6589daf2f94e3209c6dc8f9c038bc1ff1b9741c80bdf951c25995057","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"614c832c6589daf2f94e3209c6dc8f9c038bc1ff1b9741c80bdf951c25995057","first_computed_at":"2026-05-18T02:21:35.486027Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:35.486027Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RWIeU6aZ5tjFJyhMVnM2v2LCEU95v4clENdC9o+B0Z4Lq8bwn0S+lgPCNw8z3yL/heyevgzsVy9K71UfYWDkAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:35.486632Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.1221","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ce52b2b5cfff6d78c762590841b0f8e02ba30cb8d2eb5d7c9bfeb08e4b289ae7","sha256:b7a3d0f50cc17873dfefe36169c7893c3202e87f7b61bd91e36d0522ad4b2035"],"state_sha256":"af7f46645657ad811dd8e8ce953e551da95c299c0978035e64acb768a779a0cb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XNJtngbSF+JCAWDNMjYBApuKPEO/hYW/nlYY+a4noTOyANhQi9KNewI4rfZjxD7+5DYqtJJkP5qmXeNEDQyXCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T06:28:45.107613Z","bundle_sha256":"2448639ae7c791b76193ac1ddac197ae1138f88b8a887d6aaa3faec95c0e853e"}}