{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:PBHO7P652VRYBQ23BYQ4E7SSKH","short_pith_number":"pith:PBHO7P65","canonical_record":{"source":{"id":"1007.0942","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2010-07-06T16:31:11Z","cross_cats_sorted":[],"title_canon_sha256":"ae34f3cadc2298a48c833feafb257a640537765fb28c9520b5c3bd7bbe47aa2b","abstract_canon_sha256":"72e9e43c5b10aa52e9835e86fe44124cc98fd87fb19c8b02c7475ff5dda1d0f6"},"schema_version":"1.0"},"canonical_sha256":"784eefbfddd56380c35b0e21c27e5251cbb916293c712bb9368f132682d433b4","source":{"kind":"arxiv","id":"1007.0942","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.0942","created_at":"2026-05-18T02:06:31Z"},{"alias_kind":"arxiv_version","alias_value":"1007.0942v1","created_at":"2026-05-18T02:06:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.0942","created_at":"2026-05-18T02:06:31Z"},{"alias_kind":"pith_short_12","alias_value":"PBHO7P652VRY","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"PBHO7P652VRYBQ23","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"PBHO7P65","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:PBHO7P652VRYBQ23BYQ4E7SSKH","target":"record","payload":{"canonical_record":{"source":{"id":"1007.0942","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2010-07-06T16:31:11Z","cross_cats_sorted":[],"title_canon_sha256":"ae34f3cadc2298a48c833feafb257a640537765fb28c9520b5c3bd7bbe47aa2b","abstract_canon_sha256":"72e9e43c5b10aa52e9835e86fe44124cc98fd87fb19c8b02c7475ff5dda1d0f6"},"schema_version":"1.0"},"canonical_sha256":"784eefbfddd56380c35b0e21c27e5251cbb916293c712bb9368f132682d433b4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:06:31.942374Z","signature_b64":"x4DJise0m99obPEQ/5mstd8vWSVcBQgZ8u9dyWaNXqmLHrLGMD7r6B1S7DLisxb4SOnbTRjqxe9/8Yuk4EG0Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"784eefbfddd56380c35b0e21c27e5251cbb916293c712bb9368f132682d433b4","last_reissued_at":"2026-05-18T02:06:31.941647Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:06:31.941647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1007.0942","source_version":1,"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-18T02:06:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zT80AjqgEWR44oEQ1jeMIl3KkHCGltCAHstbwya8TsYw5Anwf2cgJqxODCEebPs1RvcoPR+UvbggONrV01aUCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T19:16:39.719631Z"},"content_sha256":"3a2582578ce9c55b202bc504456f17b5d55a7b98b659014c113d82fd4aa3017c","schema_version":"1.0","event_id":"sha256:3a2582578ce9c55b202bc504456f17b5d55a7b98b659014c113d82fd4aa3017c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:PBHO7P652VRYBQ23BYQ4E7SSKH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient chaining of seeds in ordered trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"q-bio.QM","authors_text":"Anne-Laure Gaillard (LaBRI), C\\'edric Chauve, Julien Allali (LaBRI), Pascal Ferraro (LaBRI, PIMS)","submitted_at":"2010-07-06T16:31:11Z","abstract_excerpt":"We consider here the problem of chaining seeds in ordered trees. Seeds are mappings between two trees Q and T and a chain is a subset of non overlapping seeds that is consistent with respect to postfix order and ancestrality. This problem is a natural extension of a similar problem for sequences, and has applications in computational biology, such as mining a database of RNA secondary structures. For the chaining problem with a set of m constant size seeds, we describe an algorithm with complexity O(m2 log(m)) in time and O(m2) in space."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.0942","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"},"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-18T02:06:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dqnDFMIkGz9L0Yoxd0HztAJphnpAvuD+xpvBDR52KpEf9+K8cMdy4h5cbFd8+wpM4PCOFVlTDRb0vTQgswhZAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T19:16:39.719969Z"},"content_sha256":"0afa6ca4d22fe7704525ffe67daa3df08d867e23b78c73cd7a36185bdebdd27a","schema_version":"1.0","event_id":"sha256:0afa6ca4d22fe7704525ffe67daa3df08d867e23b78c73cd7a36185bdebdd27a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PBHO7P652VRYBQ23BYQ4E7SSKH/bundle.json","state_url":"https://pith.science/pith/PBHO7P652VRYBQ23BYQ4E7SSKH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PBHO7P652VRYBQ23BYQ4E7SSKH/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-06-21T19:16:39Z","links":{"resolver":"https://pith.science/pith/PBHO7P652VRYBQ23BYQ4E7SSKH","bundle":"https://pith.science/pith/PBHO7P652VRYBQ23BYQ4E7SSKH/bundle.json","state":"https://pith.science/pith/PBHO7P652VRYBQ23BYQ4E7SSKH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PBHO7P652VRYBQ23BYQ4E7SSKH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:PBHO7P652VRYBQ23BYQ4E7SSKH","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":"72e9e43c5b10aa52e9835e86fe44124cc98fd87fb19c8b02c7475ff5dda1d0f6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2010-07-06T16:31:11Z","title_canon_sha256":"ae34f3cadc2298a48c833feafb257a640537765fb28c9520b5c3bd7bbe47aa2b"},"schema_version":"1.0","source":{"id":"1007.0942","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.0942","created_at":"2026-05-18T02:06:31Z"},{"alias_kind":"arxiv_version","alias_value":"1007.0942v1","created_at":"2026-05-18T02:06:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.0942","created_at":"2026-05-18T02:06:31Z"},{"alias_kind":"pith_short_12","alias_value":"PBHO7P652VRY","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"PBHO7P652VRYBQ23","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"PBHO7P65","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:0afa6ca4d22fe7704525ffe67daa3df08d867e23b78c73cd7a36185bdebdd27a","target":"graph","created_at":"2026-05-18T02:06:31Z","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":"We consider here the problem of chaining seeds in ordered trees. Seeds are mappings between two trees Q and T and a chain is a subset of non overlapping seeds that is consistent with respect to postfix order and ancestrality. This problem is a natural extension of a similar problem for sequences, and has applications in computational biology, such as mining a database of RNA secondary structures. For the chaining problem with a set of m constant size seeds, we describe an algorithm with complexity O(m2 log(m)) in time and O(m2) in space.","authors_text":"Anne-Laure Gaillard (LaBRI), C\\'edric Chauve, Julien Allali (LaBRI), Pascal Ferraro (LaBRI, PIMS)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2010-07-06T16:31:11Z","title":"Efficient chaining of seeds in ordered trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.0942","kind":"arxiv","version":1},"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:3a2582578ce9c55b202bc504456f17b5d55a7b98b659014c113d82fd4aa3017c","target":"record","created_at":"2026-05-18T02:06:31Z","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":"72e9e43c5b10aa52e9835e86fe44124cc98fd87fb19c8b02c7475ff5dda1d0f6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2010-07-06T16:31:11Z","title_canon_sha256":"ae34f3cadc2298a48c833feafb257a640537765fb28c9520b5c3bd7bbe47aa2b"},"schema_version":"1.0","source":{"id":"1007.0942","kind":"arxiv","version":1}},"canonical_sha256":"784eefbfddd56380c35b0e21c27e5251cbb916293c712bb9368f132682d433b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"784eefbfddd56380c35b0e21c27e5251cbb916293c712bb9368f132682d433b4","first_computed_at":"2026-05-18T02:06:31.941647Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:06:31.941647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x4DJise0m99obPEQ/5mstd8vWSVcBQgZ8u9dyWaNXqmLHrLGMD7r6B1S7DLisxb4SOnbTRjqxe9/8Yuk4EG0Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:06:31.942374Z","signed_message":"canonical_sha256_bytes"},"source_id":"1007.0942","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3a2582578ce9c55b202bc504456f17b5d55a7b98b659014c113d82fd4aa3017c","sha256:0afa6ca4d22fe7704525ffe67daa3df08d867e23b78c73cd7a36185bdebdd27a"],"state_sha256":"da3ec3c456e8e230bc03f271410868ea1bcfb7c9fefbad513d920fe6d262f19c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"weBODcTCT6++gIIxsWMsw2zQI7nippZoelpEDxj8COCYDrkVl3UG2S9fOeEM0fL+4Izt78Zf64BXzbpnpFTpCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T19:16:39.721897Z","bundle_sha256":"7e152008808b476030ec062559a0eb665469cd5a40a7365b8a910507351c5f61"}}