{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1998:QITJOGIWTGGXPSDWGNRMMRK2BP","short_pith_number":"pith:QITJOGIW","schema_version":"1.0","canonical_sha256":"8226971916998d77c8763362c6455a0bcf7e7f4f4a1bf098790337017d5cd10e","source":{"kind":"arxiv","id":"cs/9809099","version":1},"attestation_state":"computed","paper":{"title":"A Quantitative Measure Of Fairness And Discrimination For Resource Allocation In Shared Computer Systems","license":"","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"D. Chiu, R. Jain, W. Hawe","submitted_at":"1998-09-24T05:27:34Z","abstract_excerpt":"Fairness is an important performance criterion in all resource allocation schemes, including those in distributed computer systems. However, it is often specified only qualitatively. The quantitative measures proposed in the literature are either too specific to a particular application, or suffer from some undesirable characteristics. In this paper, we have introduced a quantitative measure called Indiex of FRairness. The index is applicable to any resource sharing or allocation problem. It is independent of the amount of the resource. The fairness index always lies between 0 and 1. This boun"},"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":"cs/9809099","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.NI","submitted_at":"1998-09-24T05:27:34Z","cross_cats_sorted":[],"title_canon_sha256":"223043b8d06ca1001106b48174aa20cbbe8c903b17ec10d5affcbceb272f6f76","abstract_canon_sha256":"cb376c845057256b17f6b101bb3335eb4ff94e292d360da587975ffcf8619230"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:25:07.424138Z","signature_b64":"w/gDAYtm4rHCRu2UH8opKqEfvcR8utBcm1N9IhhmwZYSsMJUqV8MF3UaufNq3HDZuk79vtbKsx1B4Geg0LtGBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8226971916998d77c8763362c6455a0bcf7e7f4f4a1bf098790337017d5cd10e","last_reissued_at":"2026-07-04T14:25:07.423742Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:25:07.423742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Quantitative Measure Of Fairness And Discrimination For Resource Allocation In Shared Computer Systems","license":"","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"D. Chiu, R. Jain, W. Hawe","submitted_at":"1998-09-24T05:27:34Z","abstract_excerpt":"Fairness is an important performance criterion in all resource allocation schemes, including those in distributed computer systems. However, it is often specified only qualitatively. The quantitative measures proposed in the literature are either too specific to a particular application, or suffer from some undesirable characteristics. In this paper, we have introduced a quantitative measure called Indiex of FRairness. The index is applicable to any resource sharing or allocation problem. It is independent of the amount of the resource. The fairness index always lies between 0 and 1. This boun"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/9809099","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/cs/9809099/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"cs/9809099","created_at":"2026-07-04T14:25:07.423799+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/9809099v1","created_at":"2026-07-04T14:25:07.423799+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/9809099","created_at":"2026-07-04T14:25:07.423799+00:00"},{"alias_kind":"pith_short_12","alias_value":"QITJOGIWTGGX","created_at":"2026-07-04T14:25:07.423799+00:00"},{"alias_kind":"pith_short_16","alias_value":"QITJOGIWTGGXPSDW","created_at":"2026-07-04T14:25:07.423799+00:00"},{"alias_kind":"pith_short_8","alias_value":"QITJOGIW","created_at":"2026-07-04T14:25:07.423799+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2511.14135","citing_title":"AdaFair-MARL: Enforcing Adaptive Fairness Constraints in Multi-Agent Reinforcement Learning","ref_index":32,"is_internal_anchor":true},{"citing_arxiv_id":"2604.25032","citing_title":"Offline Evaluation Measures of Fairness in Recommender Systems","ref_index":108,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QITJOGIWTGGXPSDWGNRMMRK2BP","json":"https://pith.science/pith/QITJOGIWTGGXPSDWGNRMMRK2BP.json","graph_json":"https://pith.science/api/pith-number/QITJOGIWTGGXPSDWGNRMMRK2BP/graph.json","events_json":"https://pith.science/api/pith-number/QITJOGIWTGGXPSDWGNRMMRK2BP/events.json","paper":"https://pith.science/paper/QITJOGIW"},"agent_actions":{"view_html":"https://pith.science/pith/QITJOGIWTGGXPSDWGNRMMRK2BP","download_json":"https://pith.science/pith/QITJOGIWTGGXPSDWGNRMMRK2BP.json","view_paper":"https://pith.science/paper/QITJOGIW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/9809099&json=true","fetch_graph":"https://pith.science/api/pith-number/QITJOGIWTGGXPSDWGNRMMRK2BP/graph.json","fetch_events":"https://pith.science/api/pith-number/QITJOGIWTGGXPSDWGNRMMRK2BP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QITJOGIWTGGXPSDWGNRMMRK2BP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QITJOGIWTGGXPSDWGNRMMRK2BP/action/storage_attestation","attest_author":"https://pith.science/pith/QITJOGIWTGGXPSDWGNRMMRK2BP/action/author_attestation","sign_citation":"https://pith.science/pith/QITJOGIWTGGXPSDWGNRMMRK2BP/action/citation_signature","submit_replication":"https://pith.science/pith/QITJOGIWTGGXPSDWGNRMMRK2BP/action/replication_record"}},"created_at":"2026-07-04T14:25:07.423799+00:00","updated_at":"2026-07-04T14:25:07.423799+00:00"}