{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:QHXAVGATU53VRBYU2D7EMNYLND","short_pith_number":"pith:QHXAVGAT","canonical_record":{"source":{"id":"2103.01460","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2021-03-02T04:03:36Z","cross_cats_sorted":[],"title_canon_sha256":"cef6f52470611c934f7aacc9e31ae639d192a06bf468a6755c5111fc52a6b985","abstract_canon_sha256":"aa8707b4026ddcd07b055a4dfb858f35009d709fd10eb9a265bd5ffad703269b"},"schema_version":"1.0"},"canonical_sha256":"81ee0a9813a777588714d0fe46370b68f0ac411ec6bc3f6a2c8500a1503adea4","source":{"kind":"arxiv","id":"2103.01460","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2103.01460","created_at":"2026-07-05T07:35:33Z"},{"alias_kind":"arxiv_version","alias_value":"2103.01460v5","created_at":"2026-07-05T07:35:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.01460","created_at":"2026-07-05T07:35:33Z"},{"alias_kind":"pith_short_12","alias_value":"QHXAVGATU53V","created_at":"2026-07-05T07:35:33Z"},{"alias_kind":"pith_short_16","alias_value":"QHXAVGATU53VRBYU","created_at":"2026-07-05T07:35:33Z"},{"alias_kind":"pith_short_8","alias_value":"QHXAVGAT","created_at":"2026-07-05T07:35:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:QHXAVGATU53VRBYU2D7EMNYLND","target":"record","payload":{"canonical_record":{"source":{"id":"2103.01460","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2021-03-02T04:03:36Z","cross_cats_sorted":[],"title_canon_sha256":"cef6f52470611c934f7aacc9e31ae639d192a06bf468a6755c5111fc52a6b985","abstract_canon_sha256":"aa8707b4026ddcd07b055a4dfb858f35009d709fd10eb9a265bd5ffad703269b"},"schema_version":"1.0"},"canonical_sha256":"81ee0a9813a777588714d0fe46370b68f0ac411ec6bc3f6a2c8500a1503adea4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:35:33.573600Z","signature_b64":"atDXT03fXrVxUwyBj0YB2jded6T3RiW4STOeWGHn9eOQqGcmDUZXGCiOdftD4ad3objMuzpN10EZp/gYL2ngCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81ee0a9813a777588714d0fe46370b68f0ac411ec6bc3f6a2c8500a1503adea4","last_reissued_at":"2026-07-05T07:35:33.573145Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:35:33.573145Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2103.01460","source_version":5,"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-07-05T07:35:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rRtHoFdkF4siXf2bHWLTtXB/Kuw16N21Cq3+O3NtLpC8W0YtuOaW4qqnea087h+SSCAYVmhXQcZTjoSwz+b6BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T18:46:16.831364Z"},"content_sha256":"a51e0def034874818833d79cac6200ce31042e5855c9738c652f010f046b1a07","schema_version":"1.0","event_id":"sha256:a51e0def034874818833d79cac6200ce31042e5855c9738c652f010f046b1a07"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:QHXAVGATU53VRBYU2D7EMNYLND","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Limited-Trust in Social Network Games","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Jugal Garg, Rakesh Nagi, Timothy Murray","submitted_at":"2021-03-02T04:03:36Z","abstract_excerpt":"We consider agents in a social network competing to be selected as partners in collaborative, mutually beneficial activities. We study this through a model in which an agent i can initiate a limited number k_i>0 of games and selects the ideal partners from its one-hop neighborhood. On the flip side it can accept as many games offered from its neighbors. Each game signifies a productive joint economic activity, and players attempt to maximize their individual utilities. Unsurprisingly, more trustworthy agents are more desirable as partners. Trustworthiness is measured by the game theoretic conc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.01460","kind":"arxiv","version":5},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2103.01460/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T07:35:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KSpVZ9QnD5v9GucwuJ2uofsEaYhW6F2sY691m+lkQaMlXATtxdfZR0PQWk4P9REhNyEiAGVE+RAvO1gkvhgQAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T18:46:16.831958Z"},"content_sha256":"d724907309fff26701a599bc332dc3ecd4a390b7dddbb75efa9a657bdaead644","schema_version":"1.0","event_id":"sha256:d724907309fff26701a599bc332dc3ecd4a390b7dddbb75efa9a657bdaead644"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QHXAVGATU53VRBYU2D7EMNYLND/bundle.json","state_url":"https://pith.science/pith/QHXAVGATU53VRBYU2D7EMNYLND/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QHXAVGATU53VRBYU2D7EMNYLND/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-08-12T18:46:16Z","links":{"resolver":"https://pith.science/pith/QHXAVGATU53VRBYU2D7EMNYLND","bundle":"https://pith.science/pith/QHXAVGATU53VRBYU2D7EMNYLND/bundle.json","state":"https://pith.science/pith/QHXAVGATU53VRBYU2D7EMNYLND/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QHXAVGATU53VRBYU2D7EMNYLND/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:QHXAVGATU53VRBYU2D7EMNYLND","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":"aa8707b4026ddcd07b055a4dfb858f35009d709fd10eb9a265bd5ffad703269b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2021-03-02T04:03:36Z","title_canon_sha256":"cef6f52470611c934f7aacc9e31ae639d192a06bf468a6755c5111fc52a6b985"},"schema_version":"1.0","source":{"id":"2103.01460","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2103.01460","created_at":"2026-07-05T07:35:33Z"},{"alias_kind":"arxiv_version","alias_value":"2103.01460v5","created_at":"2026-07-05T07:35:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.01460","created_at":"2026-07-05T07:35:33Z"},{"alias_kind":"pith_short_12","alias_value":"QHXAVGATU53V","created_at":"2026-07-05T07:35:33Z"},{"alias_kind":"pith_short_16","alias_value":"QHXAVGATU53VRBYU","created_at":"2026-07-05T07:35:33Z"},{"alias_kind":"pith_short_8","alias_value":"QHXAVGAT","created_at":"2026-07-05T07:35:33Z"}],"graph_snapshots":[{"event_id":"sha256:d724907309fff26701a599bc332dc3ecd4a390b7dddbb75efa9a657bdaead644","target":"graph","created_at":"2026-07-05T07:35:33Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2103.01460/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider agents in a social network competing to be selected as partners in collaborative, mutually beneficial activities. We study this through a model in which an agent i can initiate a limited number k_i>0 of games and selects the ideal partners from its one-hop neighborhood. On the flip side it can accept as many games offered from its neighbors. Each game signifies a productive joint economic activity, and players attempt to maximize their individual utilities. Unsurprisingly, more trustworthy agents are more desirable as partners. Trustworthiness is measured by the game theoretic conc","authors_text":"Jugal Garg, Rakesh Nagi, Timothy Murray","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2021-03-02T04:03:36Z","title":"Limited-Trust in Social Network Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.01460","kind":"arxiv","version":5},"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:a51e0def034874818833d79cac6200ce31042e5855c9738c652f010f046b1a07","target":"record","created_at":"2026-07-05T07:35:33Z","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":"aa8707b4026ddcd07b055a4dfb858f35009d709fd10eb9a265bd5ffad703269b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2021-03-02T04:03:36Z","title_canon_sha256":"cef6f52470611c934f7aacc9e31ae639d192a06bf468a6755c5111fc52a6b985"},"schema_version":"1.0","source":{"id":"2103.01460","kind":"arxiv","version":5}},"canonical_sha256":"81ee0a9813a777588714d0fe46370b68f0ac411ec6bc3f6a2c8500a1503adea4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"81ee0a9813a777588714d0fe46370b68f0ac411ec6bc3f6a2c8500a1503adea4","first_computed_at":"2026-07-05T07:35:33.573145Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:35:33.573145Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"atDXT03fXrVxUwyBj0YB2jded6T3RiW4STOeWGHn9eOQqGcmDUZXGCiOdftD4ad3objMuzpN10EZp/gYL2ngCg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:35:33.573600Z","signed_message":"canonical_sha256_bytes"},"source_id":"2103.01460","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a51e0def034874818833d79cac6200ce31042e5855c9738c652f010f046b1a07","sha256:d724907309fff26701a599bc332dc3ecd4a390b7dddbb75efa9a657bdaead644"],"state_sha256":"b182f623bfadafd4353d456fcc0d50ce3bb140ab113a4fd287d2968ec4263761"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8EUWGMeodUzR/k8IBGCVe4NeBGDQUTTEkGcbYaDrYIHEqc86DLJL9kcTUSsqB/A0lU0+qf/TRikz39JsWFWPCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T18:46:16.838352Z","bundle_sha256":"1cead9e07024da974ba4ea0a08cd83b645ab9d7ec863609e6976e77848f4cd54"}}