{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:R4354HUOY52J2XLXEFVK7YHVPR","short_pith_number":"pith:R4354HUO","schema_version":"1.0","canonical_sha256":"8f37de1e8ec7749d5d77216aafe0f57c42c32843d8a87029850f7fdeb1a3c439","source":{"kind":"arxiv","id":"1312.6039","version":1},"attestation_state":"computed","paper":{"title":"Succinct representation of labeled trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dekel Tsur","submitted_at":"2013-12-20T16:56:28Z","abstract_excerpt":"We give a representation for labeled ordered trees that supports labeled queries such as finding the i-th ancestor of a node with a given label. Our representation is succinct, namely the redundancy is small-o of the optimal space for storing the tree. This improves the representation of He et al. which is succinct unless the entropy of the labels is small."},"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":"1312.6039","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-20T16:56:28Z","cross_cats_sorted":[],"title_canon_sha256":"d03e424003c78248be123dfbb2e3719aa48a1e9f4dd0fe3ab2f82a29b2063094","abstract_canon_sha256":"776bc9975dd3503066df437018de77f1ace840ac5a31ef8528a78492ac0c6694"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:07.295666Z","signature_b64":"Q0HY0jE/uS4V+i1FqXGPrKhPCm/GB0pZOvCLGYv/uIj+kUSNOWWkkp6omUMN+52DsNuDmMaVPi4PKZagy9WmBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f37de1e8ec7749d5d77216aafe0f57c42c32843d8a87029850f7fdeb1a3c439","last_reissued_at":"2026-05-18T03:04:07.295059Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:07.295059Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Succinct representation of labeled trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dekel Tsur","submitted_at":"2013-12-20T16:56:28Z","abstract_excerpt":"We give a representation for labeled ordered trees that supports labeled queries such as finding the i-th ancestor of a node with a given label. Our representation is succinct, namely the redundancy is small-o of the optimal space for storing the tree. This improves the representation of He et al. which is succinct unless the entropy of the labels is small."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.6039","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":"1312.6039","created_at":"2026-05-18T03:04:07.295163+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.6039v1","created_at":"2026-05-18T03:04:07.295163+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.6039","created_at":"2026-05-18T03:04:07.295163+00:00"},{"alias_kind":"pith_short_12","alias_value":"R4354HUOY52J","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"R4354HUOY52J2XLX","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"R4354HUO","created_at":"2026-05-18T12:27:57.521954+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/R4354HUOY52J2XLXEFVK7YHVPR","json":"https://pith.science/pith/R4354HUOY52J2XLXEFVK7YHVPR.json","graph_json":"https://pith.science/api/pith-number/R4354HUOY52J2XLXEFVK7YHVPR/graph.json","events_json":"https://pith.science/api/pith-number/R4354HUOY52J2XLXEFVK7YHVPR/events.json","paper":"https://pith.science/paper/R4354HUO"},"agent_actions":{"view_html":"https://pith.science/pith/R4354HUOY52J2XLXEFVK7YHVPR","download_json":"https://pith.science/pith/R4354HUOY52J2XLXEFVK7YHVPR.json","view_paper":"https://pith.science/paper/R4354HUO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.6039&json=true","fetch_graph":"https://pith.science/api/pith-number/R4354HUOY52J2XLXEFVK7YHVPR/graph.json","fetch_events":"https://pith.science/api/pith-number/R4354HUOY52J2XLXEFVK7YHVPR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R4354HUOY52J2XLXEFVK7YHVPR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R4354HUOY52J2XLXEFVK7YHVPR/action/storage_attestation","attest_author":"https://pith.science/pith/R4354HUOY52J2XLXEFVK7YHVPR/action/author_attestation","sign_citation":"https://pith.science/pith/R4354HUOY52J2XLXEFVK7YHVPR/action/citation_signature","submit_replication":"https://pith.science/pith/R4354HUOY52J2XLXEFVK7YHVPR/action/replication_record"}},"created_at":"2026-05-18T03:04:07.295163+00:00","updated_at":"2026-05-18T03:04:07.295163+00:00"}