{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:WEXLN2WTPDK7TDILON7IMZOLKZ","short_pith_number":"pith:WEXLN2WT","canonical_record":{"source":{"id":"2605.21715","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PF","submitted_at":"2026-05-20T20:19:32Z","cross_cats_sorted":[],"title_canon_sha256":"2dac4a4907ae3ed25e5039d6cd6523f441358c25ce32c4807eb9fc5ce33f9167","abstract_canon_sha256":"102de79dade9504e3bf98c9f5ede82f3a0f87a97a07708e82378113c6959f4ab"},"schema_version":"1.0"},"canonical_sha256":"b12eb6ead378d5f98d0b737e8665cb5675539918e22e326b4eb0af378ba3979c","source":{"kind":"arxiv","id":"2605.21715","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.21715","created_at":"2026-05-22T01:03:29Z"},{"alias_kind":"arxiv_version","alias_value":"2605.21715v1","created_at":"2026-05-22T01:03:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.21715","created_at":"2026-05-22T01:03:29Z"},{"alias_kind":"pith_short_12","alias_value":"WEXLN2WTPDK7","created_at":"2026-05-22T01:03:29Z"},{"alias_kind":"pith_short_16","alias_value":"WEXLN2WTPDK7TDIL","created_at":"2026-05-22T01:03:29Z"},{"alias_kind":"pith_short_8","alias_value":"WEXLN2WT","created_at":"2026-05-22T01:03:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:WEXLN2WTPDK7TDILON7IMZOLKZ","target":"record","payload":{"canonical_record":{"source":{"id":"2605.21715","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PF","submitted_at":"2026-05-20T20:19:32Z","cross_cats_sorted":[],"title_canon_sha256":"2dac4a4907ae3ed25e5039d6cd6523f441358c25ce32c4807eb9fc5ce33f9167","abstract_canon_sha256":"102de79dade9504e3bf98c9f5ede82f3a0f87a97a07708e82378113c6959f4ab"},"schema_version":"1.0"},"canonical_sha256":"b12eb6ead378d5f98d0b737e8665cb5675539918e22e326b4eb0af378ba3979c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-22T01:03:29.093709Z","signature_b64":"71e0QsVbRx9T/u2d8jqkrZJJwX5zyd758kZJ3ExVmKpo9Itq6iDXaww4hESChNEeBjw+eGmX2NMe9FtVK0TEDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b12eb6ead378d5f98d0b737e8665cb5675539918e22e326b4eb0af378ba3979c","last_reissued_at":"2026-05-22T01:03:29.093176Z","signature_status":"signed_v1","first_computed_at":"2026-05-22T01:03:29.093176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.21715","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-22T01:03:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EFTG8lEv0CTaFFhWnD031gb/G023T25EKR4YdBXIjkzxjhpug6sjGpFBNY89rYAqFctFr9JW+dtB1OPBrfVlAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T11:59:54.887220Z"},"content_sha256":"c9bd7560b0b3a87d10341c0e9d99498b8a8de7e08a5fdc4d26c284199dd0dcd0","schema_version":"1.0","event_id":"sha256:c9bd7560b0b3a87d10341c0e9d99498b8a8de7e08a5fdc4d26c284199dd0dcd0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:WEXLN2WTPDK7TDILON7IMZOLKZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Throughput-Optimal Multiresource-Job Scheduling with Continuous Requirement Distribution","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PF","authors_text":"Heyuan Yao, Izzy Grosof, Willow Kowalik","submitted_at":"2026-05-20T20:19:32Z","abstract_excerpt":"Modern computing systems process jobs with resource requirements such as CPU and memory, which are described by multiresource jobs (MRJ) queueing models. In practice, job resource requirements are spread out over so many values, that it is rare to see the same value twice. This pattern is best modeled by a continuous distribution of requirement values. However, the existing theoretical work on stability or throughput-optimality focuses on queueing models with class-based resource requirements. In class-based models, the number of distinct resource requirements must be small to demonstrate stro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.21715","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.21715/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-22T01:03:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"czIPRWcEL6uHUeuBGnOiQFUkNn+3937e3fm+DHwXlPzU1ck4pz/vpL+iecMNqTvCABqNDiF2ldgoMsnntZgZBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T11:59:54.887598Z"},"content_sha256":"930a91d22ba7092ade923b78e921b37a0f59f6b610d0859c7e419eb4ee40d6fa","schema_version":"1.0","event_id":"sha256:930a91d22ba7092ade923b78e921b37a0f59f6b610d0859c7e419eb4ee40d6fa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WEXLN2WTPDK7TDILON7IMZOLKZ/bundle.json","state_url":"https://pith.science/pith/WEXLN2WTPDK7TDILON7IMZOLKZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WEXLN2WTPDK7TDILON7IMZOLKZ/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-07T11:59:54Z","links":{"resolver":"https://pith.science/pith/WEXLN2WTPDK7TDILON7IMZOLKZ","bundle":"https://pith.science/pith/WEXLN2WTPDK7TDILON7IMZOLKZ/bundle.json","state":"https://pith.science/pith/WEXLN2WTPDK7TDILON7IMZOLKZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WEXLN2WTPDK7TDILON7IMZOLKZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:WEXLN2WTPDK7TDILON7IMZOLKZ","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":"102de79dade9504e3bf98c9f5ede82f3a0f87a97a07708e82378113c6959f4ab","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PF","submitted_at":"2026-05-20T20:19:32Z","title_canon_sha256":"2dac4a4907ae3ed25e5039d6cd6523f441358c25ce32c4807eb9fc5ce33f9167"},"schema_version":"1.0","source":{"id":"2605.21715","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.21715","created_at":"2026-05-22T01:03:29Z"},{"alias_kind":"arxiv_version","alias_value":"2605.21715v1","created_at":"2026-05-22T01:03:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.21715","created_at":"2026-05-22T01:03:29Z"},{"alias_kind":"pith_short_12","alias_value":"WEXLN2WTPDK7","created_at":"2026-05-22T01:03:29Z"},{"alias_kind":"pith_short_16","alias_value":"WEXLN2WTPDK7TDIL","created_at":"2026-05-22T01:03:29Z"},{"alias_kind":"pith_short_8","alias_value":"WEXLN2WT","created_at":"2026-05-22T01:03:29Z"}],"graph_snapshots":[{"event_id":"sha256:930a91d22ba7092ade923b78e921b37a0f59f6b610d0859c7e419eb4ee40d6fa","target":"graph","created_at":"2026-05-22T01:03:29Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2605.21715/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Modern computing systems process jobs with resource requirements such as CPU and memory, which are described by multiresource jobs (MRJ) queueing models. In practice, job resource requirements are spread out over so many values, that it is rare to see the same value twice. This pattern is best modeled by a continuous distribution of requirement values. However, the existing theoretical work on stability or throughput-optimality focuses on queueing models with class-based resource requirements. In class-based models, the number of distinct resource requirements must be small to demonstrate stro","authors_text":"Heyuan Yao, Izzy Grosof, Willow Kowalik","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PF","submitted_at":"2026-05-20T20:19:32Z","title":"Throughput-Optimal Multiresource-Job Scheduling with Continuous Requirement Distribution"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.21715","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:c9bd7560b0b3a87d10341c0e9d99498b8a8de7e08a5fdc4d26c284199dd0dcd0","target":"record","created_at":"2026-05-22T01:03:29Z","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":"102de79dade9504e3bf98c9f5ede82f3a0f87a97a07708e82378113c6959f4ab","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PF","submitted_at":"2026-05-20T20:19:32Z","title_canon_sha256":"2dac4a4907ae3ed25e5039d6cd6523f441358c25ce32c4807eb9fc5ce33f9167"},"schema_version":"1.0","source":{"id":"2605.21715","kind":"arxiv","version":1}},"canonical_sha256":"b12eb6ead378d5f98d0b737e8665cb5675539918e22e326b4eb0af378ba3979c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b12eb6ead378d5f98d0b737e8665cb5675539918e22e326b4eb0af378ba3979c","first_computed_at":"2026-05-22T01:03:29.093176Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-22T01:03:29.093176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"71e0QsVbRx9T/u2d8jqkrZJJwX5zyd758kZJ3ExVmKpo9Itq6iDXaww4hESChNEeBjw+eGmX2NMe9FtVK0TEDg==","signature_status":"signed_v1","signed_at":"2026-05-22T01:03:29.093709Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.21715","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c9bd7560b0b3a87d10341c0e9d99498b8a8de7e08a5fdc4d26c284199dd0dcd0","sha256:930a91d22ba7092ade923b78e921b37a0f59f6b610d0859c7e419eb4ee40d6fa"],"state_sha256":"1d0f4ea9ea10a3ef2508d39600e42bbe4d91d8ef4a67e60902ae9f95c6a82910"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tsivFzajHAFm/KxXgDsPK3GchcXdanj8aQlf0/Q1eG6H+OFooONMytrtfrYsNlWa5wiHx6UcRmzS6tfiaxZVDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T11:59:54.889642Z","bundle_sha256":"769501fbde78d1637a0c51a4b7c01ea89711294e85e2c1eaa38b61bc4675a94c"}}