{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:KNZ26PTPLVYXBBNM2GRYUWCIRK","short_pith_number":"pith:KNZ26PTP","canonical_record":{"source":{"id":"1702.02204","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-12-30T19:37:29Z","cross_cats_sorted":[],"title_canon_sha256":"5eccccf3f869e81c1a52561e8186c32d0842f398f1f8c4f84d4cc50341e09665","abstract_canon_sha256":"c50c391c6da91fc17be89990377e9715cade87a51eaa250936d02baebc563332"},"schema_version":"1.0"},"canonical_sha256":"5373af3e6f5d717085acd1a38a58488a8140241d992ffc4c5b6fc38d2859ea8b","source":{"kind":"arxiv","id":"1702.02204","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.02204","created_at":"2026-05-18T00:51:06Z"},{"alias_kind":"arxiv_version","alias_value":"1702.02204v1","created_at":"2026-05-18T00:51:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.02204","created_at":"2026-05-18T00:51:06Z"},{"alias_kind":"pith_short_12","alias_value":"KNZ26PTPLVYX","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KNZ26PTPLVYXBBNM","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KNZ26PTP","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:KNZ26PTPLVYXBBNM2GRYUWCIRK","target":"record","payload":{"canonical_record":{"source":{"id":"1702.02204","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-12-30T19:37:29Z","cross_cats_sorted":[],"title_canon_sha256":"5eccccf3f869e81c1a52561e8186c32d0842f398f1f8c4f84d4cc50341e09665","abstract_canon_sha256":"c50c391c6da91fc17be89990377e9715cade87a51eaa250936d02baebc563332"},"schema_version":"1.0"},"canonical_sha256":"5373af3e6f5d717085acd1a38a58488a8140241d992ffc4c5b6fc38d2859ea8b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:06.515069Z","signature_b64":"jKsBs/XQZGxvIGK4U/Lgfs8/wMtcijCijBTL2yUNxCDqXVBoKdKB065OpAycFrHhAq+hkcHwE4PvT6YzZnb0DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5373af3e6f5d717085acd1a38a58488a8140241d992ffc4c5b6fc38d2859ea8b","last_reissued_at":"2026-05-18T00:51:06.514608Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:06.514608Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.02204","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-18T00:51:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q1FRcIr6BmAWtcuK+x9LkkmFWzVIVIgPDExYBDNtA3QX66qE/rvbEWIAYSlW+P1Agiko6ZyDMGwAIJ+q3J2dCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:46:14.933302Z"},"content_sha256":"a3cd77c3b14dfc0911b902932b551c20fa0fab6775c0c2b5529622b2ac90bd7b","schema_version":"1.0","event_id":"sha256:a3cd77c3b14dfc0911b902932b551c20fa0fab6775c0c2b5529622b2ac90bd7b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:KNZ26PTPLVYXBBNM2GRYUWCIRK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Robust Asynchronous Newton Method for Massive Scale Computing Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Boleslaw K. Szymanski, Carlos A. Varela, Heidi Newberg, Lee A. Newberg, Malik Magdon-Ismail, Travis Desell","submitted_at":"2016-12-30T19:37:29Z","abstract_excerpt":"Volunteer computing grids offer super-computing levels of computing power at the relatively low cost of operating a server. In previous work, the authors have shown that it is possible to take traditionally iterative evolutionary algorithms and execute them on volunteer computing grids by performing them asynchronously. The asynchronous implementations dramatically increase scalability and decrease the time taken to converge to a solution. Iterative and asynchronous optimization algorithms implemented using MPI on clusters and supercomputers, and BOINC on volunteer computing grids have been pa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.02204","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-18T00:51:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gdbv9HC5wmTH6hojDprnDdZsiVRAs2uBP5j7pEL6Qw/kmCnpnKaQAvIgeAXQ3hd2ofMHovNGl7KLQecEZ1pdAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:46:14.933801Z"},"content_sha256":"c5a9d73be0984293ca6ff5134100312c6a3e765fec22887ffb9a6fb02d48e0ee","schema_version":"1.0","event_id":"sha256:c5a9d73be0984293ca6ff5134100312c6a3e765fec22887ffb9a6fb02d48e0ee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KNZ26PTPLVYXBBNM2GRYUWCIRK/bundle.json","state_url":"https://pith.science/pith/KNZ26PTPLVYXBBNM2GRYUWCIRK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KNZ26PTPLVYXBBNM2GRYUWCIRK/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-27T00:46:14Z","links":{"resolver":"https://pith.science/pith/KNZ26PTPLVYXBBNM2GRYUWCIRK","bundle":"https://pith.science/pith/KNZ26PTPLVYXBBNM2GRYUWCIRK/bundle.json","state":"https://pith.science/pith/KNZ26PTPLVYXBBNM2GRYUWCIRK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KNZ26PTPLVYXBBNM2GRYUWCIRK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:KNZ26PTPLVYXBBNM2GRYUWCIRK","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":"c50c391c6da91fc17be89990377e9715cade87a51eaa250936d02baebc563332","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-12-30T19:37:29Z","title_canon_sha256":"5eccccf3f869e81c1a52561e8186c32d0842f398f1f8c4f84d4cc50341e09665"},"schema_version":"1.0","source":{"id":"1702.02204","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.02204","created_at":"2026-05-18T00:51:06Z"},{"alias_kind":"arxiv_version","alias_value":"1702.02204v1","created_at":"2026-05-18T00:51:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.02204","created_at":"2026-05-18T00:51:06Z"},{"alias_kind":"pith_short_12","alias_value":"KNZ26PTPLVYX","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KNZ26PTPLVYXBBNM","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KNZ26PTP","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:c5a9d73be0984293ca6ff5134100312c6a3e765fec22887ffb9a6fb02d48e0ee","target":"graph","created_at":"2026-05-18T00:51:06Z","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":"Volunteer computing grids offer super-computing levels of computing power at the relatively low cost of operating a server. In previous work, the authors have shown that it is possible to take traditionally iterative evolutionary algorithms and execute them on volunteer computing grids by performing them asynchronously. The asynchronous implementations dramatically increase scalability and decrease the time taken to converge to a solution. Iterative and asynchronous optimization algorithms implemented using MPI on clusters and supercomputers, and BOINC on volunteer computing grids have been pa","authors_text":"Boleslaw K. Szymanski, Carlos A. Varela, Heidi Newberg, Lee A. Newberg, Malik Magdon-Ismail, Travis Desell","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-12-30T19:37:29Z","title":"A Robust Asynchronous Newton Method for Massive Scale Computing Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.02204","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:a3cd77c3b14dfc0911b902932b551c20fa0fab6775c0c2b5529622b2ac90bd7b","target":"record","created_at":"2026-05-18T00:51:06Z","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":"c50c391c6da91fc17be89990377e9715cade87a51eaa250936d02baebc563332","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-12-30T19:37:29Z","title_canon_sha256":"5eccccf3f869e81c1a52561e8186c32d0842f398f1f8c4f84d4cc50341e09665"},"schema_version":"1.0","source":{"id":"1702.02204","kind":"arxiv","version":1}},"canonical_sha256":"5373af3e6f5d717085acd1a38a58488a8140241d992ffc4c5b6fc38d2859ea8b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5373af3e6f5d717085acd1a38a58488a8140241d992ffc4c5b6fc38d2859ea8b","first_computed_at":"2026-05-18T00:51:06.514608Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:06.514608Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jKsBs/XQZGxvIGK4U/Lgfs8/wMtcijCijBTL2yUNxCDqXVBoKdKB065OpAycFrHhAq+hkcHwE4PvT6YzZnb0DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:06.515069Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.02204","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a3cd77c3b14dfc0911b902932b551c20fa0fab6775c0c2b5529622b2ac90bd7b","sha256:c5a9d73be0984293ca6ff5134100312c6a3e765fec22887ffb9a6fb02d48e0ee"],"state_sha256":"5ff12920ccdbf134234fba94ed6debc7566c612caf065abbb48cfc69e32e6e3e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y/xP4hJ6ACO2RqLRw9IRu40rKCvFMXTicprbaFN1GQ5VNGT+/SDpfxZLB3r94C8bjUZLfv9nboz2q9FJiZNABg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T00:46:14.936140Z","bundle_sha256":"c90446a8171fd0b01cee094742c3668145812d1adb7cb621c41286bf403b25e8"}}