{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:K5OKMMXUTGWLI6WKRBZFYWVGYP","short_pith_number":"pith:K5OKMMXU","canonical_record":{"source":{"id":"1811.00785","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-11-02T09:05:43Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"152f8e9699cee73f47167368ec941a1f7f1f62ef735e014368e5eff4a4da7a1a","abstract_canon_sha256":"b21274c60070fc266d145e0e75ebf6d47288071f8f18456af62ca9b685411266"},"schema_version":"1.0"},"canonical_sha256":"575ca632f499acb47aca88725c5aa6c3db6ddab480efbbafff6e5b92b17990f6","source":{"kind":"arxiv","id":"1811.00785","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.00785","created_at":"2026-05-18T00:01:42Z"},{"alias_kind":"arxiv_version","alias_value":"1811.00785v1","created_at":"2026-05-18T00:01:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.00785","created_at":"2026-05-18T00:01:42Z"},{"alias_kind":"pith_short_12","alias_value":"K5OKMMXUTGWL","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"K5OKMMXUTGWLI6WK","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"K5OKMMXU","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:K5OKMMXUTGWLI6WKRBZFYWVGYP","target":"record","payload":{"canonical_record":{"source":{"id":"1811.00785","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-11-02T09:05:43Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"152f8e9699cee73f47167368ec941a1f7f1f62ef735e014368e5eff4a4da7a1a","abstract_canon_sha256":"b21274c60070fc266d145e0e75ebf6d47288071f8f18456af62ca9b685411266"},"schema_version":"1.0"},"canonical_sha256":"575ca632f499acb47aca88725c5aa6c3db6ddab480efbbafff6e5b92b17990f6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:42.157330Z","signature_b64":"c4LhS9wewYMnu/33izrfZLeDWgaWxU27XlKTZa5s451Qj72chxV3SbUoslQIszbVkPucK4hJwyG4oUfZ8aJ8AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"575ca632f499acb47aca88725c5aa6c3db6ddab480efbbafff6e5b92b17990f6","last_reissued_at":"2026-05-18T00:01:42.156693Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:42.156693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.00785","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-18T00:01:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UmMx/CojLvwRH+Kn3H5qHSyvsIzQ1pYbvGI9DjiCenxDvkdSWfSyOcM9S/muQuwg7fl7EwAKk9PVSRTa/nQhDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T10:32:32.980874Z"},"content_sha256":"fd13281a1a0ee5ec3cea5f56863fbd88964bedc528a2bde4d37eddfcb4ba6fa4","schema_version":"1.0","event_id":"sha256:fd13281a1a0ee5ec3cea5f56863fbd88964bedc528a2bde4d37eddfcb4ba6fa4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:K5OKMMXUTGWLI6WKRBZFYWVGYP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Drawing Clustered Graphs on Disk Arrangements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Ignaz Rutter, Marcel Radermacher, Nina Zimbel, Tamara Mchedlidze","submitted_at":"2018-11-02T09:05:43Z","abstract_excerpt":"Let $G=(V, E)$ be a planar graph and let $\\mathcal{C}$ be a partition of $V$. We refer to the graphs induced by the vertex sets in $\\mathcal{C}$ as Clusters. Let $D_{\\mathcal C}$ be an arrangement of disks with a bijection between the disks and the clusters. Akitaya et al. give an algorithm to test whether $(G, \\mathcal{C})$ can be embedded onto $D_{\\mathcal C}$ with the additional constraint that edges are routed through a set of pipes between the disks. Based on such an embedding, we prove that every clustered graph and every disk arrangement without pipe-disk intersections has a planar stra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.00785","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-18T00:01:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kjoOjXiRy1sJVlysfZvcgaGZwEPlXeg1wJELtUW0RsY7MplDw50V8kWinuBk9S/ZV4/eYSyKtFLMtxh3t3+5Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T10:32:32.981212Z"},"content_sha256":"adba693e461c33f0e89bc2f7f40004ccfefcf75217252fe93c4505f7f6ab2a0b","schema_version":"1.0","event_id":"sha256:adba693e461c33f0e89bc2f7f40004ccfefcf75217252fe93c4505f7f6ab2a0b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K5OKMMXUTGWLI6WKRBZFYWVGYP/bundle.json","state_url":"https://pith.science/pith/K5OKMMXUTGWLI6WKRBZFYWVGYP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K5OKMMXUTGWLI6WKRBZFYWVGYP/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-06-24T10:32:32Z","links":{"resolver":"https://pith.science/pith/K5OKMMXUTGWLI6WKRBZFYWVGYP","bundle":"https://pith.science/pith/K5OKMMXUTGWLI6WKRBZFYWVGYP/bundle.json","state":"https://pith.science/pith/K5OKMMXUTGWLI6WKRBZFYWVGYP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K5OKMMXUTGWLI6WKRBZFYWVGYP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:K5OKMMXUTGWLI6WKRBZFYWVGYP","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":"b21274c60070fc266d145e0e75ebf6d47288071f8f18456af62ca9b685411266","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-11-02T09:05:43Z","title_canon_sha256":"152f8e9699cee73f47167368ec941a1f7f1f62ef735e014368e5eff4a4da7a1a"},"schema_version":"1.0","source":{"id":"1811.00785","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.00785","created_at":"2026-05-18T00:01:42Z"},{"alias_kind":"arxiv_version","alias_value":"1811.00785v1","created_at":"2026-05-18T00:01:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.00785","created_at":"2026-05-18T00:01:42Z"},{"alias_kind":"pith_short_12","alias_value":"K5OKMMXUTGWL","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"K5OKMMXUTGWLI6WK","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"K5OKMMXU","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:adba693e461c33f0e89bc2f7f40004ccfefcf75217252fe93c4505f7f6ab2a0b","target":"graph","created_at":"2026-05-18T00:01:42Z","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":"Let $G=(V, E)$ be a planar graph and let $\\mathcal{C}$ be a partition of $V$. We refer to the graphs induced by the vertex sets in $\\mathcal{C}$ as Clusters. Let $D_{\\mathcal C}$ be an arrangement of disks with a bijection between the disks and the clusters. Akitaya et al. give an algorithm to test whether $(G, \\mathcal{C})$ can be embedded onto $D_{\\mathcal C}$ with the additional constraint that edges are routed through a set of pipes between the disks. Based on such an embedding, we prove that every clustered graph and every disk arrangement without pipe-disk intersections has a planar stra","authors_text":"Ignaz Rutter, Marcel Radermacher, Nina Zimbel, Tamara Mchedlidze","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-11-02T09:05:43Z","title":"Drawing Clustered Graphs on Disk Arrangements"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.00785","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:fd13281a1a0ee5ec3cea5f56863fbd88964bedc528a2bde4d37eddfcb4ba6fa4","target":"record","created_at":"2026-05-18T00:01:42Z","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":"b21274c60070fc266d145e0e75ebf6d47288071f8f18456af62ca9b685411266","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-11-02T09:05:43Z","title_canon_sha256":"152f8e9699cee73f47167368ec941a1f7f1f62ef735e014368e5eff4a4da7a1a"},"schema_version":"1.0","source":{"id":"1811.00785","kind":"arxiv","version":1}},"canonical_sha256":"575ca632f499acb47aca88725c5aa6c3db6ddab480efbbafff6e5b92b17990f6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"575ca632f499acb47aca88725c5aa6c3db6ddab480efbbafff6e5b92b17990f6","first_computed_at":"2026-05-18T00:01:42.156693Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:42.156693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c4LhS9wewYMnu/33izrfZLeDWgaWxU27XlKTZa5s451Qj72chxV3SbUoslQIszbVkPucK4hJwyG4oUfZ8aJ8AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:42.157330Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.00785","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fd13281a1a0ee5ec3cea5f56863fbd88964bedc528a2bde4d37eddfcb4ba6fa4","sha256:adba693e461c33f0e89bc2f7f40004ccfefcf75217252fe93c4505f7f6ab2a0b"],"state_sha256":"31f94b708748eb195b69d6c9a40fcd85bd214f3e9fc1710b3a4418cb549a145d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JOdX9Krq7T+rIPD6rbm8G8/sxJjQeqXNBkT5tnk09RAtnmMvz7W6tDxYXPqYfo+RWkpxjd74m/Q3CbCW9ierAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T10:32:32.983280Z","bundle_sha256":"938c628cb28d6639985b51f5f09a1881e9e5fc34a92b0c8dc13e39eaa8c4a2ee"}}