{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:65MDF5GUTSTHKYXXQ7RE4M6I4Q","short_pith_number":"pith:65MDF5GU","canonical_record":{"source":{"id":"1202.3957","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-02-17T16:38:10Z","cross_cats_sorted":["cs.FL","cs.LO"],"title_canon_sha256":"413dc1253007706bb24c6ea4466fb1d990c286cb0a31c13e4a356821357b3337","abstract_canon_sha256":"fadd7bdb09db37a64969440bd1934505d56a5d869480413069fc4dd325abb5be"},"schema_version":"1.0"},"canonical_sha256":"f75832f4d49ca67562f787e24e33c8e41ab03b0f16fe5f4eaa8ac6d5e2bdf7f9","source":{"kind":"arxiv","id":"1202.3957","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.3957","created_at":"2026-05-18T01:37:39Z"},{"alias_kind":"arxiv_version","alias_value":"1202.3957v2","created_at":"2026-05-18T01:37:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3957","created_at":"2026-05-18T01:37:39Z"},{"alias_kind":"pith_short_12","alias_value":"65MDF5GUTSTH","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"65MDF5GUTSTHKYXX","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"65MDF5GU","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:65MDF5GUTSTHKYXXQ7RE4M6I4Q","target":"record","payload":{"canonical_record":{"source":{"id":"1202.3957","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-02-17T16:38:10Z","cross_cats_sorted":["cs.FL","cs.LO"],"title_canon_sha256":"413dc1253007706bb24c6ea4466fb1d990c286cb0a31c13e4a356821357b3337","abstract_canon_sha256":"fadd7bdb09db37a64969440bd1934505d56a5d869480413069fc4dd325abb5be"},"schema_version":"1.0"},"canonical_sha256":"f75832f4d49ca67562f787e24e33c8e41ab03b0f16fe5f4eaa8ac6d5e2bdf7f9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:39.001007Z","signature_b64":"srU6EoQjEhAHlh4BZdFcdrQLNzJAzUyfBfoGuhwYxzecFyraP95hRcdCBYp9XG0qRQ6lGdna/WmXfpcD1tOSAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f75832f4d49ca67562f787e24e33c8e41ab03b0f16fe5f4eaa8ac6d5e2bdf7f9","last_reissued_at":"2026-05-18T01:37:39.000341Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:39.000341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.3957","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-18T01:37:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k21wg2T2EH8X9ewanOW8/5hadQxwvLUailsWeuFDxJ3qBV0e9GYtPI90OziOJYC9NOViZObx3nW1JpAWufD3Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T11:00:50.601978Z"},"content_sha256":"69efb16c700eaef01cb5081b70a7d34a1d01b84f28e8745a95ed6b32ef4e12f8","schema_version":"1.0","event_id":"sha256:69efb16c700eaef01cb5081b70a7d34a1d01b84f28e8745a95ed6b32ef4e12f8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:65MDF5GUTSTHKYXXQ7RE4M6I4Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Alternating register automata on finite words and trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","cs.LO"],"primary_cat":"cs.DB","authors_text":"Diego Figueira (INRIA & ENS Cachan, LSV)","submitted_at":"2012-02-17T16:38:10Z","abstract_excerpt":"We study alternating register automata on data words and data trees in relation to logics. A data word (resp. data tree) is a word (resp. tree) whose every position carries a label from a finite alphabet and a data value from an infinite domain. We investigate one-way automata with alternating control over data words or trees, with one register for storing data and comparing them for equality. This is a continuation of the study started by Demri, Lazic and Jurdzinski. From the standpoint of register automata models, this work aims at two objectives: (1) simplifying the existent decidability pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3957","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-18T01:37:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dOcp+HX8FBKg0f4iIfOlqTRFJ1/f94iD9nKJsKdjZvyx1Uua4JyenXbCFWdmmtcEY0EDo53SJMb+kTcVqOFRBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T11:00:50.602534Z"},"content_sha256":"869265ce0e7e7a04cd059086232d5077987eeaebd4e51779c4e7b727fa569dc4","schema_version":"1.0","event_id":"sha256:869265ce0e7e7a04cd059086232d5077987eeaebd4e51779c4e7b727fa569dc4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/65MDF5GUTSTHKYXXQ7RE4M6I4Q/bundle.json","state_url":"https://pith.science/pith/65MDF5GUTSTHKYXXQ7RE4M6I4Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/65MDF5GUTSTHKYXXQ7RE4M6I4Q/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-07T11:00:50Z","links":{"resolver":"https://pith.science/pith/65MDF5GUTSTHKYXXQ7RE4M6I4Q","bundle":"https://pith.science/pith/65MDF5GUTSTHKYXXQ7RE4M6I4Q/bundle.json","state":"https://pith.science/pith/65MDF5GUTSTHKYXXQ7RE4M6I4Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/65MDF5GUTSTHKYXXQ7RE4M6I4Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:65MDF5GUTSTHKYXXQ7RE4M6I4Q","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":"fadd7bdb09db37a64969440bd1934505d56a5d869480413069fc4dd325abb5be","cross_cats_sorted":["cs.FL","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-02-17T16:38:10Z","title_canon_sha256":"413dc1253007706bb24c6ea4466fb1d990c286cb0a31c13e4a356821357b3337"},"schema_version":"1.0","source":{"id":"1202.3957","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.3957","created_at":"2026-05-18T01:37:39Z"},{"alias_kind":"arxiv_version","alias_value":"1202.3957v2","created_at":"2026-05-18T01:37:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3957","created_at":"2026-05-18T01:37:39Z"},{"alias_kind":"pith_short_12","alias_value":"65MDF5GUTSTH","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"65MDF5GUTSTHKYXX","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"65MDF5GU","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:869265ce0e7e7a04cd059086232d5077987eeaebd4e51779c4e7b727fa569dc4","target":"graph","created_at":"2026-05-18T01:37:39Z","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 study alternating register automata on data words and data trees in relation to logics. A data word (resp. data tree) is a word (resp. tree) whose every position carries a label from a finite alphabet and a data value from an infinite domain. We investigate one-way automata with alternating control over data words or trees, with one register for storing data and comparing them for equality. This is a continuation of the study started by Demri, Lazic and Jurdzinski. From the standpoint of register automata models, this work aims at two objectives: (1) simplifying the existent decidability pr","authors_text":"Diego Figueira (INRIA & ENS Cachan, LSV)","cross_cats":["cs.FL","cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-02-17T16:38:10Z","title":"Alternating register automata on finite words and trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3957","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:69efb16c700eaef01cb5081b70a7d34a1d01b84f28e8745a95ed6b32ef4e12f8","target":"record","created_at":"2026-05-18T01:37:39Z","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":"fadd7bdb09db37a64969440bd1934505d56a5d869480413069fc4dd325abb5be","cross_cats_sorted":["cs.FL","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-02-17T16:38:10Z","title_canon_sha256":"413dc1253007706bb24c6ea4466fb1d990c286cb0a31c13e4a356821357b3337"},"schema_version":"1.0","source":{"id":"1202.3957","kind":"arxiv","version":2}},"canonical_sha256":"f75832f4d49ca67562f787e24e33c8e41ab03b0f16fe5f4eaa8ac6d5e2bdf7f9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f75832f4d49ca67562f787e24e33c8e41ab03b0f16fe5f4eaa8ac6d5e2bdf7f9","first_computed_at":"2026-05-18T01:37:39.000341Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:39.000341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"srU6EoQjEhAHlh4BZdFcdrQLNzJAzUyfBfoGuhwYxzecFyraP95hRcdCBYp9XG0qRQ6lGdna/WmXfpcD1tOSAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:39.001007Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.3957","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:69efb16c700eaef01cb5081b70a7d34a1d01b84f28e8745a95ed6b32ef4e12f8","sha256:869265ce0e7e7a04cd059086232d5077987eeaebd4e51779c4e7b727fa569dc4"],"state_sha256":"c52f7c6ab09f9a6c1ba371bceef4c06421e0e1651067919a38cd4bc1add4621c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ddnr+Z+mW5ZJAH/jP3oC8KEWDaswesl2qu90qQ5Ut4danKWuDeN07YKVHdi9rkCOCCcr/JETvuafaNkdEWRmBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T11:00:50.605486Z","bundle_sha256":"77ab3c08cb43cce1ddf951d8ebb965121049a3d991e2cb1dd3b4f952e60822e0"}}