{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:PQTK32EGBNXWSBDT3EBX4PVV2W","short_pith_number":"pith:PQTK32EG","schema_version":"1.0","canonical_sha256":"7c26ade8860b6f690473d9037e3eb5d58317c09d4b60ee144aa0d79b875d1b8b","source":{"kind":"arxiv","id":"1606.05910","version":1},"attestation_state":"computed","paper":{"title":"The gene family-free median of three","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.QM"],"primary_cat":"cs.DS","authors_text":"Cedric Chauve, Daniel Doerr, Metin Balaban, Pedro Feijao","submitted_at":"2016-06-19T21:21:30Z","abstract_excerpt":"The gene family-free framework for comparative genomics aims at developing methods for gene order analysis that do not require prior gene family assignment, but work directly on a sequence similarity multipartite graph. We present a model for constructing a median of three genomes in this family-free setting, based on maximizing an objective function that generalizes the classical breakpoint distance by integrating sequence similarity in the score of a gene adjacency. We show that the corresponding computational problem is MAX SNP-hard and we present a 0-1 linear program for its exact solution"},"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":"1606.05910","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-19T21:21:30Z","cross_cats_sorted":["q-bio.QM"],"title_canon_sha256":"ceccd6a1d778afb7797f7750a5751fa725e873574ace69f58e2cd3062bf0608e","abstract_canon_sha256":"675048bb8547a8327af7fcbe786c4301b76f8cc6cc5882828f4425e8ffcd32f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:15.836511Z","signature_b64":"F5U4ufZFGvmWF3/L/QUUPcHwNgV1b8ZP2l+/Y7ErFROTVz0NOlVbOad13fK6p7Oq/mrq+RCPC0IFqNNXnaKjDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c26ade8860b6f690473d9037e3eb5d58317c09d4b60ee144aa0d79b875d1b8b","last_reissued_at":"2026-05-18T01:12:15.836138Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:15.836138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The gene family-free median of three","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.QM"],"primary_cat":"cs.DS","authors_text":"Cedric Chauve, Daniel Doerr, Metin Balaban, Pedro Feijao","submitted_at":"2016-06-19T21:21:30Z","abstract_excerpt":"The gene family-free framework for comparative genomics aims at developing methods for gene order analysis that do not require prior gene family assignment, but work directly on a sequence similarity multipartite graph. We present a model for constructing a median of three genomes in this family-free setting, based on maximizing an objective function that generalizes the classical breakpoint distance by integrating sequence similarity in the score of a gene adjacency. We show that the corresponding computational problem is MAX SNP-hard and we present a 0-1 linear program for its exact solution"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.05910","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":"1606.05910","created_at":"2026-05-18T01:12:15.836185+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.05910v1","created_at":"2026-05-18T01:12:15.836185+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.05910","created_at":"2026-05-18T01:12:15.836185+00:00"},{"alias_kind":"pith_short_12","alias_value":"PQTK32EGBNXW","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"PQTK32EGBNXWSBDT","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"PQTK32EG","created_at":"2026-05-18T12:30:39.010887+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/PQTK32EGBNXWSBDT3EBX4PVV2W","json":"https://pith.science/pith/PQTK32EGBNXWSBDT3EBX4PVV2W.json","graph_json":"https://pith.science/api/pith-number/PQTK32EGBNXWSBDT3EBX4PVV2W/graph.json","events_json":"https://pith.science/api/pith-number/PQTK32EGBNXWSBDT3EBX4PVV2W/events.json","paper":"https://pith.science/paper/PQTK32EG"},"agent_actions":{"view_html":"https://pith.science/pith/PQTK32EGBNXWSBDT3EBX4PVV2W","download_json":"https://pith.science/pith/PQTK32EGBNXWSBDT3EBX4PVV2W.json","view_paper":"https://pith.science/paper/PQTK32EG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.05910&json=true","fetch_graph":"https://pith.science/api/pith-number/PQTK32EGBNXWSBDT3EBX4PVV2W/graph.json","fetch_events":"https://pith.science/api/pith-number/PQTK32EGBNXWSBDT3EBX4PVV2W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PQTK32EGBNXWSBDT3EBX4PVV2W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PQTK32EGBNXWSBDT3EBX4PVV2W/action/storage_attestation","attest_author":"https://pith.science/pith/PQTK32EGBNXWSBDT3EBX4PVV2W/action/author_attestation","sign_citation":"https://pith.science/pith/PQTK32EGBNXWSBDT3EBX4PVV2W/action/citation_signature","submit_replication":"https://pith.science/pith/PQTK32EGBNXWSBDT3EBX4PVV2W/action/replication_record"}},"created_at":"2026-05-18T01:12:15.836185+00:00","updated_at":"2026-05-18T01:12:15.836185+00:00"}