{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:R2MVS6WRN4TE3WXCIYTKNGKOGT","short_pith_number":"pith:R2MVS6WR","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"},"canonical_sha256":"8e99597ad16f264ddae24626a6994e34c1d85992192fa31e06bd35d4864f21a7","source":{"kind":"arxiv","id":"2608.07098","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.07098","created_at":"2026-08-10T01:13:12Z"},{"alias_kind":"arxiv_version","alias_value":"2608.07098v1","created_at":"2026-08-10T01:13:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.07098","created_at":"2026-08-10T01:13:12Z"},{"alias_kind":"pith_short_12","alias_value":"R2MVS6WRN4TE","created_at":"2026-08-10T01:13:12Z"},{"alias_kind":"pith_short_16","alias_value":"R2MVS6WRN4TE3WXC","created_at":"2026-08-10T01:13:12Z"},{"alias_kind":"pith_short_8","alias_value":"R2MVS6WR","created_at":"2026-08-10T01:13:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:R2MVS6WRN4TE3WXCIYTKNGKOGT","target":"record","payload":{"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"},"canonical_sha256":"8e99597ad16f264ddae24626a6994e34c1d85992192fa31e06bd35d4864f21a7","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"},"source_kind":"arxiv","source_id":"2608.07098","source_version":1,"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-08-10T01:13:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bSbtOu3mKKDhML4ZjW3eSDLONcijCPr1urAlcMSa4sjpUi9eEt3HqozxTl3NoDlcXSoxGnJNKAtnuXssC/wWCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T01:40:04.487586Z"},"content_sha256":"78b1097e15f16f5547db230cdd348706a78ef179a1ff3da9c2bb113083d19efb","schema_version":"1.0","event_id":"sha256:78b1097e15f16f5547db230cdd348706a78ef179a1ff3da9c2bb113083d19efb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:R2MVS6WRN4TE3WXCIYTKNGKOGT","target":"graph","payload":{"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"},"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-08-10T01:13:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2KTa/BMjPVFUz0M/hL3Q5PjhT3Z9ScXoV9fUUijd94oCv9PazZVyBpmnTcIa2a768z1YRQPhl7qmVrAAHqP1BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T01:40:04.488140Z"},"content_sha256":"8a68b7df91b8ace8972149235af202949a7c832e840a0f5ab1ec239621e4de62","schema_version":"1.0","event_id":"sha256:8a68b7df91b8ace8972149235af202949a7c832e840a0f5ab1ec239621e4de62"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R2MVS6WRN4TE3WXCIYTKNGKOGT/bundle.json","state_url":"https://pith.science/pith/R2MVS6WRN4TE3WXCIYTKNGKOGT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R2MVS6WRN4TE3WXCIYTKNGKOGT/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-13T01:40:04Z","links":{"resolver":"https://pith.science/pith/R2MVS6WRN4TE3WXCIYTKNGKOGT","bundle":"https://pith.science/pith/R2MVS6WRN4TE3WXCIYTKNGKOGT/bundle.json","state":"https://pith.science/pith/R2MVS6WRN4TE3WXCIYTKNGKOGT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R2MVS6WRN4TE3WXCIYTKNGKOGT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:R2MVS6WRN4TE3WXCIYTKNGKOGT","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":"d4ceed6ca2291684128ffdb8876ab602f8ec533c1ef4f34bdcf3c07d3ac501a3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"econ.TH","submitted_at":"2026-08-07T10:46:13Z","title_canon_sha256":"a978d7cb16464a2f6778b86c375d17e652e963e5569e77c1562329ccfaab5877"},"schema_version":"1.0","source":{"id":"2608.07098","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.07098","created_at":"2026-08-10T01:13:12Z"},{"alias_kind":"arxiv_version","alias_value":"2608.07098v1","created_at":"2026-08-10T01:13:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.07098","created_at":"2026-08-10T01:13:12Z"},{"alias_kind":"pith_short_12","alias_value":"R2MVS6WRN4TE","created_at":"2026-08-10T01:13:12Z"},{"alias_kind":"pith_short_16","alias_value":"R2MVS6WRN4TE3WXC","created_at":"2026-08-10T01:13:12Z"},{"alias_kind":"pith_short_8","alias_value":"R2MVS6WR","created_at":"2026-08-10T01:13:12Z"}],"graph_snapshots":[{"event_id":"sha256:8a68b7df91b8ace8972149235af202949a7c832e840a0f5ab1ec239621e4de62","target":"graph","created_at":"2026-08-10T01:13:12Z","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/2608.07098/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Janusz M. Meylahn, Nicolas Eschenbaum","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"econ.TH","submitted_at":"2026-08-07T10:46:13Z","title":"Auditing Algorithmic Collusion from Strategy Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.07098","kind":"arxiv","version":1},"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:78b1097e15f16f5547db230cdd348706a78ef179a1ff3da9c2bb113083d19efb","target":"record","created_at":"2026-08-10T01:13:12Z","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":"d4ceed6ca2291684128ffdb8876ab602f8ec533c1ef4f34bdcf3c07d3ac501a3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"econ.TH","submitted_at":"2026-08-07T10:46:13Z","title_canon_sha256":"a978d7cb16464a2f6778b86c375d17e652e963e5569e77c1562329ccfaab5877"},"schema_version":"1.0","source":{"id":"2608.07098","kind":"arxiv","version":1}},"canonical_sha256":"8e99597ad16f264ddae24626a6994e34c1d85992192fa31e06bd35d4864f21a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8e99597ad16f264ddae24626a6994e34c1d85992192fa31e06bd35d4864f21a7","first_computed_at":"2026-08-10T01:13:12.786456Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-10T01:13:12.786456Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AJfHVv52PHgJxMtQ6kVSxGmNcv1qnsYGXWEIBvRpH381XiXjrx+2u5BhneYxs2jonfWVO/FTVwcG2b7L2DTuCw==","signature_status":"signed_v1","signed_at":"2026-08-10T01:13:12.788742Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.07098","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:78b1097e15f16f5547db230cdd348706a78ef179a1ff3da9c2bb113083d19efb","sha256:8a68b7df91b8ace8972149235af202949a7c832e840a0f5ab1ec239621e4de62"],"state_sha256":"5f74cc68cc96ade488f7aa1370f27d8674e77f1b08d273279ae28264ec9c2336"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Go7F/QMKQT0DHyBs4Vjekayg6QMkVzhQicxXEtFrbM//jP27JC++CcdXyx6EjlwctXhXGRtN6xWyTnis3mFdDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T01:40:04.493330Z","bundle_sha256":"8eccb6abfa9e975ada727263ac2b920e4f129b75bb00ea513e27a5a205af35e1"}}