{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:3RFMKYMC4A5AAAVUBMRCFZF5YV","short_pith_number":"pith:3RFMKYMC","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"},"canonical_sha256":"dc4ac56182e03a0002b40b2222e4bdc557f3d76cdccf9c5fd01b940854dd8b65","source":{"kind":"arxiv","id":"1210.3762","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.3762","created_at":"2026-05-18T03:43:17Z"},{"alias_kind":"arxiv_version","alias_value":"1210.3762v1","created_at":"2026-05-18T03:43:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.3762","created_at":"2026-05-18T03:43:17Z"},{"alias_kind":"pith_short_12","alias_value":"3RFMKYMC4A5A","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"3RFMKYMC4A5AAAVU","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"3RFMKYMC","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:3RFMKYMC4A5AAAVUBMRCFZF5YV","target":"record","payload":{"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"},"canonical_sha256":"dc4ac56182e03a0002b40b2222e4bdc557f3d76cdccf9c5fd01b940854dd8b65","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"},"source_kind":"arxiv","source_id":"1210.3762","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-18T03:43:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kxLZzO58+iGrY8jLOHte79AL3pRlQy4UdDIRblGPGOppPwNkBojZpTrQeVlofxdh38vaL2x5lS8dTeJj/5toBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T22:50:16.934734Z"},"content_sha256":"9a3daa69b1b9127112d02f22a38e58e8b014c680b1b471a7c516c262f4eb58b9","schema_version":"1.0","event_id":"sha256:9a3daa69b1b9127112d02f22a38e58e8b014c680b1b471a7c516c262f4eb58b9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:3RFMKYMC4A5AAAVUBMRCFZF5YV","target":"graph","payload":{"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"},"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-18T03:43:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bc6QqHhj51sy9kkG9iAgIsSmHVFIe5ePFToz9O8Zp0qBlT5dF830voCj3B7D8kH0OHuJ5Ebe6ic7jJzM5bflCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T22:50:16.935078Z"},"content_sha256":"3d345cb5bdeec7c940a7a98473e92c797ed4ee16b17d045f68c534ef85c1f3c1","schema_version":"1.0","event_id":"sha256:3d345cb5bdeec7c940a7a98473e92c797ed4ee16b17d045f68c534ef85c1f3c1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3RFMKYMC4A5AAAVUBMRCFZF5YV/bundle.json","state_url":"https://pith.science/pith/3RFMKYMC4A5AAAVUBMRCFZF5YV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3RFMKYMC4A5AAAVUBMRCFZF5YV/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-25T22:50:16Z","links":{"resolver":"https://pith.science/pith/3RFMKYMC4A5AAAVUBMRCFZF5YV","bundle":"https://pith.science/pith/3RFMKYMC4A5AAAVUBMRCFZF5YV/bundle.json","state":"https://pith.science/pith/3RFMKYMC4A5AAAVUBMRCFZF5YV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3RFMKYMC4A5AAAVUBMRCFZF5YV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:3RFMKYMC4A5AAAVUBMRCFZF5YV","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":"4c595886bdd817518932e628e5af8b4777c3b299665e47f4d2e3fa4ef7521445","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-10-14T05:29:02Z","title_canon_sha256":"987f0d0931ac58465700d05563b2997b9d47058c730136b7b0a637f64358e21c"},"schema_version":"1.0","source":{"id":"1210.3762","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.3762","created_at":"2026-05-18T03:43:17Z"},{"alias_kind":"arxiv_version","alias_value":"1210.3762v1","created_at":"2026-05-18T03:43:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.3762","created_at":"2026-05-18T03:43:17Z"},{"alias_kind":"pith_short_12","alias_value":"3RFMKYMC4A5A","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"3RFMKYMC4A5AAAVU","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"3RFMKYMC","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:3d345cb5bdeec7c940a7a98473e92c797ed4ee16b17d045f68c534ef85c1f3c1","target":"graph","created_at":"2026-05-18T03:43:17Z","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":"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","authors_text":"David Fern\\'andez-Baca, Sudheer Vakati","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-10-14T05:29:02Z","title":"On Two Graph-Theoretic Characterizations of Tree Compatibility"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.3762","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:9a3daa69b1b9127112d02f22a38e58e8b014c680b1b471a7c516c262f4eb58b9","target":"record","created_at":"2026-05-18T03:43:17Z","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":"4c595886bdd817518932e628e5af8b4777c3b299665e47f4d2e3fa4ef7521445","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-10-14T05:29:02Z","title_canon_sha256":"987f0d0931ac58465700d05563b2997b9d47058c730136b7b0a637f64358e21c"},"schema_version":"1.0","source":{"id":"1210.3762","kind":"arxiv","version":1}},"canonical_sha256":"dc4ac56182e03a0002b40b2222e4bdc557f3d76cdccf9c5fd01b940854dd8b65","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc4ac56182e03a0002b40b2222e4bdc557f3d76cdccf9c5fd01b940854dd8b65","first_computed_at":"2026-05-18T03:43:17.162489Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:43:17.162489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H87v0386FSIikjv+g+11XeVPcpKpBnRNUNnjToD6hDb6WBKX5XkM9XhSj8T+9ar65dhXdwYXmoCQQBBINisuBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:43:17.163144Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.3762","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9a3daa69b1b9127112d02f22a38e58e8b014c680b1b471a7c516c262f4eb58b9","sha256:3d345cb5bdeec7c940a7a98473e92c797ed4ee16b17d045f68c534ef85c1f3c1"],"state_sha256":"9d4a9b6cdfb3692be67cab38962bb33ac40a4efde1784c9d21cc3513b28489b8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aEd5uNkXUdfb1OQb8hZvXXeXk9pC9IBG8960O98QnIwyvZUUdi4Btbcl6dqy4WJZLu7U9xu/TwiFrQCeAOudAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T22:50:16.936972Z","bundle_sha256":"ab92bef2604607969e8a0ac7d1b4a320eb8022e5a52ec9554956e706e76b5d58"}}