{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:CW5E6BQWBC6FNZDCCV2VCPUIQG","short_pith_number":"pith:CW5E6BQW","schema_version":"1.0","canonical_sha256":"15ba4f061608bc56e4621575513e8881b0dc26e9658549360efd63fda86ee043","source":{"kind":"arxiv","id":"2410.03724","version":3},"attestation_state":"computed","paper":{"title":"Overcoming the Machine Penalty with Imperfectly Fair AI Agents","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI","cs.GT","econ.GN","q-fin.EC"],"primary_cat":"cs.HC","authors_text":"Balaraju Battu, Chen Shen, Danyang Jia, Lei Shi, Ruiqi Song, Shiya Yin, Shuyue Hu, Talal Rahwan, Zhao Song, Zhen Wang","submitted_at":"2024-09-29T10:11:25Z","abstract_excerpt":"Despite rapid technological progress, effective human-machine cooperation remains a significant challenge. Humans tend to cooperate less with machines than with fellow humans, a phenomenon known as the machine penalty. Here, we show that artificial intelligence (AI) agents powered by large language models can overcome this penalty in social dilemma games with communication. In a pre-registered experiment with 1,152 participants, we deploy AI agents exhibiting three distinct personas: selfish, cooperative, and fair. However, only fair agents elicit human cooperation at rates comparable to human"},"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":"2410.03724","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.HC","submitted_at":"2024-09-29T10:11:25Z","cross_cats_sorted":["cs.AI","cs.GT","econ.GN","q-fin.EC"],"title_canon_sha256":"707bcfce684be960b0943c9bb956a22c14a66a05bd4345a1b3b4186027b4c55f","abstract_canon_sha256":"aeb66e12c699c6b2f5da798ba787b7663c705d77bfdd394a5d16bb93054b1408"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:11:20.812886Z","signature_b64":"FsWYpE4Jm0p833wIhZQQVPvbuZOmavX3xuBxdvKQwmeq3S7fvf++NPnRshzs7HyOvatgmfOs44fGDjhY9DsEAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15ba4f061608bc56e4621575513e8881b0dc26e9658549360efd63fda86ee043","last_reissued_at":"2026-07-05T11:11:20.812387Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:11:20.812387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Overcoming the Machine Penalty with Imperfectly Fair AI Agents","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI","cs.GT","econ.GN","q-fin.EC"],"primary_cat":"cs.HC","authors_text":"Balaraju Battu, Chen Shen, Danyang Jia, Lei Shi, Ruiqi Song, Shiya Yin, Shuyue Hu, Talal Rahwan, Zhao Song, Zhen Wang","submitted_at":"2024-09-29T10:11:25Z","abstract_excerpt":"Despite rapid technological progress, effective human-machine cooperation remains a significant challenge. Humans tend to cooperate less with machines than with fellow humans, a phenomenon known as the machine penalty. Here, we show that artificial intelligence (AI) agents powered by large language models can overcome this penalty in social dilemma games with communication. In a pre-registered experiment with 1,152 participants, we deploy AI agents exhibiting three distinct personas: selfish, cooperative, and fair. However, only fair agents elicit human cooperation at rates comparable to human"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.03724","kind":"arxiv","version":3},"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/2410.03724/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2410.03724","created_at":"2026-07-05T11:11:20.812446+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.03724v3","created_at":"2026-07-05T11:11:20.812446+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.03724","created_at":"2026-07-05T11:11:20.812446+00:00"},{"alias_kind":"pith_short_12","alias_value":"CW5E6BQWBC6F","created_at":"2026-07-05T11:11:20.812446+00:00"},{"alias_kind":"pith_short_16","alias_value":"CW5E6BQWBC6FNZDC","created_at":"2026-07-05T11:11:20.812446+00:00"},{"alias_kind":"pith_short_8","alias_value":"CW5E6BQW","created_at":"2026-07-05T11:11:20.812446+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2601.03846","citing_title":"When Numbers Start Talking: Implicit Numerical Coordination Among LLM-Based Agents","ref_index":41,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CW5E6BQWBC6FNZDCCV2VCPUIQG","json":"https://pith.science/pith/CW5E6BQWBC6FNZDCCV2VCPUIQG.json","graph_json":"https://pith.science/api/pith-number/CW5E6BQWBC6FNZDCCV2VCPUIQG/graph.json","events_json":"https://pith.science/api/pith-number/CW5E6BQWBC6FNZDCCV2VCPUIQG/events.json","paper":"https://pith.science/paper/CW5E6BQW"},"agent_actions":{"view_html":"https://pith.science/pith/CW5E6BQWBC6FNZDCCV2VCPUIQG","download_json":"https://pith.science/pith/CW5E6BQWBC6FNZDCCV2VCPUIQG.json","view_paper":"https://pith.science/paper/CW5E6BQW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.03724&json=true","fetch_graph":"https://pith.science/api/pith-number/CW5E6BQWBC6FNZDCCV2VCPUIQG/graph.json","fetch_events":"https://pith.science/api/pith-number/CW5E6BQWBC6FNZDCCV2VCPUIQG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CW5E6BQWBC6FNZDCCV2VCPUIQG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CW5E6BQWBC6FNZDCCV2VCPUIQG/action/storage_attestation","attest_author":"https://pith.science/pith/CW5E6BQWBC6FNZDCCV2VCPUIQG/action/author_attestation","sign_citation":"https://pith.science/pith/CW5E6BQWBC6FNZDCCV2VCPUIQG/action/citation_signature","submit_replication":"https://pith.science/pith/CW5E6BQWBC6FNZDCCV2VCPUIQG/action/replication_record"}},"created_at":"2026-07-05T11:11:20.812446+00:00","updated_at":"2026-07-05T11:11:20.812446+00:00"}