{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:GIBKQVKO4NN3QRB5ZEWVOT4VEK","short_pith_number":"pith:GIBKQVKO","canonical_record":{"source":{"id":"1410.0329","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-10-01T19:02:20Z","cross_cats_sorted":[],"title_canon_sha256":"0c501cdc366ff03d201d3e2377b862bcf4666767d5bffe01f64383be19a28e55","abstract_canon_sha256":"6b756a6144bdb7ec443adb05d1d994b551f191bbf6a1ab8ceb55de75c7e580e7"},"schema_version":"1.0"},"canonical_sha256":"3202a8554ee35bb8443dc92d574f95228186900d1e6fff243bca978adef40bc9","source":{"kind":"arxiv","id":"1410.0329","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.0329","created_at":"2026-05-18T02:41:17Z"},{"alias_kind":"arxiv_version","alias_value":"1410.0329v1","created_at":"2026-05-18T02:41:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.0329","created_at":"2026-05-18T02:41:17Z"},{"alias_kind":"pith_short_12","alias_value":"GIBKQVKO4NN3","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GIBKQVKO4NN3QRB5","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GIBKQVKO","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:GIBKQVKO4NN3QRB5ZEWVOT4VEK","target":"record","payload":{"canonical_record":{"source":{"id":"1410.0329","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-10-01T19:02:20Z","cross_cats_sorted":[],"title_canon_sha256":"0c501cdc366ff03d201d3e2377b862bcf4666767d5bffe01f64383be19a28e55","abstract_canon_sha256":"6b756a6144bdb7ec443adb05d1d994b551f191bbf6a1ab8ceb55de75c7e580e7"},"schema_version":"1.0"},"canonical_sha256":"3202a8554ee35bb8443dc92d574f95228186900d1e6fff243bca978adef40bc9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:17.548499Z","signature_b64":"1H0+frl+l3qpUVmdnCPLGtx/PXMpLu7JJT+ZvoGAKRjeXW+ifaRrnzoo+CLN0vGtWyy/lDf/uNbsWh+7Zw0oBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3202a8554ee35bb8443dc92d574f95228186900d1e6fff243bca978adef40bc9","last_reissued_at":"2026-05-18T02:41:17.547859Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:17.547859Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.0329","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:41:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0lRYaAFzhe90bpaDIBpwJFfdX9W//a/gWeGAxcv3EMCpvAjx/Fueo9i4pDLxdR5xwNn5weJFBVF7R9EivKE0Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T05:03:21.543985Z"},"content_sha256":"b949eec44ee51c6bac4214b802534fe8f718c83e0126d0e7366eb01ea0cbf452","schema_version":"1.0","event_id":"sha256:b949eec44ee51c6bac4214b802534fe8f718c83e0126d0e7366eb01ea0cbf452"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:GIBKQVKO4NN3QRB5ZEWVOT4VEK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parallel scheduling of task trees with limited memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Fr\\'ed\\'eric Vivien (ENS Lyon / CNRS / Inria Grenoble Rh\\^one-Alpes, INRIA Bordeaux - Sud-Ouest), Lionel Eyraud-Dubois (LaBRI, LIP), Loris Marchal (ENS Lyon / CNRS / Inria Grenoble Rh\\^one-Alpes, Oliver Sinnen (ECE)","submitted_at":"2014-10-01T19:02:20Z","abstract_excerpt":"This paper investigates the execution of tree-shaped task graphs using multiple processors. Each edge of such a tree represents some large data. A task can only be executed if all input and output data fit into memory, and a data can only be removed from memory after the completion of the task that uses it as an input data. Such trees arise, for instance, in the multifrontal method of sparse matrix factorization. The peak memory needed for the processing of the entire tree depends on the execution order of the tasks. With one processor the objective of the tree traversal is to minimize the req"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.0329","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:41:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bSqjqYBo/5/lKrVLXRJAzLey6fMpNR5BxztHEVQcyDU0zjBm7qOMC3OP3FbNFaJ+gHBRNbhlMczY1s3JfSLWAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T05:03:21.544341Z"},"content_sha256":"bc502edc0a2e08e4d1eb1b70c2c5b9cb9996f6e75fc308482d6932d594352bb1","schema_version":"1.0","event_id":"sha256:bc502edc0a2e08e4d1eb1b70c2c5b9cb9996f6e75fc308482d6932d594352bb1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GIBKQVKO4NN3QRB5ZEWVOT4VEK/bundle.json","state_url":"https://pith.science/pith/GIBKQVKO4NN3QRB5ZEWVOT4VEK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GIBKQVKO4NN3QRB5ZEWVOT4VEK/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-24T05:03:21Z","links":{"resolver":"https://pith.science/pith/GIBKQVKO4NN3QRB5ZEWVOT4VEK","bundle":"https://pith.science/pith/GIBKQVKO4NN3QRB5ZEWVOT4VEK/bundle.json","state":"https://pith.science/pith/GIBKQVKO4NN3QRB5ZEWVOT4VEK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GIBKQVKO4NN3QRB5ZEWVOT4VEK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:GIBKQVKO4NN3QRB5ZEWVOT4VEK","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":"6b756a6144bdb7ec443adb05d1d994b551f191bbf6a1ab8ceb55de75c7e580e7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-10-01T19:02:20Z","title_canon_sha256":"0c501cdc366ff03d201d3e2377b862bcf4666767d5bffe01f64383be19a28e55"},"schema_version":"1.0","source":{"id":"1410.0329","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.0329","created_at":"2026-05-18T02:41:17Z"},{"alias_kind":"arxiv_version","alias_value":"1410.0329v1","created_at":"2026-05-18T02:41:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.0329","created_at":"2026-05-18T02:41:17Z"},{"alias_kind":"pith_short_12","alias_value":"GIBKQVKO4NN3","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GIBKQVKO4NN3QRB5","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GIBKQVKO","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:bc502edc0a2e08e4d1eb1b70c2c5b9cb9996f6e75fc308482d6932d594352bb1","target":"graph","created_at":"2026-05-18T02:41:17Z","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 investigates the execution of tree-shaped task graphs using multiple processors. Each edge of such a tree represents some large data. A task can only be executed if all input and output data fit into memory, and a data can only be removed from memory after the completion of the task that uses it as an input data. Such trees arise, for instance, in the multifrontal method of sparse matrix factorization. The peak memory needed for the processing of the entire tree depends on the execution order of the tasks. With one processor the objective of the tree traversal is to minimize the req","authors_text":"Fr\\'ed\\'eric Vivien (ENS Lyon / CNRS / Inria Grenoble Rh\\^one-Alpes, INRIA Bordeaux - Sud-Ouest), Lionel Eyraud-Dubois (LaBRI, LIP), Loris Marchal (ENS Lyon / CNRS / Inria Grenoble Rh\\^one-Alpes, Oliver Sinnen (ECE)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-10-01T19:02:20Z","title":"Parallel scheduling of task trees with limited memory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.0329","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:b949eec44ee51c6bac4214b802534fe8f718c83e0126d0e7366eb01ea0cbf452","target":"record","created_at":"2026-05-18T02:41:17Z","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":"6b756a6144bdb7ec443adb05d1d994b551f191bbf6a1ab8ceb55de75c7e580e7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-10-01T19:02:20Z","title_canon_sha256":"0c501cdc366ff03d201d3e2377b862bcf4666767d5bffe01f64383be19a28e55"},"schema_version":"1.0","source":{"id":"1410.0329","kind":"arxiv","version":1}},"canonical_sha256":"3202a8554ee35bb8443dc92d574f95228186900d1e6fff243bca978adef40bc9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3202a8554ee35bb8443dc92d574f95228186900d1e6fff243bca978adef40bc9","first_computed_at":"2026-05-18T02:41:17.547859Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:41:17.547859Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1H0+frl+l3qpUVmdnCPLGtx/PXMpLu7JJT+ZvoGAKRjeXW+ifaRrnzoo+CLN0vGtWyy/lDf/uNbsWh+7Zw0oBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:41:17.548499Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.0329","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b949eec44ee51c6bac4214b802534fe8f718c83e0126d0e7366eb01ea0cbf452","sha256:bc502edc0a2e08e4d1eb1b70c2c5b9cb9996f6e75fc308482d6932d594352bb1"],"state_sha256":"353e00de0e54083e770e079b9fcbf1d0ba250000391e63b3ffe39db8e0cba072"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Tl2xmUh3t6X7DPcH5cVljGXQPqIbyRtorwhJhRTNyGNWF1rK7Vx0ICG01xNC/vfnaKsJZGhccThwx3V6nD4CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T05:03:21.546305Z","bundle_sha256":"d593391f48c4bb838317af8c1318bfcfac27a884d0c450fe4590e3f36c3aeb82"}}