{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:6BDWI6WET7AATI5ADB7OA7TDJ7","short_pith_number":"pith:6BDWI6WE","schema_version":"1.0","canonical_sha256":"f047647ac49fc009a3a0187ee07e634fe3c905d0612114297bcb327a082061e3","source":{"kind":"arxiv","id":"1801.01059","version":1},"attestation_state":"computed","paper":{"title":"Slowing Down Top Trees for Better Worst-Case Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bart{\\l}omiej Dudek, Pawe{\\l} Gawrychowski","submitted_at":"2018-01-03T16:00:26Z","abstract_excerpt":"We consider the top tree compression scheme introduced by Bille et al. [ICALP 2013] and construct an infinite family of trees on $n$ nodes labeled from an alphabet of size $\\sigma$, for which the size of the top DAG is $\\Theta(\\frac{n}{\\log_\\sigma n}\\log\\log_\\sigma n)$. Our construction matches a previously known upper bound and exhibits a weakness of this scheme, as the information-theoretic lower bound is $\\Omega(\\frac{n}{\\log_\\sigma n})$. This settles an open problem stated by Lohrey et al. [arXiv 2017], who designed a more involved version achieving the lower bound. We show that this can b"},"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":"1801.01059","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-01-03T16:00:26Z","cross_cats_sorted":[],"title_canon_sha256":"50ecc82753c8367069ffbbd55f4556f25a3cbd4357579329f9e09996a9e547e5","abstract_canon_sha256":"87f876989cbf3abcbe7be32afda83803f4c2816c8dff1b4b9293a933c6788caa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:47.943966Z","signature_b64":"Z++SaMNniQMYwxNNNaOieO8BSJZEkFpnF6ByC7hI2ssyqvgY8Ykj0SKrrJtOv6rFRNn3AHGdC3HsCoHNrDtYBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f047647ac49fc009a3a0187ee07e634fe3c905d0612114297bcb327a082061e3","last_reissued_at":"2026-05-18T00:26:47.943357Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:47.943357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Slowing Down Top Trees for Better Worst-Case Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bart{\\l}omiej Dudek, Pawe{\\l} Gawrychowski","submitted_at":"2018-01-03T16:00:26Z","abstract_excerpt":"We consider the top tree compression scheme introduced by Bille et al. [ICALP 2013] and construct an infinite family of trees on $n$ nodes labeled from an alphabet of size $\\sigma$, for which the size of the top DAG is $\\Theta(\\frac{n}{\\log_\\sigma n}\\log\\log_\\sigma n)$. Our construction matches a previously known upper bound and exhibits a weakness of this scheme, as the information-theoretic lower bound is $\\Omega(\\frac{n}{\\log_\\sigma n})$. This settles an open problem stated by Lohrey et al. [arXiv 2017], who designed a more involved version achieving the lower bound. We show that this can b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.01059","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":"1801.01059","created_at":"2026-05-18T00:26:47.943465+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.01059v1","created_at":"2026-05-18T00:26:47.943465+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.01059","created_at":"2026-05-18T00:26:47.943465+00:00"},{"alias_kind":"pith_short_12","alias_value":"6BDWI6WET7AA","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"6BDWI6WET7AATI5A","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"6BDWI6WE","created_at":"2026-05-18T12:32:08.215937+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/6BDWI6WET7AATI5ADB7OA7TDJ7","json":"https://pith.science/pith/6BDWI6WET7AATI5ADB7OA7TDJ7.json","graph_json":"https://pith.science/api/pith-number/6BDWI6WET7AATI5ADB7OA7TDJ7/graph.json","events_json":"https://pith.science/api/pith-number/6BDWI6WET7AATI5ADB7OA7TDJ7/events.json","paper":"https://pith.science/paper/6BDWI6WE"},"agent_actions":{"view_html":"https://pith.science/pith/6BDWI6WET7AATI5ADB7OA7TDJ7","download_json":"https://pith.science/pith/6BDWI6WET7AATI5ADB7OA7TDJ7.json","view_paper":"https://pith.science/paper/6BDWI6WE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.01059&json=true","fetch_graph":"https://pith.science/api/pith-number/6BDWI6WET7AATI5ADB7OA7TDJ7/graph.json","fetch_events":"https://pith.science/api/pith-number/6BDWI6WET7AATI5ADB7OA7TDJ7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6BDWI6WET7AATI5ADB7OA7TDJ7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6BDWI6WET7AATI5ADB7OA7TDJ7/action/storage_attestation","attest_author":"https://pith.science/pith/6BDWI6WET7AATI5ADB7OA7TDJ7/action/author_attestation","sign_citation":"https://pith.science/pith/6BDWI6WET7AATI5ADB7OA7TDJ7/action/citation_signature","submit_replication":"https://pith.science/pith/6BDWI6WET7AATI5ADB7OA7TDJ7/action/replication_record"}},"created_at":"2026-05-18T00:26:47.943465+00:00","updated_at":"2026-05-18T00:26:47.943465+00:00"}