{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:LKNFMSVQA3WCHUMVILDUADABLB","short_pith_number":"pith:LKNFMSVQ","canonical_record":{"source":{"id":"1603.03502","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-03-11T02:26:11Z","cross_cats_sorted":[],"title_canon_sha256":"ebadeb7d29355e7e175aecc05c1ffb87b3791bf1898cdcc3e832f65322d0c385","abstract_canon_sha256":"ef2f8b209751ce7bf4b1cb72f74c70ef2ccf87c43e14d7fd68ebdcf0757b45a0"},"schema_version":"1.0"},"canonical_sha256":"5a9a564ab006ec23d19542c7400c01586bc284466b784d12c8d64ecfc7e051ee","source":{"kind":"arxiv","id":"1603.03502","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.03502","created_at":"2026-05-18T01:19:15Z"},{"alias_kind":"arxiv_version","alias_value":"1603.03502v1","created_at":"2026-05-18T01:19:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.03502","created_at":"2026-05-18T01:19:15Z"},{"alias_kind":"pith_short_12","alias_value":"LKNFMSVQA3WC","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LKNFMSVQA3WCHUMV","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LKNFMSVQ","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:LKNFMSVQA3WCHUMVILDUADABLB","target":"record","payload":{"canonical_record":{"source":{"id":"1603.03502","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-03-11T02:26:11Z","cross_cats_sorted":[],"title_canon_sha256":"ebadeb7d29355e7e175aecc05c1ffb87b3791bf1898cdcc3e832f65322d0c385","abstract_canon_sha256":"ef2f8b209751ce7bf4b1cb72f74c70ef2ccf87c43e14d7fd68ebdcf0757b45a0"},"schema_version":"1.0"},"canonical_sha256":"5a9a564ab006ec23d19542c7400c01586bc284466b784d12c8d64ecfc7e051ee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:15.468907Z","signature_b64":"lspjC2Zhp0SjVn6AycAshPlVOqs1l/YrdmxCohIv44SJA9n005+zYHz3MkSB2ZkroFLuKqPYrXZaYsDI/VlFDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a9a564ab006ec23d19542c7400c01586bc284466b784d12c8d64ecfc7e051ee","last_reissued_at":"2026-05-18T01:19:15.468477Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:15.468477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.03502","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:19:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HN8JIL8JMRjp7/6RV+4JmgwoMm3F9gZ1FquBSruQ+mHBMWr1An1Iui9Wx7pkW5cuy7OuYq/H/93hNxwrA9KcAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T21:20:55.736574Z"},"content_sha256":"389596013ddc08129c133ee13ea34c02e1888e9d4623e842594eac5ea9923ac5","schema_version":"1.0","event_id":"sha256:389596013ddc08129c133ee13ea34c02e1888e9d4623e842594eac5ea9923ac5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:LKNFMSVQA3WCHUMVILDUADABLB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Checkpointing to minimize completion time for Inter-dependent Parallel Processes on Volunteer Grids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Gopal Pandurangan, Hien Nguyen, Jaspal Subhlok, Mohammad Tanvir Rahman","submitted_at":"2016-03-11T02:26:11Z","abstract_excerpt":"Volunteer computing is being used successfully for large scale scientific computations. This research is in the context of Volpex, a programming framework that supports communicating parallel processes in a volunteer environment. Redundancy and checkpointing are combined to ensure consistent forward progress with Volpex in this unique execution environment characterized by heterogeneous failure prone nodes and interdependent replicated processes. An important parameter for optimizing performance with Volpex is the frequency of checkpointing. The paper presents a mathematical model to minimize "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.03502","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:19:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uUxI2bzFJzoB/fT1F9eJawuhfJyu0OFHOGfLrT3FyoXlEx/bWFogyAijVDYBdDDH7YtqcFcp75R6CP5kR13JDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T21:20:55.736915Z"},"content_sha256":"1477c041f86a379ea39ecf538a9d8840bbbc0a94b09a95cec2d58c8fced3b3cd","schema_version":"1.0","event_id":"sha256:1477c041f86a379ea39ecf538a9d8840bbbc0a94b09a95cec2d58c8fced3b3cd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LKNFMSVQA3WCHUMVILDUADABLB/bundle.json","state_url":"https://pith.science/pith/LKNFMSVQA3WCHUMVILDUADABLB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LKNFMSVQA3WCHUMVILDUADABLB/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-30T21:20:55Z","links":{"resolver":"https://pith.science/pith/LKNFMSVQA3WCHUMVILDUADABLB","bundle":"https://pith.science/pith/LKNFMSVQA3WCHUMVILDUADABLB/bundle.json","state":"https://pith.science/pith/LKNFMSVQA3WCHUMVILDUADABLB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LKNFMSVQA3WCHUMVILDUADABLB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LKNFMSVQA3WCHUMVILDUADABLB","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":"ef2f8b209751ce7bf4b1cb72f74c70ef2ccf87c43e14d7fd68ebdcf0757b45a0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-03-11T02:26:11Z","title_canon_sha256":"ebadeb7d29355e7e175aecc05c1ffb87b3791bf1898cdcc3e832f65322d0c385"},"schema_version":"1.0","source":{"id":"1603.03502","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.03502","created_at":"2026-05-18T01:19:15Z"},{"alias_kind":"arxiv_version","alias_value":"1603.03502v1","created_at":"2026-05-18T01:19:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.03502","created_at":"2026-05-18T01:19:15Z"},{"alias_kind":"pith_short_12","alias_value":"LKNFMSVQA3WC","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LKNFMSVQA3WCHUMV","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LKNFMSVQ","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:1477c041f86a379ea39ecf538a9d8840bbbc0a94b09a95cec2d58c8fced3b3cd","target":"graph","created_at":"2026-05-18T01:19:15Z","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 is being used successfully for large scale scientific computations. This research is in the context of Volpex, a programming framework that supports communicating parallel processes in a volunteer environment. Redundancy and checkpointing are combined to ensure consistent forward progress with Volpex in this unique execution environment characterized by heterogeneous failure prone nodes and interdependent replicated processes. An important parameter for optimizing performance with Volpex is the frequency of checkpointing. The paper presents a mathematical model to minimize ","authors_text":"Gopal Pandurangan, Hien Nguyen, Jaspal Subhlok, Mohammad Tanvir Rahman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-03-11T02:26:11Z","title":"Checkpointing to minimize completion time for Inter-dependent Parallel Processes on Volunteer Grids"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.03502","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:389596013ddc08129c133ee13ea34c02e1888e9d4623e842594eac5ea9923ac5","target":"record","created_at":"2026-05-18T01:19:15Z","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":"ef2f8b209751ce7bf4b1cb72f74c70ef2ccf87c43e14d7fd68ebdcf0757b45a0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-03-11T02:26:11Z","title_canon_sha256":"ebadeb7d29355e7e175aecc05c1ffb87b3791bf1898cdcc3e832f65322d0c385"},"schema_version":"1.0","source":{"id":"1603.03502","kind":"arxiv","version":1}},"canonical_sha256":"5a9a564ab006ec23d19542c7400c01586bc284466b784d12c8d64ecfc7e051ee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5a9a564ab006ec23d19542c7400c01586bc284466b784d12c8d64ecfc7e051ee","first_computed_at":"2026-05-18T01:19:15.468477Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:15.468477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lspjC2Zhp0SjVn6AycAshPlVOqs1l/YrdmxCohIv44SJA9n005+zYHz3MkSB2ZkroFLuKqPYrXZaYsDI/VlFDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:15.468907Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.03502","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:389596013ddc08129c133ee13ea34c02e1888e9d4623e842594eac5ea9923ac5","sha256:1477c041f86a379ea39ecf538a9d8840bbbc0a94b09a95cec2d58c8fced3b3cd"],"state_sha256":"352e61cc6da811b0f2f8b21477bb67dc391bb72832b4975c719f719306fd857c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X1tIveZGQrfzEypg74/h/nLH2cNTfCkTP8gXzWeF5cUkSaEbj42SSz12wOgnaM1X7qGF+UmcQSv2bT/t0BiQDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T21:20:55.738872Z","bundle_sha256":"fc8f77bdcc09eb6ec23f0170f38da116777d9ce00b92d0539ef83d8a8374853d"}}