{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:YEGFIEULIDLTXCL256I6J2DNYW","short_pith_number":"pith:YEGFIEUL","schema_version":"1.0","canonical_sha256":"c10c54128b40d73b897aef91e4e86dc5b14f1b54392d6a566b0912b398dceaa3","source":{"kind":"arxiv","id":"1201.0597","version":2},"attestation_state":"computed","paper":{"title":"An extension of data automata that captures XPath","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Miko{\\l}aj Boja\\'nczyk (University of Warsaw), S{\\l}awomir Lasota (University of Warsaw)","submitted_at":"2012-01-03T09:13:14Z","abstract_excerpt":"We define a new kind of automata recognizing properties of data words or data trees and prove that the automata capture all queries definable in Regular XPath. We show that the automata-theoretic approach may be applied to answer decidability and expressibility questions for XPath."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1201.0597","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-01-03T09:13:14Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"c5dfc5459f4ffbebac212e295fb0a64e4594fda29fc4293471d7166641319eaa","abstract_canon_sha256":"8a0c73369a3e41680c52f9888e0e8ecbba1891ca0a9c21de6a9df59a0918ddf4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:39.094010Z","signature_b64":"fTadKd/OzmUneJu+gMsQRJpa8Ilc521YVLdfl2kCZfgKeD78v1OqrvafPGe6SVq5JcuEiVpnBvDHjylFWRPjAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c10c54128b40d73b897aef91e4e86dc5b14f1b54392d6a566b0912b398dceaa3","last_reissued_at":"2026-05-18T01:37:39.093327Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:39.093327Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An extension of data automata that captures XPath","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Miko{\\l}aj Boja\\'nczyk (University of Warsaw), S{\\l}awomir Lasota (University of Warsaw)","submitted_at":"2012-01-03T09:13:14Z","abstract_excerpt":"We define a new kind of automata recognizing properties of data words or data trees and prove that the automata capture all queries definable in Regular XPath. We show that the automata-theoretic approach may be applied to answer decidability and expressibility questions for XPath."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.0597","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1201.0597","created_at":"2026-05-18T01:37:39.093471+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.0597v2","created_at":"2026-05-18T01:37:39.093471+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.0597","created_at":"2026-05-18T01:37:39.093471+00:00"},{"alias_kind":"pith_short_12","alias_value":"YEGFIEULIDLT","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_16","alias_value":"YEGFIEULIDLTXCL2","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_8","alias_value":"YEGFIEUL","created_at":"2026-05-18T12:27:27.928770+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YEGFIEULIDLTXCL256I6J2DNYW","json":"https://pith.science/pith/YEGFIEULIDLTXCL256I6J2DNYW.json","graph_json":"https://pith.science/api/pith-number/YEGFIEULIDLTXCL256I6J2DNYW/graph.json","events_json":"https://pith.science/api/pith-number/YEGFIEULIDLTXCL256I6J2DNYW/events.json","paper":"https://pith.science/paper/YEGFIEUL"},"agent_actions":{"view_html":"https://pith.science/pith/YEGFIEULIDLTXCL256I6J2DNYW","download_json":"https://pith.science/pith/YEGFIEULIDLTXCL256I6J2DNYW.json","view_paper":"https://pith.science/paper/YEGFIEUL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.0597&json=true","fetch_graph":"https://pith.science/api/pith-number/YEGFIEULIDLTXCL256I6J2DNYW/graph.json","fetch_events":"https://pith.science/api/pith-number/YEGFIEULIDLTXCL256I6J2DNYW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YEGFIEULIDLTXCL256I6J2DNYW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YEGFIEULIDLTXCL256I6J2DNYW/action/storage_attestation","attest_author":"https://pith.science/pith/YEGFIEULIDLTXCL256I6J2DNYW/action/author_attestation","sign_citation":"https://pith.science/pith/YEGFIEULIDLTXCL256I6J2DNYW/action/citation_signature","submit_replication":"https://pith.science/pith/YEGFIEULIDLTXCL256I6J2DNYW/action/replication_record"}},"created_at":"2026-05-18T01:37:39.093471+00:00","updated_at":"2026-05-18T01:37:39.093471+00:00"}