{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:HHANL365V2OFFYCXXGEC3P7JJ5","short_pith_number":"pith:HHANL365","canonical_record":{"source":{"id":"1806.07838","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-06-20T16:41:19Z","cross_cats_sorted":[],"title_canon_sha256":"23e8123bf3039b3b0496f36e497a01eb8e3ecf7f5f11fc971ef1c026be2794ca","abstract_canon_sha256":"6a9eee49b8b776e5b80594242d33f838b621d972a605dbf895eeb6c76a6149e0"},"schema_version":"1.0"},"canonical_sha256":"39c0d5efddae9c52e057b9882dbfe94f5a90912a6ab4c43da37959cb93351317","source":{"kind":"arxiv","id":"1806.07838","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.07838","created_at":"2026-05-18T00:12:46Z"},{"alias_kind":"arxiv_version","alias_value":"1806.07838v1","created_at":"2026-05-18T00:12:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.07838","created_at":"2026-05-18T00:12:46Z"},{"alias_kind":"pith_short_12","alias_value":"HHANL365V2OF","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HHANL365V2OFFYCX","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HHANL365","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:HHANL365V2OFFYCXXGEC3P7JJ5","target":"record","payload":{"canonical_record":{"source":{"id":"1806.07838","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-06-20T16:41:19Z","cross_cats_sorted":[],"title_canon_sha256":"23e8123bf3039b3b0496f36e497a01eb8e3ecf7f5f11fc971ef1c026be2794ca","abstract_canon_sha256":"6a9eee49b8b776e5b80594242d33f838b621d972a605dbf895eeb6c76a6149e0"},"schema_version":"1.0"},"canonical_sha256":"39c0d5efddae9c52e057b9882dbfe94f5a90912a6ab4c43da37959cb93351317","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:46.493349Z","signature_b64":"CkJJHIwr7Z4MSH+nDwYvYubhJvQ44eoffKntklqEYAnHZigSINfda4jhn1ToV1PJpL4lqKb8TrSXoQKavXf1Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39c0d5efddae9c52e057b9882dbfe94f5a90912a6ab4c43da37959cb93351317","last_reissued_at":"2026-05-18T00:12:46.492773Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:46.492773Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.07838","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-18T00:12:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hgxl8bxg5YfupystpP7nO73iXmQZPModyyRbGBLGHwFze+Jb8ZhE/TkYPvFYUgQ6EplnhGkB0FvrdhUewQFaDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T23:22:57.560462Z"},"content_sha256":"e4861751ba626a33a8b12e2bec09e44f9fef1108df91547d125c231362a6eb68","schema_version":"1.0","event_id":"sha256:e4861751ba626a33a8b12e2bec09e44f9fef1108df91547d125c231362a6eb68"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:HHANL365V2OFFYCXXGEC3P7JJ5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimax functions on Galton-Watson trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"James B. Martin, Roman Stasi\\'nski","submitted_at":"2018-06-20T16:41:19Z","abstract_excerpt":"We consider the behaviour of minimax recursions defined on random trees. Such recursions give the value of a general class of two-player combinatorial games. We examine in particular the case where the tree is given by a Galton-Watson branching process, truncated at some depth $2n$, and the terminal values of the level-$2n$ nodes are drawn independently from some common distribution. The case of a regular tree was previously considered by Pearl, who showed that as $n\\to\\infty$ the value of the game converges to a constant, and by Ali Khan, Devroye and Neininger, who obtained a distributional l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.07838","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-18T00:12:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Aiksx6IBjeXWqoVvOukpqgHln6HNZU1Fb0hZR11wFu2vJnDY4qNZbn4pTXimIMHbwIOMiPucJuRk+rk0vEnDDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T23:22:57.560810Z"},"content_sha256":"1a41e88c8d09d932817aa7fbafb52375ba3046708d98862209650bbabbb36c62","schema_version":"1.0","event_id":"sha256:1a41e88c8d09d932817aa7fbafb52375ba3046708d98862209650bbabbb36c62"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HHANL365V2OFFYCXXGEC3P7JJ5/bundle.json","state_url":"https://pith.science/pith/HHANL365V2OFFYCXXGEC3P7JJ5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HHANL365V2OFFYCXXGEC3P7JJ5/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-25T23:22:57Z","links":{"resolver":"https://pith.science/pith/HHANL365V2OFFYCXXGEC3P7JJ5","bundle":"https://pith.science/pith/HHANL365V2OFFYCXXGEC3P7JJ5/bundle.json","state":"https://pith.science/pith/HHANL365V2OFFYCXXGEC3P7JJ5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HHANL365V2OFFYCXXGEC3P7JJ5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:HHANL365V2OFFYCXXGEC3P7JJ5","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":"6a9eee49b8b776e5b80594242d33f838b621d972a605dbf895eeb6c76a6149e0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-06-20T16:41:19Z","title_canon_sha256":"23e8123bf3039b3b0496f36e497a01eb8e3ecf7f5f11fc971ef1c026be2794ca"},"schema_version":"1.0","source":{"id":"1806.07838","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.07838","created_at":"2026-05-18T00:12:46Z"},{"alias_kind":"arxiv_version","alias_value":"1806.07838v1","created_at":"2026-05-18T00:12:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.07838","created_at":"2026-05-18T00:12:46Z"},{"alias_kind":"pith_short_12","alias_value":"HHANL365V2OF","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HHANL365V2OFFYCX","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HHANL365","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:1a41e88c8d09d932817aa7fbafb52375ba3046708d98862209650bbabbb36c62","target":"graph","created_at":"2026-05-18T00:12:46Z","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":"We consider the behaviour of minimax recursions defined on random trees. Such recursions give the value of a general class of two-player combinatorial games. We examine in particular the case where the tree is given by a Galton-Watson branching process, truncated at some depth $2n$, and the terminal values of the level-$2n$ nodes are drawn independently from some common distribution. The case of a regular tree was previously considered by Pearl, who showed that as $n\\to\\infty$ the value of the game converges to a constant, and by Ali Khan, Devroye and Neininger, who obtained a distributional l","authors_text":"James B. Martin, Roman Stasi\\'nski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-06-20T16:41:19Z","title":"Minimax functions on Galton-Watson trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.07838","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:e4861751ba626a33a8b12e2bec09e44f9fef1108df91547d125c231362a6eb68","target":"record","created_at":"2026-05-18T00:12:46Z","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":"6a9eee49b8b776e5b80594242d33f838b621d972a605dbf895eeb6c76a6149e0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-06-20T16:41:19Z","title_canon_sha256":"23e8123bf3039b3b0496f36e497a01eb8e3ecf7f5f11fc971ef1c026be2794ca"},"schema_version":"1.0","source":{"id":"1806.07838","kind":"arxiv","version":1}},"canonical_sha256":"39c0d5efddae9c52e057b9882dbfe94f5a90912a6ab4c43da37959cb93351317","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"39c0d5efddae9c52e057b9882dbfe94f5a90912a6ab4c43da37959cb93351317","first_computed_at":"2026-05-18T00:12:46.492773Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:46.492773Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CkJJHIwr7Z4MSH+nDwYvYubhJvQ44eoffKntklqEYAnHZigSINfda4jhn1ToV1PJpL4lqKb8TrSXoQKavXf1Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:46.493349Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.07838","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e4861751ba626a33a8b12e2bec09e44f9fef1108df91547d125c231362a6eb68","sha256:1a41e88c8d09d932817aa7fbafb52375ba3046708d98862209650bbabbb36c62"],"state_sha256":"d87c2a66cfa275a0e62f5217805c994762dcaee6e32d93744ddb0a4b7844b445"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kn0U2624gOhimB9fyCULp38PQsdtuizyUbLA7mHAPRjIgDWm0ZrBJFws/AmuKicSpf6zqx00ks1h01/bA05cDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T23:22:57.562870Z","bundle_sha256":"a389f3e7be3112275491af921dc2016b099f9470526f7aa5fb95745cc327ea02"}}