{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:EA44KC3BWE4Q3D37IJTFLLQA6E","short_pith_number":"pith:EA44KC3B","schema_version":"1.0","canonical_sha256":"2039c50b61b1390d8f7f426655ae00f123f239df635f78d6aae0b4ef08470f4d","source":{"kind":"arxiv","id":"1311.5573","version":1},"attestation_state":"computed","paper":{"title":"XPath Node Selection over Grammar-Compressed Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.DB","authors_text":"INRIA), Sebastian Maneth (University of Edinburgh), Tom Sebastian (Innovimax","submitted_at":"2013-11-21T21:01:02Z","abstract_excerpt":"XML document markup is highly repetitive and therefore well compressible using grammar-based compression. Downward, navigational XPath can be executed over grammar-compressed trees in PTIME: the query is translated into an automaton which is executed in one pass over the grammar. This result is well-known and has been mentioned before. Here we present precise bounds on the time complexity of this problem, in terms of big-O notation. For a given grammar and XPath query, we consider three different tasks: (1) to count the number of nodes selected by the query, (2) to materialize the pre-order nu"},"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":"1311.5573","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-11-21T21:01:02Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"2ca865e0ff487f5037c3760a74d98d52dd207a733b3bbf5ba7e6df350c39fc69","abstract_canon_sha256":"c1fa8cce3aa0d7c9e13f7005a0a6d262d91bf0ef836d8ee6c4ffb26a592aa891"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:23.874207Z","signature_b64":"aZzH4AcbDT5TH/1F6Q6lxYq3sf4YaQ7B4d/W5O+XcG1ZhT+TcParNTe5Bpv3IemEprWGtXYUWoecH8+Zak3gBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2039c50b61b1390d8f7f426655ae00f123f239df635f78d6aae0b4ef08470f4d","last_reissued_at":"2026-05-18T03:06:23.873505Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:23.873505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"XPath Node Selection over Grammar-Compressed Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.DB","authors_text":"INRIA), Sebastian Maneth (University of Edinburgh), Tom Sebastian (Innovimax","submitted_at":"2013-11-21T21:01:02Z","abstract_excerpt":"XML document markup is highly repetitive and therefore well compressible using grammar-based compression. Downward, navigational XPath can be executed over grammar-compressed trees in PTIME: the query is translated into an automaton which is executed in one pass over the grammar. This result is well-known and has been mentioned before. Here we present precise bounds on the time complexity of this problem, in terms of big-O notation. For a given grammar and XPath query, we consider three different tasks: (1) to count the number of nodes selected by the query, (2) to materialize the pre-order nu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.5573","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1311.5573","created_at":"2026-05-18T03:06:23.873622+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.5573v1","created_at":"2026-05-18T03:06:23.873622+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.5573","created_at":"2026-05-18T03:06:23.873622+00:00"},{"alias_kind":"pith_short_12","alias_value":"EA44KC3BWE4Q","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"EA44KC3BWE4Q3D37","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"EA44KC3B","created_at":"2026-05-18T12:27:43.054852+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/EA44KC3BWE4Q3D37IJTFLLQA6E","json":"https://pith.science/pith/EA44KC3BWE4Q3D37IJTFLLQA6E.json","graph_json":"https://pith.science/api/pith-number/EA44KC3BWE4Q3D37IJTFLLQA6E/graph.json","events_json":"https://pith.science/api/pith-number/EA44KC3BWE4Q3D37IJTFLLQA6E/events.json","paper":"https://pith.science/paper/EA44KC3B"},"agent_actions":{"view_html":"https://pith.science/pith/EA44KC3BWE4Q3D37IJTFLLQA6E","download_json":"https://pith.science/pith/EA44KC3BWE4Q3D37IJTFLLQA6E.json","view_paper":"https://pith.science/paper/EA44KC3B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.5573&json=true","fetch_graph":"https://pith.science/api/pith-number/EA44KC3BWE4Q3D37IJTFLLQA6E/graph.json","fetch_events":"https://pith.science/api/pith-number/EA44KC3BWE4Q3D37IJTFLLQA6E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EA44KC3BWE4Q3D37IJTFLLQA6E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EA44KC3BWE4Q3D37IJTFLLQA6E/action/storage_attestation","attest_author":"https://pith.science/pith/EA44KC3BWE4Q3D37IJTFLLQA6E/action/author_attestation","sign_citation":"https://pith.science/pith/EA44KC3BWE4Q3D37IJTFLLQA6E/action/citation_signature","submit_replication":"https://pith.science/pith/EA44KC3BWE4Q3D37IJTFLLQA6E/action/replication_record"}},"created_at":"2026-05-18T03:06:23.873622+00:00","updated_at":"2026-05-18T03:06:23.873622+00:00"}