{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:NNUKWGU7NZ7WRVWWCW3OHGMYVK","short_pith_number":"pith:NNUKWGU7","canonical_record":{"source":{"id":"1509.05069","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-09-16T21:38:32Z","cross_cats_sorted":[],"title_canon_sha256":"aced92ab1960ec3739c3cecd736dae9d9df531c9ceed88627d1c65c364362317","abstract_canon_sha256":"96b9634589625f6bbd188ea98de501080c322beaaa7ece250d84fe955875f6d2"},"schema_version":"1.0"},"canonical_sha256":"6b68ab1a9f6e7f68d6d615b6e39998aa9eb4b8d3b2f8856339377e44363954c2","source":{"kind":"arxiv","id":"1509.05069","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.05069","created_at":"2026-05-18T01:32:49Z"},{"alias_kind":"arxiv_version","alias_value":"1509.05069v1","created_at":"2026-05-18T01:32:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05069","created_at":"2026-05-18T01:32:49Z"},{"alias_kind":"pith_short_12","alias_value":"NNUKWGU7NZ7W","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"NNUKWGU7NZ7WRVWW","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"NNUKWGU7","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:NNUKWGU7NZ7WRVWWCW3OHGMYVK","target":"record","payload":{"canonical_record":{"source":{"id":"1509.05069","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-09-16T21:38:32Z","cross_cats_sorted":[],"title_canon_sha256":"aced92ab1960ec3739c3cecd736dae9d9df531c9ceed88627d1c65c364362317","abstract_canon_sha256":"96b9634589625f6bbd188ea98de501080c322beaaa7ece250d84fe955875f6d2"},"schema_version":"1.0"},"canonical_sha256":"6b68ab1a9f6e7f68d6d615b6e39998aa9eb4b8d3b2f8856339377e44363954c2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:49.994159Z","signature_b64":"IWSfGHfIBPKhCL9iNNSMbEhvK2J4cFstgM78B3v08ct/+Gr/BHqbz4Urbsd/M0DCCJvVZSRNp9/5D/lop3TnCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b68ab1a9f6e7f68d6d615b6e39998aa9eb4b8d3b2f8856339377e44363954c2","last_reissued_at":"2026-05-18T01:32:49.993516Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:49.993516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.05069","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-18T01:32:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pja3VyWzi5mNbStyEmDwl66OUPzEVBeCC4kyQDbK22sX8DG/MxNUYgo/M/BuzOufLOUeMaQKlTpKI4kuTfveDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T17:40:32.431552Z"},"content_sha256":"5cc7d8d205b55f576d31cd9031a6af71483f0c7b5bff1dc13644c7ae6e1bd63f","schema_version":"1.0","event_id":"sha256:5cc7d8d205b55f576d31cd9031a6af71483f0c7b5bff1dc13644c7ae6e1bd63f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:NNUKWGU7NZ7WRVWWCW3OHGMYVK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Tree Representations of Relations and Graphs: Symbolic Ultrametrics and Cograph Edge Decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Marc Hellmuth, Nicolas Wieseke","submitted_at":"2015-09-16T21:38:32Z","abstract_excerpt":"Tree representations of (sets of) symmetric binary relations, or equivalently edge-colored undirected graphs, are of central interest, e.g.\\ in phylogenomics. In this context symbolic ultrametrics play a crucial role. Symbolic ultrametrics define an edge-colored complete graph that allows to represent the topology of this graph as a vertex-colored tree. Here, we are interested in the structure and the complexity of certain combinatorial problems resulting from considerations based on symbolic ultrametrics, and on algorithms to solve them.\n  This includes, the characterization of symbolic ultra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05069","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-18T01:32:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7HJ9PobgxlObmYVgmDOxw+DWtD295HWT+J8OvzyIT9RYl3WWDMYxyDs4OtzK/uBszseQ627CPkz10IRLVosgDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T17:40:32.431893Z"},"content_sha256":"1a0eca0d3d9d2bb1b8f565d1b23f41dfb14023ceb7ece6b2a5865116ef860abe","schema_version":"1.0","event_id":"sha256:1a0eca0d3d9d2bb1b8f565d1b23f41dfb14023ceb7ece6b2a5865116ef860abe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NNUKWGU7NZ7WRVWWCW3OHGMYVK/bundle.json","state_url":"https://pith.science/pith/NNUKWGU7NZ7WRVWWCW3OHGMYVK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NNUKWGU7NZ7WRVWWCW3OHGMYVK/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-26T17:40:32Z","links":{"resolver":"https://pith.science/pith/NNUKWGU7NZ7WRVWWCW3OHGMYVK","bundle":"https://pith.science/pith/NNUKWGU7NZ7WRVWWCW3OHGMYVK/bundle.json","state":"https://pith.science/pith/NNUKWGU7NZ7WRVWWCW3OHGMYVK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NNUKWGU7NZ7WRVWWCW3OHGMYVK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:NNUKWGU7NZ7WRVWWCW3OHGMYVK","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":"96b9634589625f6bbd188ea98de501080c322beaaa7ece250d84fe955875f6d2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-09-16T21:38:32Z","title_canon_sha256":"aced92ab1960ec3739c3cecd736dae9d9df531c9ceed88627d1c65c364362317"},"schema_version":"1.0","source":{"id":"1509.05069","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.05069","created_at":"2026-05-18T01:32:49Z"},{"alias_kind":"arxiv_version","alias_value":"1509.05069v1","created_at":"2026-05-18T01:32:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05069","created_at":"2026-05-18T01:32:49Z"},{"alias_kind":"pith_short_12","alias_value":"NNUKWGU7NZ7W","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"NNUKWGU7NZ7WRVWW","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"NNUKWGU7","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:1a0eca0d3d9d2bb1b8f565d1b23f41dfb14023ceb7ece6b2a5865116ef860abe","target":"graph","created_at":"2026-05-18T01:32:49Z","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":"Tree representations of (sets of) symmetric binary relations, or equivalently edge-colored undirected graphs, are of central interest, e.g.\\ in phylogenomics. In this context symbolic ultrametrics play a crucial role. Symbolic ultrametrics define an edge-colored complete graph that allows to represent the topology of this graph as a vertex-colored tree. Here, we are interested in the structure and the complexity of certain combinatorial problems resulting from considerations based on symbolic ultrametrics, and on algorithms to solve them.\n  This includes, the characterization of symbolic ultra","authors_text":"Marc Hellmuth, Nicolas Wieseke","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-09-16T21:38:32Z","title":"On Tree Representations of Relations and Graphs: Symbolic Ultrametrics and Cograph Edge Decompositions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05069","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:5cc7d8d205b55f576d31cd9031a6af71483f0c7b5bff1dc13644c7ae6e1bd63f","target":"record","created_at":"2026-05-18T01:32:49Z","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":"96b9634589625f6bbd188ea98de501080c322beaaa7ece250d84fe955875f6d2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-09-16T21:38:32Z","title_canon_sha256":"aced92ab1960ec3739c3cecd736dae9d9df531c9ceed88627d1c65c364362317"},"schema_version":"1.0","source":{"id":"1509.05069","kind":"arxiv","version":1}},"canonical_sha256":"6b68ab1a9f6e7f68d6d615b6e39998aa9eb4b8d3b2f8856339377e44363954c2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6b68ab1a9f6e7f68d6d615b6e39998aa9eb4b8d3b2f8856339377e44363954c2","first_computed_at":"2026-05-18T01:32:49.993516Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:49.993516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IWSfGHfIBPKhCL9iNNSMbEhvK2J4cFstgM78B3v08ct/+Gr/BHqbz4Urbsd/M0DCCJvVZSRNp9/5D/lop3TnCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:49.994159Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.05069","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5cc7d8d205b55f576d31cd9031a6af71483f0c7b5bff1dc13644c7ae6e1bd63f","sha256:1a0eca0d3d9d2bb1b8f565d1b23f41dfb14023ceb7ece6b2a5865116ef860abe"],"state_sha256":"d69e6b8aa300cf2cbf79dbd9fa0eaad3301be1710d2e1b13b03632b6e3995bc5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lutsyIsTxjeTHJuR1wH5ITxel/KM6WsDK9LC2GyVCdKCDcjwgT7AsEi76xfOfk+tUz4VUvwfFI2J0PMApOvrDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T17:40:32.433755Z","bundle_sha256":"2d4e6217655966c12cb4aa59f42fc48e18c35aab31a8c1c16685f637a44a5553"}}