{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:M25ENYPL2WPTN576F7ABTGUHKB","short_pith_number":"pith:M25ENYPL","schema_version":"1.0","canonical_sha256":"66ba46e1ebd59f36f7fe2fc0199a87504473176a9a55a34fb015f16ee291992a","source":{"kind":"arxiv","id":"1304.2170","version":1},"attestation_state":"computed","paper":{"title":"On sampling SCJ rearrangement scenarios","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CE","authors_text":"Eric Tannier, Istvan Miklos, Sandor Z. Kiss","submitted_at":"2013-04-08T11:22:12Z","abstract_excerpt":"The Single Cut or Join (SCJ) operation on genomes, generalizing chromosome evolution by fusions and fissions, is the computationally simplest known model of genome rearrangement. While most genome rearrangement problems are already hard when comparing three genomes, it is possible to compute in polynomial time a most parsimonious SCJ scenario for an arbitrary number of genomes related by a binary phylogenetic tree.\n  Here we consider the problems of sampling and counting the most parsimonious SCJ scenarios. We show that both the sampling and counting problems are easy for two genomes, and we r"},"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":"1304.2170","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2013-04-08T11:22:12Z","cross_cats_sorted":[],"title_canon_sha256":"a24f92ac2ab508113c71e760a2c4c85566bdde14009723857d573477d6363810","abstract_canon_sha256":"2ae2745dbf3ec3a78b89f9012c6dd9e4c2799e2ffcf09ec4e23b23cf359e94cf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:43.789944Z","signature_b64":"DWNIhNM3p/6LMGh1LhXYT1InwmuDF1xlSYM51/V33RBjyp6ckC8RXJsjXpGmRrioVF1+M1VtTp7lEc7MhxpdBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66ba46e1ebd59f36f7fe2fc0199a87504473176a9a55a34fb015f16ee291992a","last_reissued_at":"2026-05-18T03:28:43.789229Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:43.789229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On sampling SCJ rearrangement scenarios","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CE","authors_text":"Eric Tannier, Istvan Miklos, Sandor Z. Kiss","submitted_at":"2013-04-08T11:22:12Z","abstract_excerpt":"The Single Cut or Join (SCJ) operation on genomes, generalizing chromosome evolution by fusions and fissions, is the computationally simplest known model of genome rearrangement. While most genome rearrangement problems are already hard when comparing three genomes, it is possible to compute in polynomial time a most parsimonious SCJ scenario for an arbitrary number of genomes related by a binary phylogenetic tree.\n  Here we consider the problems of sampling and counting the most parsimonious SCJ scenarios. We show that both the sampling and counting problems are easy for two genomes, and we r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.2170","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":"1304.2170","created_at":"2026-05-18T03:28:43.789331+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.2170v1","created_at":"2026-05-18T03:28:43.789331+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.2170","created_at":"2026-05-18T03:28:43.789331+00:00"},{"alias_kind":"pith_short_12","alias_value":"M25ENYPL2WPT","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"M25ENYPL2WPTN576","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"M25ENYPL","created_at":"2026-05-18T12:27:51.066281+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/M25ENYPL2WPTN576F7ABTGUHKB","json":"https://pith.science/pith/M25ENYPL2WPTN576F7ABTGUHKB.json","graph_json":"https://pith.science/api/pith-number/M25ENYPL2WPTN576F7ABTGUHKB/graph.json","events_json":"https://pith.science/api/pith-number/M25ENYPL2WPTN576F7ABTGUHKB/events.json","paper":"https://pith.science/paper/M25ENYPL"},"agent_actions":{"view_html":"https://pith.science/pith/M25ENYPL2WPTN576F7ABTGUHKB","download_json":"https://pith.science/pith/M25ENYPL2WPTN576F7ABTGUHKB.json","view_paper":"https://pith.science/paper/M25ENYPL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.2170&json=true","fetch_graph":"https://pith.science/api/pith-number/M25ENYPL2WPTN576F7ABTGUHKB/graph.json","fetch_events":"https://pith.science/api/pith-number/M25ENYPL2WPTN576F7ABTGUHKB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M25ENYPL2WPTN576F7ABTGUHKB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M25ENYPL2WPTN576F7ABTGUHKB/action/storage_attestation","attest_author":"https://pith.science/pith/M25ENYPL2WPTN576F7ABTGUHKB/action/author_attestation","sign_citation":"https://pith.science/pith/M25ENYPL2WPTN576F7ABTGUHKB/action/citation_signature","submit_replication":"https://pith.science/pith/M25ENYPL2WPTN576F7ABTGUHKB/action/replication_record"}},"created_at":"2026-05-18T03:28:43.789331+00:00","updated_at":"2026-05-18T03:28:43.789331+00:00"}