{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:IDBKHZH22POG274QZJVV7W7HUQ","short_pith_number":"pith:IDBKHZH2","schema_version":"1.0","canonical_sha256":"40c2a3e4fad3dc6d7f90ca6b5fdbe7a4313de247cc272eff692ee6bb27777cb9","source":{"kind":"arxiv","id":"1005.1311","version":2},"attestation_state":"computed","paper":{"title":"A Population-centric Approach to the Beauty Contest Game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Marc Harper","submitted_at":"2010-05-07T23:33:32Z","abstract_excerpt":"An population-centric analysis for a version of the p-beauty contest game is given for the two-player, finite population, and infinite population cases. Winning strategies are characterized in terms of iterative thinking relative to the population. To win the game one needs to iterate more times than the ambient population, but not too many more times depending on the population size and the value of p."},"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":"1005.1311","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-05-07T23:33:32Z","cross_cats_sorted":[],"title_canon_sha256":"de3daf6e0f7684afbd81a325060a3a5a546efbd544a63f3f52dec5c714b8dc7f","abstract_canon_sha256":"2cec8c4941180de96536e5a6d36cea501adf0ceb54bbf7e136f70a99d0608994"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:27.815784Z","signature_b64":"Aj9YKpkz+VYyu2TCrxoaPBAIhjDUXUJLLJV9xJEMGWp7SeeAI2tpjD6iQnLIrt9tQSPBaEg6yUTnDHSRRCcTBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40c2a3e4fad3dc6d7f90ca6b5fdbe7a4313de247cc272eff692ee6bb27777cb9","last_reissued_at":"2026-05-18T02:31:27.815228Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:27.815228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Population-centric Approach to the Beauty Contest Game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Marc Harper","submitted_at":"2010-05-07T23:33:32Z","abstract_excerpt":"An population-centric analysis for a version of the p-beauty contest game is given for the two-player, finite population, and infinite population cases. Winning strategies are characterized in terms of iterative thinking relative to the population. To win the game one needs to iterate more times than the ambient population, but not too many more times depending on the population size and the value of p."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.1311","kind":"arxiv","version":2},"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":"1005.1311","created_at":"2026-05-18T02:31:27.815304+00:00"},{"alias_kind":"arxiv_version","alias_value":"1005.1311v2","created_at":"2026-05-18T02:31:27.815304+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.1311","created_at":"2026-05-18T02:31:27.815304+00:00"},{"alias_kind":"pith_short_12","alias_value":"IDBKHZH22POG","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_16","alias_value":"IDBKHZH22POG274Q","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_8","alias_value":"IDBKHZH2","created_at":"2026-05-18T12:26:09.077623+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/IDBKHZH22POG274QZJVV7W7HUQ","json":"https://pith.science/pith/IDBKHZH22POG274QZJVV7W7HUQ.json","graph_json":"https://pith.science/api/pith-number/IDBKHZH22POG274QZJVV7W7HUQ/graph.json","events_json":"https://pith.science/api/pith-number/IDBKHZH22POG274QZJVV7W7HUQ/events.json","paper":"https://pith.science/paper/IDBKHZH2"},"agent_actions":{"view_html":"https://pith.science/pith/IDBKHZH22POG274QZJVV7W7HUQ","download_json":"https://pith.science/pith/IDBKHZH22POG274QZJVV7W7HUQ.json","view_paper":"https://pith.science/paper/IDBKHZH2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1005.1311&json=true","fetch_graph":"https://pith.science/api/pith-number/IDBKHZH22POG274QZJVV7W7HUQ/graph.json","fetch_events":"https://pith.science/api/pith-number/IDBKHZH22POG274QZJVV7W7HUQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IDBKHZH22POG274QZJVV7W7HUQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IDBKHZH22POG274QZJVV7W7HUQ/action/storage_attestation","attest_author":"https://pith.science/pith/IDBKHZH22POG274QZJVV7W7HUQ/action/author_attestation","sign_citation":"https://pith.science/pith/IDBKHZH22POG274QZJVV7W7HUQ/action/citation_signature","submit_replication":"https://pith.science/pith/IDBKHZH22POG274QZJVV7W7HUQ/action/replication_record"}},"created_at":"2026-05-18T02:31:27.815304+00:00","updated_at":"2026-05-18T02:31:27.815304+00:00"}