{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:UNLJRKSIKW6D3XDVWQORSZMOZ2","short_pith_number":"pith:UNLJRKSI","schema_version":"1.0","canonical_sha256":"a35698aa4855bc3ddc75b41d19658ece92265275ddf3d3585db67a433ef40711","source":{"kind":"arxiv","id":"1404.5660","version":1},"attestation_state":"computed","paper":{"title":"Fast Algorithms for Constructing Maximum Entropy Summary Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Howard Karloff, Richard Cole","submitted_at":"2014-04-22T21:58:17Z","abstract_excerpt":"Karloff? and Shirley recently proposed summary trees as a new way to visualize large rooted trees (Eurovis 2013) and gave algorithms for generating a maximum-entropy k-node summary tree of an input n-node rooted tree. However, the algorithm generating optimal summary trees was only pseudo-polynomial (and worked only for integral weights); the authors left open existence of a olynomial-time algorithm. In addition, the authors provided an additive approximation algorithm and a greedy heuristic, both working on real weights. This paper shows how to construct maximum entropy k-node summary trees i"},"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":"1404.5660","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-22T21:58:17Z","cross_cats_sorted":[],"title_canon_sha256":"c877f125d8b7539b8f0ffdfbd16603c5b7fa984dabcf175f621dea69d1a9086b","abstract_canon_sha256":"a0231c539b8816958e316171d49fe8d8c492dcc02392caef63fd6c24dad5eb20"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:28.234961Z","signature_b64":"Us7Rt7yln/lj3E7VaTZqhncedX4g5qYDihRw9TNPMlEHvTflDWZuz9NcVMuy3pRLqQ9YQNEQ687D5pjL1VoMAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a35698aa4855bc3ddc75b41d19658ece92265275ddf3d3585db67a433ef40711","last_reissued_at":"2026-05-18T02:53:28.234389Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:28.234389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Algorithms for Constructing Maximum Entropy Summary Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Howard Karloff, Richard Cole","submitted_at":"2014-04-22T21:58:17Z","abstract_excerpt":"Karloff? and Shirley recently proposed summary trees as a new way to visualize large rooted trees (Eurovis 2013) and gave algorithms for generating a maximum-entropy k-node summary tree of an input n-node rooted tree. However, the algorithm generating optimal summary trees was only pseudo-polynomial (and worked only for integral weights); the authors left open existence of a olynomial-time algorithm. In addition, the authors provided an additive approximation algorithm and a greedy heuristic, both working on real weights. This paper shows how to construct maximum entropy k-node summary trees i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5660","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":"1404.5660","created_at":"2026-05-18T02:53:28.234489+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.5660v1","created_at":"2026-05-18T02:53:28.234489+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5660","created_at":"2026-05-18T02:53:28.234489+00:00"},{"alias_kind":"pith_short_12","alias_value":"UNLJRKSIKW6D","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"UNLJRKSIKW6D3XDV","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"UNLJRKSI","created_at":"2026-05-18T12:28:52.271510+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/UNLJRKSIKW6D3XDVWQORSZMOZ2","json":"https://pith.science/pith/UNLJRKSIKW6D3XDVWQORSZMOZ2.json","graph_json":"https://pith.science/api/pith-number/UNLJRKSIKW6D3XDVWQORSZMOZ2/graph.json","events_json":"https://pith.science/api/pith-number/UNLJRKSIKW6D3XDVWQORSZMOZ2/events.json","paper":"https://pith.science/paper/UNLJRKSI"},"agent_actions":{"view_html":"https://pith.science/pith/UNLJRKSIKW6D3XDVWQORSZMOZ2","download_json":"https://pith.science/pith/UNLJRKSIKW6D3XDVWQORSZMOZ2.json","view_paper":"https://pith.science/paper/UNLJRKSI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.5660&json=true","fetch_graph":"https://pith.science/api/pith-number/UNLJRKSIKW6D3XDVWQORSZMOZ2/graph.json","fetch_events":"https://pith.science/api/pith-number/UNLJRKSIKW6D3XDVWQORSZMOZ2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UNLJRKSIKW6D3XDVWQORSZMOZ2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UNLJRKSIKW6D3XDVWQORSZMOZ2/action/storage_attestation","attest_author":"https://pith.science/pith/UNLJRKSIKW6D3XDVWQORSZMOZ2/action/author_attestation","sign_citation":"https://pith.science/pith/UNLJRKSIKW6D3XDVWQORSZMOZ2/action/citation_signature","submit_replication":"https://pith.science/pith/UNLJRKSIKW6D3XDVWQORSZMOZ2/action/replication_record"}},"created_at":"2026-05-18T02:53:28.234489+00:00","updated_at":"2026-05-18T02:53:28.234489+00:00"}