{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ZF673N2RFBT7UTPDXOM4G3VTPA","short_pith_number":"pith:ZF673N2R","canonical_record":{"source":{"id":"1302.0948","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-02-05T06:59:03Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"61807f441a423f5b9dd398b932ef0040816c9e040d6c1420a6bb84f0a5d6ef8a","abstract_canon_sha256":"69335c9364613fdce233eb2874dad655443064209164d45367ea5b48d3360465"},"schema_version":"1.0"},"canonical_sha256":"c97dfdb7512867fa4de3bb99c36eb37833d8e9c167c90c83dc5f9125645e39d2","source":{"kind":"arxiv","id":"1302.0948","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.0948","created_at":"2026-05-18T02:53:41Z"},{"alias_kind":"arxiv_version","alias_value":"1302.0948v2","created_at":"2026-05-18T02:53:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.0948","created_at":"2026-05-18T02:53:41Z"},{"alias_kind":"pith_short_12","alias_value":"ZF673N2RFBT7","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZF673N2RFBT7UTPD","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZF673N2R","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ZF673N2RFBT7UTPDXOM4G3VTPA","target":"record","payload":{"canonical_record":{"source":{"id":"1302.0948","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-02-05T06:59:03Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"61807f441a423f5b9dd398b932ef0040816c9e040d6c1420a6bb84f0a5d6ef8a","abstract_canon_sha256":"69335c9364613fdce233eb2874dad655443064209164d45367ea5b48d3360465"},"schema_version":"1.0"},"canonical_sha256":"c97dfdb7512867fa4de3bb99c36eb37833d8e9c167c90c83dc5f9125645e39d2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:41.592012Z","signature_b64":"7W8Bet9jmIwAMOB4frCy8sMoo6f+6eKC1utROJD+jpdS93Iu+VTPFSVKqVcuvDgxj/lxmD3+P9hxoa9R/PfPCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c97dfdb7512867fa4de3bb99c36eb37833d8e9c167c90c83dc5f9125645e39d2","last_reissued_at":"2026-05-18T02:53:41.591210Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:41.591210Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.0948","source_version":2,"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-18T02:53:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3dVGpljNpQMuP0ZzYgjROi0wS1tfcCwipzP2q/GDv/uVBz25X0s3h4ZL5yrGbnQqKikDrLn8D53d8sR2vlY6Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T03:09:37.102943Z"},"content_sha256":"0703603c976aae0bd73a27ed3389f16e872c4c0a741f44c5540092c7f4e64408","schema_version":"1.0","event_id":"sha256:0703603c976aae0bd73a27ed3389f16e872c4c0a741f44c5540092c7f4e64408"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ZF673N2RFBT7UTPDXOM4G3VTPA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Non-monetary fair scheduling---a cooperative game theory approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DC","authors_text":"Krzysztof Rzadca, Piotr Skowron","submitted_at":"2013-02-05T06:59:03Z","abstract_excerpt":"We consider a multi-organizational system in which each organization contributes processors to the global pool but also jobs to be processed on the common resources. The fairness of the scheduling algorithm is essential for the stability and even for the existence of such systems (as organizations may refuse to join an unfair system).\n  We consider on-line, non-clairvoyant scheduling of sequential jobs. The started jobs cannot be stopped, canceled, preempted, or moved to other processors. We consider identical processors, but most of our results can be extended to related or unrelated processo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.0948","kind":"arxiv","version":2},"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-18T02:53:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fbMp+w5XSf2o1I+/0GUIS5HyvYV3Il0xqxlhNr3vmIVAD5V0SQBD6XIXrv8UC7eSTV6P0ANV1nB54TmSLjAVBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T03:09:37.103624Z"},"content_sha256":"727ecd02d341d54aa8a6080d087626778187737b866d8f26c3f1cfee0099a28b","schema_version":"1.0","event_id":"sha256:727ecd02d341d54aa8a6080d087626778187737b866d8f26c3f1cfee0099a28b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZF673N2RFBT7UTPDXOM4G3VTPA/bundle.json","state_url":"https://pith.science/pith/ZF673N2RFBT7UTPDXOM4G3VTPA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZF673N2RFBT7UTPDXOM4G3VTPA/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-02T03:09:37Z","links":{"resolver":"https://pith.science/pith/ZF673N2RFBT7UTPDXOM4G3VTPA","bundle":"https://pith.science/pith/ZF673N2RFBT7UTPDXOM4G3VTPA/bundle.json","state":"https://pith.science/pith/ZF673N2RFBT7UTPDXOM4G3VTPA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZF673N2RFBT7UTPDXOM4G3VTPA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ZF673N2RFBT7UTPDXOM4G3VTPA","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":"69335c9364613fdce233eb2874dad655443064209164d45367ea5b48d3360465","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-02-05T06:59:03Z","title_canon_sha256":"61807f441a423f5b9dd398b932ef0040816c9e040d6c1420a6bb84f0a5d6ef8a"},"schema_version":"1.0","source":{"id":"1302.0948","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.0948","created_at":"2026-05-18T02:53:41Z"},{"alias_kind":"arxiv_version","alias_value":"1302.0948v2","created_at":"2026-05-18T02:53:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.0948","created_at":"2026-05-18T02:53:41Z"},{"alias_kind":"pith_short_12","alias_value":"ZF673N2RFBT7","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZF673N2RFBT7UTPD","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZF673N2R","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:727ecd02d341d54aa8a6080d087626778187737b866d8f26c3f1cfee0099a28b","target":"graph","created_at":"2026-05-18T02:53:41Z","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":"We consider a multi-organizational system in which each organization contributes processors to the global pool but also jobs to be processed on the common resources. The fairness of the scheduling algorithm is essential for the stability and even for the existence of such systems (as organizations may refuse to join an unfair system).\n  We consider on-line, non-clairvoyant scheduling of sequential jobs. The started jobs cannot be stopped, canceled, preempted, or moved to other processors. We consider identical processors, but most of our results can be extended to related or unrelated processo","authors_text":"Krzysztof Rzadca, Piotr Skowron","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-02-05T06:59:03Z","title":"Non-monetary fair scheduling---a cooperative game theory approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.0948","kind":"arxiv","version":2},"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:0703603c976aae0bd73a27ed3389f16e872c4c0a741f44c5540092c7f4e64408","target":"record","created_at":"2026-05-18T02:53:41Z","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":"69335c9364613fdce233eb2874dad655443064209164d45367ea5b48d3360465","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-02-05T06:59:03Z","title_canon_sha256":"61807f441a423f5b9dd398b932ef0040816c9e040d6c1420a6bb84f0a5d6ef8a"},"schema_version":"1.0","source":{"id":"1302.0948","kind":"arxiv","version":2}},"canonical_sha256":"c97dfdb7512867fa4de3bb99c36eb37833d8e9c167c90c83dc5f9125645e39d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c97dfdb7512867fa4de3bb99c36eb37833d8e9c167c90c83dc5f9125645e39d2","first_computed_at":"2026-05-18T02:53:41.591210Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:53:41.591210Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7W8Bet9jmIwAMOB4frCy8sMoo6f+6eKC1utROJD+jpdS93Iu+VTPFSVKqVcuvDgxj/lxmD3+P9hxoa9R/PfPCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:53:41.592012Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.0948","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0703603c976aae0bd73a27ed3389f16e872c4c0a741f44c5540092c7f4e64408","sha256:727ecd02d341d54aa8a6080d087626778187737b866d8f26c3f1cfee0099a28b"],"state_sha256":"a4fd4d72e26be5aa8aaf9cf5dc3799d5c251037a7d6a032748cdac46cd8039c2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w5tmY3Yb9hPXA3ScMco45gwgLTU1xrR2GzscbFK8gLFndnTPpb6w76ym1BsIS4QWXWuiO39WlUrMpJ75foCECQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T03:09:37.106598Z","bundle_sha256":"2a4bf03a2ab84502af1c4b5a978eb103b3c04917c3863cf06d2ec378dfaea09a"}}