{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:R2MVS6WRN4TE3WXCIYTKNGKOGT","short_pith_number":"pith:R2MVS6WR","schema_version":"1.0","canonical_sha256":"8e99597ad16f264ddae24626a6994e34c1d85992192fa31e06bd35d4864f21a7","source":{"kind":"arxiv","id":"2608.07098","version":1},"attestation_state":"computed","paper":{"title":"Auditing Algorithmic Collusion from Strategy Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"econ.TH","authors_text":"Janusz M. Meylahn, Nicolas Eschenbaum","submitted_at":"2026-08-07T10:46:13Z","abstract_excerpt":"Detecting algorithmic collusion is challenging because regulators often have limited access to firms' algorithms, training data, and market information. We study an intermediate-information regime in which an auditor can query firms' frozen pricing policies and construct the induced strategy graph. Using a complete characterization of Nash equilibria in a repeated pricing game, we identify graph-theoretic features of strategy graphs that are associated with collusive reward-and-punishment schemes, including maximum betweenness, attractor in-degree, and average path length. We then test these m"},"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":"2608.07098","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"econ.TH","submitted_at":"2026-08-07T10:46:13Z","cross_cats_sorted":[],"title_canon_sha256":"a978d7cb16464a2f6778b86c375d17e652e963e5569e77c1562329ccfaab5877","abstract_canon_sha256":"d4ceed6ca2291684128ffdb8876ab602f8ec533c1ef4f34bdcf3c07d3ac501a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-10T01:13:12.788742Z","signature_b64":"AJfHVv52PHgJxMtQ6kVSxGmNcv1qnsYGXWEIBvRpH381XiXjrx+2u5BhneYxs2jonfWVO/FTVwcG2b7L2DTuCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e99597ad16f264ddae24626a6994e34c1d85992192fa31e06bd35d4864f21a7","last_reissued_at":"2026-08-10T01:13:12.786456Z","signature_status":"signed_v1","first_computed_at":"2026-08-10T01:13:12.786456Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Auditing Algorithmic Collusion from Strategy Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"econ.TH","authors_text":"Janusz M. Meylahn, Nicolas Eschenbaum","submitted_at":"2026-08-07T10:46:13Z","abstract_excerpt":"Detecting algorithmic collusion is challenging because regulators often have limited access to firms' algorithms, training data, and market information. We study an intermediate-information regime in which an auditor can query firms' frozen pricing policies and construct the induced strategy graph. Using a complete characterization of Nash equilibria in a repeated pricing game, we identify graph-theoretic features of strategy graphs that are associated with collusive reward-and-punishment schemes, including maximum betweenness, attractor in-degree, and average path length. We then test these m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.07098","kind":"arxiv","version":1},"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/2608.07098/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":"2608.07098","created_at":"2026-08-10T01:13:12.787387+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.07098v1","created_at":"2026-08-10T01:13:12.787387+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.07098","created_at":"2026-08-10T01:13:12.787387+00:00"},{"alias_kind":"pith_short_12","alias_value":"R2MVS6WRN4TE","created_at":"2026-08-10T01:13:12.787387+00:00"},{"alias_kind":"pith_short_16","alias_value":"R2MVS6WRN4TE3WXC","created_at":"2026-08-10T01:13:12.787387+00:00"},{"alias_kind":"pith_short_8","alias_value":"R2MVS6WR","created_at":"2026-08-10T01:13:12.787387+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/R2MVS6WRN4TE3WXCIYTKNGKOGT","json":"https://pith.science/pith/R2MVS6WRN4TE3WXCIYTKNGKOGT.json","graph_json":"https://pith.science/api/pith-number/R2MVS6WRN4TE3WXCIYTKNGKOGT/graph.json","events_json":"https://pith.science/api/pith-number/R2MVS6WRN4TE3WXCIYTKNGKOGT/events.json","paper":"https://pith.science/paper/R2MVS6WR"},"agent_actions":{"view_html":"https://pith.science/pith/R2MVS6WRN4TE3WXCIYTKNGKOGT","download_json":"https://pith.science/pith/R2MVS6WRN4TE3WXCIYTKNGKOGT.json","view_paper":"https://pith.science/paper/R2MVS6WR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.07098&json=true","fetch_graph":"https://pith.science/api/pith-number/R2MVS6WRN4TE3WXCIYTKNGKOGT/graph.json","fetch_events":"https://pith.science/api/pith-number/R2MVS6WRN4TE3WXCIYTKNGKOGT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R2MVS6WRN4TE3WXCIYTKNGKOGT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R2MVS6WRN4TE3WXCIYTKNGKOGT/action/storage_attestation","attest_author":"https://pith.science/pith/R2MVS6WRN4TE3WXCIYTKNGKOGT/action/author_attestation","sign_citation":"https://pith.science/pith/R2MVS6WRN4TE3WXCIYTKNGKOGT/action/citation_signature","submit_replication":"https://pith.science/pith/R2MVS6WRN4TE3WXCIYTKNGKOGT/action/replication_record"}},"created_at":"2026-08-10T01:13:12.787387+00:00","updated_at":"2026-08-10T01:13:12.787387+00:00"}