{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6GUY6OVJG7AM5ROWMYW3WRJFB6","short_pith_number":"pith:6GUY6OVJ","schema_version":"1.0","canonical_sha256":"f1a98f3aa937c0cec5d6662dbb45250fa917a9169df2a05e2ad813c9036c1b3d","source":{"kind":"arxiv","id":"1706.08366","version":3},"attestation_state":"computed","paper":{"title":"Ordered and Delayed Adversaries and How to Work against Them on a Shared Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Dariusz R. Kowalski, Jaroslaw Mirek, Marek Klonowski","submitted_at":"2017-06-26T13:34:50Z","abstract_excerpt":"In this work we define a class of ordered adversaries causing distractions according to some partial order fixed by the adversary before the execution, and study how they affect performance of algorithms. We focus on the Do-All problem of performing t tasks on a shared channel consisting of p crash-prone stations. The channel restricts communication: no message is delivered to the alive stations if more than one station transmits at the same time. The performance measure for the Do-All problem is work: the total number of available processor steps during the whole execution. We address the que"},"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":"1706.08366","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-06-26T13:34:50Z","cross_cats_sorted":[],"title_canon_sha256":"28ac613718a97ebc33f4ee17605be9d823a921090089e23e7e71084cb32479e3","abstract_canon_sha256":"80324edd5274b285f44b74247aebba2026dc75e07a2385ed59157be17de7f499"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:53.079008Z","signature_b64":"CVY9I/kgczIc8p/8h+Q8yg3JUJ/2Py+G3SgTNeoMZMSvhd3CYYVAjJlB5nKydV1zcoq3zpwG1rHVVR3kg2tICA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1a98f3aa937c0cec5d6662dbb45250fa917a9169df2a05e2ad813c9036c1b3d","last_reissued_at":"2026-05-18T00:09:53.078277Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:53.078277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ordered and Delayed Adversaries and How to Work against Them on a Shared Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Dariusz R. Kowalski, Jaroslaw Mirek, Marek Klonowski","submitted_at":"2017-06-26T13:34:50Z","abstract_excerpt":"In this work we define a class of ordered adversaries causing distractions according to some partial order fixed by the adversary before the execution, and study how they affect performance of algorithms. We focus on the Do-All problem of performing t tasks on a shared channel consisting of p crash-prone stations. The channel restricts communication: no message is delivered to the alive stations if more than one station transmits at the same time. The performance measure for the Do-All problem is work: the total number of available processor steps during the whole execution. We address the que"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.08366","kind":"arxiv","version":3},"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":"1706.08366","created_at":"2026-05-18T00:09:53.078403+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.08366v3","created_at":"2026-05-18T00:09:53.078403+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08366","created_at":"2026-05-18T00:09:53.078403+00:00"},{"alias_kind":"pith_short_12","alias_value":"6GUY6OVJG7AM","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6GUY6OVJG7AM5ROW","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6GUY6OVJ","created_at":"2026-05-18T12:31:03.183658+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/6GUY6OVJG7AM5ROWMYW3WRJFB6","json":"https://pith.science/pith/6GUY6OVJG7AM5ROWMYW3WRJFB6.json","graph_json":"https://pith.science/api/pith-number/6GUY6OVJG7AM5ROWMYW3WRJFB6/graph.json","events_json":"https://pith.science/api/pith-number/6GUY6OVJG7AM5ROWMYW3WRJFB6/events.json","paper":"https://pith.science/paper/6GUY6OVJ"},"agent_actions":{"view_html":"https://pith.science/pith/6GUY6OVJG7AM5ROWMYW3WRJFB6","download_json":"https://pith.science/pith/6GUY6OVJG7AM5ROWMYW3WRJFB6.json","view_paper":"https://pith.science/paper/6GUY6OVJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.08366&json=true","fetch_graph":"https://pith.science/api/pith-number/6GUY6OVJG7AM5ROWMYW3WRJFB6/graph.json","fetch_events":"https://pith.science/api/pith-number/6GUY6OVJG7AM5ROWMYW3WRJFB6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6GUY6OVJG7AM5ROWMYW3WRJFB6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6GUY6OVJG7AM5ROWMYW3WRJFB6/action/storage_attestation","attest_author":"https://pith.science/pith/6GUY6OVJG7AM5ROWMYW3WRJFB6/action/author_attestation","sign_citation":"https://pith.science/pith/6GUY6OVJG7AM5ROWMYW3WRJFB6/action/citation_signature","submit_replication":"https://pith.science/pith/6GUY6OVJG7AM5ROWMYW3WRJFB6/action/replication_record"}},"created_at":"2026-05-18T00:09:53.078403+00:00","updated_at":"2026-05-18T00:09:53.078403+00:00"}