{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:5TEIHJE2PCL6F3KONYEUAD55BM","short_pith_number":"pith:5TEIHJE2","canonical_record":{"source":{"id":"1908.07718","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2019-08-21T06:31:07Z","cross_cats_sorted":[],"title_canon_sha256":"4b4ab7757c8e55b966e6e6d9c4bf56ca16272bc20d027eaa64e3b7e73350a7d1","abstract_canon_sha256":"ad4cfb90bb3b3dc130af4d8a24af2beb00e02edaa592a72c4f940f7792d55e3e"},"schema_version":"1.0"},"canonical_sha256":"ecc883a49a7897e2ed4e6e09400fbd0b24d45c374b33a54b42f916d435cb86a6","source":{"kind":"arxiv","id":"1908.07718","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.07718","created_at":"2026-07-05T02:58:33Z"},{"alias_kind":"arxiv_version","alias_value":"1908.07718v4","created_at":"2026-07-05T02:58:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.07718","created_at":"2026-07-05T02:58:33Z"},{"alias_kind":"pith_short_12","alias_value":"5TEIHJE2PCL6","created_at":"2026-07-05T02:58:33Z"},{"alias_kind":"pith_short_16","alias_value":"5TEIHJE2PCL6F3KO","created_at":"2026-07-05T02:58:33Z"},{"alias_kind":"pith_short_8","alias_value":"5TEIHJE2","created_at":"2026-07-05T02:58:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:5TEIHJE2PCL6F3KONYEUAD55BM","target":"record","payload":{"canonical_record":{"source":{"id":"1908.07718","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2019-08-21T06:31:07Z","cross_cats_sorted":[],"title_canon_sha256":"4b4ab7757c8e55b966e6e6d9c4bf56ca16272bc20d027eaa64e3b7e73350a7d1","abstract_canon_sha256":"ad4cfb90bb3b3dc130af4d8a24af2beb00e02edaa592a72c4f940f7792d55e3e"},"schema_version":"1.0"},"canonical_sha256":"ecc883a49a7897e2ed4e6e09400fbd0b24d45c374b33a54b42f916d435cb86a6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:58:33.421394Z","signature_b64":"moYrP9CeQrkxhBCFDJ+KDQtmj2KnLqA9FgA6I+PrrUOleIlL2+VyaHOv6/Vx56SfVPE2tdWHi/3DegLxJIHlBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ecc883a49a7897e2ed4e6e09400fbd0b24d45c374b33a54b42f916d435cb86a6","last_reissued_at":"2026-07-05T02:58:33.420959Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:58:33.420959Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.07718","source_version":4,"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-05T02:58:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2CU3iZ/w4xyx2qxS/PAR283OMiehTCrmGcvw/uDeB0Qtfg0tYIhDafi5KkAybojFGVVIOdskMz6lFCAQAJJyAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T07:38:48.082394Z"},"content_sha256":"016d1ed6ebf9747d3ed602c179706896992fc3451ec180ab0fbcdc90da7650c5","schema_version":"1.0","event_id":"sha256:016d1ed6ebf9747d3ed602c179706896992fc3451ec180ab0fbcdc90da7650c5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:5TEIHJE2PCL6F3KONYEUAD55BM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On card guessing game with one time riffle shuffle and complete feedback","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Pengda Liu","submitted_at":"2019-08-21T06:31:07Z","abstract_excerpt":"This paper studies the game of guessing riffle-shuffled cards with complete feedback. A deck of $n$ cards labelled 1 to $n$ is riffle-shuffled once and placed on a table. A player tries to guess the cards from top and is given complete feedback after each guess. The goal is to find the guessing strategy with maximum reward (expected number of correct guesses). We give the optimal strategy for this game and prove that the maximum expected reward is $n/2+\\sqrt{2/\\pi}\\cdot\\sqrt{n}+O(1)$, partially solving an open problem of Bayer and Diaconis."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.07718","kind":"arxiv","version":4},"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/1908.07718/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-05T02:58:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W1Blt1bpCI/oi1CWd53cwOPCrvUHnexGR3jHXBHgGBd4yylp5+UwwUCXakn9gtHLbyD0IasU5dXlNLYCopnjDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T07:38:48.083386Z"},"content_sha256":"b94de6558ac10ff653fda0581dc77f64b4ebfcfd733a0e1f19d7f3f21a65c9c6","schema_version":"1.0","event_id":"sha256:b94de6558ac10ff653fda0581dc77f64b4ebfcfd733a0e1f19d7f3f21a65c9c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5TEIHJE2PCL6F3KONYEUAD55BM/bundle.json","state_url":"https://pith.science/pith/5TEIHJE2PCL6F3KONYEUAD55BM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5TEIHJE2PCL6F3KONYEUAD55BM/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-16T07:38:48Z","links":{"resolver":"https://pith.science/pith/5TEIHJE2PCL6F3KONYEUAD55BM","bundle":"https://pith.science/pith/5TEIHJE2PCL6F3KONYEUAD55BM/bundle.json","state":"https://pith.science/pith/5TEIHJE2PCL6F3KONYEUAD55BM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5TEIHJE2PCL6F3KONYEUAD55BM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:5TEIHJE2PCL6F3KONYEUAD55BM","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":"ad4cfb90bb3b3dc130af4d8a24af2beb00e02edaa592a72c4f940f7792d55e3e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2019-08-21T06:31:07Z","title_canon_sha256":"4b4ab7757c8e55b966e6e6d9c4bf56ca16272bc20d027eaa64e3b7e73350a7d1"},"schema_version":"1.0","source":{"id":"1908.07718","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.07718","created_at":"2026-07-05T02:58:33Z"},{"alias_kind":"arxiv_version","alias_value":"1908.07718v4","created_at":"2026-07-05T02:58:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.07718","created_at":"2026-07-05T02:58:33Z"},{"alias_kind":"pith_short_12","alias_value":"5TEIHJE2PCL6","created_at":"2026-07-05T02:58:33Z"},{"alias_kind":"pith_short_16","alias_value":"5TEIHJE2PCL6F3KO","created_at":"2026-07-05T02:58:33Z"},{"alias_kind":"pith_short_8","alias_value":"5TEIHJE2","created_at":"2026-07-05T02:58:33Z"}],"graph_snapshots":[{"event_id":"sha256:b94de6558ac10ff653fda0581dc77f64b4ebfcfd733a0e1f19d7f3f21a65c9c6","target":"graph","created_at":"2026-07-05T02:58:33Z","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/1908.07718/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper studies the game of guessing riffle-shuffled cards with complete feedback. A deck of $n$ cards labelled 1 to $n$ is riffle-shuffled once and placed on a table. A player tries to guess the cards from top and is given complete feedback after each guess. The goal is to find the guessing strategy with maximum reward (expected number of correct guesses). We give the optimal strategy for this game and prove that the maximum expected reward is $n/2+\\sqrt{2/\\pi}\\cdot\\sqrt{n}+O(1)$, partially solving an open problem of Bayer and Diaconis.","authors_text":"Pengda Liu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2019-08-21T06:31:07Z","title":"On card guessing game with one time riffle shuffle and complete feedback"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.07718","kind":"arxiv","version":4},"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:016d1ed6ebf9747d3ed602c179706896992fc3451ec180ab0fbcdc90da7650c5","target":"record","created_at":"2026-07-05T02:58:33Z","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":"ad4cfb90bb3b3dc130af4d8a24af2beb00e02edaa592a72c4f940f7792d55e3e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2019-08-21T06:31:07Z","title_canon_sha256":"4b4ab7757c8e55b966e6e6d9c4bf56ca16272bc20d027eaa64e3b7e73350a7d1"},"schema_version":"1.0","source":{"id":"1908.07718","kind":"arxiv","version":4}},"canonical_sha256":"ecc883a49a7897e2ed4e6e09400fbd0b24d45c374b33a54b42f916d435cb86a6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ecc883a49a7897e2ed4e6e09400fbd0b24d45c374b33a54b42f916d435cb86a6","first_computed_at":"2026-07-05T02:58:33.420959Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:58:33.420959Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"moYrP9CeQrkxhBCFDJ+KDQtmj2KnLqA9FgA6I+PrrUOleIlL2+VyaHOv6/Vx56SfVPE2tdWHi/3DegLxJIHlBw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:58:33.421394Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.07718","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:016d1ed6ebf9747d3ed602c179706896992fc3451ec180ab0fbcdc90da7650c5","sha256:b94de6558ac10ff653fda0581dc77f64b4ebfcfd733a0e1f19d7f3f21a65c9c6"],"state_sha256":"2fe2f946da1ac5da7ba1f497513c41ce8116c42061826a5bdb4daeb772248215"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n52PsdGzJHvLqNC++waph0vh8OgQueT39EFc3ASPuhSLpBML7uoVwapFXmEApKm1OyJCiOVkXxKF1RduNC6eCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T07:38:48.091002Z","bundle_sha256":"0d3ef203c29d187cda6c807fd4b83814d93954293e854df777385640b0e159f6"}}