{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:OUSCJO7DCBCJJWEQZBVVAFRRA2","short_pith_number":"pith:OUSCJO7D","schema_version":"1.0","canonical_sha256":"752424bbe3104494d890c86b50163106825d71763d905f7270cfd8e7d987cf33","source":{"kind":"arxiv","id":"1908.07291","version":2},"attestation_state":"computed","paper":{"title":"Computing Stable Demers Cartograms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Jaakko Peltonen, Markus Chimani, Martin N\\\"ollenburg, Max Sondag, Soeren Nickel, Stephen Kobourov, Wouter Meulemans","submitted_at":"2019-08-20T12:04:26Z","abstract_excerpt":"Cartograms are popular for visualizing numerical data for map regions. Maintaining correct adjacencies is a primary quality criterion for cartograms. When there are multiple data values per region (over time or different datasets) shown as animated or juxtaposed cartograms, preserving the viewer's mental-map in terms of stability between cartograms is another important criterion. We present a method to compute stable Demers cartograms, where each region is shown as a square and similar data yield similar cartograms. We enforce orthogonal separation constraints with linear programming, and meas"},"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":"1908.07291","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-08-20T12:04:26Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"d7acd3fe1f1efb2dfcb1870298398c4022ce5bf24984fb64336955e183a664fe","abstract_canon_sha256":"ef11376a81f8c99a0fe2baa7c7b0d8a80709b14c01a5335f10b23781bc6d1e4d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:58:58.781895Z","signature_b64":"u5Z+FGVd7QzBuhHGqK1+k34mv/U9ehaEF48ovHV2MT3kDSUVM9njHcU8K5Pw3zrBtp6UmlQQ0faOoALOGqzXAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"752424bbe3104494d890c86b50163106825d71763d905f7270cfd8e7d987cf33","last_reissued_at":"2026-07-04T23:58:58.781415Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:58:58.781415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing Stable Demers Cartograms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Jaakko Peltonen, Markus Chimani, Martin N\\\"ollenburg, Max Sondag, Soeren Nickel, Stephen Kobourov, Wouter Meulemans","submitted_at":"2019-08-20T12:04:26Z","abstract_excerpt":"Cartograms are popular for visualizing numerical data for map regions. Maintaining correct adjacencies is a primary quality criterion for cartograms. When there are multiple data values per region (over time or different datasets) shown as animated or juxtaposed cartograms, preserving the viewer's mental-map in terms of stability between cartograms is another important criterion. We present a method to compute stable Demers cartograms, where each region is shown as a square and similar data yield similar cartograms. We enforce orthogonal separation constraints with linear programming, and meas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.07291","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.07291/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1908.07291","created_at":"2026-07-04T23:58:58.781473+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.07291v2","created_at":"2026-07-04T23:58:58.781473+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.07291","created_at":"2026-07-04T23:58:58.781473+00:00"},{"alias_kind":"pith_short_12","alias_value":"OUSCJO7DCBCJ","created_at":"2026-07-04T23:58:58.781473+00:00"},{"alias_kind":"pith_short_16","alias_value":"OUSCJO7DCBCJJWEQ","created_at":"2026-07-04T23:58:58.781473+00:00"},{"alias_kind":"pith_short_8","alias_value":"OUSCJO7D","created_at":"2026-07-04T23:58:58.781473+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/OUSCJO7DCBCJJWEQZBVVAFRRA2","json":"https://pith.science/pith/OUSCJO7DCBCJJWEQZBVVAFRRA2.json","graph_json":"https://pith.science/api/pith-number/OUSCJO7DCBCJJWEQZBVVAFRRA2/graph.json","events_json":"https://pith.science/api/pith-number/OUSCJO7DCBCJJWEQZBVVAFRRA2/events.json","paper":"https://pith.science/paper/OUSCJO7D"},"agent_actions":{"view_html":"https://pith.science/pith/OUSCJO7DCBCJJWEQZBVVAFRRA2","download_json":"https://pith.science/pith/OUSCJO7DCBCJJWEQZBVVAFRRA2.json","view_paper":"https://pith.science/paper/OUSCJO7D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.07291&json=true","fetch_graph":"https://pith.science/api/pith-number/OUSCJO7DCBCJJWEQZBVVAFRRA2/graph.json","fetch_events":"https://pith.science/api/pith-number/OUSCJO7DCBCJJWEQZBVVAFRRA2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OUSCJO7DCBCJJWEQZBVVAFRRA2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OUSCJO7DCBCJJWEQZBVVAFRRA2/action/storage_attestation","attest_author":"https://pith.science/pith/OUSCJO7DCBCJJWEQZBVVAFRRA2/action/author_attestation","sign_citation":"https://pith.science/pith/OUSCJO7DCBCJJWEQZBVVAFRRA2/action/citation_signature","submit_replication":"https://pith.science/pith/OUSCJO7DCBCJJWEQZBVVAFRRA2/action/replication_record"}},"created_at":"2026-07-04T23:58:58.781473+00:00","updated_at":"2026-07-04T23:58:58.781473+00:00"}