{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:6ELQV7Z7LYCF2DEBDNYFMZ5AMU","short_pith_number":"pith:6ELQV7Z7","canonical_record":{"source":{"id":"1404.2670","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-04-10T02:14:34Z","cross_cats_sorted":["cs.DC","cs.NA"],"title_canon_sha256":"fb340acd976e533330baf6529eae22acb331dc6438e4fd4475665f3732bd29f8","abstract_canon_sha256":"8b4c0cf8f922b2a2660a9e5ae1c58a9d9d469dc6629196f3bf1e601c8d2c3bb2"},"schema_version":"1.0"},"canonical_sha256":"f1170aff3f5e045d0c811b705667a065365fd1e761b0a0dc5f976975ce5edc76","source":{"kind":"arxiv","id":"1404.2670","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.2670","created_at":"2026-05-18T02:54:29Z"},{"alias_kind":"arxiv_version","alias_value":"1404.2670v1","created_at":"2026-05-18T02:54:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.2670","created_at":"2026-05-18T02:54:29Z"},{"alias_kind":"pith_short_12","alias_value":"6ELQV7Z7LYCF","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6ELQV7Z7LYCF2DEB","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6ELQV7Z7","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:6ELQV7Z7LYCF2DEBDNYFMZ5AMU","target":"record","payload":{"canonical_record":{"source":{"id":"1404.2670","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-04-10T02:14:34Z","cross_cats_sorted":["cs.DC","cs.NA"],"title_canon_sha256":"fb340acd976e533330baf6529eae22acb331dc6438e4fd4475665f3732bd29f8","abstract_canon_sha256":"8b4c0cf8f922b2a2660a9e5ae1c58a9d9d469dc6629196f3bf1e601c8d2c3bb2"},"schema_version":"1.0"},"canonical_sha256":"f1170aff3f5e045d0c811b705667a065365fd1e761b0a0dc5f976975ce5edc76","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:29.842542Z","signature_b64":"PGpD1ds+Wpn3FkwdBqKscOkTOfRp4A1VGGgsk9qJhljAr8kvFL62/D6A5tLhGCgAmhhshCnXcZJYfTJ8SNftBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1170aff3f5e045d0c811b705667a065365fd1e761b0a0dc5f976975ce5edc76","last_reissued_at":"2026-05-18T02:54:29.841866Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:29.841866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.2670","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-18T02:54:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zawzxXC59sYA6C3AwlsifMsFnD/azHaEZg5eiSTkgOKklPlGROKNo+c3MgvytGhgr60srgy9NMbTu+zq7X6rCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:18:06.875837Z"},"content_sha256":"d01a6dc93fcca37a44e0a2e2ccd5e6706ddddf3bc9fd118965938533a9e31e32","schema_version":"1.0","event_id":"sha256:d01a6dc93fcca37a44e0a2e2ccd5e6706ddddf3bc9fd118965938533a9e31e32"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:6ELQV7Z7LYCF2DEBDNYFMZ5AMU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable and Fault Tolerant Computation with the Sparse Grid Combination Technique","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.NA"],"primary_cat":"math.NA","authors_text":"Brendan Harding, James Southern, Jay Larson, Markus Hegland","submitted_at":"2014-04-10T02:14:34Z","abstract_excerpt":"This paper continues to develop a fault tolerant extension of the sparse grid combination technique recently proposed in [B. Harding and M. Hegland, ANZIAM J., 54 (CTAC2012), pp. C394-C411]. The approach is novel for two reasons, first it provides several levels in which one can exploit parallelism leading towards massively parallel implementations, and second, it provides algorithm-based fault tolerance so that solutions can still be recovered if failures occur during computation. We present a generalisation of the combination technique from which the fault tolerant algorithm is a consequence"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.2670","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-18T02:54:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iLDlmS34M5fg1aY48B1BA1wmYH39zJJZSTL8N0jKPGOsSItSsa/fPT+SEYhnQAf/xnI6cb5PZRYNtsod3l6IDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:18:06.876658Z"},"content_sha256":"d89f64810eb71a553a4322925ac0d60f75c36dd8083d91d7a654de3d0f4f3d91","schema_version":"1.0","event_id":"sha256:d89f64810eb71a553a4322925ac0d60f75c36dd8083d91d7a654de3d0f4f3d91"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6ELQV7Z7LYCF2DEBDNYFMZ5AMU/bundle.json","state_url":"https://pith.science/pith/6ELQV7Z7LYCF2DEBDNYFMZ5AMU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6ELQV7Z7LYCF2DEBDNYFMZ5AMU/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-27T14:18:06Z","links":{"resolver":"https://pith.science/pith/6ELQV7Z7LYCF2DEBDNYFMZ5AMU","bundle":"https://pith.science/pith/6ELQV7Z7LYCF2DEBDNYFMZ5AMU/bundle.json","state":"https://pith.science/pith/6ELQV7Z7LYCF2DEBDNYFMZ5AMU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6ELQV7Z7LYCF2DEBDNYFMZ5AMU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:6ELQV7Z7LYCF2DEBDNYFMZ5AMU","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":"8b4c0cf8f922b2a2660a9e5ae1c58a9d9d469dc6629196f3bf1e601c8d2c3bb2","cross_cats_sorted":["cs.DC","cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-04-10T02:14:34Z","title_canon_sha256":"fb340acd976e533330baf6529eae22acb331dc6438e4fd4475665f3732bd29f8"},"schema_version":"1.0","source":{"id":"1404.2670","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.2670","created_at":"2026-05-18T02:54:29Z"},{"alias_kind":"arxiv_version","alias_value":"1404.2670v1","created_at":"2026-05-18T02:54:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.2670","created_at":"2026-05-18T02:54:29Z"},{"alias_kind":"pith_short_12","alias_value":"6ELQV7Z7LYCF","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6ELQV7Z7LYCF2DEB","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6ELQV7Z7","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:d89f64810eb71a553a4322925ac0d60f75c36dd8083d91d7a654de3d0f4f3d91","target":"graph","created_at":"2026-05-18T02:54:29Z","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":"This paper continues to develop a fault tolerant extension of the sparse grid combination technique recently proposed in [B. Harding and M. Hegland, ANZIAM J., 54 (CTAC2012), pp. C394-C411]. The approach is novel for two reasons, first it provides several levels in which one can exploit parallelism leading towards massively parallel implementations, and second, it provides algorithm-based fault tolerance so that solutions can still be recovered if failures occur during computation. We present a generalisation of the combination technique from which the fault tolerant algorithm is a consequence","authors_text":"Brendan Harding, James Southern, Jay Larson, Markus Hegland","cross_cats":["cs.DC","cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-04-10T02:14:34Z","title":"Scalable and Fault Tolerant Computation with the Sparse Grid Combination Technique"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.2670","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:d01a6dc93fcca37a44e0a2e2ccd5e6706ddddf3bc9fd118965938533a9e31e32","target":"record","created_at":"2026-05-18T02:54:29Z","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":"8b4c0cf8f922b2a2660a9e5ae1c58a9d9d469dc6629196f3bf1e601c8d2c3bb2","cross_cats_sorted":["cs.DC","cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-04-10T02:14:34Z","title_canon_sha256":"fb340acd976e533330baf6529eae22acb331dc6438e4fd4475665f3732bd29f8"},"schema_version":"1.0","source":{"id":"1404.2670","kind":"arxiv","version":1}},"canonical_sha256":"f1170aff3f5e045d0c811b705667a065365fd1e761b0a0dc5f976975ce5edc76","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f1170aff3f5e045d0c811b705667a065365fd1e761b0a0dc5f976975ce5edc76","first_computed_at":"2026-05-18T02:54:29.841866Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:54:29.841866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PGpD1ds+Wpn3FkwdBqKscOkTOfRp4A1VGGgsk9qJhljAr8kvFL62/D6A5tLhGCgAmhhshCnXcZJYfTJ8SNftBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:54:29.842542Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.2670","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d01a6dc93fcca37a44e0a2e2ccd5e6706ddddf3bc9fd118965938533a9e31e32","sha256:d89f64810eb71a553a4322925ac0d60f75c36dd8083d91d7a654de3d0f4f3d91"],"state_sha256":"7b083589718b00f1ef8438cf0582168f67a59830c51decda0cd1c7f35f6089bf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b2K28jPZvN5u7pxI9cX8dL4L8ch6ERQ/mJ8blMd9HaeiCOvnLUqDYLmNiBDFG4nGKOmvgSeK/Q1G4P1ZKAOPBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T14:18:06.883247Z","bundle_sha256":"0f6a8e76dea4259583616e64b1ebafe6024cc85e48975bcd1266c2d0de12a78a"}}