{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:K2GDRUPTC6JPDXLIIQTYZAMXGD","short_pith_number":"pith:K2GDRUPT","canonical_record":{"source":{"id":"1501.03931","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-01-16T09:59:19Z","cross_cats_sorted":[],"title_canon_sha256":"d555d57f1645e0ee202ab03c79a429f3cea5560a17da710307769f7c208a91f9","abstract_canon_sha256":"109b8e09b8f1a860da6fb806520e09ad7de3381e7995f94fba7c64ec6148f7cd"},"schema_version":"1.0"},"canonical_sha256":"568c38d1f31792f1dd6844278c819730c1ab6f53381e9f79a42537a4603d8fc1","source":{"kind":"arxiv","id":"1501.03931","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.03931","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"arxiv_version","alias_value":"1501.03931v2","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.03931","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"pith_short_12","alias_value":"K2GDRUPTC6JP","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"K2GDRUPTC6JPDXLI","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"K2GDRUPT","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:K2GDRUPTC6JPDXLIIQTYZAMXGD","target":"record","payload":{"canonical_record":{"source":{"id":"1501.03931","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-01-16T09:59:19Z","cross_cats_sorted":[],"title_canon_sha256":"d555d57f1645e0ee202ab03c79a429f3cea5560a17da710307769f7c208a91f9","abstract_canon_sha256":"109b8e09b8f1a860da6fb806520e09ad7de3381e7995f94fba7c64ec6148f7cd"},"schema_version":"1.0"},"canonical_sha256":"568c38d1f31792f1dd6844278c819730c1ab6f53381e9f79a42537a4603d8fc1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:47.269279Z","signature_b64":"hKJeOX0e56iBfs6NEkWee0HuO4CvOEqo4tz/KJtuY5PWayIaZcpJG0I3pVOgqE5/Nxu1HbIzEiLmwvxo3rGOAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"568c38d1f31792f1dd6844278c819730c1ab6f53381e9f79a42537a4603d8fc1","last_reissued_at":"2026-05-18T02:28:47.268883Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:47.268883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.03931","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-18T02:28:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y+++DddDSZ57htnEjM4GNP/a00ND7k00la/z+OGZUpSSAN+EPt/6yRcmGgEaTH0T605+1W6eBwaq8YoglIpWBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:43:52.050661Z"},"content_sha256":"013de2ed9c2ca6db6b511e7460e9bbf3e916c185a04e93128715438084683d21","schema_version":"1.0","event_id":"sha256:013de2ed9c2ca6db6b511e7460e9bbf3e916c185a04e93128715438084683d21"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:K2GDRUPTC6JPDXLIIQTYZAMXGD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Symbolic Ultrametrics, Cotree Representations, and Cograph Edge Decompositions and Partitions","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-01-16T09:59:19Z","abstract_excerpt":"Symbolic ultrametrics define edge-colored complete graphs K_n and yield a simple tree representation of K_n. We discuss, under which conditions this idea can be generalized to find a symbolic ultrametric that, in addition, distinguishes between edges and non-edges of arbitrary graphs G=(V,E) and thus, yielding a simple tree representation of G. We prove that such a symbolic ultrametric can only be defined for G if and only if G is a so-called cograph. A cograph is uniquely determined by a so-called cotree. As not all graphs are cographs, we ask, furthermore, what is the minimum number of cotre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.03931","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-18T02:28:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7MqG/OQiiu/pG8AXEMI9mn6arW+KkHnfs9v0uAJ5gkhwejxkNI0qhdEVSblNuADlN03hWdEINwQTxxl5WNOADw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:43:52.051345Z"},"content_sha256":"0587f564fa3a7a5b3f52ad7d699d8722eff6db6597db8523b7ebdb90a58f8eda","schema_version":"1.0","event_id":"sha256:0587f564fa3a7a5b3f52ad7d699d8722eff6db6597db8523b7ebdb90a58f8eda"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K2GDRUPTC6JPDXLIIQTYZAMXGD/bundle.json","state_url":"https://pith.science/pith/K2GDRUPTC6JPDXLIIQTYZAMXGD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K2GDRUPTC6JPDXLIIQTYZAMXGD/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-25T15:43:52Z","links":{"resolver":"https://pith.science/pith/K2GDRUPTC6JPDXLIIQTYZAMXGD","bundle":"https://pith.science/pith/K2GDRUPTC6JPDXLIIQTYZAMXGD/bundle.json","state":"https://pith.science/pith/K2GDRUPTC6JPDXLIIQTYZAMXGD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K2GDRUPTC6JPDXLIIQTYZAMXGD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:K2GDRUPTC6JPDXLIIQTYZAMXGD","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":"109b8e09b8f1a860da6fb806520e09ad7de3381e7995f94fba7c64ec6148f7cd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-01-16T09:59:19Z","title_canon_sha256":"d555d57f1645e0ee202ab03c79a429f3cea5560a17da710307769f7c208a91f9"},"schema_version":"1.0","source":{"id":"1501.03931","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.03931","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"arxiv_version","alias_value":"1501.03931v2","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.03931","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"pith_short_12","alias_value":"K2GDRUPTC6JP","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"K2GDRUPTC6JPDXLI","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"K2GDRUPT","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:0587f564fa3a7a5b3f52ad7d699d8722eff6db6597db8523b7ebdb90a58f8eda","target":"graph","created_at":"2026-05-18T02:28:47Z","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":"Symbolic ultrametrics define edge-colored complete graphs K_n and yield a simple tree representation of K_n. We discuss, under which conditions this idea can be generalized to find a symbolic ultrametric that, in addition, distinguishes between edges and non-edges of arbitrary graphs G=(V,E) and thus, yielding a simple tree representation of G. We prove that such a symbolic ultrametric can only be defined for G if and only if G is a so-called cograph. A cograph is uniquely determined by a so-called cotree. As not all graphs are cographs, we ask, furthermore, what is the minimum number of cotre","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-01-16T09:59:19Z","title":"On Symbolic Ultrametrics, Cotree Representations, and Cograph Edge Decompositions and Partitions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.03931","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:013de2ed9c2ca6db6b511e7460e9bbf3e916c185a04e93128715438084683d21","target":"record","created_at":"2026-05-18T02:28:47Z","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":"109b8e09b8f1a860da6fb806520e09ad7de3381e7995f94fba7c64ec6148f7cd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-01-16T09:59:19Z","title_canon_sha256":"d555d57f1645e0ee202ab03c79a429f3cea5560a17da710307769f7c208a91f9"},"schema_version":"1.0","source":{"id":"1501.03931","kind":"arxiv","version":2}},"canonical_sha256":"568c38d1f31792f1dd6844278c819730c1ab6f53381e9f79a42537a4603d8fc1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"568c38d1f31792f1dd6844278c819730c1ab6f53381e9f79a42537a4603d8fc1","first_computed_at":"2026-05-18T02:28:47.268883Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:28:47.268883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hKJeOX0e56iBfs6NEkWee0HuO4CvOEqo4tz/KJtuY5PWayIaZcpJG0I3pVOgqE5/Nxu1HbIzEiLmwvxo3rGOAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:28:47.269279Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.03931","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:013de2ed9c2ca6db6b511e7460e9bbf3e916c185a04e93128715438084683d21","sha256:0587f564fa3a7a5b3f52ad7d699d8722eff6db6597db8523b7ebdb90a58f8eda"],"state_sha256":"d2d0f09f82b5a30a5f4d608186fcc9ccebb1b116da59446f9b10efb97ba8ebdf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oVvVBk92pQvUQJPAO2ksTT2RohfRmMc+a72c3j+897ma18rA6fcRc6BVK+6YcymwDLzke8YdY3Uvp21l3zBtBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T15:43:52.055249Z","bundle_sha256":"d5245bd3517589881bf122e2ee85565a0317ba35880499d02be58b8da6649b0b"}}