{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:BDUSVD254HG6DZ4Q6ZCBU5MJUB","short_pith_number":"pith:BDUSVD25","canonical_record":{"source":{"id":"2511.15727","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2025-11-17T20:08:52Z","cross_cats_sorted":[],"title_canon_sha256":"b063e756cc30215fc73fc1f74099576b40f6572a8bb90b0f7ff6ba818b140533","abstract_canon_sha256":"21894dc6f088afdd8fa9db506c33e829a9b6f9a186a2fd22371f4e53ebd531b9"},"schema_version":"1.0"},"canonical_sha256":"08e92a8f5de1cde1e790f6441a7589a0765054e33346c8adeec3659913f23cf6","source":{"kind":"arxiv","id":"2511.15727","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2511.15727","created_at":"2026-07-07T02:19:42Z"},{"alias_kind":"arxiv_version","alias_value":"2511.15727v2","created_at":"2026-07-07T02:19:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.15727","created_at":"2026-07-07T02:19:42Z"},{"alias_kind":"pith_short_12","alias_value":"BDUSVD254HG6","created_at":"2026-07-07T02:19:42Z"},{"alias_kind":"pith_short_16","alias_value":"BDUSVD254HG6DZ4Q","created_at":"2026-07-07T02:19:42Z"},{"alias_kind":"pith_short_8","alias_value":"BDUSVD25","created_at":"2026-07-07T02:19:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:BDUSVD254HG6DZ4Q6ZCBU5MJUB","target":"record","payload":{"canonical_record":{"source":{"id":"2511.15727","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2025-11-17T20:08:52Z","cross_cats_sorted":[],"title_canon_sha256":"b063e756cc30215fc73fc1f74099576b40f6572a8bb90b0f7ff6ba818b140533","abstract_canon_sha256":"21894dc6f088afdd8fa9db506c33e829a9b6f9a186a2fd22371f4e53ebd531b9"},"schema_version":"1.0"},"canonical_sha256":"08e92a8f5de1cde1e790f6441a7589a0765054e33346c8adeec3659913f23cf6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-07T02:19:42.337521Z","signature_b64":"13fOLeGccfn8dodE55T+arR2E4WUTsgTFjxMloROUZ64XDsEd2zAlIE47mJBPO34dDAAaHObo/w/Qz74HoO8Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08e92a8f5de1cde1e790f6441a7589a0765054e33346c8adeec3659913f23cf6","last_reissued_at":"2026-07-07T02:19:42.336532Z","signature_status":"signed_v1","first_computed_at":"2026-07-07T02:19:42.336532Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2511.15727","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-07T02:19:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UbBb7i5v/5GYRhAChGKLhevZ+p00JTEJ3IR+CP2VPl5Z4kon0ZFLUvOeq7aoorbAARqosjYHvQi0V38Okit+AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T19:46:16.840223Z"},"content_sha256":"b377649d4f5f47a471c968a6b7bad32b70d18405e3c3e39496db71118637b15c","schema_version":"1.0","event_id":"sha256:b377649d4f5f47a471c968a6b7bad32b70d18405e3c3e39496db71118637b15c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:BDUSVD254HG6DZ4Q6ZCBU5MJUB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Prior-free Collusion-proof Dynamic Mechanisms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Endre Cs\\'oka","submitted_at":"2025-11-17T20:08:52Z","abstract_excerpt":"For a general class of dynamic stochastic multi-player problems, Cs\\'oka, Liu, Rodivilov, and Teytelboym (2024) proposed prior-dependent efficient collusion-proof mechanisms. The present paper proves prior-free lifting theorems, at the price of lower guaranteed utility levels that depend on the set of possible initial type profiles. As a special case, we implement a $0.872$-approximately utility-maximizing prior-free collusion-proof mechanism for the Markovian repeated single-good allocation problem studied by Fikioris, Banerjee, and Tardos (2025)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.15727","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/2511.15727/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-07T02:19:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5WarECrxRKIBkIMQZzHC4npP3ffA52JidFxGozZhLjTibe45thjKwlolwjmOxZs6XN9k1Pm9FfSeKc0EF6yjDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T19:46:16.840802Z"},"content_sha256":"f6c392f58503713bf4c60e74d4afe3ecf315505208315408d0bd60d07f7d24f7","schema_version":"1.0","event_id":"sha256:f6c392f58503713bf4c60e74d4afe3ecf315505208315408d0bd60d07f7d24f7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BDUSVD254HG6DZ4Q6ZCBU5MJUB/bundle.json","state_url":"https://pith.science/pith/BDUSVD254HG6DZ4Q6ZCBU5MJUB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BDUSVD254HG6DZ4Q6ZCBU5MJUB/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-09T19:46:16Z","links":{"resolver":"https://pith.science/pith/BDUSVD254HG6DZ4Q6ZCBU5MJUB","bundle":"https://pith.science/pith/BDUSVD254HG6DZ4Q6ZCBU5MJUB/bundle.json","state":"https://pith.science/pith/BDUSVD254HG6DZ4Q6ZCBU5MJUB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BDUSVD254HG6DZ4Q6ZCBU5MJUB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:BDUSVD254HG6DZ4Q6ZCBU5MJUB","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":"21894dc6f088afdd8fa9db506c33e829a9b6f9a186a2fd22371f4e53ebd531b9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2025-11-17T20:08:52Z","title_canon_sha256":"b063e756cc30215fc73fc1f74099576b40f6572a8bb90b0f7ff6ba818b140533"},"schema_version":"1.0","source":{"id":"2511.15727","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2511.15727","created_at":"2026-07-07T02:19:42Z"},{"alias_kind":"arxiv_version","alias_value":"2511.15727v2","created_at":"2026-07-07T02:19:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.15727","created_at":"2026-07-07T02:19:42Z"},{"alias_kind":"pith_short_12","alias_value":"BDUSVD254HG6","created_at":"2026-07-07T02:19:42Z"},{"alias_kind":"pith_short_16","alias_value":"BDUSVD254HG6DZ4Q","created_at":"2026-07-07T02:19:42Z"},{"alias_kind":"pith_short_8","alias_value":"BDUSVD25","created_at":"2026-07-07T02:19:42Z"}],"graph_snapshots":[{"event_id":"sha256:f6c392f58503713bf4c60e74d4afe3ecf315505208315408d0bd60d07f7d24f7","target":"graph","created_at":"2026-07-07T02:19:42Z","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/2511.15727/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For a general class of dynamic stochastic multi-player problems, Cs\\'oka, Liu, Rodivilov, and Teytelboym (2024) proposed prior-dependent efficient collusion-proof mechanisms. The present paper proves prior-free lifting theorems, at the price of lower guaranteed utility levels that depend on the set of possible initial type profiles. As a special case, we implement a $0.872$-approximately utility-maximizing prior-free collusion-proof mechanism for the Markovian repeated single-good allocation problem studied by Fikioris, Banerjee, and Tardos (2025).","authors_text":"Endre Cs\\'oka","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2025-11-17T20:08:52Z","title":"Prior-free Collusion-proof Dynamic Mechanisms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.15727","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:b377649d4f5f47a471c968a6b7bad32b70d18405e3c3e39496db71118637b15c","target":"record","created_at":"2026-07-07T02:19:42Z","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":"21894dc6f088afdd8fa9db506c33e829a9b6f9a186a2fd22371f4e53ebd531b9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2025-11-17T20:08:52Z","title_canon_sha256":"b063e756cc30215fc73fc1f74099576b40f6572a8bb90b0f7ff6ba818b140533"},"schema_version":"1.0","source":{"id":"2511.15727","kind":"arxiv","version":2}},"canonical_sha256":"08e92a8f5de1cde1e790f6441a7589a0765054e33346c8adeec3659913f23cf6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"08e92a8f5de1cde1e790f6441a7589a0765054e33346c8adeec3659913f23cf6","first_computed_at":"2026-07-07T02:19:42.336532Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-07T02:19:42.336532Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"13fOLeGccfn8dodE55T+arR2E4WUTsgTFjxMloROUZ64XDsEd2zAlIE47mJBPO34dDAAaHObo/w/Qz74HoO8Dg==","signature_status":"signed_v1","signed_at":"2026-07-07T02:19:42.337521Z","signed_message":"canonical_sha256_bytes"},"source_id":"2511.15727","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b377649d4f5f47a471c968a6b7bad32b70d18405e3c3e39496db71118637b15c","sha256:f6c392f58503713bf4c60e74d4afe3ecf315505208315408d0bd60d07f7d24f7"],"state_sha256":"3be74d535424a2bdf34e66c9dab7a54c3cdfa3e6c356d0d101662237d54cc921"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IzslxUSqnblZ0lsrq/hnjcYjiXJ/eHhjAJh9BhaRT0ObdJx+aBXJuQ+bQdY3lC6l2rEEf/yeFn7Y3tW2CG76Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T19:46:16.845158Z","bundle_sha256":"236d7583a4c811e95b2843648b435c3baa6b78615d84e7ed75ee4fdfd0932678"}}