{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:EA44KC3BWE4Q3D37IJTFLLQA6E","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":"c1fa8cce3aa0d7c9e13f7005a0a6d262d91bf0ef836d8ee6c4ffb26a592aa891","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-11-21T21:01:02Z","title_canon_sha256":"2ca865e0ff487f5037c3760a74d98d52dd207a733b3bbf5ba7e6df350c39fc69"},"schema_version":"1.0","source":{"id":"1311.5573","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.5573","created_at":"2026-05-18T03:06:23Z"},{"alias_kind":"arxiv_version","alias_value":"1311.5573v1","created_at":"2026-05-18T03:06:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.5573","created_at":"2026-05-18T03:06:23Z"},{"alias_kind":"pith_short_12","alias_value":"EA44KC3BWE4Q","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"EA44KC3BWE4Q3D37","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"EA44KC3B","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:d951424400ac90f7e6ec4b2bad4425173b4da2b8d4ab57b552ca5cacb05102a5","target":"graph","created_at":"2026-05-18T03:06:23Z","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":"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","authors_text":"INRIA), Sebastian Maneth (University of Edinburgh), Tom Sebastian (Innovimax","cross_cats":["cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-11-21T21:01:02Z","title":"XPath Node Selection over Grammar-Compressed Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.5573","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:ced0eed9abdbcad7cfc1edaf6e0bc3613ae024b687a998349740f1cbdc580d4b","target":"record","created_at":"2026-05-18T03:06:23Z","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":"c1fa8cce3aa0d7c9e13f7005a0a6d262d91bf0ef836d8ee6c4ffb26a592aa891","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-11-21T21:01:02Z","title_canon_sha256":"2ca865e0ff487f5037c3760a74d98d52dd207a733b3bbf5ba7e6df350c39fc69"},"schema_version":"1.0","source":{"id":"1311.5573","kind":"arxiv","version":1}},"canonical_sha256":"2039c50b61b1390d8f7f426655ae00f123f239df635f78d6aae0b4ef08470f4d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2039c50b61b1390d8f7f426655ae00f123f239df635f78d6aae0b4ef08470f4d","first_computed_at":"2026-05-18T03:06:23.873505Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:06:23.873505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aZzH4AcbDT5TH/1F6Q6lxYq3sf4YaQ7B4d/W5O+XcG1ZhT+TcParNTe5Bpv3IemEprWGtXYUWoecH8+Zak3gBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:06:23.874207Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.5573","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ced0eed9abdbcad7cfc1edaf6e0bc3613ae024b687a998349740f1cbdc580d4b","sha256:d951424400ac90f7e6ec4b2bad4425173b4da2b8d4ab57b552ca5cacb05102a5"],"state_sha256":"e127bdd3333ac0020b1d60064d659bd7d0b2e19e68fdc732cf4935b039fa346b"}