{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:6M6KZ35LORV6P6FKR3YEPV4NZE","short_pith_number":"pith:6M6KZ35L","canonical_record":{"source":{"id":"1110.5704","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2011-10-26T05:43:01Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"a3fc440a8cd0b6db08a48809075e9008263ae23e102dd643650e9e23b2b2b067","abstract_canon_sha256":"fd612d01c480d27ce2e4dfe5064b1cf04cebe3be7fc55b1d8592d9b51232da26"},"schema_version":"1.0"},"canonical_sha256":"f33cacefab746be7f8aa8ef047d78dc92802c04ba893395cbf54614fc8f272ab","source":{"kind":"arxiv","id":"1110.5704","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.5704","created_at":"2026-05-18T02:29:32Z"},{"alias_kind":"arxiv_version","alias_value":"1110.5704v1","created_at":"2026-05-18T02:29:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.5704","created_at":"2026-05-18T02:29:32Z"},{"alias_kind":"pith_short_12","alias_value":"6M6KZ35LORV6","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"6M6KZ35LORV6P6FK","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"6M6KZ35L","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:6M6KZ35LORV6P6FKR3YEPV4NZE","target":"record","payload":{"canonical_record":{"source":{"id":"1110.5704","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2011-10-26T05:43:01Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"a3fc440a8cd0b6db08a48809075e9008263ae23e102dd643650e9e23b2b2b067","abstract_canon_sha256":"fd612d01c480d27ce2e4dfe5064b1cf04cebe3be7fc55b1d8592d9b51232da26"},"schema_version":"1.0"},"canonical_sha256":"f33cacefab746be7f8aa8ef047d78dc92802c04ba893395cbf54614fc8f272ab","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:32.696159Z","signature_b64":"quEv24voZwDa0aghKMULU3hafU9oRdtQRAHksJ8kJ00dNp5a4unoFeLeZpujKURS7gn9DtzeUdLBFniwXJOpAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f33cacefab746be7f8aa8ef047d78dc92802c04ba893395cbf54614fc8f272ab","last_reissued_at":"2026-05-18T02:29:32.695753Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:32.695753Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1110.5704","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-18T02:29:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IZqjBKJlYIC4eBWgFCRehvSxjKGi0v2UYXKGXzJczxtEbdF4B0BvlCMLh5e8h655M49BTd4SLo5kjHs0eQOoDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:03:13.625143Z"},"content_sha256":"c3e848f762ec56c9cc934726ae89d6171adbe33bf80f526cd565a37fce4f7b2a","schema_version":"1.0","event_id":"sha256:c3e848f762ec56c9cc934726ae89d6171adbe33bf80f526cd565a37fce4f7b2a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:6M6KZ35LORV6P6FKR3YEPV4NZE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Mirroring co-evolving trees in the light of their topologies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"q-bio.PE","authors_text":"Alexander Sch\\\"onhuth, Alfonso Valencia, David Juan, Iman Hajirasouliha, S.Cenk Sahinalp","submitted_at":"2011-10-26T05:43:01Z","abstract_excerpt":"Determining the interaction partners among protein/domain families poses hard computational problems, in particular in the presence of paralogous proteins. Available approaches aim to identify interaction partners among protein/domain families through maximizing the similarity between trimmed versions of their phylogenetic trees. Since maximization of any natural similarity score is computationally difficult, many approaches employ heuristics to maximize the distance matrices corresponding to the tree topologies in question. In this paper we devise an efficient deterministic algorithm which di"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.5704","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-18T02:29:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I/6howS/WCKBaos2PNNM/EwNogOsa8UOzaC+Mo3zFzaodlV/4tQoaa4otC1JfC+bAOjkHYg62q6InCs+TQnfDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:03:13.625740Z"},"content_sha256":"08d1fdcb182f16eea0abbfcbdd770b301819b185b242303278d3bfb67741596e","schema_version":"1.0","event_id":"sha256:08d1fdcb182f16eea0abbfcbdd770b301819b185b242303278d3bfb67741596e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6M6KZ35LORV6P6FKR3YEPV4NZE/bundle.json","state_url":"https://pith.science/pith/6M6KZ35LORV6P6FKR3YEPV4NZE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6M6KZ35LORV6P6FKR3YEPV4NZE/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-27T10:03:13Z","links":{"resolver":"https://pith.science/pith/6M6KZ35LORV6P6FKR3YEPV4NZE","bundle":"https://pith.science/pith/6M6KZ35LORV6P6FKR3YEPV4NZE/bundle.json","state":"https://pith.science/pith/6M6KZ35LORV6P6FKR3YEPV4NZE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6M6KZ35LORV6P6FKR3YEPV4NZE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:6M6KZ35LORV6P6FKR3YEPV4NZE","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":"fd612d01c480d27ce2e4dfe5064b1cf04cebe3be7fc55b1d8592d9b51232da26","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2011-10-26T05:43:01Z","title_canon_sha256":"a3fc440a8cd0b6db08a48809075e9008263ae23e102dd643650e9e23b2b2b067"},"schema_version":"1.0","source":{"id":"1110.5704","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.5704","created_at":"2026-05-18T02:29:32Z"},{"alias_kind":"arxiv_version","alias_value":"1110.5704v1","created_at":"2026-05-18T02:29:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.5704","created_at":"2026-05-18T02:29:32Z"},{"alias_kind":"pith_short_12","alias_value":"6M6KZ35LORV6","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"6M6KZ35LORV6P6FK","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"6M6KZ35L","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:08d1fdcb182f16eea0abbfcbdd770b301819b185b242303278d3bfb67741596e","target":"graph","created_at":"2026-05-18T02:29:32Z","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":"Determining the interaction partners among protein/domain families poses hard computational problems, in particular in the presence of paralogous proteins. Available approaches aim to identify interaction partners among protein/domain families through maximizing the similarity between trimmed versions of their phylogenetic trees. Since maximization of any natural similarity score is computationally difficult, many approaches employ heuristics to maximize the distance matrices corresponding to the tree topologies in question. In this paper we devise an efficient deterministic algorithm which di","authors_text":"Alexander Sch\\\"onhuth, Alfonso Valencia, David Juan, Iman Hajirasouliha, S.Cenk Sahinalp","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2011-10-26T05:43:01Z","title":"Mirroring co-evolving trees in the light of their topologies"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.5704","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:c3e848f762ec56c9cc934726ae89d6171adbe33bf80f526cd565a37fce4f7b2a","target":"record","created_at":"2026-05-18T02:29:32Z","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":"fd612d01c480d27ce2e4dfe5064b1cf04cebe3be7fc55b1d8592d9b51232da26","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2011-10-26T05:43:01Z","title_canon_sha256":"a3fc440a8cd0b6db08a48809075e9008263ae23e102dd643650e9e23b2b2b067"},"schema_version":"1.0","source":{"id":"1110.5704","kind":"arxiv","version":1}},"canonical_sha256":"f33cacefab746be7f8aa8ef047d78dc92802c04ba893395cbf54614fc8f272ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f33cacefab746be7f8aa8ef047d78dc92802c04ba893395cbf54614fc8f272ab","first_computed_at":"2026-05-18T02:29:32.695753Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:29:32.695753Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"quEv24voZwDa0aghKMULU3hafU9oRdtQRAHksJ8kJ00dNp5a4unoFeLeZpujKURS7gn9DtzeUdLBFniwXJOpAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:29:32.696159Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.5704","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c3e848f762ec56c9cc934726ae89d6171adbe33bf80f526cd565a37fce4f7b2a","sha256:08d1fdcb182f16eea0abbfcbdd770b301819b185b242303278d3bfb67741596e"],"state_sha256":"81a185f9f40b51561301293c14f5936536f9f6dc6626891bd41023819696da98"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vpZdwBcrKavXuScTVFrDmtMQsKWGZzWRRB6ytO3uSO6xvUFUMW2CNHGnP/1m6Ie6IMqXGlwL2amRTGw0WgmEBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T10:03:13.628786Z","bundle_sha256":"f64c3a3d2b86aa41676dfa41c40312344d40e03bbcc8d4d30f8bf24e3bd15b55"}}