{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:VPTPU522AS5K2SCA5EDQ6NWVM5","short_pith_number":"pith:VPTPU522","canonical_record":{"source":{"id":"1308.2480","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-08-12T07:45:15Z","cross_cats_sorted":[],"title_canon_sha256":"7b4c0e5ab353365cde7b63d003730fa0426e4590e2d74a946f86afeb498f42ab","abstract_canon_sha256":"c8964fa5bf2edcbab121b92277eea107344ae9122ba2d1eb1535101f15555af5"},"schema_version":"1.0"},"canonical_sha256":"abe6fa775a04baad4840e9070f36d5676f6a62f6aa35914aef0f9976eb4ef34b","source":{"kind":"arxiv","id":"1308.2480","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.2480","created_at":"2026-05-18T03:16:07Z"},{"alias_kind":"arxiv_version","alias_value":"1308.2480v1","created_at":"2026-05-18T03:16:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.2480","created_at":"2026-05-18T03:16:07Z"},{"alias_kind":"pith_short_12","alias_value":"VPTPU522AS5K","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VPTPU522AS5K2SCA","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VPTPU522","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:VPTPU522AS5K2SCA5EDQ6NWVM5","target":"record","payload":{"canonical_record":{"source":{"id":"1308.2480","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-08-12T07:45:15Z","cross_cats_sorted":[],"title_canon_sha256":"7b4c0e5ab353365cde7b63d003730fa0426e4590e2d74a946f86afeb498f42ab","abstract_canon_sha256":"c8964fa5bf2edcbab121b92277eea107344ae9122ba2d1eb1535101f15555af5"},"schema_version":"1.0"},"canonical_sha256":"abe6fa775a04baad4840e9070f36d5676f6a62f6aa35914aef0f9976eb4ef34b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:16:07.263617Z","signature_b64":"zaBclAfFK5lFwjHDwb8s8vi47mwr2qu1wjMJzdyFeOx5j0p0bg7NiXBnp1FUHArlatiPDpVZiBlfeZrnBceDBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"abe6fa775a04baad4840e9070f36d5676f6a62f6aa35914aef0f9976eb4ef34b","last_reissued_at":"2026-05-18T03:16:07.263068Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:16:07.263068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.2480","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-18T03:16:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r4w4cUBzF+dkRwcXsuLj4pgojAieKz7CSAGTPJ7qmffei38sjSoDmADjU9MogaSGy0/oO2DLlsvaoWdSthSfCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T15:58:58.172793Z"},"content_sha256":"787ffc932a0135d3689ce809fa7d4fcdc7643386014df024aaa350cf50d62982","schema_version":"1.0","event_id":"sha256:787ffc932a0135d3689ce809fa7d4fcdc7643386014df024aaa350cf50d62982"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:VPTPU522AS5K2SCA5EDQ6NWVM5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A thread-parallel algorithm for anisotropic mesh adaptation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Georgios Rokos, Gerard J. Gorman, James Southern, Paul H.J. Kelly","submitted_at":"2013-08-12T07:45:15Z","abstract_excerpt":"Anisotropic mesh adaptation is a powerful way to directly minimise the computational cost of mesh based simulation. It is particularly important for multi-scale problems where the required number of floating-point operations can be reduced by orders of magnitude relative to more traditional static mesh approaches.\n  Increasingly, finite element and finite volume codes are being optimised for modern multi-core architectures. Typically, decomposition methods implemented through the Message Passing Interface (MPI) are applied for inter-node parallelisation, while a threaded programming model, suc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.2480","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-18T03:16:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vro7dv1DTa/uUT5PdPyiJsbransCdRcu3XgC6UuEOZ9APe4YdFESnywXvtMa0/PqsvU2G2aLfv/6ExKQysrrDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T15:58:58.173539Z"},"content_sha256":"4118416415d45bb9bc3c71e8f4d4867eb416fa9860e3081011367da8d6091980","schema_version":"1.0","event_id":"sha256:4118416415d45bb9bc3c71e8f4d4867eb416fa9860e3081011367da8d6091980"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VPTPU522AS5K2SCA5EDQ6NWVM5/bundle.json","state_url":"https://pith.science/pith/VPTPU522AS5K2SCA5EDQ6NWVM5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VPTPU522AS5K2SCA5EDQ6NWVM5/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-06T15:58:58Z","links":{"resolver":"https://pith.science/pith/VPTPU522AS5K2SCA5EDQ6NWVM5","bundle":"https://pith.science/pith/VPTPU522AS5K2SCA5EDQ6NWVM5/bundle.json","state":"https://pith.science/pith/VPTPU522AS5K2SCA5EDQ6NWVM5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VPTPU522AS5K2SCA5EDQ6NWVM5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:VPTPU522AS5K2SCA5EDQ6NWVM5","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":"c8964fa5bf2edcbab121b92277eea107344ae9122ba2d1eb1535101f15555af5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-08-12T07:45:15Z","title_canon_sha256":"7b4c0e5ab353365cde7b63d003730fa0426e4590e2d74a946f86afeb498f42ab"},"schema_version":"1.0","source":{"id":"1308.2480","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.2480","created_at":"2026-05-18T03:16:07Z"},{"alias_kind":"arxiv_version","alias_value":"1308.2480v1","created_at":"2026-05-18T03:16:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.2480","created_at":"2026-05-18T03:16:07Z"},{"alias_kind":"pith_short_12","alias_value":"VPTPU522AS5K","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VPTPU522AS5K2SCA","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VPTPU522","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:4118416415d45bb9bc3c71e8f4d4867eb416fa9860e3081011367da8d6091980","target":"graph","created_at":"2026-05-18T03:16:07Z","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":"Anisotropic mesh adaptation is a powerful way to directly minimise the computational cost of mesh based simulation. It is particularly important for multi-scale problems where the required number of floating-point operations can be reduced by orders of magnitude relative to more traditional static mesh approaches.\n  Increasingly, finite element and finite volume codes are being optimised for modern multi-core architectures. Typically, decomposition methods implemented through the Message Passing Interface (MPI) are applied for inter-node parallelisation, while a threaded programming model, suc","authors_text":"Georgios Rokos, Gerard J. Gorman, James Southern, Paul H.J. Kelly","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-08-12T07:45:15Z","title":"A thread-parallel algorithm for anisotropic mesh adaptation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.2480","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:787ffc932a0135d3689ce809fa7d4fcdc7643386014df024aaa350cf50d62982","target":"record","created_at":"2026-05-18T03:16:07Z","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":"c8964fa5bf2edcbab121b92277eea107344ae9122ba2d1eb1535101f15555af5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-08-12T07:45:15Z","title_canon_sha256":"7b4c0e5ab353365cde7b63d003730fa0426e4590e2d74a946f86afeb498f42ab"},"schema_version":"1.0","source":{"id":"1308.2480","kind":"arxiv","version":1}},"canonical_sha256":"abe6fa775a04baad4840e9070f36d5676f6a62f6aa35914aef0f9976eb4ef34b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"abe6fa775a04baad4840e9070f36d5676f6a62f6aa35914aef0f9976eb4ef34b","first_computed_at":"2026-05-18T03:16:07.263068Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:16:07.263068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zaBclAfFK5lFwjHDwb8s8vi47mwr2qu1wjMJzdyFeOx5j0p0bg7NiXBnp1FUHArlatiPDpVZiBlfeZrnBceDBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:16:07.263617Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.2480","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:787ffc932a0135d3689ce809fa7d4fcdc7643386014df024aaa350cf50d62982","sha256:4118416415d45bb9bc3c71e8f4d4867eb416fa9860e3081011367da8d6091980"],"state_sha256":"315ec4c20917e50696737e809cdc9e89761cbe38be7c169956491a9c1a1a101e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZSbKQJTEOIzaLh9kkAu6ItysyE/0uoAG0+LqRViR6YCHWzxYes/J3AY9MMFolUZ2Nf7lKUGyRc7U4uU5CZv8BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T15:58:58.177271Z","bundle_sha256":"e324ceb19efcbccb55625ae9f006b8027a1eaa81407c666970aff0a574eeb509"}}