{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:3RFMKYMC4A5AAAVUBMRCFZF5YV","short_pith_number":"pith:3RFMKYMC","schema_version":"1.0","canonical_sha256":"dc4ac56182e03a0002b40b2222e4bdc557f3d76cdccf9c5fd01b940854dd8b65","source":{"kind":"arxiv","id":"1210.3762","version":1},"attestation_state":"computed","paper":{"title":"On Two Graph-Theoretic Characterizations of Tree Compatibility","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"David Fern\\'andez-Baca, Sudheer Vakati","submitted_at":"2012-10-14T05:29:02Z","abstract_excerpt":"Deciding whether a collection of unrooted trees is compatible is a fundamental problem in phylogenetics. Two different graph-theoretic characterizations of tree compatibility have recently been proposed. In one of these, tree compatibility is characterized in terms of the existence of a specific kind of triangulation in a structure known as the display graph. An alternative characterization expresses the tree compatibility problem as a chordal graph sandwich problem in a structure known as the edge label intersection graph. In this paper we show that the characterization using edge label inter"},"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":"1210.3762","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-10-14T05:29:02Z","cross_cats_sorted":[],"title_canon_sha256":"987f0d0931ac58465700d05563b2997b9d47058c730136b7b0a637f64358e21c","abstract_canon_sha256":"4c595886bdd817518932e628e5af8b4777c3b299665e47f4d2e3fa4ef7521445"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:43:17.163144Z","signature_b64":"H87v0386FSIikjv+g+11XeVPcpKpBnRNUNnjToD6hDb6WBKX5XkM9XhSj8T+9ar65dhXdwYXmoCQQBBINisuBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc4ac56182e03a0002b40b2222e4bdc557f3d76cdccf9c5fd01b940854dd8b65","last_reissued_at":"2026-05-18T03:43:17.162489Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:43:17.162489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Two Graph-Theoretic Characterizations of Tree Compatibility","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"David Fern\\'andez-Baca, Sudheer Vakati","submitted_at":"2012-10-14T05:29:02Z","abstract_excerpt":"Deciding whether a collection of unrooted trees is compatible is a fundamental problem in phylogenetics. Two different graph-theoretic characterizations of tree compatibility have recently been proposed. In one of these, tree compatibility is characterized in terms of the existence of a specific kind of triangulation in a structure known as the display graph. An alternative characterization expresses the tree compatibility problem as a chordal graph sandwich problem in a structure known as the edge label intersection graph. In this paper we show that the characterization using edge label inter"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.3762","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1210.3762","created_at":"2026-05-18T03:43:17.162601+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.3762v1","created_at":"2026-05-18T03:43:17.162601+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.3762","created_at":"2026-05-18T03:43:17.162601+00:00"},{"alias_kind":"pith_short_12","alias_value":"3RFMKYMC4A5A","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"3RFMKYMC4A5AAAVU","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"3RFMKYMC","created_at":"2026-05-18T12:26:53.410803+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/3RFMKYMC4A5AAAVUBMRCFZF5YV","json":"https://pith.science/pith/3RFMKYMC4A5AAAVUBMRCFZF5YV.json","graph_json":"https://pith.science/api/pith-number/3RFMKYMC4A5AAAVUBMRCFZF5YV/graph.json","events_json":"https://pith.science/api/pith-number/3RFMKYMC4A5AAAVUBMRCFZF5YV/events.json","paper":"https://pith.science/paper/3RFMKYMC"},"agent_actions":{"view_html":"https://pith.science/pith/3RFMKYMC4A5AAAVUBMRCFZF5YV","download_json":"https://pith.science/pith/3RFMKYMC4A5AAAVUBMRCFZF5YV.json","view_paper":"https://pith.science/paper/3RFMKYMC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.3762&json=true","fetch_graph":"https://pith.science/api/pith-number/3RFMKYMC4A5AAAVUBMRCFZF5YV/graph.json","fetch_events":"https://pith.science/api/pith-number/3RFMKYMC4A5AAAVUBMRCFZF5YV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3RFMKYMC4A5AAAVUBMRCFZF5YV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3RFMKYMC4A5AAAVUBMRCFZF5YV/action/storage_attestation","attest_author":"https://pith.science/pith/3RFMKYMC4A5AAAVUBMRCFZF5YV/action/author_attestation","sign_citation":"https://pith.science/pith/3RFMKYMC4A5AAAVUBMRCFZF5YV/action/citation_signature","submit_replication":"https://pith.science/pith/3RFMKYMC4A5AAAVUBMRCFZF5YV/action/replication_record"}},"created_at":"2026-05-18T03:43:17.162601+00:00","updated_at":"2026-05-18T03:43:17.162601+00:00"}