{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:MNCBOGF45KX6IYY5S2NHFY2CSW","short_pith_number":"pith:MNCBOGF4","canonical_record":{"source":{"id":"1610.03803","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-10-12T17:44:57Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"338280b5b0beeeb6b5fa9621b3c8439201df1a39b88b08b23bf9e46fdc7aef6c","abstract_canon_sha256":"ff0d206e23c74e7dd9b7110f7225ed76029318cd115f6e144f5951a9ef99c76a"},"schema_version":"1.0"},"canonical_sha256":"63441718bceaafe4631d969a72e3429597af0c2049da6641b8a144b20bc2b9c5","source":{"kind":"arxiv","id":"1610.03803","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.03803","created_at":"2026-05-18T01:02:29Z"},{"alias_kind":"arxiv_version","alias_value":"1610.03803v1","created_at":"2026-05-18T01:02:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.03803","created_at":"2026-05-18T01:02:29Z"},{"alias_kind":"pith_short_12","alias_value":"MNCBOGF45KX6","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MNCBOGF45KX6IYY5","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MNCBOGF4","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:MNCBOGF45KX6IYY5S2NHFY2CSW","target":"record","payload":{"canonical_record":{"source":{"id":"1610.03803","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-10-12T17:44:57Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"338280b5b0beeeb6b5fa9621b3c8439201df1a39b88b08b23bf9e46fdc7aef6c","abstract_canon_sha256":"ff0d206e23c74e7dd9b7110f7225ed76029318cd115f6e144f5951a9ef99c76a"},"schema_version":"1.0"},"canonical_sha256":"63441718bceaafe4631d969a72e3429597af0c2049da6641b8a144b20bc2b9c5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:29.183828Z","signature_b64":"ECRSbII0PP5R5PaX4eDTI4PK0NOvT5ummxtUP0gB/q2AIU4geC3L+bo/jlqpF0ojn8a0xOl+ReBb3YIckgAiBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63441718bceaafe4631d969a72e3429597af0c2049da6641b8a144b20bc2b9c5","last_reissued_at":"2026-05-18T01:02:29.183270Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:29.183270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.03803","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:02:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0EfibR4uZUJvPjqA0w5SRrVzu2/m76Hu/V09rHpSztn9yI0wku/JHcdTBHqczBDZvFZD0n2QOF1O43Yr7x3SCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T12:17:29.242192Z"},"content_sha256":"4dfcab7715f1f6fd00f109da7d78f38d357bd39c40a3ab7945eb2ba860133a50","schema_version":"1.0","event_id":"sha256:4dfcab7715f1f6fd00f109da7d78f38d357bd39c40a3ab7945eb2ba860133a50"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:MNCBOGF45KX6IYY5S2NHFY2CSW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Scheduling for Flexible Processing Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"math.PR","authors_text":"Jean Walrand, Ramtin Pedarsani, Yuan Zhong","submitted_at":"2016-10-12T17:44:57Z","abstract_excerpt":"Modern processing networks often consist of heterogeneous servers with widely varying capabilities, and process job flows with complex structure and requirements. A major challenge in designing efficient scheduling policies in these networks is the lack of reliable estimates of system parameters, and an attractive approach for addressing this challenge is to design robust policies, i.e., policies that do not use system parameters such as arrival and/or service rates for making scheduling decisions. In this paper, we propose a general framework for the design of robust policies. The main techni"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.03803","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:02:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w3X5CLH3QuOxS0Adu6qay/783uLPxweWV7Dhsiwel8jRHcWOd/Tdml2XXKJ28yWNAy1ebWPV+hyaVe9MhKU/Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T12:17:29.242562Z"},"content_sha256":"f097327484b8d018290fc339c6d8ce475b41c5b5c80ab636afa1d69a3bca11a6","schema_version":"1.0","event_id":"sha256:f097327484b8d018290fc339c6d8ce475b41c5b5c80ab636afa1d69a3bca11a6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MNCBOGF45KX6IYY5S2NHFY2CSW/bundle.json","state_url":"https://pith.science/pith/MNCBOGF45KX6IYY5S2NHFY2CSW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MNCBOGF45KX6IYY5S2NHFY2CSW/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-21T12:17:29Z","links":{"resolver":"https://pith.science/pith/MNCBOGF45KX6IYY5S2NHFY2CSW","bundle":"https://pith.science/pith/MNCBOGF45KX6IYY5S2NHFY2CSW/bundle.json","state":"https://pith.science/pith/MNCBOGF45KX6IYY5S2NHFY2CSW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MNCBOGF45KX6IYY5S2NHFY2CSW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:MNCBOGF45KX6IYY5S2NHFY2CSW","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":"ff0d206e23c74e7dd9b7110f7225ed76029318cd115f6e144f5951a9ef99c76a","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-10-12T17:44:57Z","title_canon_sha256":"338280b5b0beeeb6b5fa9621b3c8439201df1a39b88b08b23bf9e46fdc7aef6c"},"schema_version":"1.0","source":{"id":"1610.03803","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.03803","created_at":"2026-05-18T01:02:29Z"},{"alias_kind":"arxiv_version","alias_value":"1610.03803v1","created_at":"2026-05-18T01:02:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.03803","created_at":"2026-05-18T01:02:29Z"},{"alias_kind":"pith_short_12","alias_value":"MNCBOGF45KX6","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MNCBOGF45KX6IYY5","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MNCBOGF4","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:f097327484b8d018290fc339c6d8ce475b41c5b5c80ab636afa1d69a3bca11a6","target":"graph","created_at":"2026-05-18T01:02: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"},"paper":{"abstract_excerpt":"Modern processing networks often consist of heterogeneous servers with widely varying capabilities, and process job flows with complex structure and requirements. A major challenge in designing efficient scheduling policies in these networks is the lack of reliable estimates of system parameters, and an attractive approach for addressing this challenge is to design robust policies, i.e., policies that do not use system parameters such as arrival and/or service rates for making scheduling decisions. In this paper, we propose a general framework for the design of robust policies. The main techni","authors_text":"Jean Walrand, Ramtin Pedarsani, Yuan Zhong","cross_cats":["cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-10-12T17:44:57Z","title":"Robust Scheduling for Flexible Processing Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.03803","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:4dfcab7715f1f6fd00f109da7d78f38d357bd39c40a3ab7945eb2ba860133a50","target":"record","created_at":"2026-05-18T01:02: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":"ff0d206e23c74e7dd9b7110f7225ed76029318cd115f6e144f5951a9ef99c76a","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-10-12T17:44:57Z","title_canon_sha256":"338280b5b0beeeb6b5fa9621b3c8439201df1a39b88b08b23bf9e46fdc7aef6c"},"schema_version":"1.0","source":{"id":"1610.03803","kind":"arxiv","version":1}},"canonical_sha256":"63441718bceaafe4631d969a72e3429597af0c2049da6641b8a144b20bc2b9c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"63441718bceaafe4631d969a72e3429597af0c2049da6641b8a144b20bc2b9c5","first_computed_at":"2026-05-18T01:02:29.183270Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:29.183270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ECRSbII0PP5R5PaX4eDTI4PK0NOvT5ummxtUP0gB/q2AIU4geC3L+bo/jlqpF0ojn8a0xOl+ReBb3YIckgAiBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:29.183828Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.03803","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4dfcab7715f1f6fd00f109da7d78f38d357bd39c40a3ab7945eb2ba860133a50","sha256:f097327484b8d018290fc339c6d8ce475b41c5b5c80ab636afa1d69a3bca11a6"],"state_sha256":"46a79657ac54bcc432b983ad5c3460bafd33b97e99cc5e12e20bd09139b97b45"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HJOMGtPdr7A4AgKf+e5YlWZmlku6xPouuKx+RgHcPPm3HbtagXZfLE3aD8mfYKvuVGLv/eTe6qbET4iSb6DFBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T12:17:29.244636Z","bundle_sha256":"7f6a3778ed5a7e08b12b26a669b3e2fee4f4e7d9da55b164ee3d2ddd8c4085f9"}}