{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:OZ7RHAOA5MLWD7Y7IJJZJ3VOXB","short_pith_number":"pith:OZ7RHAOA","canonical_record":{"source":{"id":"1102.4230","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.TR","submitted_at":"2011-02-21T14:04:21Z","cross_cats_sorted":["cond-mat.stat-mech"],"title_canon_sha256":"f44781c4220af1ebd9a0d308d8e6ddbb7297010684fce6a8ebe41d5a84ee5ee9","abstract_canon_sha256":"1997b0cd432232cc1c4bd5f46997d15246a798c3d8f468de960e342b1f2f2e9b"},"schema_version":"1.0"},"canonical_sha256":"767f1381c0eb1761ff1f425394eeaeb84fecfebf39988d9f5311795940efd14b","source":{"kind":"arxiv","id":"1102.4230","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.4230","created_at":"2026-05-18T02:03:07Z"},{"alias_kind":"arxiv_version","alias_value":"1102.4230v1","created_at":"2026-05-18T02:03:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.4230","created_at":"2026-05-18T02:03:07Z"},{"alias_kind":"pith_short_12","alias_value":"OZ7RHAOA5MLW","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"OZ7RHAOA5MLWD7Y7","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"OZ7RHAOA","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:OZ7RHAOA5MLWD7Y7IJJZJ3VOXB","target":"record","payload":{"canonical_record":{"source":{"id":"1102.4230","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.TR","submitted_at":"2011-02-21T14:04:21Z","cross_cats_sorted":["cond-mat.stat-mech"],"title_canon_sha256":"f44781c4220af1ebd9a0d308d8e6ddbb7297010684fce6a8ebe41d5a84ee5ee9","abstract_canon_sha256":"1997b0cd432232cc1c4bd5f46997d15246a798c3d8f468de960e342b1f2f2e9b"},"schema_version":"1.0"},"canonical_sha256":"767f1381c0eb1761ff1f425394eeaeb84fecfebf39988d9f5311795940efd14b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:03:07.059163Z","signature_b64":"5b6c33gRJl5FC/yA1z1PlVevU4zTeTOHmaW/3K2ncOKY1XK6zvFs2iRsj/UrTbRSuMNYQcjsyikYCgTHTjE2AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"767f1381c0eb1761ff1f425394eeaeb84fecfebf39988d9f5311795940efd14b","last_reissued_at":"2026-05-18T02:03:07.058652Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:03:07.058652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.4230","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-18T02:03:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"COACJl3vCCJkmFz8FCUfNa890DzFVqeK0nX+CSAkT4+0ed481nscdvuXlV/LtdNtLxfModr7FowOhmnf8AStAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T01:39:48.797235Z"},"content_sha256":"994207879af1f28a757be7f517270dc45fa3e974bf2baac62a302d36a7c04114","schema_version":"1.0","event_id":"sha256:994207879af1f28a757be7f517270dc45fa3e974bf2baac62a302d36a7c04114"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:OZ7RHAOA5MLWD7Y7IJJZJ3VOXB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cooperation amongst competing agents in minority games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"q-fin.TR","authors_text":"Bikas K. Chakrabarti, Deepak Dhar, V. Sasidevan","submitted_at":"2011-02-21T14:04:21Z","abstract_excerpt":"We study a variation of the minority game. There are N agents. Each has to choose between one of two alternatives everyday, and there is reward to each member of the smaller group. The agents cannot communicate with each other, but try to guess the choice others will make, based only the past history of number of people choosing the two alternatives. We describe a simple probabilistic strategy using which the agents acting independently, can still maximize the average number of people benefitting every day. The strategy leads to a very efficient utilization of resources, and the average deviat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.4230","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-18T02:03:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9l+nKDEiQehYbOiodcpdfmezX+0oL3d83LBBsK5LG/0t2JnVRikjbG+UpPi97RoxxrfR9J/cVZMTQ2Z5uh64Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T01:39:48.797591Z"},"content_sha256":"d9c1143486c052d3d1aa2521bddc7313b1bf5e562dfa2841c7aba8eaa415ee74","schema_version":"1.0","event_id":"sha256:d9c1143486c052d3d1aa2521bddc7313b1bf5e562dfa2841c7aba8eaa415ee74"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OZ7RHAOA5MLWD7Y7IJJZJ3VOXB/bundle.json","state_url":"https://pith.science/pith/OZ7RHAOA5MLWD7Y7IJJZJ3VOXB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OZ7RHAOA5MLWD7Y7IJJZJ3VOXB/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-20T01:39:48Z","links":{"resolver":"https://pith.science/pith/OZ7RHAOA5MLWD7Y7IJJZJ3VOXB","bundle":"https://pith.science/pith/OZ7RHAOA5MLWD7Y7IJJZJ3VOXB/bundle.json","state":"https://pith.science/pith/OZ7RHAOA5MLWD7Y7IJJZJ3VOXB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OZ7RHAOA5MLWD7Y7IJJZJ3VOXB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:OZ7RHAOA5MLWD7Y7IJJZJ3VOXB","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":"1997b0cd432232cc1c4bd5f46997d15246a798c3d8f468de960e342b1f2f2e9b","cross_cats_sorted":["cond-mat.stat-mech"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.TR","submitted_at":"2011-02-21T14:04:21Z","title_canon_sha256":"f44781c4220af1ebd9a0d308d8e6ddbb7297010684fce6a8ebe41d5a84ee5ee9"},"schema_version":"1.0","source":{"id":"1102.4230","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.4230","created_at":"2026-05-18T02:03:07Z"},{"alias_kind":"arxiv_version","alias_value":"1102.4230v1","created_at":"2026-05-18T02:03:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.4230","created_at":"2026-05-18T02:03:07Z"},{"alias_kind":"pith_short_12","alias_value":"OZ7RHAOA5MLW","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"OZ7RHAOA5MLWD7Y7","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"OZ7RHAOA","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:d9c1143486c052d3d1aa2521bddc7313b1bf5e562dfa2841c7aba8eaa415ee74","target":"graph","created_at":"2026-05-18T02:03:07Z","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 study a variation of the minority game. There are N agents. Each has to choose between one of two alternatives everyday, and there is reward to each member of the smaller group. The agents cannot communicate with each other, but try to guess the choice others will make, based only the past history of number of people choosing the two alternatives. We describe a simple probabilistic strategy using which the agents acting independently, can still maximize the average number of people benefitting every day. The strategy leads to a very efficient utilization of resources, and the average deviat","authors_text":"Bikas K. Chakrabarti, Deepak Dhar, V. Sasidevan","cross_cats":["cond-mat.stat-mech"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.TR","submitted_at":"2011-02-21T14:04:21Z","title":"Cooperation amongst competing agents in minority games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.4230","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:994207879af1f28a757be7f517270dc45fa3e974bf2baac62a302d36a7c04114","target":"record","created_at":"2026-05-18T02:03:07Z","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":"1997b0cd432232cc1c4bd5f46997d15246a798c3d8f468de960e342b1f2f2e9b","cross_cats_sorted":["cond-mat.stat-mech"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.TR","submitted_at":"2011-02-21T14:04:21Z","title_canon_sha256":"f44781c4220af1ebd9a0d308d8e6ddbb7297010684fce6a8ebe41d5a84ee5ee9"},"schema_version":"1.0","source":{"id":"1102.4230","kind":"arxiv","version":1}},"canonical_sha256":"767f1381c0eb1761ff1f425394eeaeb84fecfebf39988d9f5311795940efd14b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"767f1381c0eb1761ff1f425394eeaeb84fecfebf39988d9f5311795940efd14b","first_computed_at":"2026-05-18T02:03:07.058652Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:03:07.058652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5b6c33gRJl5FC/yA1z1PlVevU4zTeTOHmaW/3K2ncOKY1XK6zvFs2iRsj/UrTbRSuMNYQcjsyikYCgTHTjE2AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:03:07.059163Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.4230","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:994207879af1f28a757be7f517270dc45fa3e974bf2baac62a302d36a7c04114","sha256:d9c1143486c052d3d1aa2521bddc7313b1bf5e562dfa2841c7aba8eaa415ee74"],"state_sha256":"2d250dc3f84fa31438626d29093a2187adc8c66ab22bda59604a3a97fa0856eb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z3JSW4W4h+G4xc9kSKnuM4yXgcknJObCqPRyV1a6PQwWOb0tH/phYz9+fFC2tJ3i4mS/lY1gOuoFIcZRJiZuBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T01:39:48.799423Z","bundle_sha256":"df40a777cc19646caf1b573d4a6e0a86d4bdcdef3667912b224c0c7e302abdbb"}}