{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:5IHZCIUHCGXLLWCHV67TYO7SEC","short_pith_number":"pith:5IHZCIUH","canonical_record":{"source":{"id":"1201.0066","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-12-30T05:44:30Z","cross_cats_sorted":["cs.CG","cs.DS"],"title_canon_sha256":"3d30d6e78ead69c6fa3e736fccd5846de61ffc3b424bfaa88a091db0a53042db","abstract_canon_sha256":"7d336d63384cc4ceb72b0b437d9281d7aa4244f12ef955dae9799f7037bce0af"},"schema_version":"1.0"},"canonical_sha256":"ea0f91228711aeb5d847afbf3c3bf220a98d7acbb053e91bc18331ae15300802","source":{"kind":"arxiv","id":"1201.0066","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.0066","created_at":"2026-05-18T04:05:16Z"},{"alias_kind":"arxiv_version","alias_value":"1201.0066v1","created_at":"2026-05-18T04:05:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.0066","created_at":"2026-05-18T04:05:16Z"},{"alias_kind":"pith_short_12","alias_value":"5IHZCIUHCGXL","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"5IHZCIUHCGXLLWCH","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"5IHZCIUH","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:5IHZCIUHCGXLLWCHV67TYO7SEC","target":"record","payload":{"canonical_record":{"source":{"id":"1201.0066","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-12-30T05:44:30Z","cross_cats_sorted":["cs.CG","cs.DS"],"title_canon_sha256":"3d30d6e78ead69c6fa3e736fccd5846de61ffc3b424bfaa88a091db0a53042db","abstract_canon_sha256":"7d336d63384cc4ceb72b0b437d9281d7aa4244f12ef955dae9799f7037bce0af"},"schema_version":"1.0"},"canonical_sha256":"ea0f91228711aeb5d847afbf3c3bf220a98d7acbb053e91bc18331ae15300802","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:16.392453Z","signature_b64":"dp1ZSETqJfnUrVIwSFMJpwGckBdYbbmoS6HJZq65W3gyHhR/LlO3+l5TONvSKcWbS56tH1sBE27XwWv+yGeUAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea0f91228711aeb5d847afbf3c3bf220a98d7acbb053e91bc18331ae15300802","last_reissued_at":"2026-05-18T04:05:16.391955Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:16.391955Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.0066","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-18T04:05:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cS7/vEowHXE3ARjC/DCwRAPGz2KjxtaUcpqzl95NfJs9sZnG5XK8oxIuXcSo1ImdPsKNcHXCcMOU2QItHq57AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:53:25.012136Z"},"content_sha256":"f98d9a04256510b8058513a398381e4b0596dee2633166fcacaefb6da20ffe0f","schema_version":"1.0","event_id":"sha256:f98d9a04256510b8058513a398381e4b0596dee2633166fcacaefb6da20ffe0f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:5IHZCIUHCGXLLWCHV67TYO7SEC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing Cartograms with Optimal Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DS"],"primary_cat":"cs.DM","authors_text":"Md. Jawaherul Alam, Michael Kaufmann, Stefan Felsner, Stephen G. Kobourov, Therese Biedl, Torsten Ueckerdt","submitted_at":"2011-12-30T05:44:30Z","abstract_excerpt":"In a rectilinear dual of a planar graph vertices are represented by simple rectilinear polygons and edges are represented by side-contact between the corresponding polygons. A rectilinear dual is called a cartogram if the area of each region is equal to a pre-specified weight of the corresponding vertex. The complexity of a cartogram is determined by the maximum number of corners (or sides) required for any polygon. In a series of papers the polygonal complexity of such representations for maximal planar graphs has been reduced from the initial 40 to 34, then to 12 and very recently to the cur"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.0066","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-18T04:05:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dyurg4qWJrvnYDtfrJVeLbLCGcdqzLo3K1v+IbmIt+P5xOhfDbv4/3elIrjA1WABOCqus/aYijH+X3jBIKF8AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:53:25.012584Z"},"content_sha256":"5d213666e469046c5687713a3bfac090989f1a7f5bb58e6d391975024309535e","schema_version":"1.0","event_id":"sha256:5d213666e469046c5687713a3bfac090989f1a7f5bb58e6d391975024309535e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5IHZCIUHCGXLLWCHV67TYO7SEC/bundle.json","state_url":"https://pith.science/pith/5IHZCIUHCGXLLWCHV67TYO7SEC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5IHZCIUHCGXLLWCHV67TYO7SEC/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-05-27T21:53:25Z","links":{"resolver":"https://pith.science/pith/5IHZCIUHCGXLLWCHV67TYO7SEC","bundle":"https://pith.science/pith/5IHZCIUHCGXLLWCHV67TYO7SEC/bundle.json","state":"https://pith.science/pith/5IHZCIUHCGXLLWCHV67TYO7SEC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5IHZCIUHCGXLLWCHV67TYO7SEC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:5IHZCIUHCGXLLWCHV67TYO7SEC","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":"7d336d63384cc4ceb72b0b437d9281d7aa4244f12ef955dae9799f7037bce0af","cross_cats_sorted":["cs.CG","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-12-30T05:44:30Z","title_canon_sha256":"3d30d6e78ead69c6fa3e736fccd5846de61ffc3b424bfaa88a091db0a53042db"},"schema_version":"1.0","source":{"id":"1201.0066","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.0066","created_at":"2026-05-18T04:05:16Z"},{"alias_kind":"arxiv_version","alias_value":"1201.0066v1","created_at":"2026-05-18T04:05:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.0066","created_at":"2026-05-18T04:05:16Z"},{"alias_kind":"pith_short_12","alias_value":"5IHZCIUHCGXL","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"5IHZCIUHCGXLLWCH","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"5IHZCIUH","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:5d213666e469046c5687713a3bfac090989f1a7f5bb58e6d391975024309535e","target":"graph","created_at":"2026-05-18T04:05:16Z","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":"In a rectilinear dual of a planar graph vertices are represented by simple rectilinear polygons and edges are represented by side-contact between the corresponding polygons. A rectilinear dual is called a cartogram if the area of each region is equal to a pre-specified weight of the corresponding vertex. The complexity of a cartogram is determined by the maximum number of corners (or sides) required for any polygon. In a series of papers the polygonal complexity of such representations for maximal planar graphs has been reduced from the initial 40 to 34, then to 12 and very recently to the cur","authors_text":"Md. Jawaherul Alam, Michael Kaufmann, Stefan Felsner, Stephen G. Kobourov, Therese Biedl, Torsten Ueckerdt","cross_cats":["cs.CG","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-12-30T05:44:30Z","title":"Computing Cartograms with Optimal Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.0066","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:f98d9a04256510b8058513a398381e4b0596dee2633166fcacaefb6da20ffe0f","target":"record","created_at":"2026-05-18T04:05:16Z","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":"7d336d63384cc4ceb72b0b437d9281d7aa4244f12ef955dae9799f7037bce0af","cross_cats_sorted":["cs.CG","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-12-30T05:44:30Z","title_canon_sha256":"3d30d6e78ead69c6fa3e736fccd5846de61ffc3b424bfaa88a091db0a53042db"},"schema_version":"1.0","source":{"id":"1201.0066","kind":"arxiv","version":1}},"canonical_sha256":"ea0f91228711aeb5d847afbf3c3bf220a98d7acbb053e91bc18331ae15300802","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ea0f91228711aeb5d847afbf3c3bf220a98d7acbb053e91bc18331ae15300802","first_computed_at":"2026-05-18T04:05:16.391955Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:05:16.391955Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dp1ZSETqJfnUrVIwSFMJpwGckBdYbbmoS6HJZq65W3gyHhR/LlO3+l5TONvSKcWbS56tH1sBE27XwWv+yGeUAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:05:16.392453Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.0066","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f98d9a04256510b8058513a398381e4b0596dee2633166fcacaefb6da20ffe0f","sha256:5d213666e469046c5687713a3bfac090989f1a7f5bb58e6d391975024309535e"],"state_sha256":"ed744e228027283442d6798b63bba275cb7d3b4f6c660efb10873efaea669dd9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IcO+o89bL1TTViA0TOrndWY+sql4Inj3aet7VI7rZJFMuSYvqLqD6+ET4/hjwhtRPgqLIFeWwV+DgOmUf+/IBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T21:53:25.015429Z","bundle_sha256":"e2c352330bcd615edf867f13d163e4c9818c1b3a6d72d084c20ec70678c84320"}}