{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:K2GDRUPTC6JPDXLIIQTYZAMXGD","short_pith_number":"pith:K2GDRUPT","schema_version":"1.0","canonical_sha256":"568c38d1f31792f1dd6844278c819730c1ab6f53381e9f79a42537a4603d8fc1","source":{"kind":"arxiv","id":"1501.03931","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1501.03931","created_at":"2026-05-18T02:28:47.268955+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.03931v2","created_at":"2026-05-18T02:28:47.268955+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.03931","created_at":"2026-05-18T02:28:47.268955+00:00"},{"alias_kind":"pith_short_12","alias_value":"K2GDRUPTC6JP","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"K2GDRUPTC6JPDXLI","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"K2GDRUPT","created_at":"2026-05-18T12:29:27.538025+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/K2GDRUPTC6JPDXLIIQTYZAMXGD","json":"https://pith.science/pith/K2GDRUPTC6JPDXLIIQTYZAMXGD.json","graph_json":"https://pith.science/api/pith-number/K2GDRUPTC6JPDXLIIQTYZAMXGD/graph.json","events_json":"https://pith.science/api/pith-number/K2GDRUPTC6JPDXLIIQTYZAMXGD/events.json","paper":"https://pith.science/paper/K2GDRUPT"},"agent_actions":{"view_html":"https://pith.science/pith/K2GDRUPTC6JPDXLIIQTYZAMXGD","download_json":"https://pith.science/pith/K2GDRUPTC6JPDXLIIQTYZAMXGD.json","view_paper":"https://pith.science/paper/K2GDRUPT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.03931&json=true","fetch_graph":"https://pith.science/api/pith-number/K2GDRUPTC6JPDXLIIQTYZAMXGD/graph.json","fetch_events":"https://pith.science/api/pith-number/K2GDRUPTC6JPDXLIIQTYZAMXGD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K2GDRUPTC6JPDXLIIQTYZAMXGD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K2GDRUPTC6JPDXLIIQTYZAMXGD/action/storage_attestation","attest_author":"https://pith.science/pith/K2GDRUPTC6JPDXLIIQTYZAMXGD/action/author_attestation","sign_citation":"https://pith.science/pith/K2GDRUPTC6JPDXLIIQTYZAMXGD/action/citation_signature","submit_replication":"https://pith.science/pith/K2GDRUPTC6JPDXLIIQTYZAMXGD/action/replication_record"}},"created_at":"2026-05-18T02:28:47.268955+00:00","updated_at":"2026-05-18T02:28:47.268955+00:00"}