{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:BLNHLDTXO4MA6LGJPJHLEJG7K3","short_pith_number":"pith:BLNHLDTX","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"},"canonical_sha256":"0ada758e7777180f2cc97a4eb224df56c21b2a1217a407af6ac39514f90bbf0f","source":{"kind":"arxiv","id":"1305.4747","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.4747","created_at":"2026-05-18T03:05:54Z"},{"alias_kind":"arxiv_version","alias_value":"1305.4747v2","created_at":"2026-05-18T03:05:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.4747","created_at":"2026-05-18T03:05:54Z"},{"alias_kind":"pith_short_12","alias_value":"BLNHLDTXO4MA","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"BLNHLDTXO4MA6LGJ","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"BLNHLDTX","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:BLNHLDTXO4MA6LGJPJHLEJG7K3","target":"record","payload":{"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"},"canonical_sha256":"0ada758e7777180f2cc97a4eb224df56c21b2a1217a407af6ac39514f90bbf0f","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"},"source_kind":"arxiv","source_id":"1305.4747","source_version":2,"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-18T03:05:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MHZUqh5pzXBtnrPVCRQPmESpHtRwPBMX0MDzhnTerran4E3zt4+iHQBKrDUIHuuHkqBCy7ycet/Ue7uN49a1CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:25:05.708587Z"},"content_sha256":"5b81a77c1b93e1ad372549d31601894067d76dbd62d91ea80ef078b346070da5","schema_version":"1.0","event_id":"sha256:5b81a77c1b93e1ad372549d31601894067d76dbd62d91ea80ef078b346070da5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:BLNHLDTXO4MA6LGJPJHLEJG7K3","target":"graph","payload":{"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"},"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-18T03:05:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NmSkud4kcGOLvZFHa2DUTZuSmXavEqhDJkP7Lzbq1mjxC9l0s4HAm5B3Kgert90aqYesdip7EN9OApcfGULmCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:25:05.709188Z"},"content_sha256":"6fe6ab49cf2a2ba425d10e1ed65c9215249e321f75d512063138ec12f884b88d","schema_version":"1.0","event_id":"sha256:6fe6ab49cf2a2ba425d10e1ed65c9215249e321f75d512063138ec12f884b88d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BLNHLDTXO4MA6LGJPJHLEJG7K3/bundle.json","state_url":"https://pith.science/pith/BLNHLDTXO4MA6LGJPJHLEJG7K3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BLNHLDTXO4MA6LGJPJHLEJG7K3/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-27T11:25:05Z","links":{"resolver":"https://pith.science/pith/BLNHLDTXO4MA6LGJPJHLEJG7K3","bundle":"https://pith.science/pith/BLNHLDTXO4MA6LGJPJHLEJG7K3/bundle.json","state":"https://pith.science/pith/BLNHLDTXO4MA6LGJPJHLEJG7K3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BLNHLDTXO4MA6LGJPJHLEJG7K3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:BLNHLDTXO4MA6LGJPJHLEJG7K3","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":"41a6fd47d1ecc9bf051fa5aee7e4f917f515d6f4a07aa32c825542400d5b2c0d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-21T08:04:55Z","title_canon_sha256":"c3e9175b79944fd37704dc55e485680f3e229c60eaeb121b51472198569cb1a9"},"schema_version":"1.0","source":{"id":"1305.4747","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.4747","created_at":"2026-05-18T03:05:54Z"},{"alias_kind":"arxiv_version","alias_value":"1305.4747v2","created_at":"2026-05-18T03:05:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.4747","created_at":"2026-05-18T03:05:54Z"},{"alias_kind":"pith_short_12","alias_value":"BLNHLDTXO4MA","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"BLNHLDTXO4MA6LGJ","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"BLNHLDTX","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:6fe6ab49cf2a2ba425d10e1ed65c9215249e321f75d512063138ec12f884b88d","target":"graph","created_at":"2026-05-18T03:05:54Z","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":"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","authors_text":"Fabien de Montgolfier, Irena Rusu, Mathieu Raffinot","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-21T08:04:55Z","title":"Easy identification of generalized common and conserved nested intervals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.4747","kind":"arxiv","version":2},"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:5b81a77c1b93e1ad372549d31601894067d76dbd62d91ea80ef078b346070da5","target":"record","created_at":"2026-05-18T03:05:54Z","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":"41a6fd47d1ecc9bf051fa5aee7e4f917f515d6f4a07aa32c825542400d5b2c0d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-21T08:04:55Z","title_canon_sha256":"c3e9175b79944fd37704dc55e485680f3e229c60eaeb121b51472198569cb1a9"},"schema_version":"1.0","source":{"id":"1305.4747","kind":"arxiv","version":2}},"canonical_sha256":"0ada758e7777180f2cc97a4eb224df56c21b2a1217a407af6ac39514f90bbf0f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0ada758e7777180f2cc97a4eb224df56c21b2a1217a407af6ac39514f90bbf0f","first_computed_at":"2026-05-18T03:05:54.496686Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:54.496686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d+nZVOCd0z5fTwUG6q8tFnIMLK/oTuODPO5cwb1uKNcvBjwHaKOCPBYQEgvcsv+tlh0zEZ2m2Kot7Hp8VxMZCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:54.497417Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.4747","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5b81a77c1b93e1ad372549d31601894067d76dbd62d91ea80ef078b346070da5","sha256:6fe6ab49cf2a2ba425d10e1ed65c9215249e321f75d512063138ec12f884b88d"],"state_sha256":"857db8f4144596316bf5291494f975012d3c9f7fb1ddde6e27b1cd5865d8e025"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+BTjKULlOm4t28ISq5XAZaIXxcl42WnNd49eY8cUou/l+uVKBO1AT2vFBq/QC5MhwahXyElrpoNNHzYVsTC6BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T11:25:05.712447Z","bundle_sha256":"467585ba33ca9cdeb5e03fc2e2367103aed90e111f7e34e766159a729b7eb9f1"}}