{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:WVJRSAC34S2KV5QY3YAA7LI5FT","short_pith_number":"pith:WVJRSAC3","canonical_record":{"source":{"id":"1701.05431","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-01-19T14:29:17Z","cross_cats_sorted":["cs.MS","math.NA"],"title_canon_sha256":"941dc3571aa2fd2f3de80289344b037ea3923cb2695a511ed6410ef9c248e566","abstract_canon_sha256":"692664d987e8e592fcf5751496816fbf693c8170a5610777d4c6de590a64e5ea"},"schema_version":"1.0"},"canonical_sha256":"b55319005be4b4aaf618de000fad1d2ccbbf45d2801f0be5371521e935169cf2","source":{"kind":"arxiv","id":"1701.05431","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.05431","created_at":"2026-05-18T00:52:29Z"},{"alias_kind":"arxiv_version","alias_value":"1701.05431v1","created_at":"2026-05-18T00:52:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05431","created_at":"2026-05-18T00:52:29Z"},{"alias_kind":"pith_short_12","alias_value":"WVJRSAC34S2K","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WVJRSAC34S2KV5QY","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WVJRSAC3","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:WVJRSAC34S2KV5QY3YAA7LI5FT","target":"record","payload":{"canonical_record":{"source":{"id":"1701.05431","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-01-19T14:29:17Z","cross_cats_sorted":["cs.MS","math.NA"],"title_canon_sha256":"941dc3571aa2fd2f3de80289344b037ea3923cb2695a511ed6410ef9c248e566","abstract_canon_sha256":"692664d987e8e592fcf5751496816fbf693c8170a5610777d4c6de590a64e5ea"},"schema_version":"1.0"},"canonical_sha256":"b55319005be4b4aaf618de000fad1d2ccbbf45d2801f0be5371521e935169cf2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:29.567498Z","signature_b64":"YWa6jFwX72oTjSLGZzyZSMW4TyYaOISb1Eg1zHlF18LWlpehtX10JYyW16NxSJmE1OaxQuE2+P2p5jHBfy/7DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b55319005be4b4aaf618de000fad1d2ccbbf45d2801f0be5371521e935169cf2","last_reissued_at":"2026-05-18T00:52:29.566582Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:29.566582Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.05431","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:52:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PgfPtUhvAj4UMzc63g+b9dWStcpPfXjTQYlIDE/cvIVjFmIzPH8PFup0rEyOlgs+dfa89DWtWd6/1TLpkaZkDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:42:25.159275Z"},"content_sha256":"798d0db8bd4f695f055ab10343ce3a2bacc320d7c72db7108327fb1ea0d4f811","schema_version":"1.0","event_id":"sha256:798d0db8bd4f695f055ab10343ce3a2bacc320d7c72db7108327fb1ea0d4f811"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:WVJRSAC34S2KV5QY3YAA7LI5FT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A task-driven implementation of a simple numerical solver for hyperbolic conservation laws","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS","math.NA"],"primary_cat":"cs.DC","authors_text":"Adam Larat (FR3487, EM2C), FR3487, Jonathan Jung (LMAP), Milan Pelletier (EM2C), Mohamed Essadki (IFPEN, Vincent Perrier (LMAP)","submitted_at":"2017-01-19T14:29:17Z","abstract_excerpt":"This article describes the implementation of an all-in-one numerical procedure within the runtime StarPU. In order to limit the complexity of the method, for the sake of clarity of the presentation of the non-classical task-driven programming environnement, we have limited the numerics to first order in space and time. Results show that the task distribution is efficient if the tasks are numerous and individually large enough so that the task heap can be saturated by tasks which computational time covers the task management overhead. Next, we also see that even though they are mostly faster on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.05431","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:52:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"el4nLcOWf2Un0KMJBNMVA54bhoHV/3n/r6SWZxGiRC5zYFxrhkq2HdHQvLiK2Hv/T1knjnrfoh41LUbEMpH9Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:42:25.159624Z"},"content_sha256":"e8e32b70d4da2bac033c4ff6a802e65ea7bf2a93ee905693467772567d7d515d","schema_version":"1.0","event_id":"sha256:e8e32b70d4da2bac033c4ff6a802e65ea7bf2a93ee905693467772567d7d515d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WVJRSAC34S2KV5QY3YAA7LI5FT/bundle.json","state_url":"https://pith.science/pith/WVJRSAC34S2KV5QY3YAA7LI5FT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WVJRSAC34S2KV5QY3YAA7LI5FT/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-02T14:42:25Z","links":{"resolver":"https://pith.science/pith/WVJRSAC34S2KV5QY3YAA7LI5FT","bundle":"https://pith.science/pith/WVJRSAC34S2KV5QY3YAA7LI5FT/bundle.json","state":"https://pith.science/pith/WVJRSAC34S2KV5QY3YAA7LI5FT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WVJRSAC34S2KV5QY3YAA7LI5FT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:WVJRSAC34S2KV5QY3YAA7LI5FT","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":"692664d987e8e592fcf5751496816fbf693c8170a5610777d4c6de590a64e5ea","cross_cats_sorted":["cs.MS","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-01-19T14:29:17Z","title_canon_sha256":"941dc3571aa2fd2f3de80289344b037ea3923cb2695a511ed6410ef9c248e566"},"schema_version":"1.0","source":{"id":"1701.05431","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.05431","created_at":"2026-05-18T00:52:29Z"},{"alias_kind":"arxiv_version","alias_value":"1701.05431v1","created_at":"2026-05-18T00:52:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05431","created_at":"2026-05-18T00:52:29Z"},{"alias_kind":"pith_short_12","alias_value":"WVJRSAC34S2K","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WVJRSAC34S2KV5QY","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WVJRSAC3","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:e8e32b70d4da2bac033c4ff6a802e65ea7bf2a93ee905693467772567d7d515d","target":"graph","created_at":"2026-05-18T00:52: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 article describes the implementation of an all-in-one numerical procedure within the runtime StarPU. In order to limit the complexity of the method, for the sake of clarity of the presentation of the non-classical task-driven programming environnement, we have limited the numerics to first order in space and time. Results show that the task distribution is efficient if the tasks are numerous and individually large enough so that the task heap can be saturated by tasks which computational time covers the task management overhead. Next, we also see that even though they are mostly faster on","authors_text":"Adam Larat (FR3487, EM2C), FR3487, Jonathan Jung (LMAP), Milan Pelletier (EM2C), Mohamed Essadki (IFPEN, Vincent Perrier (LMAP)","cross_cats":["cs.MS","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-01-19T14:29:17Z","title":"A task-driven implementation of a simple numerical solver for hyperbolic conservation laws"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.05431","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:798d0db8bd4f695f055ab10343ce3a2bacc320d7c72db7108327fb1ea0d4f811","target":"record","created_at":"2026-05-18T00:52: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":"692664d987e8e592fcf5751496816fbf693c8170a5610777d4c6de590a64e5ea","cross_cats_sorted":["cs.MS","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-01-19T14:29:17Z","title_canon_sha256":"941dc3571aa2fd2f3de80289344b037ea3923cb2695a511ed6410ef9c248e566"},"schema_version":"1.0","source":{"id":"1701.05431","kind":"arxiv","version":1}},"canonical_sha256":"b55319005be4b4aaf618de000fad1d2ccbbf45d2801f0be5371521e935169cf2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b55319005be4b4aaf618de000fad1d2ccbbf45d2801f0be5371521e935169cf2","first_computed_at":"2026-05-18T00:52:29.566582Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:29.566582Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YWa6jFwX72oTjSLGZzyZSMW4TyYaOISb1Eg1zHlF18LWlpehtX10JYyW16NxSJmE1OaxQuE2+P2p5jHBfy/7DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:29.567498Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.05431","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:798d0db8bd4f695f055ab10343ce3a2bacc320d7c72db7108327fb1ea0d4f811","sha256:e8e32b70d4da2bac033c4ff6a802e65ea7bf2a93ee905693467772567d7d515d"],"state_sha256":"71b87ff6a9b0cd4c364eeb5dfc42a8cda6b8c6b919905cd2fa19918cdd72593d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OUDjqYXw8HxWXwUmUT9IHr7dDXWFuDbq9+ucTy2jp5ex0G/gsxgmXGJ+8o1mYDmzek7ddKUTSDD2AIH+CjvuBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T14:42:25.161491Z","bundle_sha256":"c050c9fc9b9d89fb1bc97a47636a7d9fe48276a311062dba12fe6613d1dc1f46"}}