{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:SBBQY62QU74A5QYELXBJ6EPLJN","short_pith_number":"pith:SBBQY62Q","canonical_record":{"source":{"id":"1508.05769","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-08-24T12:00:55Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"69012a461a6f7c8dcb16793d56e554b26dbcd9d9c454296d0698fc90f3379a31","abstract_canon_sha256":"c853d1903ac7a87093832762b069329341f86c982b08c61624af11d19a8ec7d8"},"schema_version":"1.0"},"canonical_sha256":"90430c7b50a7f80ec3045dc29f11eb4b5d1b346e3b9593140caf1b50fd51bc7a","source":{"kind":"arxiv","id":"1508.05769","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.05769","created_at":"2026-05-18T01:34:51Z"},{"alias_kind":"arxiv_version","alias_value":"1508.05769v1","created_at":"2026-05-18T01:34:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.05769","created_at":"2026-05-18T01:34:51Z"},{"alias_kind":"pith_short_12","alias_value":"SBBQY62QU74A","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"SBBQY62QU74A5QYE","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"SBBQY62Q","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:SBBQY62QU74A5QYELXBJ6EPLJN","target":"record","payload":{"canonical_record":{"source":{"id":"1508.05769","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-08-24T12:00:55Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"69012a461a6f7c8dcb16793d56e554b26dbcd9d9c454296d0698fc90f3379a31","abstract_canon_sha256":"c853d1903ac7a87093832762b069329341f86c982b08c61624af11d19a8ec7d8"},"schema_version":"1.0"},"canonical_sha256":"90430c7b50a7f80ec3045dc29f11eb4b5d1b346e3b9593140caf1b50fd51bc7a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:51.679922Z","signature_b64":"axnNq7lCgOS3aB88xgAAvHcxo06sHou3JgNxmHSe7iIq1TDYEFamf8bS7WAozFbgyelEowVn88zsyfQDhgr2Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90430c7b50a7f80ec3045dc29f11eb4b5d1b346e3b9593140caf1b50fd51bc7a","last_reissued_at":"2026-05-18T01:34:51.679378Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:51.679378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.05769","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:34:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S5L4WSZY5ogBwCqjy4CBvPVA/64xsj8swkZ1e1wmaQfDvRvx7ZVVSD09pNZC7DfCbhekDY+2a4C6UMLvHDshAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T07:09:32.354604Z"},"content_sha256":"7df0c22bb49d45f5b01b879661de5a1919d8e4c4fd23e6ff2355ed3874bfa973","schema_version":"1.0","event_id":"sha256:7df0c22bb49d45f5b01b879661de5a1919d8e4c4fd23e6ff2355ed3874bfa973"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:SBBQY62QU74A5QYELXBJ6EPLJN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-round Master-Worker Computing: a Repeated Game Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DC","authors_text":"Antonio Fern\\'andez Anta, Chryssis Georgiou, Daniel Pareja, Miguel A. Mosteiro","submitted_at":"2015-08-24T12:00:55Z","abstract_excerpt":"We consider a computing system where a master processor assigns tasks for execution to worker processors through the Internet. We model the workers decision of whether to comply (compute the task) or not (return a bogus result to save the computation cost) as a mixed extension of a strategic game among workers. That is, we assume that workers are rational in a game-theoretic sense, and that they randomize their strategic choice. Workers are assigned multiple tasks in subsequent rounds. We model the system as an infinitely repeated game of the mixed extension of the strategic game. In each roun"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.05769","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:34:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+d/RxW6rop0nEZl7s19KGTYM4ZTJzne6PXtSmglA8moNpLIfVhGwoTfCmF2lBNoH9zGzrrzKKK8Fk0ONQyIrCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T07:09:32.354954Z"},"content_sha256":"62413dae8943e1ae8cbb82d5ad9f6732a998cb4e8131cc618400252dd7e37d58","schema_version":"1.0","event_id":"sha256:62413dae8943e1ae8cbb82d5ad9f6732a998cb4e8131cc618400252dd7e37d58"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SBBQY62QU74A5QYELXBJ6EPLJN/bundle.json","state_url":"https://pith.science/pith/SBBQY62QU74A5QYELXBJ6EPLJN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SBBQY62QU74A5QYELXBJ6EPLJN/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-24T07:09:32Z","links":{"resolver":"https://pith.science/pith/SBBQY62QU74A5QYELXBJ6EPLJN","bundle":"https://pith.science/pith/SBBQY62QU74A5QYELXBJ6EPLJN/bundle.json","state":"https://pith.science/pith/SBBQY62QU74A5QYELXBJ6EPLJN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SBBQY62QU74A5QYELXBJ6EPLJN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:SBBQY62QU74A5QYELXBJ6EPLJN","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":"c853d1903ac7a87093832762b069329341f86c982b08c61624af11d19a8ec7d8","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-08-24T12:00:55Z","title_canon_sha256":"69012a461a6f7c8dcb16793d56e554b26dbcd9d9c454296d0698fc90f3379a31"},"schema_version":"1.0","source":{"id":"1508.05769","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.05769","created_at":"2026-05-18T01:34:51Z"},{"alias_kind":"arxiv_version","alias_value":"1508.05769v1","created_at":"2026-05-18T01:34:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.05769","created_at":"2026-05-18T01:34:51Z"},{"alias_kind":"pith_short_12","alias_value":"SBBQY62QU74A","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"SBBQY62QU74A5QYE","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"SBBQY62Q","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:62413dae8943e1ae8cbb82d5ad9f6732a998cb4e8131cc618400252dd7e37d58","target":"graph","created_at":"2026-05-18T01:34:51Z","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 consider a computing system where a master processor assigns tasks for execution to worker processors through the Internet. We model the workers decision of whether to comply (compute the task) or not (return a bogus result to save the computation cost) as a mixed extension of a strategic game among workers. That is, we assume that workers are rational in a game-theoretic sense, and that they randomize their strategic choice. Workers are assigned multiple tasks in subsequent rounds. We model the system as an infinitely repeated game of the mixed extension of the strategic game. In each roun","authors_text":"Antonio Fern\\'andez Anta, Chryssis Georgiou, Daniel Pareja, Miguel A. Mosteiro","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-08-24T12:00:55Z","title":"Multi-round Master-Worker Computing: a Repeated Game Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.05769","kind":"arxiv","version":1},"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:7df0c22bb49d45f5b01b879661de5a1919d8e4c4fd23e6ff2355ed3874bfa973","target":"record","created_at":"2026-05-18T01:34:51Z","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":"c853d1903ac7a87093832762b069329341f86c982b08c61624af11d19a8ec7d8","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-08-24T12:00:55Z","title_canon_sha256":"69012a461a6f7c8dcb16793d56e554b26dbcd9d9c454296d0698fc90f3379a31"},"schema_version":"1.0","source":{"id":"1508.05769","kind":"arxiv","version":1}},"canonical_sha256":"90430c7b50a7f80ec3045dc29f11eb4b5d1b346e3b9593140caf1b50fd51bc7a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"90430c7b50a7f80ec3045dc29f11eb4b5d1b346e3b9593140caf1b50fd51bc7a","first_computed_at":"2026-05-18T01:34:51.679378Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:51.679378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"axnNq7lCgOS3aB88xgAAvHcxo06sHou3JgNxmHSe7iIq1TDYEFamf8bS7WAozFbgyelEowVn88zsyfQDhgr2Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:51.679922Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.05769","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7df0c22bb49d45f5b01b879661de5a1919d8e4c4fd23e6ff2355ed3874bfa973","sha256:62413dae8943e1ae8cbb82d5ad9f6732a998cb4e8131cc618400252dd7e37d58"],"state_sha256":"67a712c7f4646828a5f8d578db31dcd25b395d4dbb06007e6ac0396e86c8cae0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ku9W4SYQqzgfAtG/YZxtxXFbdV2AYh7l7q/bPUFJBjW3qaz+kJwszaDU+M/pQEwrKmiaq8VBnKUFKIIEdpZGAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T07:09:32.356980Z","bundle_sha256":"015b02788309fd734b863b231b19e91839e479789452c1c425ff0a9a98898a1e"}}