{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:BLNHLDTXO4MA6LGJPJHLEJG7K3","short_pith_number":"pith:BLNHLDTX","schema_version":"1.0","canonical_sha256":"0ada758e7777180f2cc97a4eb224df56c21b2a1217a407af6ac39514f90bbf0f","source":{"kind":"arxiv","id":"1305.4747","version":2},"attestation_state":"computed","paper":{"title":"Easy identification of generalized common and conserved nested intervals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fabien de Montgolfier, Irena Rusu, Mathieu Raffinot","submitted_at":"2013-05-21T08:04:55Z","abstract_excerpt":"In this paper we explain how to easily compute gene clusters, formalized by classical or generalized nested common or conserved intervals, between a set of K genomes represented as K permutations. A b-nested common (resp. conserved) interval I of size |I| is either an interval of size 1 or a common (resp. conserved) interval that contains another b-nested common (resp. conserved) interval of size at least |I|-b. When b=1, this corresponds to the classical notion of nested interval. We exhibit two simple algorithms to output all b-nested common or conserved intervals between K permutations in O"},"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":"1305.4747","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-21T08:04:55Z","cross_cats_sorted":[],"title_canon_sha256":"c3e9175b79944fd37704dc55e485680f3e229c60eaeb121b51472198569cb1a9","abstract_canon_sha256":"41a6fd47d1ecc9bf051fa5aee7e4f917f515d6f4a07aa32c825542400d5b2c0d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:54.497417Z","signature_b64":"d+nZVOCd0z5fTwUG6q8tFnIMLK/oTuODPO5cwb1uKNcvBjwHaKOCPBYQEgvcsv+tlh0zEZ2m2Kot7Hp8VxMZCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ada758e7777180f2cc97a4eb224df56c21b2a1217a407af6ac39514f90bbf0f","last_reissued_at":"2026-05-18T03:05:54.496686Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:54.496686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Easy identification of generalized common and conserved nested intervals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fabien de Montgolfier, Irena Rusu, Mathieu Raffinot","submitted_at":"2013-05-21T08:04:55Z","abstract_excerpt":"In this paper we explain how to easily compute gene clusters, formalized by classical or generalized nested common or conserved intervals, between a set of K genomes represented as K permutations. A b-nested common (resp. conserved) interval I of size |I| is either an interval of size 1 or a common (resp. conserved) interval that contains another b-nested common (resp. conserved) interval of size at least |I|-b. When b=1, this corresponds to the classical notion of nested interval. We exhibit two simple algorithms to output all b-nested common or conserved intervals between K permutations in O"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.4747","kind":"arxiv","version":2},"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":"1305.4747","created_at":"2026-05-18T03:05:54.496813+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.4747v2","created_at":"2026-05-18T03:05:54.496813+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.4747","created_at":"2026-05-18T03:05:54.496813+00:00"},{"alias_kind":"pith_short_12","alias_value":"BLNHLDTXO4MA","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"BLNHLDTXO4MA6LGJ","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"BLNHLDTX","created_at":"2026-05-18T12:27:38.830355+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/BLNHLDTXO4MA6LGJPJHLEJG7K3","json":"https://pith.science/pith/BLNHLDTXO4MA6LGJPJHLEJG7K3.json","graph_json":"https://pith.science/api/pith-number/BLNHLDTXO4MA6LGJPJHLEJG7K3/graph.json","events_json":"https://pith.science/api/pith-number/BLNHLDTXO4MA6LGJPJHLEJG7K3/events.json","paper":"https://pith.science/paper/BLNHLDTX"},"agent_actions":{"view_html":"https://pith.science/pith/BLNHLDTXO4MA6LGJPJHLEJG7K3","download_json":"https://pith.science/pith/BLNHLDTXO4MA6LGJPJHLEJG7K3.json","view_paper":"https://pith.science/paper/BLNHLDTX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.4747&json=true","fetch_graph":"https://pith.science/api/pith-number/BLNHLDTXO4MA6LGJPJHLEJG7K3/graph.json","fetch_events":"https://pith.science/api/pith-number/BLNHLDTXO4MA6LGJPJHLEJG7K3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BLNHLDTXO4MA6LGJPJHLEJG7K3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BLNHLDTXO4MA6LGJPJHLEJG7K3/action/storage_attestation","attest_author":"https://pith.science/pith/BLNHLDTXO4MA6LGJPJHLEJG7K3/action/author_attestation","sign_citation":"https://pith.science/pith/BLNHLDTXO4MA6LGJPJHLEJG7K3/action/citation_signature","submit_replication":"https://pith.science/pith/BLNHLDTXO4MA6LGJPJHLEJG7K3/action/replication_record"}},"created_at":"2026-05-18T03:05:54.496813+00:00","updated_at":"2026-05-18T03:05:54.496813+00:00"}