{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DC66FVN3BXF6MGDY2I6KNFERXM","short_pith_number":"pith:DC66FVN3","schema_version":"1.0","canonical_sha256":"18bde2d5bb0dcbe61878d23ca69491bb21c742372b4e167936ac711e9b58f4d0","source":{"kind":"arxiv","id":"1511.02141","version":2},"attestation_state":"computed","paper":{"title":"Traversing Grammar-Compressed Trees with Constant Delay","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Carl Philipp Reh, Markus Lohrey, Sebastian Maneth","submitted_at":"2015-11-06T16:29:47Z","abstract_excerpt":"A grammar-compressed ranked tree is represented with a linear space overhead so that a single traversal step, i.e., the move to the parent or the i-th child, can be carried out in constant time. Moreover, we extend our data structure such that equality of subtrees can be checked in constant time."},"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":"1511.02141","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-06T16:29:47Z","cross_cats_sorted":[],"title_canon_sha256":"8781d62e72a1ffbcf3e22bc737d7ccf8e7d01806ce1abc8afe956d7fb7f20984","abstract_canon_sha256":"ade56d453d6b134b8174e179de89335b19d319410c308899f34a52833d23a0fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:21.860046Z","signature_b64":"F/Fk3DaOFsy5n+58kv7bsJD8x/kC0RlUWzTy499JH+NxlKmSkxTetD63ZhLu2UZDVbrR72sIqUdpjGVCqJMQAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18bde2d5bb0dcbe61878d23ca69491bb21c742372b4e167936ac711e9b58f4d0","last_reissued_at":"2026-05-18T01:27:21.859600Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:21.859600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Traversing Grammar-Compressed Trees with Constant Delay","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Carl Philipp Reh, Markus Lohrey, Sebastian Maneth","submitted_at":"2015-11-06T16:29:47Z","abstract_excerpt":"A grammar-compressed ranked tree is represented with a linear space overhead so that a single traversal step, i.e., the move to the parent or the i-th child, can be carried out in constant time. Moreover, we extend our data structure such that equality of subtrees can be checked in constant time."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02141","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":"1511.02141","created_at":"2026-05-18T01:27:21.859673+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.02141v2","created_at":"2026-05-18T01:27:21.859673+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02141","created_at":"2026-05-18T01:27:21.859673+00:00"},{"alias_kind":"pith_short_12","alias_value":"DC66FVN3BXF6","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DC66FVN3BXF6MGDY","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DC66FVN3","created_at":"2026-05-18T12:29:17.054201+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/DC66FVN3BXF6MGDY2I6KNFERXM","json":"https://pith.science/pith/DC66FVN3BXF6MGDY2I6KNFERXM.json","graph_json":"https://pith.science/api/pith-number/DC66FVN3BXF6MGDY2I6KNFERXM/graph.json","events_json":"https://pith.science/api/pith-number/DC66FVN3BXF6MGDY2I6KNFERXM/events.json","paper":"https://pith.science/paper/DC66FVN3"},"agent_actions":{"view_html":"https://pith.science/pith/DC66FVN3BXF6MGDY2I6KNFERXM","download_json":"https://pith.science/pith/DC66FVN3BXF6MGDY2I6KNFERXM.json","view_paper":"https://pith.science/paper/DC66FVN3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.02141&json=true","fetch_graph":"https://pith.science/api/pith-number/DC66FVN3BXF6MGDY2I6KNFERXM/graph.json","fetch_events":"https://pith.science/api/pith-number/DC66FVN3BXF6MGDY2I6KNFERXM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DC66FVN3BXF6MGDY2I6KNFERXM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DC66FVN3BXF6MGDY2I6KNFERXM/action/storage_attestation","attest_author":"https://pith.science/pith/DC66FVN3BXF6MGDY2I6KNFERXM/action/author_attestation","sign_citation":"https://pith.science/pith/DC66FVN3BXF6MGDY2I6KNFERXM/action/citation_signature","submit_replication":"https://pith.science/pith/DC66FVN3BXF6MGDY2I6KNFERXM/action/replication_record"}},"created_at":"2026-05-18T01:27:21.859673+00:00","updated_at":"2026-05-18T01:27:21.859673+00:00"}