{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:JYTKWIMUSF3MQ26ZDMKVBM7CSU","short_pith_number":"pith:JYTKWIMU","canonical_record":{"source":{"id":"1811.07312","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CC","submitted_at":"2018-11-18T10:45:20Z","cross_cats_sorted":[],"title_canon_sha256":"3928cceee0ceb4da2e5de8950f18a5056504c50dd41fcdf4705ad876f29c41e3","abstract_canon_sha256":"9f7e766687a9005dca53d7bb5790eeedf52c6167b39ce74ded4ae972478ee176"},"schema_version":"1.0"},"canonical_sha256":"4e26ab21949176c86bd91b1550b3e295303d46cdcde3d042bf845fbf1237ad0a","source":{"kind":"arxiv","id":"1811.07312","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.07312","created_at":"2026-07-05T03:01:20Z"},{"alias_kind":"arxiv_version","alias_value":"1811.07312v2","created_at":"2026-07-05T03:01:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.07312","created_at":"2026-07-05T03:01:20Z"},{"alias_kind":"pith_short_12","alias_value":"JYTKWIMUSF3M","created_at":"2026-07-05T03:01:20Z"},{"alias_kind":"pith_short_16","alias_value":"JYTKWIMUSF3MQ26Z","created_at":"2026-07-05T03:01:20Z"},{"alias_kind":"pith_short_8","alias_value":"JYTKWIMU","created_at":"2026-07-05T03:01:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:JYTKWIMUSF3MQ26ZDMKVBM7CSU","target":"record","payload":{"canonical_record":{"source":{"id":"1811.07312","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CC","submitted_at":"2018-11-18T10:45:20Z","cross_cats_sorted":[],"title_canon_sha256":"3928cceee0ceb4da2e5de8950f18a5056504c50dd41fcdf4705ad876f29c41e3","abstract_canon_sha256":"9f7e766687a9005dca53d7bb5790eeedf52c6167b39ce74ded4ae972478ee176"},"schema_version":"1.0"},"canonical_sha256":"4e26ab21949176c86bd91b1550b3e295303d46cdcde3d042bf845fbf1237ad0a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:01:20.100176Z","signature_b64":"HopjxTXoMaLzKGTPxFpgBsKmwjLdkHLCfQYp6QNdtogCecYnAoxIOcCEqh0K9aTyvnI1SwYyn9H74Wi3Ah5JDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e26ab21949176c86bd91b1550b3e295303d46cdcde3d042bf845fbf1237ad0a","last_reissued_at":"2026-07-05T03:01:20.099703Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:01:20.099703Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.07312","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-07-05T03:01:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aNZFUdLn1UzjLZrQHN0CP3RJi0P1LXmGmW5rh13GT5KrlWJTWzvpRuRcm08NIzk73Sqdo+OaNICPdCbU98XpBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T17:01:26.362574Z"},"content_sha256":"71a9523b950e28ad44ffe8733514d29eec0b55fc12a9adf798e60f8e17cd2b2f","schema_version":"1.0","event_id":"sha256:71a9523b950e28ad44ffe8733514d29eec0b55fc12a9adf798e60f8e17cd2b2f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:JYTKWIMUSF3MQ26ZDMKVBM7CSU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithmic complexity in computational biology: basics, challenges and limitations","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Alfonso Valencia, Davide Cirillo, Miguel Ponce-de-Leon","submitted_at":"2018-11-18T10:45:20Z","abstract_excerpt":"Computational problems can be classified according to their algorithmic complexity, which is defined based on how the resources needed to solve the problem, e.g. the execution time, scale with the problem size. Many problems in computational biology are computationally infeasible in the sense that the exhaustive search for the optimal solution is prohibitive in practical terms. As a consequence, these problems are tackled through heuristics and approximations aiming to overcome the exceeding computational requirements at the cost of providing suboptimal solutions. The importance of defining th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.07312","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1811.07312/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T03:01:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Af8coO7ej6bdCQnuldK2R9EnebtxAyjLxseQVqrhU6Wyva69V85q/0c64xiPSs8rGtB4SSRbOwDUlTXTW+97DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T17:01:26.362947Z"},"content_sha256":"105a7ce8f42df2350cadae19a81bae243b537da56c563b3aa74d10e8bd49e598","schema_version":"1.0","event_id":"sha256:105a7ce8f42df2350cadae19a81bae243b537da56c563b3aa74d10e8bd49e598"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JYTKWIMUSF3MQ26ZDMKVBM7CSU/bundle.json","state_url":"https://pith.science/pith/JYTKWIMUSF3MQ26ZDMKVBM7CSU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JYTKWIMUSF3MQ26ZDMKVBM7CSU/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-07-06T17:01:26Z","links":{"resolver":"https://pith.science/pith/JYTKWIMUSF3MQ26ZDMKVBM7CSU","bundle":"https://pith.science/pith/JYTKWIMUSF3MQ26ZDMKVBM7CSU/bundle.json","state":"https://pith.science/pith/JYTKWIMUSF3MQ26ZDMKVBM7CSU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JYTKWIMUSF3MQ26ZDMKVBM7CSU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JYTKWIMUSF3MQ26ZDMKVBM7CSU","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":"9f7e766687a9005dca53d7bb5790eeedf52c6167b39ce74ded4ae972478ee176","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CC","submitted_at":"2018-11-18T10:45:20Z","title_canon_sha256":"3928cceee0ceb4da2e5de8950f18a5056504c50dd41fcdf4705ad876f29c41e3"},"schema_version":"1.0","source":{"id":"1811.07312","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.07312","created_at":"2026-07-05T03:01:20Z"},{"alias_kind":"arxiv_version","alias_value":"1811.07312v2","created_at":"2026-07-05T03:01:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.07312","created_at":"2026-07-05T03:01:20Z"},{"alias_kind":"pith_short_12","alias_value":"JYTKWIMUSF3M","created_at":"2026-07-05T03:01:20Z"},{"alias_kind":"pith_short_16","alias_value":"JYTKWIMUSF3MQ26Z","created_at":"2026-07-05T03:01:20Z"},{"alias_kind":"pith_short_8","alias_value":"JYTKWIMU","created_at":"2026-07-05T03:01:20Z"}],"graph_snapshots":[{"event_id":"sha256:105a7ce8f42df2350cadae19a81bae243b537da56c563b3aa74d10e8bd49e598","target":"graph","created_at":"2026-07-05T03:01:20Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1811.07312/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Computational problems can be classified according to their algorithmic complexity, which is defined based on how the resources needed to solve the problem, e.g. the execution time, scale with the problem size. Many problems in computational biology are computationally infeasible in the sense that the exhaustive search for the optimal solution is prohibitive in practical terms. As a consequence, these problems are tackled through heuristics and approximations aiming to overcome the exceeding computational requirements at the cost of providing suboptimal solutions. The importance of defining th","authors_text":"Alfonso Valencia, Davide Cirillo, Miguel Ponce-de-Leon","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CC","submitted_at":"2018-11-18T10:45:20Z","title":"Algorithmic complexity in computational biology: basics, challenges and limitations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.07312","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:71a9523b950e28ad44ffe8733514d29eec0b55fc12a9adf798e60f8e17cd2b2f","target":"record","created_at":"2026-07-05T03:01:20Z","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":"9f7e766687a9005dca53d7bb5790eeedf52c6167b39ce74ded4ae972478ee176","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CC","submitted_at":"2018-11-18T10:45:20Z","title_canon_sha256":"3928cceee0ceb4da2e5de8950f18a5056504c50dd41fcdf4705ad876f29c41e3"},"schema_version":"1.0","source":{"id":"1811.07312","kind":"arxiv","version":2}},"canonical_sha256":"4e26ab21949176c86bd91b1550b3e295303d46cdcde3d042bf845fbf1237ad0a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4e26ab21949176c86bd91b1550b3e295303d46cdcde3d042bf845fbf1237ad0a","first_computed_at":"2026-07-05T03:01:20.099703Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:01:20.099703Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HopjxTXoMaLzKGTPxFpgBsKmwjLdkHLCfQYp6QNdtogCecYnAoxIOcCEqh0K9aTyvnI1SwYyn9H74Wi3Ah5JDw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:01:20.100176Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.07312","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:71a9523b950e28ad44ffe8733514d29eec0b55fc12a9adf798e60f8e17cd2b2f","sha256:105a7ce8f42df2350cadae19a81bae243b537da56c563b3aa74d10e8bd49e598"],"state_sha256":"f263102ce6ed34aac8375d5525f212b34edf00ce943cf1d184c78372f0e9f537"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jVqODyjagNic0TF4chIOJ0hW88sjpp3d5xs1vavPsEq5kb39HjonsvCEr9xSMin8Y/Iwt0PlPnLx6aF4jFYnCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T17:01:26.364862Z","bundle_sha256":"7e8212ff9055d920217042d1842b08e835156bc7e542eb25676ca9b5afbfb436"}}