{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:ZP7SVCVA7PSSR3NCKBDTODRZUW","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"aec8ad306c2a7c62107637563a4eac1c05e05aa0ddd54498cb7ca92e9f0fd654","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DC","submitted_at":"2011-07-15T04:24:38Z","title_canon_sha256":"01950a763b0051959e1b142b4786403c730d91d2a2f5a83dca8a36153ed6888c"},"schema_version":"1.0","source":{"id":"1107.2990","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.2990","created_at":"2026-05-18T03:05:45Z"},{"alias_kind":"arxiv_version","alias_value":"1107.2990v2","created_at":"2026-05-18T03:05:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2990","created_at":"2026-05-18T03:05:45Z"},{"alias_kind":"pith_short_12","alias_value":"ZP7SVCVA7PSS","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"ZP7SVCVA7PSSR3NC","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"ZP7SVCVA","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:08637f2bd679eb3dc01a75efa0669414827e86f95bf25232e93b54f092ff3c7f","target":"graph","created_at":"2026-05-18T03:05:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We present and analyze a wait-free deterministic algorithm for solving the at-most-once problem: how m shared-memory fail-prone processes perform asynchronously n jobs at most once. Our algorithmic strategy provides for the first time nearly optimal effectiveness, which is a measure that expresses the total number of jobs completed in the worst case. The effectiveness of our algorithm equals n-2m+2. This is up to an additive factor of m close to the known effectiveness upper bound n-m+1 over all possible algorithms and improves on the previously best known deterministic solutions that have eff","authors_text":"Aggelos Kiayias, Sotirios Kentros","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DC","submitted_at":"2011-07-15T04:24:38Z","title":"Solving the At-Most-Once Problem with Nearly Optimal Effectiveness"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.2990","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:10079697b50db9d3dd25bf16511d0a426f48910dc9b24be77bf305fed23ae561","target":"record","created_at":"2026-05-18T03:05:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"aec8ad306c2a7c62107637563a4eac1c05e05aa0ddd54498cb7ca92e9f0fd654","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DC","submitted_at":"2011-07-15T04:24:38Z","title_canon_sha256":"01950a763b0051959e1b142b4786403c730d91d2a2f5a83dca8a36153ed6888c"},"schema_version":"1.0","source":{"id":"1107.2990","kind":"arxiv","version":2}},"canonical_sha256":"cbff2a8aa0fbe528eda25047370e39a5bde22df9212d7f2f1ad2eaa7895a2cac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cbff2a8aa0fbe528eda25047370e39a5bde22df9212d7f2f1ad2eaa7895a2cac","first_computed_at":"2026-05-18T03:05:45.056997Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:45.056997Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jjh6Ic50Qk5QfZktm/Zspicgw7FJdqLDLT8p611KViR12K9UlAE8xB3PGEPGaQLcgyUYO/dUCo1Nhx4fJGuHBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:45.057608Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.2990","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:10079697b50db9d3dd25bf16511d0a426f48910dc9b24be77bf305fed23ae561","sha256:08637f2bd679eb3dc01a75efa0669414827e86f95bf25232e93b54f092ff3c7f"],"state_sha256":"ef83bc6797a39dc5ebc8f65cdf93a5e6c52b7de4feeb821180a7e2ccb5525de2"}