{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:ZF673N2RFBT7UTPDXOM4G3VTPA","short_pith_number":"pith:ZF673N2R","schema_version":"1.0","canonical_sha256":"c97dfdb7512867fa4de3bb99c36eb37833d8e9c167c90c83dc5f9125645e39d2","source":{"kind":"arxiv","id":"1302.0948","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1302.0948","created_at":"2026-05-18T02:53:41.591353+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.0948v2","created_at":"2026-05-18T02:53:41.591353+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.0948","created_at":"2026-05-18T02:53:41.591353+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZF673N2RFBT7","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZF673N2RFBT7UTPD","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZF673N2R","created_at":"2026-05-18T12:28:09.283467+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZF673N2RFBT7UTPDXOM4G3VTPA","json":"https://pith.science/pith/ZF673N2RFBT7UTPDXOM4G3VTPA.json","graph_json":"https://pith.science/api/pith-number/ZF673N2RFBT7UTPDXOM4G3VTPA/graph.json","events_json":"https://pith.science/api/pith-number/ZF673N2RFBT7UTPDXOM4G3VTPA/events.json","paper":"https://pith.science/paper/ZF673N2R"},"agent_actions":{"view_html":"https://pith.science/pith/ZF673N2RFBT7UTPDXOM4G3VTPA","download_json":"https://pith.science/pith/ZF673N2RFBT7UTPDXOM4G3VTPA.json","view_paper":"https://pith.science/paper/ZF673N2R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.0948&json=true","fetch_graph":"https://pith.science/api/pith-number/ZF673N2RFBT7UTPDXOM4G3VTPA/graph.json","fetch_events":"https://pith.science/api/pith-number/ZF673N2RFBT7UTPDXOM4G3VTPA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZF673N2RFBT7UTPDXOM4G3VTPA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZF673N2RFBT7UTPDXOM4G3VTPA/action/storage_attestation","attest_author":"https://pith.science/pith/ZF673N2RFBT7UTPDXOM4G3VTPA/action/author_attestation","sign_citation":"https://pith.science/pith/ZF673N2RFBT7UTPDXOM4G3VTPA/action/citation_signature","submit_replication":"https://pith.science/pith/ZF673N2RFBT7UTPDXOM4G3VTPA/action/replication_record"}},"created_at":"2026-05-18T02:53:41.591353+00:00","updated_at":"2026-05-18T02:53:41.591353+00:00"}