{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:CSOSYHEF4GCARQXQZA5XYS3JEM","short_pith_number":"pith:CSOSYHEF","canonical_record":{"source":{"id":"1610.05512","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2016-10-18T09:54:14Z","cross_cats_sorted":[],"title_canon_sha256":"25716446ddd802a78ab14187c3c0d0d50fa494cc8c081c1c8d046080d2744f63","abstract_canon_sha256":"75f334316a09206dfd02218ed39ac949f233d2da913679984e309d3f3a16deff"},"schema_version":"1.0"},"canonical_sha256":"149d2c1c85e18408c2f0c83b7c4b6923260551a055e3b7d0f2ae790a647d735a","source":{"kind":"arxiv","id":"1610.05512","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.05512","created_at":"2026-05-18T01:01:59Z"},{"alias_kind":"arxiv_version","alias_value":"1610.05512v1","created_at":"2026-05-18T01:01:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.05512","created_at":"2026-05-18T01:01:59Z"},{"alias_kind":"pith_short_12","alias_value":"CSOSYHEF4GCA","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CSOSYHEF4GCARQXQ","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CSOSYHEF","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:CSOSYHEF4GCARQXQZA5XYS3JEM","target":"record","payload":{"canonical_record":{"source":{"id":"1610.05512","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2016-10-18T09:54:14Z","cross_cats_sorted":[],"title_canon_sha256":"25716446ddd802a78ab14187c3c0d0d50fa494cc8c081c1c8d046080d2744f63","abstract_canon_sha256":"75f334316a09206dfd02218ed39ac949f233d2da913679984e309d3f3a16deff"},"schema_version":"1.0"},"canonical_sha256":"149d2c1c85e18408c2f0c83b7c4b6923260551a055e3b7d0f2ae790a647d735a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:59.139754Z","signature_b64":"u/Cz5EpOTsWQp7hZv+WPdbpkY5z5Dn3++K66rLAdIQy2SuGZgUmirp40tYd33Yrpsa2AhrXTCBUDd19kObDmDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"149d2c1c85e18408c2f0c83b7c4b6923260551a055e3b7d0f2ae790a647d735a","last_reissued_at":"2026-05-18T01:01:59.139247Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:59.139247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.05512","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:01:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1fLNQyA5GOTM6CZswkvqUTsYn/8+k2kVLwxSV2hm34jE6zTaVEA+rx4UY1RvlksTSsnCQdMtlZW+oSgAmQ2qCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:35:06.581294Z"},"content_sha256":"c298e192c1f554276885ca3de703119bf48a05e3352c6fbc7d0cb2c5c543d62d","schema_version":"1.0","event_id":"sha256:c298e192c1f554276885ca3de703119bf48a05e3352c6fbc7d0cb2c5c543d62d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:CSOSYHEF4GCARQXQZA5XYS3JEM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards a HPC-oriented parallel implementation of a learning algorithm for bioinformatics applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"q-bio.QM","authors_text":"Gianni D'Angelo, Salvatore Rampone","submitted_at":"2016-10-18T09:54:14Z","abstract_excerpt":"Background: The huge quantity of data produced in Biomedical research needs sophisticated algorithmic methodologies for its storage, analysis, and processing. High Performance Computing (HPC) appears as a magic bullet in this challenge. However, several hard to solve parallelization and load balancing problems arise in this context. Here we discuss the HPC-oriented implementation of a general purpose learning algorithm, originally conceived for DNA analysis and recently extended to treat uncertainty on data (U BRAIN). The U-BRAIN algorithm is a learning algorithm that finds a Boolean formula i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.05512","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:01:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UL8PmhNfNVLVeFQxB0y/RGmtoHn5ZQMermLIFZYvCtO2IY4mVmYFL/vDye7jznR6lZTK1tntF1Wsm6oHcsjLAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:35:06.581665Z"},"content_sha256":"cc12f92c7d6d22ebb55968bbb315ad0e5cff73fbf717cf2a60c43a07fbe04154","schema_version":"1.0","event_id":"sha256:cc12f92c7d6d22ebb55968bbb315ad0e5cff73fbf717cf2a60c43a07fbe04154"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CSOSYHEF4GCARQXQZA5XYS3JEM/bundle.json","state_url":"https://pith.science/pith/CSOSYHEF4GCARQXQZA5XYS3JEM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CSOSYHEF4GCARQXQZA5XYS3JEM/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-02T20:35:06Z","links":{"resolver":"https://pith.science/pith/CSOSYHEF4GCARQXQZA5XYS3JEM","bundle":"https://pith.science/pith/CSOSYHEF4GCARQXQZA5XYS3JEM/bundle.json","state":"https://pith.science/pith/CSOSYHEF4GCARQXQZA5XYS3JEM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CSOSYHEF4GCARQXQZA5XYS3JEM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:CSOSYHEF4GCARQXQZA5XYS3JEM","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":"75f334316a09206dfd02218ed39ac949f233d2da913679984e309d3f3a16deff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2016-10-18T09:54:14Z","title_canon_sha256":"25716446ddd802a78ab14187c3c0d0d50fa494cc8c081c1c8d046080d2744f63"},"schema_version":"1.0","source":{"id":"1610.05512","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.05512","created_at":"2026-05-18T01:01:59Z"},{"alias_kind":"arxiv_version","alias_value":"1610.05512v1","created_at":"2026-05-18T01:01:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.05512","created_at":"2026-05-18T01:01:59Z"},{"alias_kind":"pith_short_12","alias_value":"CSOSYHEF4GCA","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CSOSYHEF4GCARQXQ","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CSOSYHEF","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:cc12f92c7d6d22ebb55968bbb315ad0e5cff73fbf717cf2a60c43a07fbe04154","target":"graph","created_at":"2026-05-18T01:01:59Z","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":"Background: The huge quantity of data produced in Biomedical research needs sophisticated algorithmic methodologies for its storage, analysis, and processing. High Performance Computing (HPC) appears as a magic bullet in this challenge. However, several hard to solve parallelization and load balancing problems arise in this context. Here we discuss the HPC-oriented implementation of a general purpose learning algorithm, originally conceived for DNA analysis and recently extended to treat uncertainty on data (U BRAIN). The U-BRAIN algorithm is a learning algorithm that finds a Boolean formula i","authors_text":"Gianni D'Angelo, Salvatore Rampone","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2016-10-18T09:54:14Z","title":"Towards a HPC-oriented parallel implementation of a learning algorithm for bioinformatics applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.05512","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:c298e192c1f554276885ca3de703119bf48a05e3352c6fbc7d0cb2c5c543d62d","target":"record","created_at":"2026-05-18T01:01:59Z","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":"75f334316a09206dfd02218ed39ac949f233d2da913679984e309d3f3a16deff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2016-10-18T09:54:14Z","title_canon_sha256":"25716446ddd802a78ab14187c3c0d0d50fa494cc8c081c1c8d046080d2744f63"},"schema_version":"1.0","source":{"id":"1610.05512","kind":"arxiv","version":1}},"canonical_sha256":"149d2c1c85e18408c2f0c83b7c4b6923260551a055e3b7d0f2ae790a647d735a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"149d2c1c85e18408c2f0c83b7c4b6923260551a055e3b7d0f2ae790a647d735a","first_computed_at":"2026-05-18T01:01:59.139247Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:59.139247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u/Cz5EpOTsWQp7hZv+WPdbpkY5z5Dn3++K66rLAdIQy2SuGZgUmirp40tYd33Yrpsa2AhrXTCBUDd19kObDmDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:59.139754Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.05512","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c298e192c1f554276885ca3de703119bf48a05e3352c6fbc7d0cb2c5c543d62d","sha256:cc12f92c7d6d22ebb55968bbb315ad0e5cff73fbf717cf2a60c43a07fbe04154"],"state_sha256":"cb772b6527f6a8c6d1ff8c3cdfcbea830b657fa87677d3539e4f194cf6ce9562"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ma9k65ljwIx008mYR4ghwdfFLXHdGvQ4UTEZcdvmLr1WY4/9c2le+r4P2BHxuPl/hUgBR5RDb3W/cee38MMKAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T20:35:06.583834Z","bundle_sha256":"a12bbc41975d0a1920b45be73593b712a2a78d838aa79c2c769dc409cb4defb7"}}