{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:QYLIRU4GMXTLQPFXLZSZ3ACRXX","short_pith_number":"pith:QYLIRU4G","schema_version":"1.0","canonical_sha256":"861688d38665e6b83cb75e659d8051bdc6c40d5788134fcff2d3e31ada9baec0","source":{"kind":"arxiv","id":"1912.03973","version":4},"attestation_state":"computed","paper":{"title":"Deep Teams: Decentralized Decision Making with Finite and Infinite Number of Agents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Amir G. Aghdam, Jalal Arabneydi","submitted_at":"2019-12-09T11:23:20Z","abstract_excerpt":"Inspired by the concepts of deep learning in artificial intelligence and fairness in behavioural economics, we introduce deep teams in this paper. In such systems, agents are partitioned into a few sub-populations so that the dynamics and cost of agents in each sub-population is invariant to the indexing of agents. The goal of agents is to minimize a common cost function in such a manner that the agents in each sub-population are not discriminated or privileged by the way they are indexed. Two non-classical information structures are studied. In the first one, each agent observes its local sta"},"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":"1912.03973","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-12-09T11:23:20Z","cross_cats_sorted":[],"title_canon_sha256":"70746b3ba817e28560458dd412b3f33433e428dce1746fef9153922fdebe3921","abstract_canon_sha256":"e0617b031e94aeda61e69b15a38bec48aa9869fd7d11ef9bcf8a2336f4b38a94"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:07:12.137702Z","signature_b64":"Sa7Q7fbc655GdXly836fqIVhMm6l25wbDJcoboHyZA4gw8XzYA3Uljl4UqrKhIJTOADXR4voFQqlNkekDAg+CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"861688d38665e6b83cb75e659d8051bdc6c40d5788134fcff2d3e31ada9baec0","last_reissued_at":"2026-07-05T01:07:12.137232Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:07:12.137232Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deep Teams: Decentralized Decision Making with Finite and Infinite Number of Agents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Amir G. Aghdam, Jalal Arabneydi","submitted_at":"2019-12-09T11:23:20Z","abstract_excerpt":"Inspired by the concepts of deep learning in artificial intelligence and fairness in behavioural economics, we introduce deep teams in this paper. In such systems, agents are partitioned into a few sub-populations so that the dynamics and cost of agents in each sub-population is invariant to the indexing of agents. The goal of agents is to minimize a common cost function in such a manner that the agents in each sub-population are not discriminated or privileged by the way they are indexed. Two non-classical information structures are studied. In the first one, each agent observes its local sta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.03973","kind":"arxiv","version":4},"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/1912.03973/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":"1912.03973","created_at":"2026-07-05T01:07:12.137297+00:00"},{"alias_kind":"arxiv_version","alias_value":"1912.03973v4","created_at":"2026-07-05T01:07:12.137297+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.03973","created_at":"2026-07-05T01:07:12.137297+00:00"},{"alias_kind":"pith_short_12","alias_value":"QYLIRU4GMXTL","created_at":"2026-07-05T01:07:12.137297+00:00"},{"alias_kind":"pith_short_16","alias_value":"QYLIRU4GMXTLQPFX","created_at":"2026-07-05T01:07:12.137297+00:00"},{"alias_kind":"pith_short_8","alias_value":"QYLIRU4G","created_at":"2026-07-05T01:07:12.137297+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/QYLIRU4GMXTLQPFXLZSZ3ACRXX","json":"https://pith.science/pith/QYLIRU4GMXTLQPFXLZSZ3ACRXX.json","graph_json":"https://pith.science/api/pith-number/QYLIRU4GMXTLQPFXLZSZ3ACRXX/graph.json","events_json":"https://pith.science/api/pith-number/QYLIRU4GMXTLQPFXLZSZ3ACRXX/events.json","paper":"https://pith.science/paper/QYLIRU4G"},"agent_actions":{"view_html":"https://pith.science/pith/QYLIRU4GMXTLQPFXLZSZ3ACRXX","download_json":"https://pith.science/pith/QYLIRU4GMXTLQPFXLZSZ3ACRXX.json","view_paper":"https://pith.science/paper/QYLIRU4G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1912.03973&json=true","fetch_graph":"https://pith.science/api/pith-number/QYLIRU4GMXTLQPFXLZSZ3ACRXX/graph.json","fetch_events":"https://pith.science/api/pith-number/QYLIRU4GMXTLQPFXLZSZ3ACRXX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QYLIRU4GMXTLQPFXLZSZ3ACRXX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QYLIRU4GMXTLQPFXLZSZ3ACRXX/action/storage_attestation","attest_author":"https://pith.science/pith/QYLIRU4GMXTLQPFXLZSZ3ACRXX/action/author_attestation","sign_citation":"https://pith.science/pith/QYLIRU4GMXTLQPFXLZSZ3ACRXX/action/citation_signature","submit_replication":"https://pith.science/pith/QYLIRU4GMXTLQPFXLZSZ3ACRXX/action/replication_record"}},"created_at":"2026-07-05T01:07:12.137297+00:00","updated_at":"2026-07-05T01:07:12.137297+00:00"}