{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:U3UUO4PCYBSGAQQTPMG6WREUH3","short_pith_number":"pith:U3UUO4PC","canonical_record":{"source":{"id":"1506.07458","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-24T16:37:07Z","cross_cats_sorted":[],"title_canon_sha256":"2916014f2367b2040ac562e341396d0f3f793d9c5019bb2dd5d6e757fd254e77","abstract_canon_sha256":"51f724392aaad0ce52db1d55468b653113cf0e8824fd8d935fb87f567c007100"},"schema_version":"1.0"},"canonical_sha256":"a6e94771e2c0646042137b0deb44943ee22565760fdec2811e017d41ec9639eb","source":{"kind":"arxiv","id":"1506.07458","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.07458","created_at":"2026-05-18T01:39:53Z"},{"alias_kind":"arxiv_version","alias_value":"1506.07458v1","created_at":"2026-05-18T01:39:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.07458","created_at":"2026-05-18T01:39:53Z"},{"alias_kind":"pith_short_12","alias_value":"U3UUO4PCYBSG","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"U3UUO4PCYBSGAQQT","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"U3UUO4PC","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:U3UUO4PCYBSGAQQTPMG6WREUH3","target":"record","payload":{"canonical_record":{"source":{"id":"1506.07458","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-24T16:37:07Z","cross_cats_sorted":[],"title_canon_sha256":"2916014f2367b2040ac562e341396d0f3f793d9c5019bb2dd5d6e757fd254e77","abstract_canon_sha256":"51f724392aaad0ce52db1d55468b653113cf0e8824fd8d935fb87f567c007100"},"schema_version":"1.0"},"canonical_sha256":"a6e94771e2c0646042137b0deb44943ee22565760fdec2811e017d41ec9639eb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:39:53.992497Z","signature_b64":"BIR8lBylSvyRMkvhAaArm1pe1UD8OH64VoSzyG1NWIjWQVNUFNW72FuSyDFmhhgdeXa6WsXbSZoPC6RHG3dlAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6e94771e2c0646042137b0deb44943ee22565760fdec2811e017d41ec9639eb","last_reissued_at":"2026-05-18T01:39:53.992052Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:39:53.992052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.07458","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-18T01:39:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ve88YZBpJ+yzbz82YyOGqMdCdpaWuWu8Q+eqVYTdIG0IPRiCi3102R0+gFTkUC+zru+KGsz6VMn/E2XZcWA6CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T16:44:06.358663Z"},"content_sha256":"8fcd1ed342b622c11bcbd736b60551805bef79430fa18804d4dcaa7bc24e12f2","schema_version":"1.0","event_id":"sha256:8fcd1ed342b622c11bcbd736b60551805bef79430fa18804d4dcaa7bc24e12f2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:U3UUO4PCYBSGAQQTPMG6WREUH3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Chaining fragments in sequences: to sweep or not","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Cedric Chauve, Julien Allali, Laetitia Bourgeade","submitted_at":"2015-06-24T16:37:07Z","abstract_excerpt":"Computing an optimal chain of fragments is a classical problem in string algorithms, with important applications in computational biology. There exist two efficient dynamic programming algorithms solving this problem, based on different principles. In the present note, we show how it is possible to combine the principles of two of these algorithms in order to design a hybrid dynamic programming algorithm that combines the advantages of both algorithms."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.07458","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-18T01:39:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"92AWunOLouBU55Rmu0DJRXPF0rl8IX99oC5XQFD9gdUZh8G2k8oMgllRPXO3n6jM33SCM48sivJoSC+uozWjDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T16:44:06.359304Z"},"content_sha256":"0bc9004ca87a6beb1e7b245394aec042e24077602b9c3623898239a0c79cfe3a","schema_version":"1.0","event_id":"sha256:0bc9004ca87a6beb1e7b245394aec042e24077602b9c3623898239a0c79cfe3a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U3UUO4PCYBSGAQQTPMG6WREUH3/bundle.json","state_url":"https://pith.science/pith/U3UUO4PCYBSGAQQTPMG6WREUH3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U3UUO4PCYBSGAQQTPMG6WREUH3/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-07T16:44:06Z","links":{"resolver":"https://pith.science/pith/U3UUO4PCYBSGAQQTPMG6WREUH3","bundle":"https://pith.science/pith/U3UUO4PCYBSGAQQTPMG6WREUH3/bundle.json","state":"https://pith.science/pith/U3UUO4PCYBSGAQQTPMG6WREUH3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U3UUO4PCYBSGAQQTPMG6WREUH3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:U3UUO4PCYBSGAQQTPMG6WREUH3","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":"51f724392aaad0ce52db1d55468b653113cf0e8824fd8d935fb87f567c007100","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-24T16:37:07Z","title_canon_sha256":"2916014f2367b2040ac562e341396d0f3f793d9c5019bb2dd5d6e757fd254e77"},"schema_version":"1.0","source":{"id":"1506.07458","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.07458","created_at":"2026-05-18T01:39:53Z"},{"alias_kind":"arxiv_version","alias_value":"1506.07458v1","created_at":"2026-05-18T01:39:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.07458","created_at":"2026-05-18T01:39:53Z"},{"alias_kind":"pith_short_12","alias_value":"U3UUO4PCYBSG","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"U3UUO4PCYBSGAQQT","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"U3UUO4PC","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:0bc9004ca87a6beb1e7b245394aec042e24077602b9c3623898239a0c79cfe3a","target":"graph","created_at":"2026-05-18T01:39:53Z","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":"Computing an optimal chain of fragments is a classical problem in string algorithms, with important applications in computational biology. There exist two efficient dynamic programming algorithms solving this problem, based on different principles. In the present note, we show how it is possible to combine the principles of two of these algorithms in order to design a hybrid dynamic programming algorithm that combines the advantages of both algorithms.","authors_text":"Cedric Chauve, Julien Allali, Laetitia Bourgeade","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-24T16:37:07Z","title":"Chaining fragments in sequences: to sweep or not"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.07458","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:8fcd1ed342b622c11bcbd736b60551805bef79430fa18804d4dcaa7bc24e12f2","target":"record","created_at":"2026-05-18T01:39:53Z","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":"51f724392aaad0ce52db1d55468b653113cf0e8824fd8d935fb87f567c007100","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-24T16:37:07Z","title_canon_sha256":"2916014f2367b2040ac562e341396d0f3f793d9c5019bb2dd5d6e757fd254e77"},"schema_version":"1.0","source":{"id":"1506.07458","kind":"arxiv","version":1}},"canonical_sha256":"a6e94771e2c0646042137b0deb44943ee22565760fdec2811e017d41ec9639eb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a6e94771e2c0646042137b0deb44943ee22565760fdec2811e017d41ec9639eb","first_computed_at":"2026-05-18T01:39:53.992052Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:39:53.992052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BIR8lBylSvyRMkvhAaArm1pe1UD8OH64VoSzyG1NWIjWQVNUFNW72FuSyDFmhhgdeXa6WsXbSZoPC6RHG3dlAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:39:53.992497Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.07458","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8fcd1ed342b622c11bcbd736b60551805bef79430fa18804d4dcaa7bc24e12f2","sha256:0bc9004ca87a6beb1e7b245394aec042e24077602b9c3623898239a0c79cfe3a"],"state_sha256":"ceaba0a5b8c952b0796366a9c1c906ef744f6eaa1ff3f5f2a3e85212c57ba659"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QnTNrkAs+mVa2FxdYxORff9AEpLckIGl6t9W5K/XypBb+8dGcyRmAr87DnHs6ME/VjO8nsHN7eMHB3VR/HW9CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T16:44:06.363143Z","bundle_sha256":"2ca2623095c0c3e144c6c0822c6d800d208dddcfc7adfee526f1d055f7af3d75"}}