{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:UI4GERJHJLZ3JRIP7DPGBBESNX","short_pith_number":"pith:UI4GERJH","schema_version":"1.0","canonical_sha256":"a2386245274af3b4c50ff8de6084926dd70fbeb1e42e6ceb8f6e046f4e4b0954","source":{"kind":"arxiv","id":"1706.05267","version":1},"attestation_state":"computed","paper":{"title":"Set-Constrained Delivery Broadcast: Definition, Abstraction Power, and Computability Limits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Achour Mostefaoui (GDD), Damien Imbs (LIF), IUF), Matthieu Perrin, Michel Raynal (ASAP","submitted_at":"2017-06-15T14:20:40Z","abstract_excerpt":"This paper introduces a new communication abstraction, called Set-Constrained Delivery Broadcast (SCD-broadcast), whose aim is to provide its users with an appropriate abstraction level when they have to implement objects or distributed tasks in an asynchronous message-passing system prone to process crash failures. This abstraction allows each process to broadcast messages and deliver a sequence of sets of messages in such a way that, if a process delivers a set of messages including a message m and later delivers a set of messages including a message m ' , no process delivers first a set of "},"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.05267","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-06-15T14:20:40Z","cross_cats_sorted":[],"title_canon_sha256":"a1482c2a2d42c8a4077dca1509e31d5b5ac835a6597d229d274078e3310372a7","abstract_canon_sha256":"9af91313fecc8e3dc605debca5c884cd2498b0e64fce1967bb13738cc2267314"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:14.287395Z","signature_b64":"5mVq0Y2nrnEZOTZ5zYdGM2XUUpDujOmgtFYhQgEGxkVIh1uBlzM4gMKfoCoPZs3JyfIF8Ra/G3UyboDXeGIOCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2386245274af3b4c50ff8de6084926dd70fbeb1e42e6ceb8f6e046f4e4b0954","last_reissued_at":"2026-05-18T00:42:14.286739Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:14.286739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Set-Constrained Delivery Broadcast: Definition, Abstraction Power, and Computability Limits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Achour Mostefaoui (GDD), Damien Imbs (LIF), IUF), Matthieu Perrin, Michel Raynal (ASAP","submitted_at":"2017-06-15T14:20:40Z","abstract_excerpt":"This paper introduces a new communication abstraction, called Set-Constrained Delivery Broadcast (SCD-broadcast), whose aim is to provide its users with an appropriate abstraction level when they have to implement objects or distributed tasks in an asynchronous message-passing system prone to process crash failures. This abstraction allows each process to broadcast messages and deliver a sequence of sets of messages in such a way that, if a process delivers a set of messages including a message m and later delivers a set of messages including a message m ' , no process delivers first a set of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.05267","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":"1706.05267","created_at":"2026-05-18T00:42:14.286861+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.05267v1","created_at":"2026-05-18T00:42:14.286861+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.05267","created_at":"2026-05-18T00:42:14.286861+00:00"},{"alias_kind":"pith_short_12","alias_value":"UI4GERJHJLZ3","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"UI4GERJHJLZ3JRIP","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"UI4GERJH","created_at":"2026-05-18T12:31:46.661854+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/UI4GERJHJLZ3JRIP7DPGBBESNX","json":"https://pith.science/pith/UI4GERJHJLZ3JRIP7DPGBBESNX.json","graph_json":"https://pith.science/api/pith-number/UI4GERJHJLZ3JRIP7DPGBBESNX/graph.json","events_json":"https://pith.science/api/pith-number/UI4GERJHJLZ3JRIP7DPGBBESNX/events.json","paper":"https://pith.science/paper/UI4GERJH"},"agent_actions":{"view_html":"https://pith.science/pith/UI4GERJHJLZ3JRIP7DPGBBESNX","download_json":"https://pith.science/pith/UI4GERJHJLZ3JRIP7DPGBBESNX.json","view_paper":"https://pith.science/paper/UI4GERJH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.05267&json=true","fetch_graph":"https://pith.science/api/pith-number/UI4GERJHJLZ3JRIP7DPGBBESNX/graph.json","fetch_events":"https://pith.science/api/pith-number/UI4GERJHJLZ3JRIP7DPGBBESNX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UI4GERJHJLZ3JRIP7DPGBBESNX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UI4GERJHJLZ3JRIP7DPGBBESNX/action/storage_attestation","attest_author":"https://pith.science/pith/UI4GERJHJLZ3JRIP7DPGBBESNX/action/author_attestation","sign_citation":"https://pith.science/pith/UI4GERJHJLZ3JRIP7DPGBBESNX/action/citation_signature","submit_replication":"https://pith.science/pith/UI4GERJHJLZ3JRIP7DPGBBESNX/action/replication_record"}},"created_at":"2026-05-18T00:42:14.286861+00:00","updated_at":"2026-05-18T00:42:14.286861+00:00"}