{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DUOBZLRWMUJ5HIWFR7FFQNMVH6","short_pith_number":"pith:DUOBZLRW","schema_version":"1.0","canonical_sha256":"1d1c1cae366513d3a2c58fca5835953fab0707ff8b494003c9a1e00bac529853","source":{"kind":"arxiv","id":"1807.06820","version":1},"attestation_state":"computed","paper":{"title":"The Scheduler is Very Powerful in Competitive Analysis of Distributed List Accessing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Faith Ellen, Joan Boyar, Kim S. Larsen","submitted_at":"2018-07-18T08:52:06Z","abstract_excerpt":"This work is a continuation of efforts to define and understand competitive analysis of algorithms in a distributed shared memory setting, which is surprisingly different from the classical online setting. In fact, in a distributed shared memory setting, we find a counter-example to the theorem concerning classical randomized online algorithms which shows that, if there is a $c$-competitive randomized algorithm against an adaptive offline adversary, then there is a $c$-competitive deterministic algorithm [Ben-David, Borodin, Karp, Tardos, Wigderson, 1994]. In a distributed setting, there is ad"},"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":"1807.06820","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-18T08:52:06Z","cross_cats_sorted":[],"title_canon_sha256":"d0eec71f4cb8bba0a2967ead7dbe07658b312c0b029b6c7ade9a58f2956fda3b","abstract_canon_sha256":"f2ccba8928da16df7ac672e3bdb59de4b5fb6b5042c7e268555ce2c504f78846"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:25.682549Z","signature_b64":"PcyBSgistEnzfuYPmWoI5h6H5TrC6IILpjSaTyHCtG+tWHS+uEx0BTgK9SAaAOL+geitr92WNbl0ezC7Th9PAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d1c1cae366513d3a2c58fca5835953fab0707ff8b494003c9a1e00bac529853","last_reissued_at":"2026-05-18T00:10:25.681925Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:25.681925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Scheduler is Very Powerful in Competitive Analysis of Distributed List Accessing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Faith Ellen, Joan Boyar, Kim S. Larsen","submitted_at":"2018-07-18T08:52:06Z","abstract_excerpt":"This work is a continuation of efforts to define and understand competitive analysis of algorithms in a distributed shared memory setting, which is surprisingly different from the classical online setting. In fact, in a distributed shared memory setting, we find a counter-example to the theorem concerning classical randomized online algorithms which shows that, if there is a $c$-competitive randomized algorithm against an adaptive offline adversary, then there is a $c$-competitive deterministic algorithm [Ben-David, Borodin, Karp, Tardos, Wigderson, 1994]. In a distributed setting, there is ad"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.06820","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":"1807.06820","created_at":"2026-05-18T00:10:25.682042+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.06820v1","created_at":"2026-05-18T00:10:25.682042+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.06820","created_at":"2026-05-18T00:10:25.682042+00:00"},{"alias_kind":"pith_short_12","alias_value":"DUOBZLRWMUJ5","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DUOBZLRWMUJ5HIWF","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DUOBZLRW","created_at":"2026-05-18T12:32:19.392346+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/DUOBZLRWMUJ5HIWFR7FFQNMVH6","json":"https://pith.science/pith/DUOBZLRWMUJ5HIWFR7FFQNMVH6.json","graph_json":"https://pith.science/api/pith-number/DUOBZLRWMUJ5HIWFR7FFQNMVH6/graph.json","events_json":"https://pith.science/api/pith-number/DUOBZLRWMUJ5HIWFR7FFQNMVH6/events.json","paper":"https://pith.science/paper/DUOBZLRW"},"agent_actions":{"view_html":"https://pith.science/pith/DUOBZLRWMUJ5HIWFR7FFQNMVH6","download_json":"https://pith.science/pith/DUOBZLRWMUJ5HIWFR7FFQNMVH6.json","view_paper":"https://pith.science/paper/DUOBZLRW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.06820&json=true","fetch_graph":"https://pith.science/api/pith-number/DUOBZLRWMUJ5HIWFR7FFQNMVH6/graph.json","fetch_events":"https://pith.science/api/pith-number/DUOBZLRWMUJ5HIWFR7FFQNMVH6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DUOBZLRWMUJ5HIWFR7FFQNMVH6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DUOBZLRWMUJ5HIWFR7FFQNMVH6/action/storage_attestation","attest_author":"https://pith.science/pith/DUOBZLRWMUJ5HIWFR7FFQNMVH6/action/author_attestation","sign_citation":"https://pith.science/pith/DUOBZLRWMUJ5HIWFR7FFQNMVH6/action/citation_signature","submit_replication":"https://pith.science/pith/DUOBZLRWMUJ5HIWFR7FFQNMVH6/action/replication_record"}},"created_at":"2026-05-18T00:10:25.682042+00:00","updated_at":"2026-05-18T00:10:25.682042+00:00"}