{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:5FUCLMHSOAEGVWPMYS5RQHXDUM","short_pith_number":"pith:5FUCLMHS","schema_version":"1.0","canonical_sha256":"e96825b0f270086ad9ecc4bb181ee3a322ab7baf003dda627b9f59a3e9f6e494","source":{"kind":"arxiv","id":"1908.07715","version":1},"attestation_state":"computed","paper":{"title":"A sufficient condition for a linear speedup in competitive parallel computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Naoki Yonezawa","submitted_at":"2019-08-21T05:50:44Z","abstract_excerpt":"In competitive parallel computing, the identical copies of a code in a phase of a sequential program are assigned to processor cores and the result of the fastest core is adopted. In the literature, it is reported that a superlinear speedup can be achieved if there is an enough fluctuation among the execution times consumed by the cores. Competitive parallel computing is a promising approach to use a huge amount of cores effectively. However, there is few theoretical studies on speedups which can be achieved by competitive parallel computing at present. In this paper, we present a behavioral m"},"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":"1908.07715","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-08-21T05:50:44Z","cross_cats_sorted":[],"title_canon_sha256":"20c2af3e057068b2da266bb6db210dcb3d9efdd3345c611047bc9d9f197f9275","abstract_canon_sha256":"199bd09c999c71c6c4591ca9971504690d168683643c5c0fac56c629506edf9c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:59:00.607892Z","signature_b64":"dZ4lexK6cVMa74huVJaz5x9/YWHvQsiF0rjH4y5U9pJmLxJKFD8dhoJS6fAcKST+14VCq44eScRy3L91pA0qBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e96825b0f270086ad9ecc4bb181ee3a322ab7baf003dda627b9f59a3e9f6e494","last_reissued_at":"2026-07-04T23:59:00.607539Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:59:00.607539Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A sufficient condition for a linear speedup in competitive parallel computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Naoki Yonezawa","submitted_at":"2019-08-21T05:50:44Z","abstract_excerpt":"In competitive parallel computing, the identical copies of a code in a phase of a sequential program are assigned to processor cores and the result of the fastest core is adopted. In the literature, it is reported that a superlinear speedup can be achieved if there is an enough fluctuation among the execution times consumed by the cores. Competitive parallel computing is a promising approach to use a huge amount of cores effectively. However, there is few theoretical studies on speedups which can be achieved by competitive parallel computing at present. In this paper, we present a behavioral m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.07715","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/1908.07715/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":"1908.07715","created_at":"2026-07-04T23:59:00.607615+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.07715v1","created_at":"2026-07-04T23:59:00.607615+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.07715","created_at":"2026-07-04T23:59:00.607615+00:00"},{"alias_kind":"pith_short_12","alias_value":"5FUCLMHSOAEG","created_at":"2026-07-04T23:59:00.607615+00:00"},{"alias_kind":"pith_short_16","alias_value":"5FUCLMHSOAEGVWPM","created_at":"2026-07-04T23:59:00.607615+00:00"},{"alias_kind":"pith_short_8","alias_value":"5FUCLMHS","created_at":"2026-07-04T23:59:00.607615+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/5FUCLMHSOAEGVWPMYS5RQHXDUM","json":"https://pith.science/pith/5FUCLMHSOAEGVWPMYS5RQHXDUM.json","graph_json":"https://pith.science/api/pith-number/5FUCLMHSOAEGVWPMYS5RQHXDUM/graph.json","events_json":"https://pith.science/api/pith-number/5FUCLMHSOAEGVWPMYS5RQHXDUM/events.json","paper":"https://pith.science/paper/5FUCLMHS"},"agent_actions":{"view_html":"https://pith.science/pith/5FUCLMHSOAEGVWPMYS5RQHXDUM","download_json":"https://pith.science/pith/5FUCLMHSOAEGVWPMYS5RQHXDUM.json","view_paper":"https://pith.science/paper/5FUCLMHS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.07715&json=true","fetch_graph":"https://pith.science/api/pith-number/5FUCLMHSOAEGVWPMYS5RQHXDUM/graph.json","fetch_events":"https://pith.science/api/pith-number/5FUCLMHSOAEGVWPMYS5RQHXDUM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5FUCLMHSOAEGVWPMYS5RQHXDUM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5FUCLMHSOAEGVWPMYS5RQHXDUM/action/storage_attestation","attest_author":"https://pith.science/pith/5FUCLMHSOAEGVWPMYS5RQHXDUM/action/author_attestation","sign_citation":"https://pith.science/pith/5FUCLMHSOAEGVWPMYS5RQHXDUM/action/citation_signature","submit_replication":"https://pith.science/pith/5FUCLMHSOAEGVWPMYS5RQHXDUM/action/replication_record"}},"created_at":"2026-07-04T23:59:00.607615+00:00","updated_at":"2026-07-04T23:59:00.607615+00:00"}