{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:IABGB5JUKUGIK6QWAFG4QXCJRY","short_pith_number":"pith:IABGB5JU","schema_version":"1.0","canonical_sha256":"400260f534550c857a16014dc85c498e24339a958ab0ad7f3245ecb7a7c37a81","source":{"kind":"arxiv","id":"0808.1431","version":2},"attestation_state":"computed","paper":{"title":"A General Theory of Computational Scalability Based on Rational Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.PF","authors_text":"Neil J. Gunther","submitted_at":"2008-08-11T00:06:16Z","abstract_excerpt":"The universal scalability law of computational capacity is a rational function C_p = P(p)/Q(p) with P(p) a linear polynomial and Q(p) a second-degree polynomial in the number of physical processors p, that has been long used for statistical modeling and prediction of computer system performance. We prove that C_p is equivalent to the synchronous throughput bound for a machine-repairman with state-dependent service rate. Simpler rational functions, such as Amdahl's law and Gustafson speedup, are corollaries of this queue-theoretic bound. C_p is further shown to be both necessary and sufficient "},"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":"0808.1431","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2008-08-11T00:06:16Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"d534588317fef6bff4af425097b33490bfd79f2cbb7bd18a3a2727e8cb311c2b","abstract_canon_sha256":"50df39fbf6ae99a98c03880de4fd22ee1cc0a57a67248e9089fd8328a33cedb8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:13:46.505456Z","signature_b64":"e6wnYyzCBLZj3MMC9u40gKeZ41ERf33Ze0ygES8IHkF5KDHkce18vrUqDkl3EmTH/05hQl/hm6QxfmCL8/IyDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"400260f534550c857a16014dc85c498e24339a958ab0ad7f3245ecb7a7c37a81","last_reissued_at":"2026-07-04T15:13:46.504961Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:13:46.504961Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A General Theory of Computational Scalability Based on Rational Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.PF","authors_text":"Neil J. Gunther","submitted_at":"2008-08-11T00:06:16Z","abstract_excerpt":"The universal scalability law of computational capacity is a rational function C_p = P(p)/Q(p) with P(p) a linear polynomial and Q(p) a second-degree polynomial in the number of physical processors p, that has been long used for statistical modeling and prediction of computer system performance. We prove that C_p is equivalent to the synchronous throughput bound for a machine-repairman with state-dependent service rate. Simpler rational functions, such as Amdahl's law and Gustafson speedup, are corollaries of this queue-theoretic bound. C_p is further shown to be both necessary and sufficient "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0808.1431","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0808.1431/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":"0808.1431","created_at":"2026-07-04T15:13:46.505022+00:00"},{"alias_kind":"arxiv_version","alias_value":"0808.1431v2","created_at":"2026-07-04T15:13:46.505022+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0808.1431","created_at":"2026-07-04T15:13:46.505022+00:00"},{"alias_kind":"pith_short_12","alias_value":"IABGB5JUKUGI","created_at":"2026-07-04T15:13:46.505022+00:00"},{"alias_kind":"pith_short_16","alias_value":"IABGB5JUKUGIK6QW","created_at":"2026-07-04T15:13:46.505022+00:00"},{"alias_kind":"pith_short_8","alias_value":"IABGB5JU","created_at":"2026-07-04T15:13:46.505022+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/IABGB5JUKUGIK6QWAFG4QXCJRY","json":"https://pith.science/pith/IABGB5JUKUGIK6QWAFG4QXCJRY.json","graph_json":"https://pith.science/api/pith-number/IABGB5JUKUGIK6QWAFG4QXCJRY/graph.json","events_json":"https://pith.science/api/pith-number/IABGB5JUKUGIK6QWAFG4QXCJRY/events.json","paper":"https://pith.science/paper/IABGB5JU"},"agent_actions":{"view_html":"https://pith.science/pith/IABGB5JUKUGIK6QWAFG4QXCJRY","download_json":"https://pith.science/pith/IABGB5JUKUGIK6QWAFG4QXCJRY.json","view_paper":"https://pith.science/paper/IABGB5JU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0808.1431&json=true","fetch_graph":"https://pith.science/api/pith-number/IABGB5JUKUGIK6QWAFG4QXCJRY/graph.json","fetch_events":"https://pith.science/api/pith-number/IABGB5JUKUGIK6QWAFG4QXCJRY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IABGB5JUKUGIK6QWAFG4QXCJRY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IABGB5JUKUGIK6QWAFG4QXCJRY/action/storage_attestation","attest_author":"https://pith.science/pith/IABGB5JUKUGIK6QWAFG4QXCJRY/action/author_attestation","sign_citation":"https://pith.science/pith/IABGB5JUKUGIK6QWAFG4QXCJRY/action/citation_signature","submit_replication":"https://pith.science/pith/IABGB5JUKUGIK6QWAFG4QXCJRY/action/replication_record"}},"created_at":"2026-07-04T15:13:46.505022+00:00","updated_at":"2026-07-04T15:13:46.505022+00:00"}