{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6MSOPX4PYIPQX2NIVNYD645JHW","short_pith_number":"pith:6MSOPX4P","schema_version":"1.0","canonical_sha256":"f324e7df8fc21f0be9a8ab703f73a93d871f7999fe73ebe354def319ef20a57d","source":{"kind":"arxiv","id":"1702.00361","version":3},"attestation_state":"computed","paper":{"title":"Agreement Functions for Distributed Computing Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Petr Kuznetsov, Thibault Rieutord","submitted_at":"2017-02-01T17:16:47Z","abstract_excerpt":"The paper proposes a surprisingly simple characterization of a large class of models of distributed computing, via an agreement function: for each set of processes, the function determines the best level of set consensus these processes can reach. We show that the task computability of a large class of fair adversaries that includes, in particular superset-closed and symmetric one, is precisely captured by agreement functions."},"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":"1702.00361","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-02-01T17:16:47Z","cross_cats_sorted":[],"title_canon_sha256":"9cbef5a1dd2c2706d06c4586493497c6b87e3be2beca10fe81177b51946c3e06","abstract_canon_sha256":"22ae9c812634c71d86a2167fd0a1804d09d0143d793c8bb0178d0b4a7813523c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:59.376412Z","signature_b64":"OPDw8yVTpAL101oilXIfoi+D7pMB+c9YxKtX5W5NRj+KjqGYcwqPVNNRHIVbIru3Op+9rrx7LYHtrG24fGF3AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f324e7df8fc21f0be9a8ab703f73a93d871f7999fe73ebe354def319ef20a57d","last_reissued_at":"2026-05-18T00:48:59.375774Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:59.375774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Agreement Functions for Distributed Computing Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Petr Kuznetsov, Thibault Rieutord","submitted_at":"2017-02-01T17:16:47Z","abstract_excerpt":"The paper proposes a surprisingly simple characterization of a large class of models of distributed computing, via an agreement function: for each set of processes, the function determines the best level of set consensus these processes can reach. We show that the task computability of a large class of fair adversaries that includes, in particular superset-closed and symmetric one, is precisely captured by agreement functions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.00361","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":"1702.00361","created_at":"2026-05-18T00:48:59.375853+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.00361v3","created_at":"2026-05-18T00:48:59.375853+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.00361","created_at":"2026-05-18T00:48:59.375853+00:00"},{"alias_kind":"pith_short_12","alias_value":"6MSOPX4PYIPQ","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6MSOPX4PYIPQX2NI","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6MSOPX4P","created_at":"2026-05-18T12:31:03.183658+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/6MSOPX4PYIPQX2NIVNYD645JHW","json":"https://pith.science/pith/6MSOPX4PYIPQX2NIVNYD645JHW.json","graph_json":"https://pith.science/api/pith-number/6MSOPX4PYIPQX2NIVNYD645JHW/graph.json","events_json":"https://pith.science/api/pith-number/6MSOPX4PYIPQX2NIVNYD645JHW/events.json","paper":"https://pith.science/paper/6MSOPX4P"},"agent_actions":{"view_html":"https://pith.science/pith/6MSOPX4PYIPQX2NIVNYD645JHW","download_json":"https://pith.science/pith/6MSOPX4PYIPQX2NIVNYD645JHW.json","view_paper":"https://pith.science/paper/6MSOPX4P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.00361&json=true","fetch_graph":"https://pith.science/api/pith-number/6MSOPX4PYIPQX2NIVNYD645JHW/graph.json","fetch_events":"https://pith.science/api/pith-number/6MSOPX4PYIPQX2NIVNYD645JHW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6MSOPX4PYIPQX2NIVNYD645JHW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6MSOPX4PYIPQX2NIVNYD645JHW/action/storage_attestation","attest_author":"https://pith.science/pith/6MSOPX4PYIPQX2NIVNYD645JHW/action/author_attestation","sign_citation":"https://pith.science/pith/6MSOPX4PYIPQX2NIVNYD645JHW/action/citation_signature","submit_replication":"https://pith.science/pith/6MSOPX4PYIPQX2NIVNYD645JHW/action/replication_record"}},"created_at":"2026-05-18T00:48:59.375853+00:00","updated_at":"2026-05-18T00:48:59.375853+00:00"}