{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:PXVEBRMOVKGLVISIVBPIAQJKGA","short_pith_number":"pith:PXVEBRMO","canonical_record":{"source":{"id":"1803.08121","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2018-03-21T20:41:00Z","cross_cats_sorted":[],"title_canon_sha256":"c0ac44525e8fb4417c37bf88edc129549ba7ac4dcb0f76cbe4102a54fe9dc24c","abstract_canon_sha256":"e76bac58887e79367f4550ab9ab029398b17d071d0a1ca2cca28f34270748815"},"schema_version":"1.0"},"canonical_sha256":"7dea40c58eaa8cbaa248a85e80412a30128f6a4f9d3025ce27d68d3aa7ba3b3c","source":{"kind":"arxiv","id":"1803.08121","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.08121","created_at":"2026-05-18T00:20:23Z"},{"alias_kind":"arxiv_version","alias_value":"1803.08121v1","created_at":"2026-05-18T00:20:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.08121","created_at":"2026-05-18T00:20:23Z"},{"alias_kind":"pith_short_12","alias_value":"PXVEBRMOVKGL","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"PXVEBRMOVKGLVISI","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"PXVEBRMO","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:PXVEBRMOVKGLVISIVBPIAQJKGA","target":"record","payload":{"canonical_record":{"source":{"id":"1803.08121","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2018-03-21T20:41:00Z","cross_cats_sorted":[],"title_canon_sha256":"c0ac44525e8fb4417c37bf88edc129549ba7ac4dcb0f76cbe4102a54fe9dc24c","abstract_canon_sha256":"e76bac58887e79367f4550ab9ab029398b17d071d0a1ca2cca28f34270748815"},"schema_version":"1.0"},"canonical_sha256":"7dea40c58eaa8cbaa248a85e80412a30128f6a4f9d3025ce27d68d3aa7ba3b3c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:23.634655Z","signature_b64":"SlSmVpHLoqEtNEscLhn3b2etpxatAfWWnimwaJu/xm0bIp4gf+7xfNlQUp0gp1MF0ps22u+w0epJdSGdlu6+Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7dea40c58eaa8cbaa248a85e80412a30128f6a4f9d3025ce27d68d3aa7ba3b3c","last_reissued_at":"2026-05-18T00:20:23.634129Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:23.634129Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.08121","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:20:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s6gWJSW0vJUBOt357vwJNh/05UC5Q2Z3MkPX7KmVZ+27I/4R3qnDGVCAHZKuWl/gim9BLX8w4jwc9qZYo8z9Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T20:32:49.993359Z"},"content_sha256":"6d12199d1737271871e3a387a48e7929036bccc8eff7ee5231aa04310eb374e9","schema_version":"1.0","event_id":"sha256:6d12199d1737271871e3a387a48e7929036bccc8eff7ee5231aa04310eb374e9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:PXVEBRMOVKGLVISIVBPIAQJKGA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Markov Chain Monte Carlo Approach to Cost Matrix Generation for Scheduling Performance Evaluation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PF","authors_text":"Louis-Claude Canon, Mohamad El Sayah, Pierre-Cyrille H\\'eam","submitted_at":"2018-03-21T20:41:00Z","abstract_excerpt":"In high performance computing, scheduling of tasks and allocation to machines is very critical especially when we are dealing with heterogeneous execution costs. Simulations can be performed with a large variety of environments and application models. However, this technique is sensitive to bias when it relies on random instances with an uncontrolled distribution. We use methods from the literature to provide formal guarantee on the distribution of the instance. In particular, it is desirable to ensure a uniform distribution among the instances with a given task and machine heterogeneity. In t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.08121","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:20:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zQNFZyLlWeEKo0GPMC5gnHfiyW5XfWYqvcMRPSpi8RKU5/o6+Q3moNKslwO3RKnho5IRaGT2ofccy3FUbjWSCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T20:32:49.993716Z"},"content_sha256":"689023ae652ce6d38d0ad8124ac5e8a1bc640065fd8dde9eb9b42ea3b7911d79","schema_version":"1.0","event_id":"sha256:689023ae652ce6d38d0ad8124ac5e8a1bc640065fd8dde9eb9b42ea3b7911d79"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PXVEBRMOVKGLVISIVBPIAQJKGA/bundle.json","state_url":"https://pith.science/pith/PXVEBRMOVKGLVISIVBPIAQJKGA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PXVEBRMOVKGLVISIVBPIAQJKGA/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-24T20:32:49Z","links":{"resolver":"https://pith.science/pith/PXVEBRMOVKGLVISIVBPIAQJKGA","bundle":"https://pith.science/pith/PXVEBRMOVKGLVISIVBPIAQJKGA/bundle.json","state":"https://pith.science/pith/PXVEBRMOVKGLVISIVBPIAQJKGA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PXVEBRMOVKGLVISIVBPIAQJKGA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:PXVEBRMOVKGLVISIVBPIAQJKGA","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":"e76bac58887e79367f4550ab9ab029398b17d071d0a1ca2cca28f34270748815","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2018-03-21T20:41:00Z","title_canon_sha256":"c0ac44525e8fb4417c37bf88edc129549ba7ac4dcb0f76cbe4102a54fe9dc24c"},"schema_version":"1.0","source":{"id":"1803.08121","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.08121","created_at":"2026-05-18T00:20:23Z"},{"alias_kind":"arxiv_version","alias_value":"1803.08121v1","created_at":"2026-05-18T00:20:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.08121","created_at":"2026-05-18T00:20:23Z"},{"alias_kind":"pith_short_12","alias_value":"PXVEBRMOVKGL","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"PXVEBRMOVKGLVISI","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"PXVEBRMO","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:689023ae652ce6d38d0ad8124ac5e8a1bc640065fd8dde9eb9b42ea3b7911d79","target":"graph","created_at":"2026-05-18T00:20:23Z","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":"In high performance computing, scheduling of tasks and allocation to machines is very critical especially when we are dealing with heterogeneous execution costs. Simulations can be performed with a large variety of environments and application models. However, this technique is sensitive to bias when it relies on random instances with an uncontrolled distribution. We use methods from the literature to provide formal guarantee on the distribution of the instance. In particular, it is desirable to ensure a uniform distribution among the instances with a given task and machine heterogeneity. In t","authors_text":"Louis-Claude Canon, Mohamad El Sayah, Pierre-Cyrille H\\'eam","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2018-03-21T20:41:00Z","title":"A Markov Chain Monte Carlo Approach to Cost Matrix Generation for Scheduling Performance Evaluation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.08121","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:6d12199d1737271871e3a387a48e7929036bccc8eff7ee5231aa04310eb374e9","target":"record","created_at":"2026-05-18T00:20:23Z","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":"e76bac58887e79367f4550ab9ab029398b17d071d0a1ca2cca28f34270748815","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2018-03-21T20:41:00Z","title_canon_sha256":"c0ac44525e8fb4417c37bf88edc129549ba7ac4dcb0f76cbe4102a54fe9dc24c"},"schema_version":"1.0","source":{"id":"1803.08121","kind":"arxiv","version":1}},"canonical_sha256":"7dea40c58eaa8cbaa248a85e80412a30128f6a4f9d3025ce27d68d3aa7ba3b3c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7dea40c58eaa8cbaa248a85e80412a30128f6a4f9d3025ce27d68d3aa7ba3b3c","first_computed_at":"2026-05-18T00:20:23.634129Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:23.634129Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SlSmVpHLoqEtNEscLhn3b2etpxatAfWWnimwaJu/xm0bIp4gf+7xfNlQUp0gp1MF0ps22u+w0epJdSGdlu6+Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:23.634655Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.08121","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6d12199d1737271871e3a387a48e7929036bccc8eff7ee5231aa04310eb374e9","sha256:689023ae652ce6d38d0ad8124ac5e8a1bc640065fd8dde9eb9b42ea3b7911d79"],"state_sha256":"c770d40345d522b2ce86da321f417e49f6f30fbaa9430f3eefc057e834795e18"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2MimjJzYe00GICz/pP9t5xnK9iyh2rPjWId2lQakqlPFpeOvCeeWBFiTDsQ4vTqwCZpC0yX99AJRhNH+O5BwCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T20:32:49.995676Z","bundle_sha256":"c98acab2cc14a2b9ac7c439ebe62971b075eef233687d8f4cd170379073c0e9c"}}