{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:U2XK6SLIFXXS64XSUS2IAHQRKW","short_pith_number":"pith:U2XK6SLI","schema_version":"1.0","canonical_sha256":"a6aeaf49682def2f72f2a4b4801e115581db68eaa9214987254dfa21437c0c84","source":{"kind":"arxiv","id":"1109.3056","version":3},"attestation_state":"computed","paper":{"title":"Wait-Freedom with Advice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Carole Delporte-Gallet, Eli Gafni, Hugues Fauconnier, Petr Kuznetsov","submitted_at":"2011-09-14T11:36:29Z","abstract_excerpt":"We motivate and propose a new way of thinking about failure detectors which allows us to define, quite surprisingly, what it means to solve a distributed task \\emph{wait-free} \\emph{using a failure detector}. In our model, the system is composed of \\emph{computation} processes that obtain inputs and are supposed to output in a finite number of steps and \\emph{synchronization} processes that are subject to failures and can query a failure detector. We assume that, under the condition that \\emph{correct} synchronization processes take sufficiently many steps, they provide the computation process"},"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":"1109.3056","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-09-14T11:36:29Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"0c8692e62a06cf39fc6fa159d1c9645c03de28e75f3946196bb4d3df39131f6c","abstract_canon_sha256":"91ac4c177fa2fb3b6a18448dbca944fdb7bcaa680fa745cd739f6f4170caffd1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:47.020672Z","signature_b64":"jWFUw1CsveZx9ghuMS1kpYOXw/rnd7oh8iEiaK++7SPbW5sCmmzwRfPT1/xKGyP/7VnQCRVeWaJUaMWKVOOZDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6aeaf49682def2f72f2a4b4801e115581db68eaa9214987254dfa21437c0c84","last_reissued_at":"2026-05-18T03:55:47.020165Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:47.020165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Wait-Freedom with Advice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Carole Delporte-Gallet, Eli Gafni, Hugues Fauconnier, Petr Kuznetsov","submitted_at":"2011-09-14T11:36:29Z","abstract_excerpt":"We motivate and propose a new way of thinking about failure detectors which allows us to define, quite surprisingly, what it means to solve a distributed task \\emph{wait-free} \\emph{using a failure detector}. In our model, the system is composed of \\emph{computation} processes that obtain inputs and are supposed to output in a finite number of steps and \\emph{synchronization} processes that are subject to failures and can query a failure detector. We assume that, under the condition that \\emph{correct} synchronization processes take sufficiently many steps, they provide the computation process"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.3056","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":"1109.3056","created_at":"2026-05-18T03:55:47.020229+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.3056v3","created_at":"2026-05-18T03:55:47.020229+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.3056","created_at":"2026-05-18T03:55:47.020229+00:00"},{"alias_kind":"pith_short_12","alias_value":"U2XK6SLIFXXS","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"U2XK6SLIFXXS64XS","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"U2XK6SLI","created_at":"2026-05-18T12:26:42.757692+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/U2XK6SLIFXXS64XSUS2IAHQRKW","json":"https://pith.science/pith/U2XK6SLIFXXS64XSUS2IAHQRKW.json","graph_json":"https://pith.science/api/pith-number/U2XK6SLIFXXS64XSUS2IAHQRKW/graph.json","events_json":"https://pith.science/api/pith-number/U2XK6SLIFXXS64XSUS2IAHQRKW/events.json","paper":"https://pith.science/paper/U2XK6SLI"},"agent_actions":{"view_html":"https://pith.science/pith/U2XK6SLIFXXS64XSUS2IAHQRKW","download_json":"https://pith.science/pith/U2XK6SLIFXXS64XSUS2IAHQRKW.json","view_paper":"https://pith.science/paper/U2XK6SLI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.3056&json=true","fetch_graph":"https://pith.science/api/pith-number/U2XK6SLIFXXS64XSUS2IAHQRKW/graph.json","fetch_events":"https://pith.science/api/pith-number/U2XK6SLIFXXS64XSUS2IAHQRKW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U2XK6SLIFXXS64XSUS2IAHQRKW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U2XK6SLIFXXS64XSUS2IAHQRKW/action/storage_attestation","attest_author":"https://pith.science/pith/U2XK6SLIFXXS64XSUS2IAHQRKW/action/author_attestation","sign_citation":"https://pith.science/pith/U2XK6SLIFXXS64XSUS2IAHQRKW/action/citation_signature","submit_replication":"https://pith.science/pith/U2XK6SLIFXXS64XSUS2IAHQRKW/action/replication_record"}},"created_at":"2026-05-18T03:55:47.020229+00:00","updated_at":"2026-05-18T03:55:47.020229+00:00"}