{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:2NEYEHY7CYPAHEGY3KT4AYG4ZF","short_pith_number":"pith:2NEYEHY7","canonical_record":{"source":{"id":"1705.08754","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-24T13:37:44Z","cross_cats_sorted":[],"title_canon_sha256":"77c350b2efc1a5b7bca531e3fe7f080710376324f21c364eff615c20e74cf0af","abstract_canon_sha256":"e32fab2aebeaa4023e7c546471f78f93075692ebe33a4a716be30635e1353676"},"schema_version":"1.0"},"canonical_sha256":"d349821f1f161e0390d8daa7c060dcc96801881f8aae2f5565a2b07172e4ec17","source":{"kind":"arxiv","id":"1705.08754","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.08754","created_at":"2026-05-18T00:25:01Z"},{"alias_kind":"arxiv_version","alias_value":"1705.08754v3","created_at":"2026-05-18T00:25:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.08754","created_at":"2026-05-18T00:25:01Z"},{"alias_kind":"pith_short_12","alias_value":"2NEYEHY7CYPA","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2NEYEHY7CYPAHEGY","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2NEYEHY7","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:2NEYEHY7CYPAHEGY3KT4AYG4ZF","target":"record","payload":{"canonical_record":{"source":{"id":"1705.08754","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-24T13:37:44Z","cross_cats_sorted":[],"title_canon_sha256":"77c350b2efc1a5b7bca531e3fe7f080710376324f21c364eff615c20e74cf0af","abstract_canon_sha256":"e32fab2aebeaa4023e7c546471f78f93075692ebe33a4a716be30635e1353676"},"schema_version":"1.0"},"canonical_sha256":"d349821f1f161e0390d8daa7c060dcc96801881f8aae2f5565a2b07172e4ec17","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:01.747228Z","signature_b64":"UrCog/0DbUngPO5Rrzmn2zVLGjtVygL4WC81kjgRonsMeezWG2JeIwp1nrWagrKWMquc1/UKiN01yz0Rik8nAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d349821f1f161e0390d8daa7c060dcc96801881f8aae2f5565a2b07172e4ec17","last_reissued_at":"2026-05-18T00:25:01.746731Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:01.746731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.08754","source_version":3,"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-18T00:25:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MfPK6m4iEQ2ds8RYzs+fyAimz498abKaOEzhhCF5x8W9VQCrPROGz/5w1Bwk0ul0OQHGnSBNSEck1znlBSaeAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T17:02:58.155409Z"},"content_sha256":"b166b7ca585ff282efee4a10f80e9d306f507cb1c5f18d88036c8fb1d515c540","schema_version":"1.0","event_id":"sha256:b166b7ca585ff282efee4a10f80e9d306f507cb1c5f18d88036c8fb1d515c540"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:2NEYEHY7CYPAHEGY3KT4AYG4ZF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-Linear Chaining Extended","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexandru I. Tomescu, Anna Kuosmanen, Rayan Chikhi, Topi Paavilainen, Travis Gagie, Veli M\\\"akinen","submitted_at":"2017-05-24T13:37:44Z","abstract_excerpt":"Aligning sequencing reads on graph representations of genomes is an important ingredient of pan-genomics. Such approaches typically find a set of local anchors that indicate plausible matches between substrings of a read to subpaths of the graph. These anchor matches are then combined to form a (semi-local) alignment of the complete read on a subpath. Co-linear chaining is an algorithmically rigorous approach to combine the anchors. It is a well-known approach for the case of two sequences as inputs. Here we extend the approach so that one of the inputs can be a directed acyclic graph (DAGs), "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.08754","kind":"arxiv","version":3},"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-18T00:25:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M57LFzjy/OA3zA3o7DxcCtjF5r0D9aj2Robn3avmoUyNwjvnh14QchV/p6NEraiCkROyTvVNbgrzrlcg63VHDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T17:02:58.156069Z"},"content_sha256":"39d938be8ff2b4f94783d48b5b559bb3aebef0efac933f7ebe2c997a6e1d7b19","schema_version":"1.0","event_id":"sha256:39d938be8ff2b4f94783d48b5b559bb3aebef0efac933f7ebe2c997a6e1d7b19"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2NEYEHY7CYPAHEGY3KT4AYG4ZF/bundle.json","state_url":"https://pith.science/pith/2NEYEHY7CYPAHEGY3KT4AYG4ZF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2NEYEHY7CYPAHEGY3KT4AYG4ZF/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-24T17:02:58Z","links":{"resolver":"https://pith.science/pith/2NEYEHY7CYPAHEGY3KT4AYG4ZF","bundle":"https://pith.science/pith/2NEYEHY7CYPAHEGY3KT4AYG4ZF/bundle.json","state":"https://pith.science/pith/2NEYEHY7CYPAHEGY3KT4AYG4ZF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2NEYEHY7CYPAHEGY3KT4AYG4ZF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:2NEYEHY7CYPAHEGY3KT4AYG4ZF","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":"e32fab2aebeaa4023e7c546471f78f93075692ebe33a4a716be30635e1353676","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-24T13:37:44Z","title_canon_sha256":"77c350b2efc1a5b7bca531e3fe7f080710376324f21c364eff615c20e74cf0af"},"schema_version":"1.0","source":{"id":"1705.08754","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.08754","created_at":"2026-05-18T00:25:01Z"},{"alias_kind":"arxiv_version","alias_value":"1705.08754v3","created_at":"2026-05-18T00:25:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.08754","created_at":"2026-05-18T00:25:01Z"},{"alias_kind":"pith_short_12","alias_value":"2NEYEHY7CYPA","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2NEYEHY7CYPAHEGY","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2NEYEHY7","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:39d938be8ff2b4f94783d48b5b559bb3aebef0efac933f7ebe2c997a6e1d7b19","target":"graph","created_at":"2026-05-18T00:25:01Z","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":"Aligning sequencing reads on graph representations of genomes is an important ingredient of pan-genomics. Such approaches typically find a set of local anchors that indicate plausible matches between substrings of a read to subpaths of the graph. These anchor matches are then combined to form a (semi-local) alignment of the complete read on a subpath. Co-linear chaining is an algorithmically rigorous approach to combine the anchors. It is a well-known approach for the case of two sequences as inputs. Here we extend the approach so that one of the inputs can be a directed acyclic graph (DAGs), ","authors_text":"Alexandru I. Tomescu, Anna Kuosmanen, Rayan Chikhi, Topi Paavilainen, Travis Gagie, Veli M\\\"akinen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-24T13:37:44Z","title":"Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-Linear Chaining Extended"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.08754","kind":"arxiv","version":3},"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:b166b7ca585ff282efee4a10f80e9d306f507cb1c5f18d88036c8fb1d515c540","target":"record","created_at":"2026-05-18T00:25:01Z","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":"e32fab2aebeaa4023e7c546471f78f93075692ebe33a4a716be30635e1353676","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-24T13:37:44Z","title_canon_sha256":"77c350b2efc1a5b7bca531e3fe7f080710376324f21c364eff615c20e74cf0af"},"schema_version":"1.0","source":{"id":"1705.08754","kind":"arxiv","version":3}},"canonical_sha256":"d349821f1f161e0390d8daa7c060dcc96801881f8aae2f5565a2b07172e4ec17","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d349821f1f161e0390d8daa7c060dcc96801881f8aae2f5565a2b07172e4ec17","first_computed_at":"2026-05-18T00:25:01.746731Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:01.746731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UrCog/0DbUngPO5Rrzmn2zVLGjtVygL4WC81kjgRonsMeezWG2JeIwp1nrWagrKWMquc1/UKiN01yz0Rik8nAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:01.747228Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.08754","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b166b7ca585ff282efee4a10f80e9d306f507cb1c5f18d88036c8fb1d515c540","sha256:39d938be8ff2b4f94783d48b5b559bb3aebef0efac933f7ebe2c997a6e1d7b19"],"state_sha256":"ddb24e559c3703b439d2aa01ce088fa5447be89830e83205e7f23846e2e513d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uZTADuZRQBDrIQqz3jNV/Y6CJDMHMk9gu38/kh9wwoBdY52WoTl0QWe6FEcXUxiifnUD9ZwQRDPvFJnw7bynAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T17:02:58.159306Z","bundle_sha256":"039fd7f4f08d1c6c1ad9d0f73d780abe518d4eb7d6440ac1690eac77a1601ae1"}}