{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:2YNL4OBZGML7ZWUAPAKAGEJNGG","short_pith_number":"pith:2YNL4OBZ","schema_version":"1.0","canonical_sha256":"d61abe38393317fcda80781403112d319a1325b2c0954a0654a9182c82b6ea7c","source":{"kind":"arxiv","id":"1307.1650","version":1},"attestation_state":"computed","paper":{"title":"Algorithmic Mechanisms for Reliable Internet-based Computing under Collusion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DC","authors_text":"Antonio Fernandez Anta, Chryssis Georgiou, Miguel A. Mosteiro","submitted_at":"2013-07-05T16:10:23Z","abstract_excerpt":"In this work, using a game-theoretic approach, cost-sensitive mechanisms that lead to reliable Internet-based computing are designed. In particular, we consider Internet-based master-worker computations, where a master processor assigns, across the Internet, a computational task to a set of potentially untrusted worker processors and collects their responses. Workers may collude in order to increase their benefit. Several game-theoretic models that capture the nature of the problem are analyzed, and algorithmic mechanisms that, for each given set of cost and system parameters, achieve high rel"},"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":"1307.1650","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-07-05T16:10:23Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"496167948ff1164d968c2dd71f50b471304194accad6801b071626a922cf2031","abstract_canon_sha256":"70d94f027e5b5cfed72588c2d49d9c936728567da0d849050a151e4d22884ab8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:19:12.293334Z","signature_b64":"Am6cmLIQIfxtrdZOmZ1S674mU7JLSV35aGXZeJQ/1x4PA/bidfgVu3PQAtvgOF8D5VFUUfl7djq5lJAY9SO9Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d61abe38393317fcda80781403112d319a1325b2c0954a0654a9182c82b6ea7c","last_reissued_at":"2026-05-18T03:19:12.292451Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:19:12.292451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithmic Mechanisms for Reliable Internet-based Computing under Collusion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DC","authors_text":"Antonio Fernandez Anta, Chryssis Georgiou, Miguel A. Mosteiro","submitted_at":"2013-07-05T16:10:23Z","abstract_excerpt":"In this work, using a game-theoretic approach, cost-sensitive mechanisms that lead to reliable Internet-based computing are designed. In particular, we consider Internet-based master-worker computations, where a master processor assigns, across the Internet, a computational task to a set of potentially untrusted worker processors and collects their responses. Workers may collude in order to increase their benefit. Several game-theoretic models that capture the nature of the problem are analyzed, and algorithmic mechanisms that, for each given set of cost and system parameters, achieve high rel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.1650","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":"1307.1650","created_at":"2026-05-18T03:19:12.292609+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.1650v1","created_at":"2026-05-18T03:19:12.292609+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.1650","created_at":"2026-05-18T03:19:12.292609+00:00"},{"alias_kind":"pith_short_12","alias_value":"2YNL4OBZGML7","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"2YNL4OBZGML7ZWUA","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"2YNL4OBZ","created_at":"2026-05-18T12:27:32.513160+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/2YNL4OBZGML7ZWUAPAKAGEJNGG","json":"https://pith.science/pith/2YNL4OBZGML7ZWUAPAKAGEJNGG.json","graph_json":"https://pith.science/api/pith-number/2YNL4OBZGML7ZWUAPAKAGEJNGG/graph.json","events_json":"https://pith.science/api/pith-number/2YNL4OBZGML7ZWUAPAKAGEJNGG/events.json","paper":"https://pith.science/paper/2YNL4OBZ"},"agent_actions":{"view_html":"https://pith.science/pith/2YNL4OBZGML7ZWUAPAKAGEJNGG","download_json":"https://pith.science/pith/2YNL4OBZGML7ZWUAPAKAGEJNGG.json","view_paper":"https://pith.science/paper/2YNL4OBZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.1650&json=true","fetch_graph":"https://pith.science/api/pith-number/2YNL4OBZGML7ZWUAPAKAGEJNGG/graph.json","fetch_events":"https://pith.science/api/pith-number/2YNL4OBZGML7ZWUAPAKAGEJNGG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2YNL4OBZGML7ZWUAPAKAGEJNGG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2YNL4OBZGML7ZWUAPAKAGEJNGG/action/storage_attestation","attest_author":"https://pith.science/pith/2YNL4OBZGML7ZWUAPAKAGEJNGG/action/author_attestation","sign_citation":"https://pith.science/pith/2YNL4OBZGML7ZWUAPAKAGEJNGG/action/citation_signature","submit_replication":"https://pith.science/pith/2YNL4OBZGML7ZWUAPAKAGEJNGG/action/replication_record"}},"created_at":"2026-05-18T03:19:12.292609+00:00","updated_at":"2026-05-18T03:19:12.292609+00:00"}