{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:Y6DHIAUEDBFMUNFCRTV23PIJFG","short_pith_number":"pith:Y6DHIAUE","canonical_record":{"source":{"id":"cs/0702066","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.DC","submitted_at":"2007-02-10T17:43:35Z","cross_cats_sorted":[],"title_canon_sha256":"97f3c0e90a8c4edeb0e6a45ab7eddb8f0c85b273a13d37db856cced5449b17ea","abstract_canon_sha256":"37f8190328f958473c5d3bdaf45179b2bb427f3bf707c1c9d5f4c9fa901ddd31"},"schema_version":"1.0"},"canonical_sha256":"c786740284184aca34a28cebadbd09299d52f6d811061c2c8aa4b5c2cb2b031b","source":{"kind":"arxiv","id":"cs/0702066","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0702066","created_at":"2026-05-18T01:09:19Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0702066v1","created_at":"2026-05-18T01:09:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0702066","created_at":"2026-05-18T01:09:19Z"},{"alias_kind":"pith_short_12","alias_value":"Y6DHIAUEDBFM","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"Y6DHIAUEDBFMUNFC","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"Y6DHIAUE","created_at":"2026-05-18T12:25:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:Y6DHIAUEDBFMUNFCRTV23PIJFG","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0702066","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.DC","submitted_at":"2007-02-10T17:43:35Z","cross_cats_sorted":[],"title_canon_sha256":"97f3c0e90a8c4edeb0e6a45ab7eddb8f0c85b273a13d37db856cced5449b17ea","abstract_canon_sha256":"37f8190328f958473c5d3bdaf45179b2bb427f3bf707c1c9d5f4c9fa901ddd31"},"schema_version":"1.0"},"canonical_sha256":"c786740284184aca34a28cebadbd09299d52f6d811061c2c8aa4b5c2cb2b031b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:19.566020Z","signature_b64":"qDK+chxDAtu9qs0YPqM3zfFtz8ndz5MhwPtpyFCHE7rx3J8tntJ8O7jAmDGCL4WDk8PPYEWOBh/XZz9LC7R2DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c786740284184aca34a28cebadbd09299d52f6d811061c2c8aa4b5c2cb2b031b","last_reissued_at":"2026-05-18T01:09:19.565454Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:19.565454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0702066","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-18T01:09:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7ZOJbQPP6QxPQsleegEGBDN2vzoICOjT3hB8M2nSl5fVA2v57dKfwkhpsqjcsk7PqylmtiOU9RR1MATyqY8vCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:49:04.209542Z"},"content_sha256":"b47ee7f124a745750cb91c9030bb529404d6547d34340d415cb764ad663bf1eb","schema_version":"1.0","event_id":"sha256:b47ee7f124a745750cb91c9030bb529404d6547d34340d415cb764ad663bf1eb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:Y6DHIAUEDBFMUNFCRTV23PIJFG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Comments on \"Design and performance evaluation of load distribution strategies for multiple loads on heterogeneous linear daisy chain networks''","license":"","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Fr\\'ed\\'eric Vivien (LIP, INRIA Rh\\^one-Alpes), Matthieu Gallet (LIP, Yves Robert (LIP","submitted_at":"2007-02-10T17:43:35Z","abstract_excerpt":"Min, Veeravalli, and Barlas proposed strategies to minimize the overall execution time of one or several divisible loads on a heterogeneous linear network, using one or more installments. We show on a very simple example that the proposed approach does not always produce a solution and that, when it does, the solution is often suboptimal. We also show how to find an optimal scheduling for any instance, once the number of installments per load is given. Finally, we formally prove that under a linear cost model, as in the original paper, an optimal schedule has an infinite number of installments"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0702066","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-18T01:09:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hP9newx6Cn9i+5fU7ZKGa7ftaKpXuW3migHrlM6kKS6VB4LSPyWxHybD+LwUnMljaN0n3+2eipIRmLimF5tICg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:49:04.210263Z"},"content_sha256":"1f45296de0704d32de03990e2cc974027c1bd3b0a20c9a09e339ee3bb4151eef","schema_version":"1.0","event_id":"sha256:1f45296de0704d32de03990e2cc974027c1bd3b0a20c9a09e339ee3bb4151eef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y6DHIAUEDBFMUNFCRTV23PIJFG/bundle.json","state_url":"https://pith.science/pith/Y6DHIAUEDBFMUNFCRTV23PIJFG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y6DHIAUEDBFMUNFCRTV23PIJFG/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-11T23:49:04Z","links":{"resolver":"https://pith.science/pith/Y6DHIAUEDBFMUNFCRTV23PIJFG","bundle":"https://pith.science/pith/Y6DHIAUEDBFMUNFCRTV23PIJFG/bundle.json","state":"https://pith.science/pith/Y6DHIAUEDBFMUNFCRTV23PIJFG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y6DHIAUEDBFMUNFCRTV23PIJFG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:Y6DHIAUEDBFMUNFCRTV23PIJFG","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":"37f8190328f958473c5d3bdaf45179b2bb427f3bf707c1c9d5f4c9fa901ddd31","cross_cats_sorted":[],"license":"","primary_cat":"cs.DC","submitted_at":"2007-02-10T17:43:35Z","title_canon_sha256":"97f3c0e90a8c4edeb0e6a45ab7eddb8f0c85b273a13d37db856cced5449b17ea"},"schema_version":"1.0","source":{"id":"cs/0702066","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0702066","created_at":"2026-05-18T01:09:19Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0702066v1","created_at":"2026-05-18T01:09:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0702066","created_at":"2026-05-18T01:09:19Z"},{"alias_kind":"pith_short_12","alias_value":"Y6DHIAUEDBFM","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"Y6DHIAUEDBFMUNFC","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"Y6DHIAUE","created_at":"2026-05-18T12:25:56Z"}],"graph_snapshots":[{"event_id":"sha256:1f45296de0704d32de03990e2cc974027c1bd3b0a20c9a09e339ee3bb4151eef","target":"graph","created_at":"2026-05-18T01:09:19Z","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":"Min, Veeravalli, and Barlas proposed strategies to minimize the overall execution time of one or several divisible loads on a heterogeneous linear network, using one or more installments. We show on a very simple example that the proposed approach does not always produce a solution and that, when it does, the solution is often suboptimal. We also show how to find an optimal scheduling for any instance, once the number of installments per load is given. Finally, we formally prove that under a linear cost model, as in the original paper, an optimal schedule has an infinite number of installments","authors_text":"Fr\\'ed\\'eric Vivien (LIP, INRIA Rh\\^one-Alpes), Matthieu Gallet (LIP, Yves Robert (LIP","cross_cats":[],"headline":"","license":"","primary_cat":"cs.DC","submitted_at":"2007-02-10T17:43:35Z","title":"Comments on \"Design and performance evaluation of load distribution strategies for multiple loads on heterogeneous linear daisy chain networks''"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0702066","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:b47ee7f124a745750cb91c9030bb529404d6547d34340d415cb764ad663bf1eb","target":"record","created_at":"2026-05-18T01:09:19Z","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":"37f8190328f958473c5d3bdaf45179b2bb427f3bf707c1c9d5f4c9fa901ddd31","cross_cats_sorted":[],"license":"","primary_cat":"cs.DC","submitted_at":"2007-02-10T17:43:35Z","title_canon_sha256":"97f3c0e90a8c4edeb0e6a45ab7eddb8f0c85b273a13d37db856cced5449b17ea"},"schema_version":"1.0","source":{"id":"cs/0702066","kind":"arxiv","version":1}},"canonical_sha256":"c786740284184aca34a28cebadbd09299d52f6d811061c2c8aa4b5c2cb2b031b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c786740284184aca34a28cebadbd09299d52f6d811061c2c8aa4b5c2cb2b031b","first_computed_at":"2026-05-18T01:09:19.565454Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:19.565454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qDK+chxDAtu9qs0YPqM3zfFtz8ndz5MhwPtpyFCHE7rx3J8tntJ8O7jAmDGCL4WDk8PPYEWOBh/XZz9LC7R2DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:19.566020Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0702066","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b47ee7f124a745750cb91c9030bb529404d6547d34340d415cb764ad663bf1eb","sha256:1f45296de0704d32de03990e2cc974027c1bd3b0a20c9a09e339ee3bb4151eef"],"state_sha256":"26edea17387285bf5015676fea9164df67d4f7ccec19e73fceaf74ede9612940"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bsX36UMrjL4algot9EWHBo3KnQCf2puf8p/KgeoOcEfav3ymNMOHV38EQpadQWrBTsm46DRA0Xi3wOZbpcZfBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T23:49:04.214438Z","bundle_sha256":"1a9ec39b4e546aed86838c51e3405b91dacf333fe553f7a52e82bab75d5e81f5"}}