{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:WXTTVS4PHJJVYK7SD3UWMRZ5WY","short_pith_number":"pith:WXTTVS4P","canonical_record":{"source":{"id":"1304.7793","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-29T20:22:27Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"296a263b797371b61808ea9220fa617d19cb8c1f5fd96d58b24b8c0f6d20c1a0","abstract_canon_sha256":"ea0eb489b97b19fee276d742d5ea831db08842be272c6347e57fe314b8142229"},"schema_version":"1.0"},"canonical_sha256":"b5e73acb8f3a535c2bf21ee966473db61f1cca3e79e723a83327b9ac4d73b952","source":{"kind":"arxiv","id":"1304.7793","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.7793","created_at":"2026-05-18T03:26:51Z"},{"alias_kind":"arxiv_version","alias_value":"1304.7793v1","created_at":"2026-05-18T03:26:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7793","created_at":"2026-05-18T03:26:51Z"},{"alias_kind":"pith_short_12","alias_value":"WXTTVS4PHJJV","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"WXTTVS4PHJJVYK7S","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"WXTTVS4P","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:WXTTVS4PHJJVYK7SD3UWMRZ5WY","target":"record","payload":{"canonical_record":{"source":{"id":"1304.7793","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-29T20:22:27Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"296a263b797371b61808ea9220fa617d19cb8c1f5fd96d58b24b8c0f6d20c1a0","abstract_canon_sha256":"ea0eb489b97b19fee276d742d5ea831db08842be272c6347e57fe314b8142229"},"schema_version":"1.0"},"canonical_sha256":"b5e73acb8f3a535c2bf21ee966473db61f1cca3e79e723a83327b9ac4d73b952","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:51.847713Z","signature_b64":"MZXmKmvhySIXRD1g7FGDAL4MzskiBbByNoP+TYsJLyQGSbK1Mbdh0pQlkqo20T35y9x1ZTykLJuflNbJ+kK+AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5e73acb8f3a535c2bf21ee966473db61f1cca3e79e723a83327b9ac4d73b952","last_reissued_at":"2026-05-18T03:26:51.847251Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:51.847251Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.7793","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-18T03:26:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2gbhN2XmZAJdK6oPh2N2R9WClmQJEz/PDURLwHq6vORE98cbI98onwuzjg5n30JF6u4HxEumFXvmpvD1eaIFBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:51:22.234175Z"},"content_sha256":"0417d152f0de66ed42ba465312ddbec5205621cc470a7c5db0496f62f8442efd","schema_version":"1.0","event_id":"sha256:0417d152f0de66ed42ba465312ddbec5205621cc470a7c5db0496f62f8442efd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:WXTTVS4PHJJVYK7SD3UWMRZ5WY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Co-Scheduling Algorithms for High-Throughput Workload Execution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Anne Benoit, Guillaume Aupy, Manu Shantharam, Padma Raghavan, Yves Robert","submitted_at":"2013-04-29T20:22:27Z","abstract_excerpt":"This paper investigates co-scheduling algorithms for processing a set of parallel applications. Instead of executing each application one by one, using a maximum degree of parallelism for each of them, we aim at scheduling several applications concurrently. We partition the original application set into a series of packs, which are executed one by one. A pack comprises several applications, each of them with an assigned number of processors, with the constraint that the total number of processors assigned within a pack does not exceed the maximum number of available processors. The objective i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.7793","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-18T03:26:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CqDkki/5ZOR9hteQaxiAI12UPMuZ/TImq+YCFe6Y1KYw7mzHRGERn/HktxJUUZ+SAqY2sJgIr6LYoXpnEjXvBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:51:22.234910Z"},"content_sha256":"2434233f1014c3d6a208d3ebcd8b974e98ef645fde235056a66ac9955dde29af","schema_version":"1.0","event_id":"sha256:2434233f1014c3d6a208d3ebcd8b974e98ef645fde235056a66ac9955dde29af"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WXTTVS4PHJJVYK7SD3UWMRZ5WY/bundle.json","state_url":"https://pith.science/pith/WXTTVS4PHJJVYK7SD3UWMRZ5WY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WXTTVS4PHJJVYK7SD3UWMRZ5WY/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-05-30T14:51:22Z","links":{"resolver":"https://pith.science/pith/WXTTVS4PHJJVYK7SD3UWMRZ5WY","bundle":"https://pith.science/pith/WXTTVS4PHJJVYK7SD3UWMRZ5WY/bundle.json","state":"https://pith.science/pith/WXTTVS4PHJJVYK7SD3UWMRZ5WY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WXTTVS4PHJJVYK7SD3UWMRZ5WY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:WXTTVS4PHJJVYK7SD3UWMRZ5WY","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":"ea0eb489b97b19fee276d742d5ea831db08842be272c6347e57fe314b8142229","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-29T20:22:27Z","title_canon_sha256":"296a263b797371b61808ea9220fa617d19cb8c1f5fd96d58b24b8c0f6d20c1a0"},"schema_version":"1.0","source":{"id":"1304.7793","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.7793","created_at":"2026-05-18T03:26:51Z"},{"alias_kind":"arxiv_version","alias_value":"1304.7793v1","created_at":"2026-05-18T03:26:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7793","created_at":"2026-05-18T03:26:51Z"},{"alias_kind":"pith_short_12","alias_value":"WXTTVS4PHJJV","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"WXTTVS4PHJJVYK7S","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"WXTTVS4P","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:2434233f1014c3d6a208d3ebcd8b974e98ef645fde235056a66ac9955dde29af","target":"graph","created_at":"2026-05-18T03:26:51Z","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 co-scheduling algorithms for processing a set of parallel applications. Instead of executing each application one by one, using a maximum degree of parallelism for each of them, we aim at scheduling several applications concurrently. We partition the original application set into a series of packs, which are executed one by one. A pack comprises several applications, each of them with an assigned number of processors, with the constraint that the total number of processors assigned within a pack does not exceed the maximum number of available processors. The objective i","authors_text":"Anne Benoit, Guillaume Aupy, Manu Shantharam, Padma Raghavan, Yves Robert","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-29T20:22:27Z","title":"Co-Scheduling Algorithms for High-Throughput Workload Execution"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.7793","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:0417d152f0de66ed42ba465312ddbec5205621cc470a7c5db0496f62f8442efd","target":"record","created_at":"2026-05-18T03:26:51Z","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":"ea0eb489b97b19fee276d742d5ea831db08842be272c6347e57fe314b8142229","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-29T20:22:27Z","title_canon_sha256":"296a263b797371b61808ea9220fa617d19cb8c1f5fd96d58b24b8c0f6d20c1a0"},"schema_version":"1.0","source":{"id":"1304.7793","kind":"arxiv","version":1}},"canonical_sha256":"b5e73acb8f3a535c2bf21ee966473db61f1cca3e79e723a83327b9ac4d73b952","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b5e73acb8f3a535c2bf21ee966473db61f1cca3e79e723a83327b9ac4d73b952","first_computed_at":"2026-05-18T03:26:51.847251Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:26:51.847251Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MZXmKmvhySIXRD1g7FGDAL4MzskiBbByNoP+TYsJLyQGSbK1Mbdh0pQlkqo20T35y9x1ZTykLJuflNbJ+kK+AA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:26:51.847713Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.7793","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0417d152f0de66ed42ba465312ddbec5205621cc470a7c5db0496f62f8442efd","sha256:2434233f1014c3d6a208d3ebcd8b974e98ef645fde235056a66ac9955dde29af"],"state_sha256":"42288e0dfc2500b113500d0c6707646cf0082559e58c8638dcf7f5a95d7bf1cc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yEessgEjZo1f43jM7YkVRPElfUNNyloe3JSinjnWDtH/jyZTu4DTNzlPGUdb0AJredCW+TG1rWn1ONg1B4IQAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T14:51:22.238353Z","bundle_sha256":"bce3622ebcec56eb5ace982f5e82cc93597703b9075d28dbda2d4e90a3c884ca"}}