{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:NWQFHJIYPA3AU6KV2QORZPSNTW","short_pith_number":"pith:NWQFHJIY","schema_version":"1.0","canonical_sha256":"6da053a51878360a7955d41d1cbe4d9d83ea0d81abee5686443f14a45720d006","source":{"kind":"arxiv","id":"1807.00371","version":1},"attestation_state":"computed","paper":{"title":"Representation of ordered trees with a given degree distribution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dekel Tsur","submitted_at":"2018-07-01T19:02:15Z","abstract_excerpt":"The degree distribution of an ordered tree $T$ with $n$ nodes is $\\vec{n} = (n_0,\\ldots,n_{n-1})$, where $n_i$ is the number of nodes in $T$ with $i$ children. Let $\\mathcal{N}(\\vec{n})$ be the number of trees with degree distribution $\\vec{n}$. We give a data structure that stores an ordered tree $T$ with $n$ nodes and degree distribution $\\vec{n}$ using $\\log \\mathcal{N}(\\vec{n})+O(n/\\log^t n)$ bits for every constant $t$. The data structure answers tree queries in constant time. This improves the current data structures with lowest space for ordered trees: The structure of Jansson et al.\\ ["},"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":"1807.00371","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-01T19:02:15Z","cross_cats_sorted":[],"title_canon_sha256":"0f642694eb3fdc9f1dde1981e44921e7468915385d6627672de7572f5557f275","abstract_canon_sha256":"7435ad604af6b184096588616128fb9a0d32b1488e626950a1e1e06f9e05c1d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:55.059989Z","signature_b64":"kRYNXr9tKWEyWTNhogbed5tuHAKDVxApjuedVjRbxos0VWQkcVGSYT756QQbfb+NKQQEuxzm8vB3G3/XqIQTDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6da053a51878360a7955d41d1cbe4d9d83ea0d81abee5686443f14a45720d006","last_reissued_at":"2026-05-18T00:11:55.059283Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:55.059283Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Representation of ordered trees with a given degree distribution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dekel Tsur","submitted_at":"2018-07-01T19:02:15Z","abstract_excerpt":"The degree distribution of an ordered tree $T$ with $n$ nodes is $\\vec{n} = (n_0,\\ldots,n_{n-1})$, where $n_i$ is the number of nodes in $T$ with $i$ children. Let $\\mathcal{N}(\\vec{n})$ be the number of trees with degree distribution $\\vec{n}$. We give a data structure that stores an ordered tree $T$ with $n$ nodes and degree distribution $\\vec{n}$ using $\\log \\mathcal{N}(\\vec{n})+O(n/\\log^t n)$ bits for every constant $t$. The data structure answers tree queries in constant time. This improves the current data structures with lowest space for ordered trees: The structure of Jansson et al.\\ ["},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.00371","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":"1807.00371","created_at":"2026-05-18T00:11:55.059385+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.00371v1","created_at":"2026-05-18T00:11:55.059385+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.00371","created_at":"2026-05-18T00:11:55.059385+00:00"},{"alias_kind":"pith_short_12","alias_value":"NWQFHJIYPA3A","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"NWQFHJIYPA3AU6KV","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"NWQFHJIY","created_at":"2026-05-18T12:32:40.477152+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/NWQFHJIYPA3AU6KV2QORZPSNTW","json":"https://pith.science/pith/NWQFHJIYPA3AU6KV2QORZPSNTW.json","graph_json":"https://pith.science/api/pith-number/NWQFHJIYPA3AU6KV2QORZPSNTW/graph.json","events_json":"https://pith.science/api/pith-number/NWQFHJIYPA3AU6KV2QORZPSNTW/events.json","paper":"https://pith.science/paper/NWQFHJIY"},"agent_actions":{"view_html":"https://pith.science/pith/NWQFHJIYPA3AU6KV2QORZPSNTW","download_json":"https://pith.science/pith/NWQFHJIYPA3AU6KV2QORZPSNTW.json","view_paper":"https://pith.science/paper/NWQFHJIY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.00371&json=true","fetch_graph":"https://pith.science/api/pith-number/NWQFHJIYPA3AU6KV2QORZPSNTW/graph.json","fetch_events":"https://pith.science/api/pith-number/NWQFHJIYPA3AU6KV2QORZPSNTW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NWQFHJIYPA3AU6KV2QORZPSNTW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NWQFHJIYPA3AU6KV2QORZPSNTW/action/storage_attestation","attest_author":"https://pith.science/pith/NWQFHJIYPA3AU6KV2QORZPSNTW/action/author_attestation","sign_citation":"https://pith.science/pith/NWQFHJIYPA3AU6KV2QORZPSNTW/action/citation_signature","submit_replication":"https://pith.science/pith/NWQFHJIYPA3AU6KV2QORZPSNTW/action/replication_record"}},"created_at":"2026-05-18T00:11:55.059385+00:00","updated_at":"2026-05-18T00:11:55.059385+00:00"}