{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:LKVZP5OOZJ4IREENT54DYQXJJQ","short_pith_number":"pith:LKVZP5OO","canonical_record":{"source":{"id":"2312.02644","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"econ.TH","submitted_at":"2023-12-05T10:35:41Z","cross_cats_sorted":[],"title_canon_sha256":"ca4c07e5020aaf1fb53e0a22dd423dbbe188545bdd9f1285b673c08c5b4dfb2f","abstract_canon_sha256":"e7fbb631d3a7cd1599b4b712baa6898834c21664013dc03eda78cc49c545c983"},"schema_version":"1.0"},"canonical_sha256":"5aab97f5ceca7888908d9f783c42e94c1648a787cc27a2ac9f4851918f191ede","source":{"kind":"arxiv","id":"2312.02644","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.02644","created_at":"2026-07-05T09:06:01Z"},{"alias_kind":"arxiv_version","alias_value":"2312.02644v3","created_at":"2026-07-05T09:06:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.02644","created_at":"2026-07-05T09:06:01Z"},{"alias_kind":"pith_short_12","alias_value":"LKVZP5OOZJ4I","created_at":"2026-07-05T09:06:01Z"},{"alias_kind":"pith_short_16","alias_value":"LKVZP5OOZJ4IREEN","created_at":"2026-07-05T09:06:01Z"},{"alias_kind":"pith_short_8","alias_value":"LKVZP5OO","created_at":"2026-07-05T09:06:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:LKVZP5OOZJ4IREENT54DYQXJJQ","target":"record","payload":{"canonical_record":{"source":{"id":"2312.02644","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"econ.TH","submitted_at":"2023-12-05T10:35:41Z","cross_cats_sorted":[],"title_canon_sha256":"ca4c07e5020aaf1fb53e0a22dd423dbbe188545bdd9f1285b673c08c5b4dfb2f","abstract_canon_sha256":"e7fbb631d3a7cd1599b4b712baa6898834c21664013dc03eda78cc49c545c983"},"schema_version":"1.0"},"canonical_sha256":"5aab97f5ceca7888908d9f783c42e94c1648a787cc27a2ac9f4851918f191ede","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:06:01.539015Z","signature_b64":"z0vgRhyRnYvU/qe6Wsrv1kPCEUQymT1Es6sG5yUKtkkY4O3UNMB2B5umnURKRjdzjf2aK83ulMxO/hPapr+7AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5aab97f5ceca7888908d9f783c42e94c1648a787cc27a2ac9f4851918f191ede","last_reissued_at":"2026-07-05T09:06:01.538543Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:06:01.538543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2312.02644","source_version":3,"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-05T09:06:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b3HDarGLDuM/Od3KLqQjCby7YvVqwCZNTgrCMLoxxG+IgzFnUUL6bZD2MpII09QzRJpipMCdZqOs+ju3Gy8uBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T11:01:49.142828Z"},"content_sha256":"6cb9000b8fab90d33cbf9f0e64093c094d17302c0e46e500fad09c131dc7fbb4","schema_version":"1.0","event_id":"sha256:6cb9000b8fab90d33cbf9f0e64093c094d17302c0e46e500fad09c131dc7fbb4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:LKVZP5OOZJ4IREENT54DYQXJJQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithmic collusion under competitive design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"econ.TH","authors_text":"Ivan Conjeaud","submitted_at":"2023-12-05T10:35:41Z","abstract_excerpt":"We study a simple model of algorithmic collusion in which Q-learning algorithms are designed in a strategic fashion. We let players (\\textit{designers}) choose their exploration policy simultaneously prior to letting their algorithms repeatedly play a prisoner's dilemma. We prove that, in equilibrium, collusive behavior is reached with positive probability. Our numerical simulations indicate symmetry of the equilibria and give insight for how they are affected by a parameter of interest. We also investigate general profiles of exploration policies. We characterize the behavior of the system fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.02644","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/2312.02644/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-05T09:06:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fkIbTmNQ1n4iEBsxUcGhSfWQmlgDBy2cJqtVpRfM61pg5eexfKlrcj9PjEfFMBma5WI0KJOrWsuzMR9W0PZTAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T11:01:49.143452Z"},"content_sha256":"79efd7bfd6c0268c2dd4411d6e74d9135551040171682caef8b81b1ea7de6b35","schema_version":"1.0","event_id":"sha256:79efd7bfd6c0268c2dd4411d6e74d9135551040171682caef8b81b1ea7de6b35"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LKVZP5OOZJ4IREENT54DYQXJJQ/bundle.json","state_url":"https://pith.science/pith/LKVZP5OOZJ4IREENT54DYQXJJQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LKVZP5OOZJ4IREENT54DYQXJJQ/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-13T11:01:49Z","links":{"resolver":"https://pith.science/pith/LKVZP5OOZJ4IREENT54DYQXJJQ","bundle":"https://pith.science/pith/LKVZP5OOZJ4IREENT54DYQXJJQ/bundle.json","state":"https://pith.science/pith/LKVZP5OOZJ4IREENT54DYQXJJQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LKVZP5OOZJ4IREENT54DYQXJJQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:LKVZP5OOZJ4IREENT54DYQXJJQ","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":"e7fbb631d3a7cd1599b4b712baa6898834c21664013dc03eda78cc49c545c983","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"econ.TH","submitted_at":"2023-12-05T10:35:41Z","title_canon_sha256":"ca4c07e5020aaf1fb53e0a22dd423dbbe188545bdd9f1285b673c08c5b4dfb2f"},"schema_version":"1.0","source":{"id":"2312.02644","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.02644","created_at":"2026-07-05T09:06:01Z"},{"alias_kind":"arxiv_version","alias_value":"2312.02644v3","created_at":"2026-07-05T09:06:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.02644","created_at":"2026-07-05T09:06:01Z"},{"alias_kind":"pith_short_12","alias_value":"LKVZP5OOZJ4I","created_at":"2026-07-05T09:06:01Z"},{"alias_kind":"pith_short_16","alias_value":"LKVZP5OOZJ4IREEN","created_at":"2026-07-05T09:06:01Z"},{"alias_kind":"pith_short_8","alias_value":"LKVZP5OO","created_at":"2026-07-05T09:06:01Z"}],"graph_snapshots":[{"event_id":"sha256:79efd7bfd6c0268c2dd4411d6e74d9135551040171682caef8b81b1ea7de6b35","target":"graph","created_at":"2026-07-05T09:06:01Z","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/2312.02644/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study a simple model of algorithmic collusion in which Q-learning algorithms are designed in a strategic fashion. We let players (\\textit{designers}) choose their exploration policy simultaneously prior to letting their algorithms repeatedly play a prisoner's dilemma. We prove that, in equilibrium, collusive behavior is reached with positive probability. Our numerical simulations indicate symmetry of the equilibria and give insight for how they are affected by a parameter of interest. We also investigate general profiles of exploration policies. We characterize the behavior of the system fo","authors_text":"Ivan Conjeaud","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"econ.TH","submitted_at":"2023-12-05T10:35:41Z","title":"Algorithmic collusion under competitive design"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.02644","kind":"arxiv","version":3},"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:6cb9000b8fab90d33cbf9f0e64093c094d17302c0e46e500fad09c131dc7fbb4","target":"record","created_at":"2026-07-05T09:06:01Z","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":"e7fbb631d3a7cd1599b4b712baa6898834c21664013dc03eda78cc49c545c983","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"econ.TH","submitted_at":"2023-12-05T10:35:41Z","title_canon_sha256":"ca4c07e5020aaf1fb53e0a22dd423dbbe188545bdd9f1285b673c08c5b4dfb2f"},"schema_version":"1.0","source":{"id":"2312.02644","kind":"arxiv","version":3}},"canonical_sha256":"5aab97f5ceca7888908d9f783c42e94c1648a787cc27a2ac9f4851918f191ede","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5aab97f5ceca7888908d9f783c42e94c1648a787cc27a2ac9f4851918f191ede","first_computed_at":"2026-07-05T09:06:01.538543Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:06:01.538543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z0vgRhyRnYvU/qe6Wsrv1kPCEUQymT1Es6sG5yUKtkkY4O3UNMB2B5umnURKRjdzjf2aK83ulMxO/hPapr+7AQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:06:01.539015Z","signed_message":"canonical_sha256_bytes"},"source_id":"2312.02644","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6cb9000b8fab90d33cbf9f0e64093c094d17302c0e46e500fad09c131dc7fbb4","sha256:79efd7bfd6c0268c2dd4411d6e74d9135551040171682caef8b81b1ea7de6b35"],"state_sha256":"c265d4700c4a906b631ee0a081d0bbb5603bc5f5913dd9050254752049f6e388"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K4m+gwwTyXfIp58eF6hwmN6OrM7coGuPabFoxCfqYtH0BiQygT4k3Ron42jfRmqL/QYlSNHq4zV7N4HbVt9NBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T11:01:49.146857Z","bundle_sha256":"f46d97319da0648a14f3892f4ed7b457ac9180a4f9a67104174c924678ca34b4"}}