{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:TDCS2CUVKHFVNM3QDKRTMID4Y6","short_pith_number":"pith:TDCS2CUV","canonical_record":{"source":{"id":"2201.00345","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"econ.GN","submitted_at":"2022-01-02T12:10:26Z","cross_cats_sorted":["q-fin.EC"],"title_canon_sha256":"9fa1bbdf3af90fdb37c008883d0ca83488c1b43a57588bb1a7fb13d15ce5f2f6","abstract_canon_sha256":"1dfa8fbdd9b16b97cd1ae40b387c522e004d51c5417899b52dad88b5e49afd56"},"schema_version":"1.0"},"canonical_sha256":"98c52d0a9551cb56b3701aa336207cc79b911b72c1c62cad5fed9b8413f18b39","source":{"kind":"arxiv","id":"2201.00345","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.00345","created_at":"2026-07-05T03:46:04Z"},{"alias_kind":"arxiv_version","alias_value":"2201.00345v2","created_at":"2026-07-05T03:46:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.00345","created_at":"2026-07-05T03:46:04Z"},{"alias_kind":"pith_short_12","alias_value":"TDCS2CUVKHFV","created_at":"2026-07-05T03:46:04Z"},{"alias_kind":"pith_short_16","alias_value":"TDCS2CUVKHFVNM3Q","created_at":"2026-07-05T03:46:04Z"},{"alias_kind":"pith_short_8","alias_value":"TDCS2CUV","created_at":"2026-07-05T03:46:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:TDCS2CUVKHFVNM3QDKRTMID4Y6","target":"record","payload":{"canonical_record":{"source":{"id":"2201.00345","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"econ.GN","submitted_at":"2022-01-02T12:10:26Z","cross_cats_sorted":["q-fin.EC"],"title_canon_sha256":"9fa1bbdf3af90fdb37c008883d0ca83488c1b43a57588bb1a7fb13d15ce5f2f6","abstract_canon_sha256":"1dfa8fbdd9b16b97cd1ae40b387c522e004d51c5417899b52dad88b5e49afd56"},"schema_version":"1.0"},"canonical_sha256":"98c52d0a9551cb56b3701aa336207cc79b911b72c1c62cad5fed9b8413f18b39","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:46:04.374586Z","signature_b64":"T9HoAEfpdJ4LCTxAcuknLKvzXDiv87RrxwglLfCUagBmLDj37ViiNrG/IEjdmciXRTDR/q3JIqPb7Z+G5o/XCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98c52d0a9551cb56b3701aa336207cc79b911b72c1c62cad5fed9b8413f18b39","last_reissued_at":"2026-07-05T03:46:04.374142Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:46:04.374142Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2201.00345","source_version":2,"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-05T03:46:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JLxV0/78Fo9/+Y1BKCmvenXOk+eb+BRYLR0IA8FLIrkn98fpCVCRrVOm/SDXtST+rqkCFZNdKwe2KBVQjuTNAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T20:58:33.110767Z"},"content_sha256":"50b1fc6c24e6c19092810dc44a319810c3dbf0724c19502304301c9719db6aad","schema_version":"1.0","event_id":"sha256:50b1fc6c24e6c19092810dc44a319810c3dbf0724c19502304301c9719db6aad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:TDCS2CUVKHFVNM3QDKRTMID4Y6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Algorithmic Collusion","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["q-fin.EC"],"primary_cat":"econ.GN","authors_text":"Filip Mellgren, Nicolas Eschenbaum, Philipp Zahn","submitted_at":"2022-01-02T12:10:26Z","abstract_excerpt":"This paper develops a formal framework to assess policies of learning algorithms in economic games. We investigate whether reinforcement-learning agents with collusive pricing policies can successfully extrapolate collusive behavior from training to the market. We find that in testing environments collusion consistently breaks down. Instead, we observe static Nash play. We then show that restricting algorithms' strategy space can make algorithmic collusion robust, because it limits overfitting to rival strategies. Our findings suggest that policy-makers should focus on firm behavior aimed at c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.00345","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2201.00345/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-05T03:46:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KE1NIunExMDzN+vR5eZQi6S8OdmthvjbASpW1Y7VZVmZuK0xo1E+5MIWMbexeKKpxwGbT6RAoYdac+SvNo8ADg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T20:58:33.111423Z"},"content_sha256":"0bd30c94f8c58ffb910bf84062f5bafc0a17e3d5d751362d20a53ec21079b741","schema_version":"1.0","event_id":"sha256:0bd30c94f8c58ffb910bf84062f5bafc0a17e3d5d751362d20a53ec21079b741"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TDCS2CUVKHFVNM3QDKRTMID4Y6/bundle.json","state_url":"https://pith.science/pith/TDCS2CUVKHFVNM3QDKRTMID4Y6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TDCS2CUVKHFVNM3QDKRTMID4Y6/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-13T20:58:33Z","links":{"resolver":"https://pith.science/pith/TDCS2CUVKHFVNM3QDKRTMID4Y6","bundle":"https://pith.science/pith/TDCS2CUVKHFVNM3QDKRTMID4Y6/bundle.json","state":"https://pith.science/pith/TDCS2CUVKHFVNM3QDKRTMID4Y6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TDCS2CUVKHFVNM3QDKRTMID4Y6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:TDCS2CUVKHFVNM3QDKRTMID4Y6","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":"1dfa8fbdd9b16b97cd1ae40b387c522e004d51c5417899b52dad88b5e49afd56","cross_cats_sorted":["q-fin.EC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"econ.GN","submitted_at":"2022-01-02T12:10:26Z","title_canon_sha256":"9fa1bbdf3af90fdb37c008883d0ca83488c1b43a57588bb1a7fb13d15ce5f2f6"},"schema_version":"1.0","source":{"id":"2201.00345","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.00345","created_at":"2026-07-05T03:46:04Z"},{"alias_kind":"arxiv_version","alias_value":"2201.00345v2","created_at":"2026-07-05T03:46:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.00345","created_at":"2026-07-05T03:46:04Z"},{"alias_kind":"pith_short_12","alias_value":"TDCS2CUVKHFV","created_at":"2026-07-05T03:46:04Z"},{"alias_kind":"pith_short_16","alias_value":"TDCS2CUVKHFVNM3Q","created_at":"2026-07-05T03:46:04Z"},{"alias_kind":"pith_short_8","alias_value":"TDCS2CUV","created_at":"2026-07-05T03:46:04Z"}],"graph_snapshots":[{"event_id":"sha256:0bd30c94f8c58ffb910bf84062f5bafc0a17e3d5d751362d20a53ec21079b741","target":"graph","created_at":"2026-07-05T03:46:04Z","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/2201.00345/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper develops a formal framework to assess policies of learning algorithms in economic games. We investigate whether reinforcement-learning agents with collusive pricing policies can successfully extrapolate collusive behavior from training to the market. We find that in testing environments collusion consistently breaks down. Instead, we observe static Nash play. We then show that restricting algorithms' strategy space can make algorithmic collusion robust, because it limits overfitting to rival strategies. Our findings suggest that policy-makers should focus on firm behavior aimed at c","authors_text":"Filip Mellgren, Nicolas Eschenbaum, Philipp Zahn","cross_cats":["q-fin.EC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"econ.GN","submitted_at":"2022-01-02T12:10:26Z","title":"Robust Algorithmic Collusion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.00345","kind":"arxiv","version":2},"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:50b1fc6c24e6c19092810dc44a319810c3dbf0724c19502304301c9719db6aad","target":"record","created_at":"2026-07-05T03:46:04Z","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":"1dfa8fbdd9b16b97cd1ae40b387c522e004d51c5417899b52dad88b5e49afd56","cross_cats_sorted":["q-fin.EC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"econ.GN","submitted_at":"2022-01-02T12:10:26Z","title_canon_sha256":"9fa1bbdf3af90fdb37c008883d0ca83488c1b43a57588bb1a7fb13d15ce5f2f6"},"schema_version":"1.0","source":{"id":"2201.00345","kind":"arxiv","version":2}},"canonical_sha256":"98c52d0a9551cb56b3701aa336207cc79b911b72c1c62cad5fed9b8413f18b39","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"98c52d0a9551cb56b3701aa336207cc79b911b72c1c62cad5fed9b8413f18b39","first_computed_at":"2026-07-05T03:46:04.374142Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:46:04.374142Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T9HoAEfpdJ4LCTxAcuknLKvzXDiv87RrxwglLfCUagBmLDj37ViiNrG/IEjdmciXRTDR/q3JIqPb7Z+G5o/XCA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:46:04.374586Z","signed_message":"canonical_sha256_bytes"},"source_id":"2201.00345","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:50b1fc6c24e6c19092810dc44a319810c3dbf0724c19502304301c9719db6aad","sha256:0bd30c94f8c58ffb910bf84062f5bafc0a17e3d5d751362d20a53ec21079b741"],"state_sha256":"e29add704a8f0fd4c364f52c960cb5646fd36c93b5ed96a1164705027d174040"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qxy9w96kXml2s0VS+cBQZ6tLG4BTfb6ATy79I0qa0jniNLlKaDcRsEbL/F2qzs9YX2kXU9l0GjEW2r/QOEPlDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T20:58:33.128433Z","bundle_sha256":"5161c09a411f79e23c104e9a8ef1d94330363411f37fe4f5efc24c45544a7a2e"}}