{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:IEVQIYLTGTPYPBTRVAGIACF4AM","short_pith_number":"pith:IEVQIYLT","canonical_record":{"source":{"id":"1208.4854","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-08-23T20:04:51Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d4b262c34ea601901cbdf406d991d9cee1cbb4e3d54c641df8b5170c9b4f2c67","abstract_canon_sha256":"a2120d91720b976595cfc3c182e8bf74d1294050b70f822e819c8fc07772cdd2"},"schema_version":"1.0"},"canonical_sha256":"412b04617334df878671a80c8008bc031e1688c55bdce5c2536d1c8e4fb42ed0","source":{"kind":"arxiv","id":"1208.4854","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.4854","created_at":"2026-05-18T03:47:52Z"},{"alias_kind":"arxiv_version","alias_value":"1208.4854v1","created_at":"2026-05-18T03:47:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.4854","created_at":"2026-05-18T03:47:52Z"},{"alias_kind":"pith_short_12","alias_value":"IEVQIYLTGTPY","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"IEVQIYLTGTPYPBTR","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"IEVQIYLT","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:IEVQIYLTGTPYPBTRVAGIACF4AM","target":"record","payload":{"canonical_record":{"source":{"id":"1208.4854","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-08-23T20:04:51Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d4b262c34ea601901cbdf406d991d9cee1cbb4e3d54c641df8b5170c9b4f2c67","abstract_canon_sha256":"a2120d91720b976595cfc3c182e8bf74d1294050b70f822e819c8fc07772cdd2"},"schema_version":"1.0"},"canonical_sha256":"412b04617334df878671a80c8008bc031e1688c55bdce5c2536d1c8e4fb42ed0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:47:52.378137Z","signature_b64":"aDynDnhCJxvFKXsc6/3axbPrec3SHAJCp7uQKN/mXBT7hAjTtHzU094EtzasYBrfETgRIBaP6h+wdZQDc+UpAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"412b04617334df878671a80c8008bc031e1688c55bdce5c2536d1c8e4fb42ed0","last_reissued_at":"2026-05-18T03:47:52.377680Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:47:52.377680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.4854","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-05-18T03:47:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/3s3+nWBeilLDo4rrVHxiZVsB5+b209xUbfTb+BOXYp7cY1xW/C/XvMBfGE9GPWJMq74NPlTsJlj9Jiam2uhCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T00:12:20.924637Z"},"content_sha256":"4457e19cf8f66d886a6c7a36ec0febec77e62ae57f7bdb84decf0626334efb58","schema_version":"1.0","event_id":"sha256:4457e19cf8f66d886a6c7a36ec0febec77e62ae57f7bdb84decf0626334efb58"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:IEVQIYLTGTPYPBTRVAGIACF4AM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Matching expectations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Daniel J. Velleman, Gregory S. Warrington","submitted_at":"2012-08-23T20:04:51Z","abstract_excerpt":"The game of memory is played with a deck of n pairs of cards. The cards in each pair are identical. The deck is shuffled and the cards laid face down. A move consists of flipping over first one card then another. The cards are removed from play if they match. Otherwise, they are flipped back over and the next move commences. A game ends when all pairs have been matched. We determine that, when the game is played optimally, as n tends to infinity: 1) The expected number of moves is (3 - 2 ln 2)n + 7/8 - 2 ln 2 (approximately 1.61 n), 2) The expected number of times two matching cards are unwitt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.4854","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":""},"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-18T03:47:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"35YJI4YnWDMUsJ8Z00nwqttwC3NjKry0FZgmptoA+JUBoajcBGwnwNQsOjqVf/e4WQNJE2G2YFpAmSh9scwHAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T00:12:20.924991Z"},"content_sha256":"54c4c8e485957b265f887203f52173d7f032ca569e4bcfce5d2ef2f2798f855c","schema_version":"1.0","event_id":"sha256:54c4c8e485957b265f887203f52173d7f032ca569e4bcfce5d2ef2f2798f855c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IEVQIYLTGTPYPBTRVAGIACF4AM/bundle.json","state_url":"https://pith.science/pith/IEVQIYLTGTPYPBTRVAGIACF4AM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IEVQIYLTGTPYPBTRVAGIACF4AM/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-26T00:12:20Z","links":{"resolver":"https://pith.science/pith/IEVQIYLTGTPYPBTRVAGIACF4AM","bundle":"https://pith.science/pith/IEVQIYLTGTPYPBTRVAGIACF4AM/bundle.json","state":"https://pith.science/pith/IEVQIYLTGTPYPBTRVAGIACF4AM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IEVQIYLTGTPYPBTRVAGIACF4AM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:IEVQIYLTGTPYPBTRVAGIACF4AM","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":"a2120d91720b976595cfc3c182e8bf74d1294050b70f822e819c8fc07772cdd2","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-08-23T20:04:51Z","title_canon_sha256":"d4b262c34ea601901cbdf406d991d9cee1cbb4e3d54c641df8b5170c9b4f2c67"},"schema_version":"1.0","source":{"id":"1208.4854","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.4854","created_at":"2026-05-18T03:47:52Z"},{"alias_kind":"arxiv_version","alias_value":"1208.4854v1","created_at":"2026-05-18T03:47:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.4854","created_at":"2026-05-18T03:47:52Z"},{"alias_kind":"pith_short_12","alias_value":"IEVQIYLTGTPY","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"IEVQIYLTGTPYPBTR","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"IEVQIYLT","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:54c4c8e485957b265f887203f52173d7f032ca569e4bcfce5d2ef2f2798f855c","target":"graph","created_at":"2026-05-18T03:47:52Z","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 game of memory is played with a deck of n pairs of cards. The cards in each pair are identical. The deck is shuffled and the cards laid face down. A move consists of flipping over first one card then another. The cards are removed from play if they match. Otherwise, they are flipped back over and the next move commences. A game ends when all pairs have been matched. We determine that, when the game is played optimally, as n tends to infinity: 1) The expected number of moves is (3 - 2 ln 2)n + 7/8 - 2 ln 2 (approximately 1.61 n), 2) The expected number of times two matching cards are unwitt","authors_text":"Daniel J. Velleman, Gregory S. Warrington","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-08-23T20:04:51Z","title":"Matching expectations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.4854","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:4457e19cf8f66d886a6c7a36ec0febec77e62ae57f7bdb84decf0626334efb58","target":"record","created_at":"2026-05-18T03:47:52Z","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":"a2120d91720b976595cfc3c182e8bf74d1294050b70f822e819c8fc07772cdd2","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-08-23T20:04:51Z","title_canon_sha256":"d4b262c34ea601901cbdf406d991d9cee1cbb4e3d54c641df8b5170c9b4f2c67"},"schema_version":"1.0","source":{"id":"1208.4854","kind":"arxiv","version":1}},"canonical_sha256":"412b04617334df878671a80c8008bc031e1688c55bdce5c2536d1c8e4fb42ed0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"412b04617334df878671a80c8008bc031e1688c55bdce5c2536d1c8e4fb42ed0","first_computed_at":"2026-05-18T03:47:52.377680Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:47:52.377680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aDynDnhCJxvFKXsc6/3axbPrec3SHAJCp7uQKN/mXBT7hAjTtHzU094EtzasYBrfETgRIBaP6h+wdZQDc+UpAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:47:52.378137Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.4854","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4457e19cf8f66d886a6c7a36ec0febec77e62ae57f7bdb84decf0626334efb58","sha256:54c4c8e485957b265f887203f52173d7f032ca569e4bcfce5d2ef2f2798f855c"],"state_sha256":"eb5db98f18d31edf55c6871b5a96f07741c21595c1cb673eede98fefed98368a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kOVcNR62rTydWA7l5xL+HQp1oB66XmzQrr39AUqATFdscMnq7pum/3czPhGj0u9a7SKrf/8P/lMQ4RqiV7BLAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T00:12:20.927027Z","bundle_sha256":"0ed6f84e0661ffe48ee680529c5b8802e628ac095d5b47e28685de3303b271ab"}}