{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:HUFG7NJONT2HEWZMLGF2RCAAGY","short_pith_number":"pith:HUFG7NJO","schema_version":"1.0","canonical_sha256":"3d0a6fb52e6cf4725b2c598ba88800362d07cd8516882544b7f723d96361bdcc","source":{"kind":"arxiv","id":"1012.1749","version":2},"attestation_state":"computed","paper":{"title":"Treemaps with Bounded Aspect Ratio","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Bettina Speckmann, Mark de Berg, Vincent van der Weele","submitted_at":"2010-12-08T12:34:48Z","abstract_excerpt":"Treemaps are a popular technique to visualize hierarchical data. The input is a weighted tree $\\tree$ where the weight of each node is the sum of the weights of its children. A treemap for $\\tree$ is a hierarchical partition of a rectangle into simply connected regions, usually rectangles. Each region represents a node of $\\tree$ and its area is proportional to the weight of the corresponding node. An important quality criterion for treemaps is the aspect ratio of its regions. One cannot bound the aspect ratio if the regions are restricted to be rectangles. In contrast, \\emph{polygonal partiti"},"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":"1012.1749","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-12-08T12:34:48Z","cross_cats_sorted":[],"title_canon_sha256":"b9aabc58897305b2b7d4e1564deccbcda7d1f1b176362ae582624610714a7c26","abstract_canon_sha256":"6476705a6a5505a0fb317c027a6df2558d496816585d75de0fe455e2b9917b3d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:07.726235Z","signature_b64":"dEKIYasYB9ZXdg5JPKN1UOAyaCOFG6n9vHukMeZa8wNZvFDvSue5QYQ/VdBCAP3YYfJ/PWz1DCo3u5mdgkKgBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d0a6fb52e6cf4725b2c598ba88800362d07cd8516882544b7f723d96361bdcc","last_reissued_at":"2026-05-18T02:23:07.725493Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:07.725493Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Treemaps with Bounded Aspect Ratio","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Bettina Speckmann, Mark de Berg, Vincent van der Weele","submitted_at":"2010-12-08T12:34:48Z","abstract_excerpt":"Treemaps are a popular technique to visualize hierarchical data. The input is a weighted tree $\\tree$ where the weight of each node is the sum of the weights of its children. A treemap for $\\tree$ is a hierarchical partition of a rectangle into simply connected regions, usually rectangles. Each region represents a node of $\\tree$ and its area is proportional to the weight of the corresponding node. An important quality criterion for treemaps is the aspect ratio of its regions. One cannot bound the aspect ratio if the regions are restricted to be rectangles. In contrast, \\emph{polygonal partiti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.1749","kind":"arxiv","version":2},"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":"1012.1749","created_at":"2026-05-18T02:23:07.725607+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.1749v2","created_at":"2026-05-18T02:23:07.725607+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.1749","created_at":"2026-05-18T02:23:07.725607+00:00"},{"alias_kind":"pith_short_12","alias_value":"HUFG7NJONT2H","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_16","alias_value":"HUFG7NJONT2HEWZM","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_8","alias_value":"HUFG7NJO","created_at":"2026-05-18T12:26:07.630475+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/HUFG7NJONT2HEWZMLGF2RCAAGY","json":"https://pith.science/pith/HUFG7NJONT2HEWZMLGF2RCAAGY.json","graph_json":"https://pith.science/api/pith-number/HUFG7NJONT2HEWZMLGF2RCAAGY/graph.json","events_json":"https://pith.science/api/pith-number/HUFG7NJONT2HEWZMLGF2RCAAGY/events.json","paper":"https://pith.science/paper/HUFG7NJO"},"agent_actions":{"view_html":"https://pith.science/pith/HUFG7NJONT2HEWZMLGF2RCAAGY","download_json":"https://pith.science/pith/HUFG7NJONT2HEWZMLGF2RCAAGY.json","view_paper":"https://pith.science/paper/HUFG7NJO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.1749&json=true","fetch_graph":"https://pith.science/api/pith-number/HUFG7NJONT2HEWZMLGF2RCAAGY/graph.json","fetch_events":"https://pith.science/api/pith-number/HUFG7NJONT2HEWZMLGF2RCAAGY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HUFG7NJONT2HEWZMLGF2RCAAGY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HUFG7NJONT2HEWZMLGF2RCAAGY/action/storage_attestation","attest_author":"https://pith.science/pith/HUFG7NJONT2HEWZMLGF2RCAAGY/action/author_attestation","sign_citation":"https://pith.science/pith/HUFG7NJONT2HEWZMLGF2RCAAGY/action/citation_signature","submit_replication":"https://pith.science/pith/HUFG7NJONT2HEWZMLGF2RCAAGY/action/replication_record"}},"created_at":"2026-05-18T02:23:07.725607+00:00","updated_at":"2026-05-18T02:23:07.725607+00:00"}