{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:6BDWI6WET7AATI5ADB7OA7TDJ7","short_pith_number":"pith:6BDWI6WE","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"},"canonical_sha256":"f047647ac49fc009a3a0187ee07e634fe3c905d0612114297bcb327a082061e3","source":{"kind":"arxiv","id":"1801.01059","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.01059","created_at":"2026-05-18T00:26:47Z"},{"alias_kind":"arxiv_version","alias_value":"1801.01059v1","created_at":"2026-05-18T00:26:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.01059","created_at":"2026-05-18T00:26:47Z"},{"alias_kind":"pith_short_12","alias_value":"6BDWI6WET7AA","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6BDWI6WET7AATI5A","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6BDWI6WE","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:6BDWI6WET7AATI5ADB7OA7TDJ7","target":"record","payload":{"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"},"canonical_sha256":"f047647ac49fc009a3a0187ee07e634fe3c905d0612114297bcb327a082061e3","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"},"source_kind":"arxiv","source_id":"1801.01059","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:26:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LQp4y7YLT+bFx3f8udfvQ4aDlTbC9ji8J1vh0795E0lrdnj7Apsbr5WGdFU1PzRaFF19RaPNQPXW3V9EZIRIDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T22:35:23.453527Z"},"content_sha256":"9e2cd1de14b0b85b3c8d1b5cb53b32718711434b482c7b422c57bb7a6e0cc255","schema_version":"1.0","event_id":"sha256:9e2cd1de14b0b85b3c8d1b5cb53b32718711434b482c7b422c57bb7a6e0cc255"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:6BDWI6WET7AATI5ADB7OA7TDJ7","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:26:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wrjzAMqx/F4551kqUvdNjArQNTnscfn3gYFnnMjlCVIkXIMB4NSy4lzKoo3nrLKxIieYQ3ZTzuqpwx0t0Uh5Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T22:35:23.453875Z"},"content_sha256":"aeaf1c80596b75140cc956e021f312d1d960d7dc0e1edf79df89dc98836005cb","schema_version":"1.0","event_id":"sha256:aeaf1c80596b75140cc956e021f312d1d960d7dc0e1edf79df89dc98836005cb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6BDWI6WET7AATI5ADB7OA7TDJ7/bundle.json","state_url":"https://pith.science/pith/6BDWI6WET7AATI5ADB7OA7TDJ7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6BDWI6WET7AATI5ADB7OA7TDJ7/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-30T22:35:23Z","links":{"resolver":"https://pith.science/pith/6BDWI6WET7AATI5ADB7OA7TDJ7","bundle":"https://pith.science/pith/6BDWI6WET7AATI5ADB7OA7TDJ7/bundle.json","state":"https://pith.science/pith/6BDWI6WET7AATI5ADB7OA7TDJ7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6BDWI6WET7AATI5ADB7OA7TDJ7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:6BDWI6WET7AATI5ADB7OA7TDJ7","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":"87f876989cbf3abcbe7be32afda83803f4c2816c8dff1b4b9293a933c6788caa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-01-03T16:00:26Z","title_canon_sha256":"50ecc82753c8367069ffbbd55f4556f25a3cbd4357579329f9e09996a9e547e5"},"schema_version":"1.0","source":{"id":"1801.01059","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.01059","created_at":"2026-05-18T00:26:47Z"},{"alias_kind":"arxiv_version","alias_value":"1801.01059v1","created_at":"2026-05-18T00:26:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.01059","created_at":"2026-05-18T00:26:47Z"},{"alias_kind":"pith_short_12","alias_value":"6BDWI6WET7AA","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6BDWI6WET7AATI5A","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6BDWI6WE","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:aeaf1c80596b75140cc956e021f312d1d960d7dc0e1edf79df89dc98836005cb","target":"graph","created_at":"2026-05-18T00:26:47Z","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":"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","authors_text":"Bart{\\l}omiej Dudek, Pawe{\\l} Gawrychowski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-01-03T16:00:26Z","title":"Slowing Down Top Trees for Better Worst-Case Bounds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.01059","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:9e2cd1de14b0b85b3c8d1b5cb53b32718711434b482c7b422c57bb7a6e0cc255","target":"record","created_at":"2026-05-18T00:26:47Z","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":"87f876989cbf3abcbe7be32afda83803f4c2816c8dff1b4b9293a933c6788caa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-01-03T16:00:26Z","title_canon_sha256":"50ecc82753c8367069ffbbd55f4556f25a3cbd4357579329f9e09996a9e547e5"},"schema_version":"1.0","source":{"id":"1801.01059","kind":"arxiv","version":1}},"canonical_sha256":"f047647ac49fc009a3a0187ee07e634fe3c905d0612114297bcb327a082061e3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f047647ac49fc009a3a0187ee07e634fe3c905d0612114297bcb327a082061e3","first_computed_at":"2026-05-18T00:26:47.943357Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:47.943357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z++SaMNniQMYwxNNNaOieO8BSJZEkFpnF6ByC7hI2ssyqvgY8Ykj0SKrrJtOv6rFRNn3AHGdC3HsCoHNrDtYBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:47.943966Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.01059","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9e2cd1de14b0b85b3c8d1b5cb53b32718711434b482c7b422c57bb7a6e0cc255","sha256:aeaf1c80596b75140cc956e021f312d1d960d7dc0e1edf79df89dc98836005cb"],"state_sha256":"b781b9375e57aa18eb336c6feefb93a4d506a4b2c4fd9fba1acc6b24f4a117c6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CIvIj/4aS3MOhAnGUCrFIGcHKblE7Exj2k7jVKQXTuiYv3QU/AWE1X/3VlFInSwJTwMkfSRm5W6UYsURRfXQAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T22:35:23.455975Z","bundle_sha256":"516afdb34ce8f7c26bf0a863005b1ef78c007a146bd707d4fc2626829e4fab5f"}}