{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:D2NFLQZLPTEFATBQC4ZIVUL63J","short_pith_number":"pith:D2NFLQZL","canonical_record":{"source":{"id":"1611.02329","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-11-07T22:38:32Z","cross_cats_sorted":[],"title_canon_sha256":"2cf5e2e794c613193e754881261d99258816b2a6bca5d4116f1c19ebde68c3df","abstract_canon_sha256":"723aaff7ebbd605efa3475526160c248588a8a154c19ce1ed5e71fbd1f999273"},"schema_version":"1.0"},"canonical_sha256":"1e9a55c32b7cc8504c3017328ad17eda41ce19aa1a583c46535f17a9783b09c2","source":{"kind":"arxiv","id":"1611.02329","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.02329","created_at":"2026-05-18T00:59:52Z"},{"alias_kind":"arxiv_version","alias_value":"1611.02329v1","created_at":"2026-05-18T00:59:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.02329","created_at":"2026-05-18T00:59:52Z"},{"alias_kind":"pith_short_12","alias_value":"D2NFLQZLPTEF","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"D2NFLQZLPTEFATBQ","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"D2NFLQZL","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:D2NFLQZLPTEFATBQC4ZIVUL63J","target":"record","payload":{"canonical_record":{"source":{"id":"1611.02329","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-11-07T22:38:32Z","cross_cats_sorted":[],"title_canon_sha256":"2cf5e2e794c613193e754881261d99258816b2a6bca5d4116f1c19ebde68c3df","abstract_canon_sha256":"723aaff7ebbd605efa3475526160c248588a8a154c19ce1ed5e71fbd1f999273"},"schema_version":"1.0"},"canonical_sha256":"1e9a55c32b7cc8504c3017328ad17eda41ce19aa1a583c46535f17a9783b09c2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:52.425744Z","signature_b64":"BQR/LThKd1NHr/kVSxy8SzwwyFn4/GEa4uzYLw8LBCFnMCH3MQEPs9tQGEjfeWFLhtxOLvSjgRZ2psZjamIHCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e9a55c32b7cc8504c3017328ad17eda41ce19aa1a583c46535f17a9783b09c2","last_reissued_at":"2026-05-18T00:59:52.425036Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:52.425036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.02329","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-18T00:59:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mpW/kIwjiTMPlqs3tUJYH5W5fUmj9f1WyTbTUPHjfTuDfdcJHjtOM7Sf98VFEFXBTvy504Ce9kDAqcumxwbLDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T22:32:16.559970Z"},"content_sha256":"bba62f3796685c7e0a42882cf7feedbb47ebcc74f09afa6b2ca2aa1d3c0362e4","schema_version":"1.0","event_id":"sha256:bba62f3796685c7e0a42882cf7feedbb47ebcc74f09afa6b2ca2aa1d3c0362e4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:D2NFLQZLPTEFATBQC4ZIVUL63J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convergence Analysis of Iterated Best Response for a Trusted Computation Game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Alberto Speranzon, Cedric Langbort, Shaunak D. Bopardikar","submitted_at":"2016-11-07T22:38:32Z","abstract_excerpt":"We introduce a game of trusted computation in which a sensor equipped with limited computing power leverages a central node to evaluate a specified function over a large dataset, collected over time. We assume that the central computer can be under attack and we propose a strategy where the sensor retains a limited amount of the data to counteract the effect of attack. We formulate the problem as a two player game in which the sensor (defender) chooses an optimal fusion strategy using both the non-trusted output from the central computer and locally stored trusted data. The attacker seeks to c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.02329","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-18T00:59:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F/v/+BQBuyylrK5dfo7fSda2EaFDWDUwXKRUPsPEe3151Zt5fhjH8b0+GXWqR3TPUP0KZEiqfIg1vjbzwcC7Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T22:32:16.560324Z"},"content_sha256":"f0edc56d671cbb819f207fc891d9289c3390d9750a4b7003d7b519364fbaa435","schema_version":"1.0","event_id":"sha256:f0edc56d671cbb819f207fc891d9289c3390d9750a4b7003d7b519364fbaa435"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D2NFLQZLPTEFATBQC4ZIVUL63J/bundle.json","state_url":"https://pith.science/pith/D2NFLQZLPTEFATBQC4ZIVUL63J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D2NFLQZLPTEFATBQC4ZIVUL63J/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-07-03T22:32:16Z","links":{"resolver":"https://pith.science/pith/D2NFLQZLPTEFATBQC4ZIVUL63J","bundle":"https://pith.science/pith/D2NFLQZLPTEFATBQC4ZIVUL63J/bundle.json","state":"https://pith.science/pith/D2NFLQZLPTEFATBQC4ZIVUL63J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D2NFLQZLPTEFATBQC4ZIVUL63J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:D2NFLQZLPTEFATBQC4ZIVUL63J","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":"723aaff7ebbd605efa3475526160c248588a8a154c19ce1ed5e71fbd1f999273","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-11-07T22:38:32Z","title_canon_sha256":"2cf5e2e794c613193e754881261d99258816b2a6bca5d4116f1c19ebde68c3df"},"schema_version":"1.0","source":{"id":"1611.02329","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.02329","created_at":"2026-05-18T00:59:52Z"},{"alias_kind":"arxiv_version","alias_value":"1611.02329v1","created_at":"2026-05-18T00:59:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.02329","created_at":"2026-05-18T00:59:52Z"},{"alias_kind":"pith_short_12","alias_value":"D2NFLQZLPTEF","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"D2NFLQZLPTEFATBQ","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"D2NFLQZL","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:f0edc56d671cbb819f207fc891d9289c3390d9750a4b7003d7b519364fbaa435","target":"graph","created_at":"2026-05-18T00:59:52Z","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 introduce a game of trusted computation in which a sensor equipped with limited computing power leverages a central node to evaluate a specified function over a large dataset, collected over time. We assume that the central computer can be under attack and we propose a strategy where the sensor retains a limited amount of the data to counteract the effect of attack. We formulate the problem as a two player game in which the sensor (defender) chooses an optimal fusion strategy using both the non-trusted output from the central computer and locally stored trusted data. The attacker seeks to c","authors_text":"Alberto Speranzon, Cedric Langbort, Shaunak D. Bopardikar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-11-07T22:38:32Z","title":"Convergence Analysis of Iterated Best Response for a Trusted Computation Game"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.02329","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:bba62f3796685c7e0a42882cf7feedbb47ebcc74f09afa6b2ca2aa1d3c0362e4","target":"record","created_at":"2026-05-18T00:59:52Z","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":"723aaff7ebbd605efa3475526160c248588a8a154c19ce1ed5e71fbd1f999273","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-11-07T22:38:32Z","title_canon_sha256":"2cf5e2e794c613193e754881261d99258816b2a6bca5d4116f1c19ebde68c3df"},"schema_version":"1.0","source":{"id":"1611.02329","kind":"arxiv","version":1}},"canonical_sha256":"1e9a55c32b7cc8504c3017328ad17eda41ce19aa1a583c46535f17a9783b09c2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1e9a55c32b7cc8504c3017328ad17eda41ce19aa1a583c46535f17a9783b09c2","first_computed_at":"2026-05-18T00:59:52.425036Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:52.425036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BQR/LThKd1NHr/kVSxy8SzwwyFn4/GEa4uzYLw8LBCFnMCH3MQEPs9tQGEjfeWFLhtxOLvSjgRZ2psZjamIHCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:52.425744Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.02329","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bba62f3796685c7e0a42882cf7feedbb47ebcc74f09afa6b2ca2aa1d3c0362e4","sha256:f0edc56d671cbb819f207fc891d9289c3390d9750a4b7003d7b519364fbaa435"],"state_sha256":"39c3750d2d9364a5fcb7df6770b8720dc87bbb770b585b235f10366d6e70bcaf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fLMW1spSoE5xTDVYtJ7qLWmfGMlPqwrMgsy+o6HGz70Fzm9/3I1qAT07aGKUfvsV+Xj7iMu414y9Rzvw9qE5Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T22:32:16.562782Z","bundle_sha256":"f3d2867382699148415c0caea8f320dd01045134509a8b20c8ca9d7f70ba5036"}}