{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:Y7MQCIYUUSXLAU77E777GGHRC3","short_pith_number":"pith:Y7MQCIYU","schema_version":"1.0","canonical_sha256":"c7d9012314a4aeb053ff27fff318f116dc019c2c8673c46f0256a41547508ef0","source":{"kind":"arxiv","id":"2207.07561","version":1},"attestation_state":"computed","paper":{"title":"Generalized Wake-Up: Amortized Shared Memory Lower Bounds for Linearizable Data Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Siddhartha Visveswara Jayanti","submitted_at":"2022-07-12T19:21:46Z","abstract_excerpt":"In this work, we define the generalized wake-up problem, $GWU(s)$, for a shared memory asynchronous system with $n$ processes. Informally, the problem, which is parametrized by an increasing sequence $s = s_1,\\ldots,s_p$, asks that at least $n - i + 1$ processes identify that at least $s_i$ other processes have \"woken up\" and taken at least one step for each $1 \\le i \\le n$. We prove that any solution to $GWU(s)$ that uses read/write/compare-and-swap variables requires at least $\\Omega\\left(\\sum_{i = 1}^n \\log s_i \\right)$ steps to solve.\n  The generalized wake-up lower bound serves as a techn"},"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":"2207.07561","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-07-12T19:21:46Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"1ae063d0749eabc97f347d5cb6b3caa00b2930c23d500a08459b37d71628395e","abstract_canon_sha256":"c98e52963282543d7ba484772559e567a9095229f8ebfc214e8ef47f2536ecbb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:40:33.833339Z","signature_b64":"U3pPs5mvdHM8AikzIDPKG8WVfoO1/bC1PEkCW/rsnlTZS1zh6gg6Rq8T1IZdYimCMW7NETJkQEM5aCMIoB6jCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c7d9012314a4aeb053ff27fff318f116dc019c2c8673c46f0256a41547508ef0","last_reissued_at":"2026-07-05T04:40:33.832952Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:40:33.832952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized Wake-Up: Amortized Shared Memory Lower Bounds for Linearizable Data Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Siddhartha Visveswara Jayanti","submitted_at":"2022-07-12T19:21:46Z","abstract_excerpt":"In this work, we define the generalized wake-up problem, $GWU(s)$, for a shared memory asynchronous system with $n$ processes. Informally, the problem, which is parametrized by an increasing sequence $s = s_1,\\ldots,s_p$, asks that at least $n - i + 1$ processes identify that at least $s_i$ other processes have \"woken up\" and taken at least one step for each $1 \\le i \\le n$. We prove that any solution to $GWU(s)$ that uses read/write/compare-and-swap variables requires at least $\\Omega\\left(\\sum_{i = 1}^n \\log s_i \\right)$ steps to solve.\n  The generalized wake-up lower bound serves as a techn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.07561","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/2207.07561/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":"2207.07561","created_at":"2026-07-05T04:40:33.833018+00:00"},{"alias_kind":"arxiv_version","alias_value":"2207.07561v1","created_at":"2026-07-05T04:40:33.833018+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.07561","created_at":"2026-07-05T04:40:33.833018+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y7MQCIYUUSXL","created_at":"2026-07-05T04:40:33.833018+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y7MQCIYUUSXLAU77","created_at":"2026-07-05T04:40:33.833018+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y7MQCIYU","created_at":"2026-07-05T04:40:33.833018+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.14420","citing_title":"Aggregating Funnels for Faster Fetch&Add and Queues","ref_index":33,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Y7MQCIYUUSXLAU77E777GGHRC3","json":"https://pith.science/pith/Y7MQCIYUUSXLAU77E777GGHRC3.json","graph_json":"https://pith.science/api/pith-number/Y7MQCIYUUSXLAU77E777GGHRC3/graph.json","events_json":"https://pith.science/api/pith-number/Y7MQCIYUUSXLAU77E777GGHRC3/events.json","paper":"https://pith.science/paper/Y7MQCIYU"},"agent_actions":{"view_html":"https://pith.science/pith/Y7MQCIYUUSXLAU77E777GGHRC3","download_json":"https://pith.science/pith/Y7MQCIYUUSXLAU77E777GGHRC3.json","view_paper":"https://pith.science/paper/Y7MQCIYU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2207.07561&json=true","fetch_graph":"https://pith.science/api/pith-number/Y7MQCIYUUSXLAU77E777GGHRC3/graph.json","fetch_events":"https://pith.science/api/pith-number/Y7MQCIYUUSXLAU77E777GGHRC3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y7MQCIYUUSXLAU77E777GGHRC3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y7MQCIYUUSXLAU77E777GGHRC3/action/storage_attestation","attest_author":"https://pith.science/pith/Y7MQCIYUUSXLAU77E777GGHRC3/action/author_attestation","sign_citation":"https://pith.science/pith/Y7MQCIYUUSXLAU77E777GGHRC3/action/citation_signature","submit_replication":"https://pith.science/pith/Y7MQCIYUUSXLAU77E777GGHRC3/action/replication_record"}},"created_at":"2026-07-05T04:40:33.833018+00:00","updated_at":"2026-07-05T04:40:33.833018+00:00"}