{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:KADW3PEDYFPZRLEYJZFSNQAU6B","short_pith_number":"pith:KADW3PED","canonical_record":{"source":{"id":"1311.4778","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-11-19T15:21:29Z","cross_cats_sorted":[],"title_canon_sha256":"6c4635c73e091d3bd3078bb2f71be7a012117faf017bea0841d525a249734c0f","abstract_canon_sha256":"ad0556700e17bda46207834bbd2df2f4d88d9dffea0afccb4d61e338394e1cd5"},"schema_version":"1.0"},"canonical_sha256":"50076dbc83c15f98ac984e4b26c014f055bd4f579e952cf7396ed1eed962af77","source":{"kind":"arxiv","id":"1311.4778","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.4778","created_at":"2026-05-18T03:06:43Z"},{"alias_kind":"arxiv_version","alias_value":"1311.4778v1","created_at":"2026-05-18T03:06:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4778","created_at":"2026-05-18T03:06:43Z"},{"alias_kind":"pith_short_12","alias_value":"KADW3PEDYFPZ","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"KADW3PEDYFPZRLEY","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"KADW3PED","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:KADW3PEDYFPZRLEYJZFSNQAU6B","target":"record","payload":{"canonical_record":{"source":{"id":"1311.4778","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-11-19T15:21:29Z","cross_cats_sorted":[],"title_canon_sha256":"6c4635c73e091d3bd3078bb2f71be7a012117faf017bea0841d525a249734c0f","abstract_canon_sha256":"ad0556700e17bda46207834bbd2df2f4d88d9dffea0afccb4d61e338394e1cd5"},"schema_version":"1.0"},"canonical_sha256":"50076dbc83c15f98ac984e4b26c014f055bd4f579e952cf7396ed1eed962af77","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:43.514327Z","signature_b64":"mmF3IOpLfFw8K5VXV+nlwV23914XgSWHXHr6576L7KarWT0f9ZlT180QJpLVXpJmwVP5Nk4yBnOBMUCvmhJZCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50076dbc83c15f98ac984e4b26c014f055bd4f579e952cf7396ed1eed962af77","last_reissued_at":"2026-05-18T03:06:43.513764Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:43.513764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.4778","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-18T03:06:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xs4UjL9arNaGK2/4+M2ZXfb3Y1+iMni+vnH1BWre7FAtjPCH4c7K8Dj/QwwaKm4KzHeclyx5I+6+ZxFfw89OCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:58:44.448042Z"},"content_sha256":"f0ddc78af48443706767d4ceee1adb3746b49f2710ec6f44f3adf673ede88ff0","schema_version":"1.0","event_id":"sha256:f0ddc78af48443706767d4ceee1adb3746b49f2710ec6f44f3adf673ede88ff0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:KADW3PEDYFPZRLEYJZFSNQAU6B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Semantic Word Cloud Representations: Hardness and Approximation Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alexander Wolff, Anna Lubiw, Claudio Squarcella, Lukas Barth, Martin N\\\"ollenburg, Sara Irina Fabrikant, Sergey Pupyrev, Stephen Kobourov, Torsten Ueckerdt, Yoshio Okamoto","submitted_at":"2013-11-19T15:21:29Z","abstract_excerpt":"We study a geometric representation problem, where we are given a set $\\cal R$ of axis-aligned rectangles with fixed dimensions and a graph with vertex set $\\cal R$. The task is to place the rectangles without overlap such that two rectangles touch if and only if the graph contains an edge between them. We call this problem Contact Representation of Word Networks (CROWN). It formalizes the geometric problem behind drawing word clouds in which semantically related words are close to each other. Here, we represent words by rectangles and semantic relationships by edges. We show that CROWN is str"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.4778","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-18T03:06:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s5pPLPG7A0IlgTpznf/zB2AVrhxXiQHgywEF3ZOd8GqwxMLjlNQ6zRxwGADBRsBHJeBkOEYIxvx1CBE9gr7bCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:58:44.448708Z"},"content_sha256":"f5a440de9ac4c09a70b98e02deade2b0afdd946f8b3012873cdf3ea3c22f3311","schema_version":"1.0","event_id":"sha256:f5a440de9ac4c09a70b98e02deade2b0afdd946f8b3012873cdf3ea3c22f3311"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KADW3PEDYFPZRLEYJZFSNQAU6B/bundle.json","state_url":"https://pith.science/pith/KADW3PEDYFPZRLEYJZFSNQAU6B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KADW3PEDYFPZRLEYJZFSNQAU6B/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-27T22:58:44Z","links":{"resolver":"https://pith.science/pith/KADW3PEDYFPZRLEYJZFSNQAU6B","bundle":"https://pith.science/pith/KADW3PEDYFPZRLEYJZFSNQAU6B/bundle.json","state":"https://pith.science/pith/KADW3PEDYFPZRLEYJZFSNQAU6B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KADW3PEDYFPZRLEYJZFSNQAU6B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:KADW3PEDYFPZRLEYJZFSNQAU6B","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":"ad0556700e17bda46207834bbd2df2f4d88d9dffea0afccb4d61e338394e1cd5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-11-19T15:21:29Z","title_canon_sha256":"6c4635c73e091d3bd3078bb2f71be7a012117faf017bea0841d525a249734c0f"},"schema_version":"1.0","source":{"id":"1311.4778","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.4778","created_at":"2026-05-18T03:06:43Z"},{"alias_kind":"arxiv_version","alias_value":"1311.4778v1","created_at":"2026-05-18T03:06:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4778","created_at":"2026-05-18T03:06:43Z"},{"alias_kind":"pith_short_12","alias_value":"KADW3PEDYFPZ","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"KADW3PEDYFPZRLEY","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"KADW3PED","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:f5a440de9ac4c09a70b98e02deade2b0afdd946f8b3012873cdf3ea3c22f3311","target":"graph","created_at":"2026-05-18T03:06:43Z","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 a geometric representation problem, where we are given a set $\\cal R$ of axis-aligned rectangles with fixed dimensions and a graph with vertex set $\\cal R$. The task is to place the rectangles without overlap such that two rectangles touch if and only if the graph contains an edge between them. We call this problem Contact Representation of Word Networks (CROWN). It formalizes the geometric problem behind drawing word clouds in which semantically related words are close to each other. Here, we represent words by rectangles and semantic relationships by edges. We show that CROWN is str","authors_text":"Alexander Wolff, Anna Lubiw, Claudio Squarcella, Lukas Barth, Martin N\\\"ollenburg, Sara Irina Fabrikant, Sergey Pupyrev, Stephen Kobourov, Torsten Ueckerdt, Yoshio Okamoto","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-11-19T15:21:29Z","title":"Semantic Word Cloud Representations: Hardness and Approximation Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.4778","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:f0ddc78af48443706767d4ceee1adb3746b49f2710ec6f44f3adf673ede88ff0","target":"record","created_at":"2026-05-18T03:06:43Z","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":"ad0556700e17bda46207834bbd2df2f4d88d9dffea0afccb4d61e338394e1cd5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-11-19T15:21:29Z","title_canon_sha256":"6c4635c73e091d3bd3078bb2f71be7a012117faf017bea0841d525a249734c0f"},"schema_version":"1.0","source":{"id":"1311.4778","kind":"arxiv","version":1}},"canonical_sha256":"50076dbc83c15f98ac984e4b26c014f055bd4f579e952cf7396ed1eed962af77","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"50076dbc83c15f98ac984e4b26c014f055bd4f579e952cf7396ed1eed962af77","first_computed_at":"2026-05-18T03:06:43.513764Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:06:43.513764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mmF3IOpLfFw8K5VXV+nlwV23914XgSWHXHr6576L7KarWT0f9ZlT180QJpLVXpJmwVP5Nk4yBnOBMUCvmhJZCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:06:43.514327Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.4778","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f0ddc78af48443706767d4ceee1adb3746b49f2710ec6f44f3adf673ede88ff0","sha256:f5a440de9ac4c09a70b98e02deade2b0afdd946f8b3012873cdf3ea3c22f3311"],"state_sha256":"9af28f8ecdcd64e068931ef1d9c8f329458084771d183991e7ad4c38dd4b9179"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+Mn2va9gJvh9U+eXcqWZRfFaLO7R5WR2xRdtl5ds1qjVdItyR0goZski1NWCdP5oT62wGrZwEo72fr0u1/6bAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T22:58:44.452243Z","bundle_sha256":"f8897904a03352ca486abe334d872d88c125499db7cd305b5bfa1e74f3d9e0f6"}}