{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:JR4JK5466KRSGRUQNFV5Y5I5KS","short_pith_number":"pith:JR4JK546","canonical_record":{"source":{"id":"1711.06433","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-11-17T07:09:29Z","cross_cats_sorted":[],"title_canon_sha256":"e241749aaa9affb1c5427a7712151de5387d76dd14a9085a8a1ca1b2143619b5","abstract_canon_sha256":"07c92c97839a9eab7565c37ccd27481a56c993a797a732f4b9658a052e8d44c7"},"schema_version":"1.0"},"canonical_sha256":"4c7895779ef2a3234690696bdc751d549d0793220b53a0cb38a633ba2d745189","source":{"kind":"arxiv","id":"1711.06433","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.06433","created_at":"2026-05-18T00:30:21Z"},{"alias_kind":"arxiv_version","alias_value":"1711.06433v1","created_at":"2026-05-18T00:30:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06433","created_at":"2026-05-18T00:30:21Z"},{"alias_kind":"pith_short_12","alias_value":"JR4JK5466KRS","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JR4JK5466KRSGRUQ","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JR4JK546","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:JR4JK5466KRSGRUQNFV5Y5I5KS","target":"record","payload":{"canonical_record":{"source":{"id":"1711.06433","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-11-17T07:09:29Z","cross_cats_sorted":[],"title_canon_sha256":"e241749aaa9affb1c5427a7712151de5387d76dd14a9085a8a1ca1b2143619b5","abstract_canon_sha256":"07c92c97839a9eab7565c37ccd27481a56c993a797a732f4b9658a052e8d44c7"},"schema_version":"1.0"},"canonical_sha256":"4c7895779ef2a3234690696bdc751d549d0793220b53a0cb38a633ba2d745189","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:21.103232Z","signature_b64":"wOQefnSw86dgeiXJ2UqPWppJfQE3kyvE/3615ZRYlCW2/76QE5p8b/9ZujXImPjMM6cxwhCjj5SQe7B4LA7VCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c7895779ef2a3234690696bdc751d549d0793220b53a0cb38a633ba2d745189","last_reissued_at":"2026-05-18T00:30:21.102481Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:21.102481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.06433","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:30:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XYWlIA2lo1zyVhw98ZPyxE/897xtIDj2k041ORDWp9g539p+0FNXD3qZu49W6AhMMDKxPXisWXbYR91g76T1DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T14:17:33.197956Z"},"content_sha256":"6b57c282ddf82b4bc0746e37191f4744d24982c52e02e78e9968f39baa1f7de7","schema_version":"1.0","event_id":"sha256:6b57c282ddf82b4bc0746e37191f4744d24982c52e02e78e9968f39baa1f7de7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:JR4JK5466KRSGRUQNFV5Y5I5KS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generic algorithms for scheduling applications on heterogeneous multi-core platforms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Cl\\'ement Mommessin, Denis Trystram, Giorgio Lucarelli, Marcos Amaris","submitted_at":"2017-11-17T07:09:29Z","abstract_excerpt":"We study the problem of executing an application represented by a precedence task graph on a parallel machine composed of standard computing cores and accelerators. Contrary to most existing approaches, we distinguish the allocation and the scheduling phases and we mainly focus on the allocation part of the problem: choose the most appropriate type of computing unit for each task. We address both off-line and on-line settings and design generic scheduling approaches. In the first case, we establish strong lower bounds on the worst-case performance of a known approach based on Linear Programmin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.06433","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:30:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KdzLa8pouvrsqsIQzD48jOspPOtRbTejd8ZFtECVbuxPGjFBcwDdE7gV/H0MCJbxNA0zE1n+djtTRaUikjQzDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T14:17:33.198308Z"},"content_sha256":"61d63fe3ebffcb83f724d96270989e11a748d8d183bfa771da62fc31a68207fa","schema_version":"1.0","event_id":"sha256:61d63fe3ebffcb83f724d96270989e11a748d8d183bfa771da62fc31a68207fa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JR4JK5466KRSGRUQNFV5Y5I5KS/bundle.json","state_url":"https://pith.science/pith/JR4JK5466KRSGRUQNFV5Y5I5KS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JR4JK5466KRSGRUQNFV5Y5I5KS/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-11T14:17:33Z","links":{"resolver":"https://pith.science/pith/JR4JK5466KRSGRUQNFV5Y5I5KS","bundle":"https://pith.science/pith/JR4JK5466KRSGRUQNFV5Y5I5KS/bundle.json","state":"https://pith.science/pith/JR4JK5466KRSGRUQNFV5Y5I5KS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JR4JK5466KRSGRUQNFV5Y5I5KS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JR4JK5466KRSGRUQNFV5Y5I5KS","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":"07c92c97839a9eab7565c37ccd27481a56c993a797a732f4b9658a052e8d44c7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-11-17T07:09:29Z","title_canon_sha256":"e241749aaa9affb1c5427a7712151de5387d76dd14a9085a8a1ca1b2143619b5"},"schema_version":"1.0","source":{"id":"1711.06433","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.06433","created_at":"2026-05-18T00:30:21Z"},{"alias_kind":"arxiv_version","alias_value":"1711.06433v1","created_at":"2026-05-18T00:30:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06433","created_at":"2026-05-18T00:30:21Z"},{"alias_kind":"pith_short_12","alias_value":"JR4JK5466KRS","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JR4JK5466KRSGRUQ","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JR4JK546","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:61d63fe3ebffcb83f724d96270989e11a748d8d183bfa771da62fc31a68207fa","target":"graph","created_at":"2026-05-18T00:30:21Z","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":"We study the problem of executing an application represented by a precedence task graph on a parallel machine composed of standard computing cores and accelerators. Contrary to most existing approaches, we distinguish the allocation and the scheduling phases and we mainly focus on the allocation part of the problem: choose the most appropriate type of computing unit for each task. We address both off-line and on-line settings and design generic scheduling approaches. In the first case, we establish strong lower bounds on the worst-case performance of a known approach based on Linear Programmin","authors_text":"Cl\\'ement Mommessin, Denis Trystram, Giorgio Lucarelli, Marcos Amaris","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-11-17T07:09:29Z","title":"Generic algorithms for scheduling applications on heterogeneous multi-core platforms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.06433","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:6b57c282ddf82b4bc0746e37191f4744d24982c52e02e78e9968f39baa1f7de7","target":"record","created_at":"2026-05-18T00:30:21Z","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":"07c92c97839a9eab7565c37ccd27481a56c993a797a732f4b9658a052e8d44c7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-11-17T07:09:29Z","title_canon_sha256":"e241749aaa9affb1c5427a7712151de5387d76dd14a9085a8a1ca1b2143619b5"},"schema_version":"1.0","source":{"id":"1711.06433","kind":"arxiv","version":1}},"canonical_sha256":"4c7895779ef2a3234690696bdc751d549d0793220b53a0cb38a633ba2d745189","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4c7895779ef2a3234690696bdc751d549d0793220b53a0cb38a633ba2d745189","first_computed_at":"2026-05-18T00:30:21.102481Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:21.102481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wOQefnSw86dgeiXJ2UqPWppJfQE3kyvE/3615ZRYlCW2/76QE5p8b/9ZujXImPjMM6cxwhCjj5SQe7B4LA7VCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:21.103232Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.06433","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6b57c282ddf82b4bc0746e37191f4744d24982c52e02e78e9968f39baa1f7de7","sha256:61d63fe3ebffcb83f724d96270989e11a748d8d183bfa771da62fc31a68207fa"],"state_sha256":"8fff7b459d776f02aadfe58b61d17cc83262d34300954f968ab8dc2d3b0e88b2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tJbQVdkhajBNDT6LVqA3MoCWXQVX6mb815vn40ds0+NCvIKWumrg2X0UHYYiTVHSplcLHuFsgiHZePTwW1vmCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T14:17:33.200270Z","bundle_sha256":"93d1e14987e1bf92bd75c6c571e4b513c3f364eb888ed0d1297f1db2b616f675"}}