{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:QMDJJCNMFLURDLIXU62PADCWCH","short_pith_number":"pith:QMDJJCNM","canonical_record":{"source":{"id":"1408.5966","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-08-26T01:16:30Z","cross_cats_sorted":[],"title_canon_sha256":"ca7c26e6c596664a49b359b17300c62f8301f77a96450e056727e0f519dd90c3","abstract_canon_sha256":"47f8359cbe6768fd00a4ebc27697105b346c9079b8f75d4714182319a48f185a"},"schema_version":"1.0"},"canonical_sha256":"83069489ac2ae911ad17a7b4f00c5611d5f4c1d7684d25f9819a91905de69d58","source":{"kind":"arxiv","id":"1408.5966","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.5966","created_at":"2026-05-18T02:44:15Z"},{"alias_kind":"arxiv_version","alias_value":"1408.5966v1","created_at":"2026-05-18T02:44:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5966","created_at":"2026-05-18T02:44:15Z"},{"alias_kind":"pith_short_12","alias_value":"QMDJJCNMFLUR","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QMDJJCNMFLURDLIX","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QMDJJCNM","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:QMDJJCNMFLURDLIXU62PADCWCH","target":"record","payload":{"canonical_record":{"source":{"id":"1408.5966","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-08-26T01:16:30Z","cross_cats_sorted":[],"title_canon_sha256":"ca7c26e6c596664a49b359b17300c62f8301f77a96450e056727e0f519dd90c3","abstract_canon_sha256":"47f8359cbe6768fd00a4ebc27697105b346c9079b8f75d4714182319a48f185a"},"schema_version":"1.0"},"canonical_sha256":"83069489ac2ae911ad17a7b4f00c5611d5f4c1d7684d25f9819a91905de69d58","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:15.582831Z","signature_b64":"Vom16FtVgDOpT4p2J4pX2fS/BbbKI49WB/s97en5YseMUgJOy37LPBCjt0dU/K0YiIXli0w7FKgva2iI2NtUAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83069489ac2ae911ad17a7b4f00c5611d5f4c1d7684d25f9819a91905de69d58","last_reissued_at":"2026-05-18T02:44:15.582420Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:15.582420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.5966","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:44:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E1It6DFPRWyUi+wudn7dyr80iNNVN7DFw3zqtSFkSRLR1MW78GiWp2s0jyHgZUqJnBWT0B+NU5mpR1wikps0DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T15:16:51.631875Z"},"content_sha256":"9b44b70914b46705aed4624e8455cd8cec18c5c12409730432a0ce8ec26e6db4","schema_version":"1.0","event_id":"sha256:9b44b70914b46705aed4624e8455cd8cec18c5c12409730432a0ce8ec26e6db4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:QMDJJCNMFLURDLIXU62PADCWCH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deterministic Automata for Unordered Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Adrien Boiret (University of Lille 1. Links (Inria Lille & LIFL, France), Joachim Niehren (Inria. Links (Inria Lille & LIFL, Ralf Treinen (University Paris Diderot. PPS (UMR CNRS 7126), UMR CNRS 8022), Vincent Hugot (Inria. Links (Inria Lille & LIFL","submitted_at":"2014-08-26T01:16:30Z","abstract_excerpt":"Automata for unordered unranked trees are relevant for defining schemas and queries for data trees in Json or Xml format. While the existing notions are well-investigated concerning expressiveness, they all lack a proper notion of determinism, which makes it difficult to distinguish subclasses of automata for which problems such as inclusion, equivalence, and minimization can be solved efficiently. In this paper, we propose and investigate different notions of \"horizontal determinism\", starting from automata for unranked trees in which the horizontal evaluation is performed by finite state aut"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5966","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:44:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qp6BrkzPvcq853gOT6/a3ZLtY3qCbAVn4+gFPORrYsy9JyObJfoqhGBLmZYk1I+nIZUVmhmLNWPZdsjLr+9eCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T15:16:51.632218Z"},"content_sha256":"bb32822f09b4b68e219fefdbc28788fb8742e3907bbb730f59e1165c79111b9d","schema_version":"1.0","event_id":"sha256:bb32822f09b4b68e219fefdbc28788fb8742e3907bbb730f59e1165c79111b9d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QMDJJCNMFLURDLIXU62PADCWCH/bundle.json","state_url":"https://pith.science/pith/QMDJJCNMFLURDLIXU62PADCWCH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QMDJJCNMFLURDLIXU62PADCWCH/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-09T15:16:51Z","links":{"resolver":"https://pith.science/pith/QMDJJCNMFLURDLIXU62PADCWCH","bundle":"https://pith.science/pith/QMDJJCNMFLURDLIXU62PADCWCH/bundle.json","state":"https://pith.science/pith/QMDJJCNMFLURDLIXU62PADCWCH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QMDJJCNMFLURDLIXU62PADCWCH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:QMDJJCNMFLURDLIXU62PADCWCH","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":"47f8359cbe6768fd00a4ebc27697105b346c9079b8f75d4714182319a48f185a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-08-26T01:16:30Z","title_canon_sha256":"ca7c26e6c596664a49b359b17300c62f8301f77a96450e056727e0f519dd90c3"},"schema_version":"1.0","source":{"id":"1408.5966","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.5966","created_at":"2026-05-18T02:44:15Z"},{"alias_kind":"arxiv_version","alias_value":"1408.5966v1","created_at":"2026-05-18T02:44:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5966","created_at":"2026-05-18T02:44:15Z"},{"alias_kind":"pith_short_12","alias_value":"QMDJJCNMFLUR","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QMDJJCNMFLURDLIX","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QMDJJCNM","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:bb32822f09b4b68e219fefdbc28788fb8742e3907bbb730f59e1165c79111b9d","target":"graph","created_at":"2026-05-18T02:44:15Z","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 for unordered unranked trees are relevant for defining schemas and queries for data trees in Json or Xml format. While the existing notions are well-investigated concerning expressiveness, they all lack a proper notion of determinism, which makes it difficult to distinguish subclasses of automata for which problems such as inclusion, equivalence, and minimization can be solved efficiently. In this paper, we propose and investigate different notions of \"horizontal determinism\", starting from automata for unranked trees in which the horizontal evaluation is performed by finite state aut","authors_text":"Adrien Boiret (University of Lille 1. Links (Inria Lille & LIFL, France), Joachim Niehren (Inria. Links (Inria Lille & LIFL, Ralf Treinen (University Paris Diderot. PPS (UMR CNRS 7126), UMR CNRS 8022), Vincent Hugot (Inria. Links (Inria Lille & LIFL","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-08-26T01:16:30Z","title":"Deterministic Automata for Unordered Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5966","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:9b44b70914b46705aed4624e8455cd8cec18c5c12409730432a0ce8ec26e6db4","target":"record","created_at":"2026-05-18T02:44:15Z","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":"47f8359cbe6768fd00a4ebc27697105b346c9079b8f75d4714182319a48f185a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-08-26T01:16:30Z","title_canon_sha256":"ca7c26e6c596664a49b359b17300c62f8301f77a96450e056727e0f519dd90c3"},"schema_version":"1.0","source":{"id":"1408.5966","kind":"arxiv","version":1}},"canonical_sha256":"83069489ac2ae911ad17a7b4f00c5611d5f4c1d7684d25f9819a91905de69d58","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"83069489ac2ae911ad17a7b4f00c5611d5f4c1d7684d25f9819a91905de69d58","first_computed_at":"2026-05-18T02:44:15.582420Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:15.582420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Vom16FtVgDOpT4p2J4pX2fS/BbbKI49WB/s97en5YseMUgJOy37LPBCjt0dU/K0YiIXli0w7FKgva2iI2NtUAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:15.582831Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.5966","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9b44b70914b46705aed4624e8455cd8cec18c5c12409730432a0ce8ec26e6db4","sha256:bb32822f09b4b68e219fefdbc28788fb8742e3907bbb730f59e1165c79111b9d"],"state_sha256":"b2e7603ea4df4a7d53273bf5e634d4a39cc38c82eca7ff69ecd5d800f7b7e4e7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WUsvTVoIK2gVRBMzhs3+5t9YiwU2fb88Xft1XyvZYXOiSsoQ1swuAlj4IOqhj+ckLunRjUBur2BtWTd30Q0KDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T15:16:51.634123Z","bundle_sha256":"606f44061fc6321774437b408a05ff5b129bef2420d495894349e5d1b023b9f2"}}