{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:YGKA2BTR6WCX4VBU6IE6PF4ZRC","short_pith_number":"pith:YGKA2BTR","canonical_record":{"source":{"id":"1403.4861","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-19T15:57:24Z","cross_cats_sorted":[],"title_canon_sha256":"9d87a904e1d8add8622fe3e90837bb948d78e1e8a233141df11998a436736465","abstract_canon_sha256":"05b2260ec05edc4b66d0541d77ddaca7138697f8dc2a467f2839a2d30682a5a5"},"schema_version":"1.0"},"canonical_sha256":"c1940d0671f5857e5434f209e7979988a7304085fddd1ca3048572b7aa6be7d6","source":{"kind":"arxiv","id":"1403.4861","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.4861","created_at":"2026-05-18T00:06:21Z"},{"alias_kind":"arxiv_version","alias_value":"1403.4861v2","created_at":"2026-05-18T00:06:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.4861","created_at":"2026-05-18T00:06:21Z"},{"alias_kind":"pith_short_12","alias_value":"YGKA2BTR6WCX","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YGKA2BTR6WCX4VBU","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YGKA2BTR","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:YGKA2BTR6WCX4VBU6IE6PF4ZRC","target":"record","payload":{"canonical_record":{"source":{"id":"1403.4861","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-19T15:57:24Z","cross_cats_sorted":[],"title_canon_sha256":"9d87a904e1d8add8622fe3e90837bb948d78e1e8a233141df11998a436736465","abstract_canon_sha256":"05b2260ec05edc4b66d0541d77ddaca7138697f8dc2a467f2839a2d30682a5a5"},"schema_version":"1.0"},"canonical_sha256":"c1940d0671f5857e5434f209e7979988a7304085fddd1ca3048572b7aa6be7d6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:21.168961Z","signature_b64":"0PkQhhq/QLrzlvfXvLNBtYESJ8azU9TtxlD+QgrWTmnID1sv3/OHtZ79W9zXJnN499oxEIWaAKw1HLQlxsv9DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1940d0671f5857e5434f209e7979988a7304085fddd1ca3048572b7aa6be7d6","last_reissued_at":"2026-05-18T00:06:21.168382Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:21.168382Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.4861","source_version":2,"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:06:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"erfE19gZQTPvrLgYE220AmGM16A93v7RMMvumakbYLlOg8T/tqD95mzMdKys2e0V8iAa1Wp9RMlJjonw0Y4VCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:33:16.188528Z"},"content_sha256":"5c5d032648a68495111040521ea59e820c129a432acbda63529ef0b59dfe3ce3","schema_version":"1.0","event_id":"sha256:5c5d032648a68495111040521ea59e820c129a432acbda63529ef0b59dfe3ce3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:YGKA2BTR6WCX4VBU6IE6PF4ZRC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Approximation Algorithms for Box Contact Representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexander Wolff, Joachim Spoerhase, Martin Fink, Michael A. Bekos, Philipp Kindermann, Sergey Pupyrev, Stephen Kobourov, Thomas C. van Dijk","submitted_at":"2014-03-19T15:57:24Z","abstract_excerpt":"We study the following geometric representation problem: Given a graph whose vertices correspond to axis-aligned rectangles with fixed dimensions, arrange the rectangles without overlaps in the plane such that two rectangles touch if the graph contains an edge between them. This problem is called \\textsc{Contact Representation of Word Networks} (\\textsc{Crown}) since it formalizes the geometric problem behind drawing word clouds in which semantically related words are close to each other. \\textsc{Crown} is known to be NP-hard, and there are approximation algorithms for certain graph classes fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.4861","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"},"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:06:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"11l+Uncj3KkWiWswzLEsxwEi1+kKsA1xcbCi3+P1mnlk5tq+kiR1QtLwO/1PyVagFAvgWiaDURo5Eh9A/n0yCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:33:16.188881Z"},"content_sha256":"4ef0faa352c741159d3a7b92de9a136ea303d6165e268f785e7bfd050c566c23","schema_version":"1.0","event_id":"sha256:4ef0faa352c741159d3a7b92de9a136ea303d6165e268f785e7bfd050c566c23"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YGKA2BTR6WCX4VBU6IE6PF4ZRC/bundle.json","state_url":"https://pith.science/pith/YGKA2BTR6WCX4VBU6IE6PF4ZRC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YGKA2BTR6WCX4VBU6IE6PF4ZRC/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-28T04:33:16Z","links":{"resolver":"https://pith.science/pith/YGKA2BTR6WCX4VBU6IE6PF4ZRC","bundle":"https://pith.science/pith/YGKA2BTR6WCX4VBU6IE6PF4ZRC/bundle.json","state":"https://pith.science/pith/YGKA2BTR6WCX4VBU6IE6PF4ZRC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YGKA2BTR6WCX4VBU6IE6PF4ZRC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:YGKA2BTR6WCX4VBU6IE6PF4ZRC","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":"05b2260ec05edc4b66d0541d77ddaca7138697f8dc2a467f2839a2d30682a5a5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-19T15:57:24Z","title_canon_sha256":"9d87a904e1d8add8622fe3e90837bb948d78e1e8a233141df11998a436736465"},"schema_version":"1.0","source":{"id":"1403.4861","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.4861","created_at":"2026-05-18T00:06:21Z"},{"alias_kind":"arxiv_version","alias_value":"1403.4861v2","created_at":"2026-05-18T00:06:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.4861","created_at":"2026-05-18T00:06:21Z"},{"alias_kind":"pith_short_12","alias_value":"YGKA2BTR6WCX","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YGKA2BTR6WCX4VBU","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YGKA2BTR","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:4ef0faa352c741159d3a7b92de9a136ea303d6165e268f785e7bfd050c566c23","target":"graph","created_at":"2026-05-18T00:06:21Z","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 study the following geometric representation problem: Given a graph whose vertices correspond to axis-aligned rectangles with fixed dimensions, arrange the rectangles without overlaps in the plane such that two rectangles touch if the graph contains an edge between them. This problem is called \\textsc{Contact Representation of Word Networks} (\\textsc{Crown}) since it formalizes the geometric problem behind drawing word clouds in which semantically related words are close to each other. \\textsc{Crown} is known to be NP-hard, and there are approximation algorithms for certain graph classes fo","authors_text":"Alexander Wolff, Joachim Spoerhase, Martin Fink, Michael A. Bekos, Philipp Kindermann, Sergey Pupyrev, Stephen Kobourov, Thomas C. van Dijk","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-19T15:57:24Z","title":"Improved Approximation Algorithms for Box Contact Representations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.4861","kind":"arxiv","version":2},"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:5c5d032648a68495111040521ea59e820c129a432acbda63529ef0b59dfe3ce3","target":"record","created_at":"2026-05-18T00:06:21Z","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":"05b2260ec05edc4b66d0541d77ddaca7138697f8dc2a467f2839a2d30682a5a5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-19T15:57:24Z","title_canon_sha256":"9d87a904e1d8add8622fe3e90837bb948d78e1e8a233141df11998a436736465"},"schema_version":"1.0","source":{"id":"1403.4861","kind":"arxiv","version":2}},"canonical_sha256":"c1940d0671f5857e5434f209e7979988a7304085fddd1ca3048572b7aa6be7d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c1940d0671f5857e5434f209e7979988a7304085fddd1ca3048572b7aa6be7d6","first_computed_at":"2026-05-18T00:06:21.168382Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:21.168382Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0PkQhhq/QLrzlvfXvLNBtYESJ8azU9TtxlD+QgrWTmnID1sv3/OHtZ79W9zXJnN499oxEIWaAKw1HLQlxsv9DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:21.168961Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.4861","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5c5d032648a68495111040521ea59e820c129a432acbda63529ef0b59dfe3ce3","sha256:4ef0faa352c741159d3a7b92de9a136ea303d6165e268f785e7bfd050c566c23"],"state_sha256":"7ca0a92be7cb540b704ddeea7e921d18c51baa60f4c5d4f2f80b975aac04a800"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bDbHVNBNnb670Kwz63lUawIzOG/SsfSgVDo2CXtuXX84j6a+eqIWN+Gxby7+U9R8OhZ/8S1zpYvQZMk9LVJhAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T04:33:16.190875Z","bundle_sha256":"906bb9bc7210d70836c3525cb9cd89df306236111feaec42beb5bcc3864dbf2d"}}