{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:WNS22CJTNHHNA5DF3EYLQ7GGYH","short_pith_number":"pith:WNS22CJT","schema_version":"1.0","canonical_sha256":"b365ad093369ced07465d930b87cc6c1fd38c1a8c0afec8a5bc70d3e92a3875c","source":{"kind":"arxiv","id":"1605.04271","version":2},"attestation_state":"computed","paper":{"title":"Axiomatizations for downward XPath on Data Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","math.LO"],"primary_cat":"cs.LO","authors_text":"Mar\\'ia Emilia Descotte, Raul Fervari, Santiago Figueira, Sergio Abriola","submitted_at":"2016-05-13T17:49:22Z","abstract_excerpt":"We give sound and complete axiomatizations for XPath with data tests by \"equality\" or \"inequality\", and containing the single \"child\" axis. This data-aware logic predicts over data trees, which are tree-like structures whose every node contains a label from a finite alphabet and a data value from an infinite domain. The language allows us to compare data values of two nodes but cannot access the data values themselves (i.e. there is no comparison by constants). Our axioms are in the style of equational logic, extending the axiomatization of data-oblivious XPath, by B. ten Cate, T. Litak and M."},"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":"1605.04271","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-05-13T17:49:22Z","cross_cats_sorted":["cs.DB","math.LO"],"title_canon_sha256":"2eb823cc4cbe235391001a5fc04c380a088f4333e3545504ec168021b430f95d","abstract_canon_sha256":"4ae1d35cc3f0c3ac4d92edacd657293ebb4ee9df35235987b98d9989e83466b7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:54.543877Z","signature_b64":"8ZlhfGodiEIoaLKiZMp5xiOArCwQePcdyovHaVBjtdtEYgCAmvuAZYO4jAhHZBMQiQemHMTqfRDHDY//EQvODA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b365ad093369ced07465d930b87cc6c1fd38c1a8c0afec8a5bc70d3e92a3875c","last_reissued_at":"2026-05-18T00:48:54.543187Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:54.543187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Axiomatizations for downward XPath on Data Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","math.LO"],"primary_cat":"cs.LO","authors_text":"Mar\\'ia Emilia Descotte, Raul Fervari, Santiago Figueira, Sergio Abriola","submitted_at":"2016-05-13T17:49:22Z","abstract_excerpt":"We give sound and complete axiomatizations for XPath with data tests by \"equality\" or \"inequality\", and containing the single \"child\" axis. This data-aware logic predicts over data trees, which are tree-like structures whose every node contains a label from a finite alphabet and a data value from an infinite domain. The language allows us to compare data values of two nodes but cannot access the data values themselves (i.e. there is no comparison by constants). Our axioms are in the style of equational logic, extending the axiomatization of data-oblivious XPath, by B. ten Cate, T. Litak and M."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04271","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":"1605.04271","created_at":"2026-05-18T00:48:54.543299+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.04271v2","created_at":"2026-05-18T00:48:54.543299+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04271","created_at":"2026-05-18T00:48:54.543299+00:00"},{"alias_kind":"pith_short_12","alias_value":"WNS22CJTNHHN","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"WNS22CJTNHHNA5DF","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"WNS22CJT","created_at":"2026-05-18T12:30:48.956258+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/WNS22CJTNHHNA5DF3EYLQ7GGYH","json":"https://pith.science/pith/WNS22CJTNHHNA5DF3EYLQ7GGYH.json","graph_json":"https://pith.science/api/pith-number/WNS22CJTNHHNA5DF3EYLQ7GGYH/graph.json","events_json":"https://pith.science/api/pith-number/WNS22CJTNHHNA5DF3EYLQ7GGYH/events.json","paper":"https://pith.science/paper/WNS22CJT"},"agent_actions":{"view_html":"https://pith.science/pith/WNS22CJTNHHNA5DF3EYLQ7GGYH","download_json":"https://pith.science/pith/WNS22CJTNHHNA5DF3EYLQ7GGYH.json","view_paper":"https://pith.science/paper/WNS22CJT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.04271&json=true","fetch_graph":"https://pith.science/api/pith-number/WNS22CJTNHHNA5DF3EYLQ7GGYH/graph.json","fetch_events":"https://pith.science/api/pith-number/WNS22CJTNHHNA5DF3EYLQ7GGYH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WNS22CJTNHHNA5DF3EYLQ7GGYH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WNS22CJTNHHNA5DF3EYLQ7GGYH/action/storage_attestation","attest_author":"https://pith.science/pith/WNS22CJTNHHNA5DF3EYLQ7GGYH/action/author_attestation","sign_citation":"https://pith.science/pith/WNS22CJTNHHNA5DF3EYLQ7GGYH/action/citation_signature","submit_replication":"https://pith.science/pith/WNS22CJTNHHNA5DF3EYLQ7GGYH/action/replication_record"}},"created_at":"2026-05-18T00:48:54.543299+00:00","updated_at":"2026-05-18T00:48:54.543299+00:00"}