{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:6CALNFQJRARO3MFKIBAMWZP5OS","short_pith_number":"pith:6CALNFQJ","schema_version":"1.0","canonical_sha256":"f080b696098822edb0aa4040cb65fd74a20ce1c5e247ded73d38672276f4144d","source":{"kind":"arxiv","id":"1111.5872","version":1},"attestation_state":"computed","paper":{"title":"Tractability results for the Double-Cut-and-Join circular median problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Ahmad Mahmoody-Ghaidary, Cedric Chauve, Ladislav Stacho","submitted_at":"2011-11-24T23:53:48Z","abstract_excerpt":"The circular median problem in the Double-Cut-and-Join (DCJ) distance asks to find, for three given genomes, a fourth circular genome that minimizes the sum of the mutual distances with the three other ones. This problem has been shown to be NP-complete. We show here that, if the number of vertices of degree 3 in the breakpoint graph of the three input genomes is fixed, then the problem is tractable"},"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":"1111.5872","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-11-24T23:53:48Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"d1fdb7309a3b75be9685a4652fde8f7127564ae43034bfeb60ebe3646931cb24","abstract_canon_sha256":"d110a0a45e1b65d8895d943e196397746b674afe74660bb8d145c91e3a529b7f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:07:42.074587Z","signature_b64":"EKFQGUXkhR4dhT81MqCO9mvFBS31+pNVOC7TsY2MlKQU5A8fbSVupsKJr6vapMCFFW8lhBgfmqY+6gVHao9ACw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f080b696098822edb0aa4040cb65fd74a20ce1c5e247ded73d38672276f4144d","last_reissued_at":"2026-05-18T04:07:42.073931Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:07:42.073931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tractability results for the Double-Cut-and-Join circular median problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Ahmad Mahmoody-Ghaidary, Cedric Chauve, Ladislav Stacho","submitted_at":"2011-11-24T23:53:48Z","abstract_excerpt":"The circular median problem in the Double-Cut-and-Join (DCJ) distance asks to find, for three given genomes, a fourth circular genome that minimizes the sum of the mutual distances with the three other ones. This problem has been shown to be NP-complete. We show here that, if the number of vertices of degree 3 in the breakpoint graph of the three input genomes is fixed, then the problem is tractable"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.5872","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":"1111.5872","created_at":"2026-05-18T04:07:42.074029+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.5872v1","created_at":"2026-05-18T04:07:42.074029+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.5872","created_at":"2026-05-18T04:07:42.074029+00:00"},{"alias_kind":"pith_short_12","alias_value":"6CALNFQJRARO","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_16","alias_value":"6CALNFQJRARO3MFK","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_8","alias_value":"6CALNFQJ","created_at":"2026-05-18T12:26:22.705136+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/6CALNFQJRARO3MFKIBAMWZP5OS","json":"https://pith.science/pith/6CALNFQJRARO3MFKIBAMWZP5OS.json","graph_json":"https://pith.science/api/pith-number/6CALNFQJRARO3MFKIBAMWZP5OS/graph.json","events_json":"https://pith.science/api/pith-number/6CALNFQJRARO3MFKIBAMWZP5OS/events.json","paper":"https://pith.science/paper/6CALNFQJ"},"agent_actions":{"view_html":"https://pith.science/pith/6CALNFQJRARO3MFKIBAMWZP5OS","download_json":"https://pith.science/pith/6CALNFQJRARO3MFKIBAMWZP5OS.json","view_paper":"https://pith.science/paper/6CALNFQJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.5872&json=true","fetch_graph":"https://pith.science/api/pith-number/6CALNFQJRARO3MFKIBAMWZP5OS/graph.json","fetch_events":"https://pith.science/api/pith-number/6CALNFQJRARO3MFKIBAMWZP5OS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6CALNFQJRARO3MFKIBAMWZP5OS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6CALNFQJRARO3MFKIBAMWZP5OS/action/storage_attestation","attest_author":"https://pith.science/pith/6CALNFQJRARO3MFKIBAMWZP5OS/action/author_attestation","sign_citation":"https://pith.science/pith/6CALNFQJRARO3MFKIBAMWZP5OS/action/citation_signature","submit_replication":"https://pith.science/pith/6CALNFQJRARO3MFKIBAMWZP5OS/action/replication_record"}},"created_at":"2026-05-18T04:07:42.074029+00:00","updated_at":"2026-05-18T04:07:42.074029+00:00"}