{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:6UX27EJG2TLU4HKPLHUN6H6HBK","short_pith_number":"pith:6UX27EJG","schema_version":"1.0","canonical_sha256":"f52faf9126d4d74e1d4f59e8df1fc70a99849a51ee9df1a29a962db727947c5e","source":{"kind":"arxiv","id":"1212.3251","version":2},"attestation_state":"computed","paper":{"title":"Automata for two-variable logic over trees with ordered data values","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Tony Tan","submitted_at":"2012-12-13T18:18:54Z","abstract_excerpt":"Data trees are trees in which each node, besides carrying a label from a finite alphabet, also carries a data value from an infinite domain. They have been used as an abstraction model for reasoning tasks on {XML} and verification. However, most existing approaches consider the case where only equality test can be performed on the data values.\n  In this paper we study data trees in which the data values come from a linearly ordered domain, and in addition to equality test, we can test whether the data value in a node is greater than the one in another node. We introduce an automata model for t"},"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":"1212.3251","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-12-13T18:18:54Z","cross_cats_sorted":[],"title_canon_sha256":"b3bf3776e944f127415065d008c19e5a5c34d92e73b0c9e9d11a9dbea4112bd6","abstract_canon_sha256":"2ca9daa328ca4220962b174eeb4175b12dae0db676a479725c633b427ba7a7e3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:24.060708Z","signature_b64":"2O/frSPDRbF1qPKCdr2pzJGA8m+PmhIjq+ZqVLjkEKk3Tqo6WwBILH/gNmmTZR/ZmFhbjJ/ridbtquToNJudAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f52faf9126d4d74e1d4f59e8df1fc70a99849a51ee9df1a29a962db727947c5e","last_reissued_at":"2026-05-18T03:11:24.060010Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:24.060010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Automata for two-variable logic over trees with ordered data values","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Tony Tan","submitted_at":"2012-12-13T18:18:54Z","abstract_excerpt":"Data trees are trees in which each node, besides carrying a label from a finite alphabet, also carries a data value from an infinite domain. They have been used as an abstraction model for reasoning tasks on {XML} and verification. However, most existing approaches consider the case where only equality test can be performed on the data values.\n  In this paper we study data trees in which the data values come from a linearly ordered domain, and in addition to equality test, we can test whether the data value in a node is greater than the one in another node. We introduce an automata model for t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.3251","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":"1212.3251","created_at":"2026-05-18T03:11:24.060115+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.3251v2","created_at":"2026-05-18T03:11:24.060115+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.3251","created_at":"2026-05-18T03:11:24.060115+00:00"},{"alias_kind":"pith_short_12","alias_value":"6UX27EJG2TLU","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"6UX27EJG2TLU4HKP","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"6UX27EJG","created_at":"2026-05-18T12:26:56.085431+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/6UX27EJG2TLU4HKPLHUN6H6HBK","json":"https://pith.science/pith/6UX27EJG2TLU4HKPLHUN6H6HBK.json","graph_json":"https://pith.science/api/pith-number/6UX27EJG2TLU4HKPLHUN6H6HBK/graph.json","events_json":"https://pith.science/api/pith-number/6UX27EJG2TLU4HKPLHUN6H6HBK/events.json","paper":"https://pith.science/paper/6UX27EJG"},"agent_actions":{"view_html":"https://pith.science/pith/6UX27EJG2TLU4HKPLHUN6H6HBK","download_json":"https://pith.science/pith/6UX27EJG2TLU4HKPLHUN6H6HBK.json","view_paper":"https://pith.science/paper/6UX27EJG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.3251&json=true","fetch_graph":"https://pith.science/api/pith-number/6UX27EJG2TLU4HKPLHUN6H6HBK/graph.json","fetch_events":"https://pith.science/api/pith-number/6UX27EJG2TLU4HKPLHUN6H6HBK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6UX27EJG2TLU4HKPLHUN6H6HBK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6UX27EJG2TLU4HKPLHUN6H6HBK/action/storage_attestation","attest_author":"https://pith.science/pith/6UX27EJG2TLU4HKPLHUN6H6HBK/action/author_attestation","sign_citation":"https://pith.science/pith/6UX27EJG2TLU4HKPLHUN6H6HBK/action/citation_signature","submit_replication":"https://pith.science/pith/6UX27EJG2TLU4HKPLHUN6H6HBK/action/replication_record"}},"created_at":"2026-05-18T03:11:24.060115+00:00","updated_at":"2026-05-18T03:11:24.060115+00:00"}