{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:IPVYE6DUQRPEREUMWY7DM2BPUW","short_pith_number":"pith:IPVYE6DU","schema_version":"1.0","canonical_sha256":"43eb827874845e48928cb63e36682fa5853d5290f442e2c222cd92eb99741740","source":{"kind":"arxiv","id":"1505.05964","version":1},"attestation_state":"computed","paper":{"title":"CCS: It's not Fair! Fair Schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Peter H\\\"ofner, Rob van Glabbeek","submitted_at":"2015-05-22T06:45:20Z","abstract_excerpt":"In the process algebra community it is sometimes suggested that, on some level of abstraction, any distributed system can be modelled in standard process-algebraic specification formalisms like CCS. This sentiment is strengthened by results testifying that CCS, like many similar formalisms, is Turing powerful and provides a mechanism for interaction. This paper counters that sentiment by presenting a simple fair scheduler---one that in suitable variations occurs in many distributed systems---of which no implementation can be expressed in CCS, unless CCS is enriched with a fairness assumption.\n"},"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":"1505.05964","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-05-22T06:45:20Z","cross_cats_sorted":[],"title_canon_sha256":"5c7cb366a3c278ae3cf6f8f22b7dcd7d32c39632480a8d9d23b4e97dd26362d5","abstract_canon_sha256":"dee4505b17ee4de2c86bb1b522966e9a30f90fe5de9bd7cc8d8e839eed791cd7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:03:49.538500Z","signature_b64":"jycvlyTQB5v9NZhWko1faHeCDMlIl7Fcy7hsjLD34x2tiYvDHxI5iAIYm88895MdaMye2WVVmqmPgJYAvp5qAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43eb827874845e48928cb63e36682fa5853d5290f442e2c222cd92eb99741740","last_reissued_at":"2026-05-18T02:03:49.537841Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:03:49.537841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CCS: It's not Fair! Fair Schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Peter H\\\"ofner, Rob van Glabbeek","submitted_at":"2015-05-22T06:45:20Z","abstract_excerpt":"In the process algebra community it is sometimes suggested that, on some level of abstraction, any distributed system can be modelled in standard process-algebraic specification formalisms like CCS. This sentiment is strengthened by results testifying that CCS, like many similar formalisms, is Turing powerful and provides a mechanism for interaction. This paper counters that sentiment by presenting a simple fair scheduler---one that in suitable variations occurs in many distributed systems---of which no implementation can be expressed in CCS, unless CCS is enriched with a fairness assumption.\n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.05964","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1505.05964","created_at":"2026-05-18T02:03:49.537963+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.05964v1","created_at":"2026-05-18T02:03:49.537963+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.05964","created_at":"2026-05-18T02:03:49.537963+00:00"},{"alias_kind":"pith_short_12","alias_value":"IPVYE6DUQRPE","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"IPVYE6DUQRPEREUM","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"IPVYE6DU","created_at":"2026-05-18T12:29:25.134429+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/IPVYE6DUQRPEREUMWY7DM2BPUW","json":"https://pith.science/pith/IPVYE6DUQRPEREUMWY7DM2BPUW.json","graph_json":"https://pith.science/api/pith-number/IPVYE6DUQRPEREUMWY7DM2BPUW/graph.json","events_json":"https://pith.science/api/pith-number/IPVYE6DUQRPEREUMWY7DM2BPUW/events.json","paper":"https://pith.science/paper/IPVYE6DU"},"agent_actions":{"view_html":"https://pith.science/pith/IPVYE6DUQRPEREUMWY7DM2BPUW","download_json":"https://pith.science/pith/IPVYE6DUQRPEREUMWY7DM2BPUW.json","view_paper":"https://pith.science/paper/IPVYE6DU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.05964&json=true","fetch_graph":"https://pith.science/api/pith-number/IPVYE6DUQRPEREUMWY7DM2BPUW/graph.json","fetch_events":"https://pith.science/api/pith-number/IPVYE6DUQRPEREUMWY7DM2BPUW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IPVYE6DUQRPEREUMWY7DM2BPUW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IPVYE6DUQRPEREUMWY7DM2BPUW/action/storage_attestation","attest_author":"https://pith.science/pith/IPVYE6DUQRPEREUMWY7DM2BPUW/action/author_attestation","sign_citation":"https://pith.science/pith/IPVYE6DUQRPEREUMWY7DM2BPUW/action/citation_signature","submit_replication":"https://pith.science/pith/IPVYE6DUQRPEREUMWY7DM2BPUW/action/replication_record"}},"created_at":"2026-05-18T02:03:49.537963+00:00","updated_at":"2026-05-18T02:03:49.537963+00:00"}