{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:HGE6YP3TTR6KJ2Q2ZT6TZ235MN","short_pith_number":"pith:HGE6YP3T","canonical_record":{"source":{"id":"2201.09801","kind":"arxiv","version":12},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.GM","submitted_at":"2022-01-24T17:01:34Z","cross_cats_sorted":[],"title_canon_sha256":"5fb4c00f17fc86eb599662dc403c8e8a5f4e2720869077484a8d128d8b35c69c","abstract_canon_sha256":"6f0aaf56a6fc1e282f53cb6a100d4b2c4662bfbe5d5a5584f90e47c5bd4e04b5"},"schema_version":"1.0"},"canonical_sha256":"3989ec3f739c7ca4ea1accfd3ceb7d63608194c6ea7b67085e4cc24265080c1f","source":{"kind":"arxiv","id":"2201.09801","version":12},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.09801","created_at":"2026-06-01T01:03:38Z"},{"alias_kind":"arxiv_version","alias_value":"2201.09801v12","created_at":"2026-06-01T01:03:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.09801","created_at":"2026-06-01T01:03:38Z"},{"alias_kind":"pith_short_12","alias_value":"HGE6YP3TTR6K","created_at":"2026-06-01T01:03:38Z"},{"alias_kind":"pith_short_16","alias_value":"HGE6YP3TTR6KJ2Q2","created_at":"2026-06-01T01:03:38Z"},{"alias_kind":"pith_short_8","alias_value":"HGE6YP3T","created_at":"2026-06-01T01:03:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:HGE6YP3TTR6KJ2Q2ZT6TZ235MN","target":"record","payload":{"canonical_record":{"source":{"id":"2201.09801","kind":"arxiv","version":12},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.GM","submitted_at":"2022-01-24T17:01:34Z","cross_cats_sorted":[],"title_canon_sha256":"5fb4c00f17fc86eb599662dc403c8e8a5f4e2720869077484a8d128d8b35c69c","abstract_canon_sha256":"6f0aaf56a6fc1e282f53cb6a100d4b2c4662bfbe5d5a5584f90e47c5bd4e04b5"},"schema_version":"1.0"},"canonical_sha256":"3989ec3f739c7ca4ea1accfd3ceb7d63608194c6ea7b67085e4cc24265080c1f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-01T01:03:38.075919Z","signature_b64":"qRizcVs8G6XpMDkOakw6E8iANiimKXpRAMtErC0OpZv2mBJ6WI8qbhita90kBwCXX7yMxJLN/tloEhj8Xhe8Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3989ec3f739c7ca4ea1accfd3ceb7d63608194c6ea7b67085e4cc24265080c1f","last_reissued_at":"2026-06-01T01:03:38.075399Z","signature_status":"signed_v1","first_computed_at":"2026-06-01T01:03:38.075399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2201.09801","source_version":12,"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-06-01T01:03:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9kzEcfoJp96VdLK1Iu0C3OMs/HaoD8OZ29AIe4MI3RqANvGO7gzAYKSoY08iwTCO0ejRnTh4kN93ublrLYLbDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T09:10:21.630230Z"},"content_sha256":"cd07c45b0a13e21fb4935a9230e315ec458962ead356c31d7d882872ba974d5a","schema_version":"1.0","event_id":"sha256:cd07c45b0a13e21fb4935a9230e315ec458962ead356c31d7d882872ba974d5a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:HGE6YP3TTR6KJ2Q2ZT6TZ235MN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A logical treatment of noise: Solving The Hardest Logic Puzzle Ever and its generalizations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"An n-gods puzzle is solvable exactly when fewer gods answer at random than answer consistently, for any cardinal.","cross_cats":[],"primary_cat":"math.GM","authors_text":"Daniel Vallstrom","submitted_at":"2022-01-24T17:01:34Z","abstract_excerpt":"Raymond Smullyan came up with a puzzle that George Boolos called The Hardest Logic Puzzle Ever.[1] The puzzle has truthful, lying, and random gods who answer yes or no questions with words that we don't know the meaning of. The challenge is to figure out which type each god is. The puzzle has attracted some general attention -- for example, one popular presentation of the puzzle has been viewed 10 million times.[2] Various \"top-down\" solutions to the puzzle have been developed.[1,3] We present a systematic bottom-up approach to the puzzle and its generalization. We prove that an n gods puzzle "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We prove that an n gods puzzle is solvable if and only if the random gods are less than the non-random gods, for arbitrary cardinals.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The model treats random gods as answering completely at random with no dependence on prior answers or question content, and treats the unknown yes/no words as fixed but unknown; this is the standard setup referenced in the abstract but is not re-derived there.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Proves n-god puzzles solvable iff random gods < non-random gods for arbitrary cardinals, with 4.15-question average for a 5-god case and a general algorithm.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"An n-gods puzzle is solvable exactly when fewer gods answer at random than answer consistently, for any cardinal.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"25126fa8a5dc68f6bcd7ad083720e476321f39873221c718fd8c3b6ee0a13425"},"source":{"id":"2201.09801","kind":"arxiv","version":12},"verdict":{"id":"90a3f14e-9ece-4fb0-b1ef-23d8dc311469","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-24T12:33:33.234561Z","strongest_claim":"We prove that an n gods puzzle is solvable if and only if the random gods are less than the non-random gods, for arbitrary cardinals.","one_line_summary":"Proves n-god puzzles solvable iff random gods < non-random gods for arbitrary cardinals, with 4.15-question average for a 5-god case and a general algorithm.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The model treats random gods as answering completely at random with no dependence on prior answers or question content, and treats the unknown yes/no words as fixed but unknown; this is the standard setup referenced in the abstract but is not re-derived there.","pith_extraction_headline":"An n-gods puzzle is solvable exactly when fewer gods answer at random than answer consistently, for any cardinal."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2201.09801/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":"90a3f14e-9ece-4fb0-b1ef-23d8dc311469"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-01T01:03:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6KWWHDHimEXhnd+e6+E5go/mKW2Zow8djg2GhjHGGu3j77mxvMWyXYwky9NWz1CXC/X5egMDnwPDMH9JFRWSDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T09:10:21.630733Z"},"content_sha256":"29e6f72426fa1ea8cb79b95d6a99b804ad4d103e78a1374b03ea6d010592dd84","schema_version":"1.0","event_id":"sha256:29e6f72426fa1ea8cb79b95d6a99b804ad4d103e78a1374b03ea6d010592dd84"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HGE6YP3TTR6KJ2Q2ZT6TZ235MN/bundle.json","state_url":"https://pith.science/pith/HGE6YP3TTR6KJ2Q2ZT6TZ235MN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HGE6YP3TTR6KJ2Q2ZT6TZ235MN/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-11T09:10:21Z","links":{"resolver":"https://pith.science/pith/HGE6YP3TTR6KJ2Q2ZT6TZ235MN","bundle":"https://pith.science/pith/HGE6YP3TTR6KJ2Q2ZT6TZ235MN/bundle.json","state":"https://pith.science/pith/HGE6YP3TTR6KJ2Q2ZT6TZ235MN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HGE6YP3TTR6KJ2Q2ZT6TZ235MN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:HGE6YP3TTR6KJ2Q2ZT6TZ235MN","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":"6f0aaf56a6fc1e282f53cb6a100d4b2c4662bfbe5d5a5584f90e47c5bd4e04b5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.GM","submitted_at":"2022-01-24T17:01:34Z","title_canon_sha256":"5fb4c00f17fc86eb599662dc403c8e8a5f4e2720869077484a8d128d8b35c69c"},"schema_version":"1.0","source":{"id":"2201.09801","kind":"arxiv","version":12}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.09801","created_at":"2026-06-01T01:03:38Z"},{"alias_kind":"arxiv_version","alias_value":"2201.09801v12","created_at":"2026-06-01T01:03:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.09801","created_at":"2026-06-01T01:03:38Z"},{"alias_kind":"pith_short_12","alias_value":"HGE6YP3TTR6K","created_at":"2026-06-01T01:03:38Z"},{"alias_kind":"pith_short_16","alias_value":"HGE6YP3TTR6KJ2Q2","created_at":"2026-06-01T01:03:38Z"},{"alias_kind":"pith_short_8","alias_value":"HGE6YP3T","created_at":"2026-06-01T01:03:38Z"}],"graph_snapshots":[{"event_id":"sha256:29e6f72426fa1ea8cb79b95d6a99b804ad4d103e78a1374b03ea6d010592dd84","target":"graph","created_at":"2026-06-01T01:03:38Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We prove that an n gods puzzle is solvable if and only if the random gods are less than the non-random gods, for arbitrary cardinals."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The model treats random gods as answering completely at random with no dependence on prior answers or question content, and treats the unknown yes/no words as fixed but unknown; this is the standard setup referenced in the abstract but is not re-derived there."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Proves n-god puzzles solvable iff random gods < non-random gods for arbitrary cardinals, with 4.15-question average for a 5-god case and a general algorithm."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"An n-gods puzzle is solvable exactly when fewer gods answer at random than answer consistently, for any cardinal."}],"snapshot_sha256":"25126fa8a5dc68f6bcd7ad083720e476321f39873221c718fd8c3b6ee0a13425"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2201.09801/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Raymond Smullyan came up with a puzzle that George Boolos called The Hardest Logic Puzzle Ever.[1] The puzzle has truthful, lying, and random gods who answer yes or no questions with words that we don't know the meaning of. The challenge is to figure out which type each god is. The puzzle has attracted some general attention -- for example, one popular presentation of the puzzle has been viewed 10 million times.[2] Various \"top-down\" solutions to the puzzle have been developed.[1,3] We present a systematic bottom-up approach to the puzzle and its generalization. We prove that an n gods puzzle ","authors_text":"Daniel Vallstrom","cross_cats":[],"headline":"An n-gods puzzle is solvable exactly when fewer gods answer at random than answer consistently, for any cardinal.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.GM","submitted_at":"2022-01-24T17:01:34Z","title":"A logical treatment of noise: Solving The Hardest Logic Puzzle Ever and its generalizations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.09801","kind":"arxiv","version":12},"verdict":{"created_at":"2026-05-24T12:33:33.234561Z","id":"90a3f14e-9ece-4fb0-b1ef-23d8dc311469","model_set":{"reader":"grok-4.3"},"one_line_summary":"Proves n-god puzzles solvable iff random gods < non-random gods for arbitrary cardinals, with 4.15-question average for a 5-god case and a general algorithm.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"An n-gods puzzle is solvable exactly when fewer gods answer at random than answer consistently, for any cardinal.","strongest_claim":"We prove that an n gods puzzle is solvable if and only if the random gods are less than the non-random gods, for arbitrary cardinals.","weakest_assumption":"The model treats random gods as answering completely at random with no dependence on prior answers or question content, and treats the unknown yes/no words as fixed but unknown; this is the standard setup referenced in the abstract but is not re-derived there."}},"verdict_id":"90a3f14e-9ece-4fb0-b1ef-23d8dc311469"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:cd07c45b0a13e21fb4935a9230e315ec458962ead356c31d7d882872ba974d5a","target":"record","created_at":"2026-06-01T01:03:38Z","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":"6f0aaf56a6fc1e282f53cb6a100d4b2c4662bfbe5d5a5584f90e47c5bd4e04b5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.GM","submitted_at":"2022-01-24T17:01:34Z","title_canon_sha256":"5fb4c00f17fc86eb599662dc403c8e8a5f4e2720869077484a8d128d8b35c69c"},"schema_version":"1.0","source":{"id":"2201.09801","kind":"arxiv","version":12}},"canonical_sha256":"3989ec3f739c7ca4ea1accfd3ceb7d63608194c6ea7b67085e4cc24265080c1f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3989ec3f739c7ca4ea1accfd3ceb7d63608194c6ea7b67085e4cc24265080c1f","first_computed_at":"2026-06-01T01:03:38.075399Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-01T01:03:38.075399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qRizcVs8G6XpMDkOakw6E8iANiimKXpRAMtErC0OpZv2mBJ6WI8qbhita90kBwCXX7yMxJLN/tloEhj8Xhe8Bw==","signature_status":"signed_v1","signed_at":"2026-06-01T01:03:38.075919Z","signed_message":"canonical_sha256_bytes"},"source_id":"2201.09801","source_kind":"arxiv","source_version":12}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd07c45b0a13e21fb4935a9230e315ec458962ead356c31d7d882872ba974d5a","sha256:29e6f72426fa1ea8cb79b95d6a99b804ad4d103e78a1374b03ea6d010592dd84"],"state_sha256":"39538b54e837ccd47a26470edff85541ee9d3a7b741483a8cf66be250d35da53"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oKjs/3x+fwvTrNYcJiCd3ZRLMm5Zdl/PXEXcvM2tYAAbo4u2Bx5kKYyZcTrWYr4MJr5nolyGWHoaQ1/rDnLAAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T09:10:21.633646Z","bundle_sha256":"91ec1c620f8ce446ad25f332dbfd2afd70b508eaf25d7d9244f848a42f667e12"}}