{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2004:BQ7PPBWMROO5LHH4ID2C4WKB7D","short_pith_number":"pith:BQ7PPBWM","canonical_record":{"source":{"id":"math/0407504","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2004-07-28T23:15:34Z","cross_cats_sorted":[],"title_canon_sha256":"47c01525fb89895d0142175e9c0a1e8d16c9c6aec1b6882a3c39c7e50cabab43","abstract_canon_sha256":"0973e57c5783aaf92ed705b64bb541e48a10bf7d9dba85d8d587fb757cccd675"},"schema_version":"1.0"},"canonical_sha256":"0c3ef786cc8b9dd59cfc40f42e5941f8f268c400429db7ff78fde085c8571350","source":{"kind":"arxiv","id":"math/0407504","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0407504","created_at":"2026-05-18T04:36:09Z"},{"alias_kind":"arxiv_version","alias_value":"math/0407504v2","created_at":"2026-05-18T04:36:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0407504","created_at":"2026-05-18T04:36:09Z"},{"alias_kind":"pith_short_12","alias_value":"BQ7PPBWMROO5","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_16","alias_value":"BQ7PPBWMROO5LHH4","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_8","alias_value":"BQ7PPBWM","created_at":"2026-05-18T12:25:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2004:BQ7PPBWMROO5LHH4ID2C4WKB7D","target":"record","payload":{"canonical_record":{"source":{"id":"math/0407504","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2004-07-28T23:15:34Z","cross_cats_sorted":[],"title_canon_sha256":"47c01525fb89895d0142175e9c0a1e8d16c9c6aec1b6882a3c39c7e50cabab43","abstract_canon_sha256":"0973e57c5783aaf92ed705b64bb541e48a10bf7d9dba85d8d587fb757cccd675"},"schema_version":"1.0"},"canonical_sha256":"0c3ef786cc8b9dd59cfc40f42e5941f8f268c400429db7ff78fde085c8571350","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:36:09.504672Z","signature_b64":"G4oeARjR0eak+VoSF4BSQXIi1RHeq5ZnUwvnNOqPw2nBAix/DQIKIyAx1N1YIlsprJFLQ+rg7UGLTOccrhrYDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c3ef786cc8b9dd59cfc40f42e5941f8f268c400429db7ff78fde085c8571350","last_reissued_at":"2026-05-18T04:36:09.503958Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:36:09.503958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/0407504","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-05-18T04:36:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Oi2L1yxtej1d1gAgK6F4dB37U4jIpAETRQKwDu5sR6+1hIFFlRothaqCLP/VX0OJmX0UbdZx7cwy6Xhuy9djCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T13:06:51.299451Z"},"content_sha256":"dfb967ff63e96bf7d270e135790ec0446f6df8f6e8131f44e3df5e576bfa9253","schema_version":"1.0","event_id":"sha256:dfb967ff63e96bf7d270e135790ec0446f6df8f6e8131f44e3df5e576bfa9253"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2004:BQ7PPBWMROO5LHH4ID2C4WKB7D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Renyi-Ulam pathological liar game with a fixed number of lies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Catherine H. Yan, Robert B. Ellis, Vadim Ponomarenko","submitted_at":"2004-07-28T23:15:34Z","abstract_excerpt":"The $q$-round Renyi-Ulam pathological liar game with $k$ lies on the set $[n]:=\\{1,...,n\\}$ is a 2-player perfect information zero sum game. In each round Paul chooses a subset $A\\subseteq [n]$ and Carole either assigns 1 lie to each element of $A$ or to each element of $[n]\\setminus A$. Paul wins if after $q$ rounds there is at least one element with $k$ or fewer lies. The game is dual to the original Renyi-Ulam liar game for which the winning condition is that at most one element has $k$ or fewer lies. We prove the existence of a winning strategy for Paul to the existence of a covering of th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0407504","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":""},"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-05-18T04:36:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oWUvcRs83Aoy0f2cJv6GaYvzQqzGePavJARP38D44lagGAY2u/6105+8BrIjwapDe2MLXQN29vn5BuHQdrqWCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T13:06:51.299806Z"},"content_sha256":"8db6da24f180c345f15fea9c8e864019e9f5d57fe014456a56c7c6222b495eca","schema_version":"1.0","event_id":"sha256:8db6da24f180c345f15fea9c8e864019e9f5d57fe014456a56c7c6222b495eca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BQ7PPBWMROO5LHH4ID2C4WKB7D/bundle.json","state_url":"https://pith.science/pith/BQ7PPBWMROO5LHH4ID2C4WKB7D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BQ7PPBWMROO5LHH4ID2C4WKB7D/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-06-02T13:06:51Z","links":{"resolver":"https://pith.science/pith/BQ7PPBWMROO5LHH4ID2C4WKB7D","bundle":"https://pith.science/pith/BQ7PPBWMROO5LHH4ID2C4WKB7D/bundle.json","state":"https://pith.science/pith/BQ7PPBWMROO5LHH4ID2C4WKB7D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BQ7PPBWMROO5LHH4ID2C4WKB7D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2004:BQ7PPBWMROO5LHH4ID2C4WKB7D","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":"0973e57c5783aaf92ed705b64bb541e48a10bf7d9dba85d8d587fb757cccd675","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2004-07-28T23:15:34Z","title_canon_sha256":"47c01525fb89895d0142175e9c0a1e8d16c9c6aec1b6882a3c39c7e50cabab43"},"schema_version":"1.0","source":{"id":"math/0407504","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0407504","created_at":"2026-05-18T04:36:09Z"},{"alias_kind":"arxiv_version","alias_value":"math/0407504v2","created_at":"2026-05-18T04:36:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0407504","created_at":"2026-05-18T04:36:09Z"},{"alias_kind":"pith_short_12","alias_value":"BQ7PPBWMROO5","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_16","alias_value":"BQ7PPBWMROO5LHH4","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_8","alias_value":"BQ7PPBWM","created_at":"2026-05-18T12:25:52Z"}],"graph_snapshots":[{"event_id":"sha256:8db6da24f180c345f15fea9c8e864019e9f5d57fe014456a56c7c6222b495eca","target":"graph","created_at":"2026-05-18T04:36:09Z","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"},"paper":{"abstract_excerpt":"The $q$-round Renyi-Ulam pathological liar game with $k$ lies on the set $[n]:=\\{1,...,n\\}$ is a 2-player perfect information zero sum game. In each round Paul chooses a subset $A\\subseteq [n]$ and Carole either assigns 1 lie to each element of $A$ or to each element of $[n]\\setminus A$. Paul wins if after $q$ rounds there is at least one element with $k$ or fewer lies. The game is dual to the original Renyi-Ulam liar game for which the winning condition is that at most one element has $k$ or fewer lies. We prove the existence of a winning strategy for Paul to the existence of a covering of th","authors_text":"Catherine H. Yan, Robert B. Ellis, Vadim Ponomarenko","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2004-07-28T23:15:34Z","title":"The Renyi-Ulam pathological liar game with a fixed number of lies"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0407504","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:dfb967ff63e96bf7d270e135790ec0446f6df8f6e8131f44e3df5e576bfa9253","target":"record","created_at":"2026-05-18T04:36:09Z","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":"0973e57c5783aaf92ed705b64bb541e48a10bf7d9dba85d8d587fb757cccd675","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2004-07-28T23:15:34Z","title_canon_sha256":"47c01525fb89895d0142175e9c0a1e8d16c9c6aec1b6882a3c39c7e50cabab43"},"schema_version":"1.0","source":{"id":"math/0407504","kind":"arxiv","version":2}},"canonical_sha256":"0c3ef786cc8b9dd59cfc40f42e5941f8f268c400429db7ff78fde085c8571350","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0c3ef786cc8b9dd59cfc40f42e5941f8f268c400429db7ff78fde085c8571350","first_computed_at":"2026-05-18T04:36:09.503958Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:36:09.503958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G4oeARjR0eak+VoSF4BSQXIi1RHeq5ZnUwvnNOqPw2nBAix/DQIKIyAx1N1YIlsprJFLQ+rg7UGLTOccrhrYDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:36:09.504672Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0407504","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dfb967ff63e96bf7d270e135790ec0446f6df8f6e8131f44e3df5e576bfa9253","sha256:8db6da24f180c345f15fea9c8e864019e9f5d57fe014456a56c7c6222b495eca"],"state_sha256":"1fe3b4df375f3bf3887822a7257e369474d8ae895c0499a872007d2957cfd947"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fpTUplS+m86C/x11z98IXucn5bNi+zqmFxnNz13AFSbHutPAgzFcRiEOp/HnGz8TxWCVUJlK895ka0uraAqXDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T13:06:51.301691Z","bundle_sha256":"d26540c81a7dc360858726dfb07e794420cf0280f85475c32cbcc7a9ef8f2d21"}}