{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:IYKCRMGOXSC2AW5RBJUI53YTIT","short_pith_number":"pith:IYKCRMGO","canonical_record":{"source":{"id":"1808.06707","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-08-20T22:05:56Z","cross_cats_sorted":[],"title_canon_sha256":"b206f36f8a590829096e77f9de98bd0f26b7eb318319c002b5427047d2d18101","abstract_canon_sha256":"1b5ccf50ff4ab909c1f6778e7dc515ccc4123d8369bbc37c06a8824d2f503863"},"schema_version":"1.0"},"canonical_sha256":"461428b0cebc85a05bb10a688eef1344da8807ac1b375697f6dad227f388bf45","source":{"kind":"arxiv","id":"1808.06707","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.06707","created_at":"2026-05-18T00:07:39Z"},{"alias_kind":"arxiv_version","alias_value":"1808.06707v1","created_at":"2026-05-18T00:07:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.06707","created_at":"2026-05-18T00:07:39Z"},{"alias_kind":"pith_short_12","alias_value":"IYKCRMGOXSC2","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IYKCRMGOXSC2AW5R","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IYKCRMGO","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:IYKCRMGOXSC2AW5RBJUI53YTIT","target":"record","payload":{"canonical_record":{"source":{"id":"1808.06707","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-08-20T22:05:56Z","cross_cats_sorted":[],"title_canon_sha256":"b206f36f8a590829096e77f9de98bd0f26b7eb318319c002b5427047d2d18101","abstract_canon_sha256":"1b5ccf50ff4ab909c1f6778e7dc515ccc4123d8369bbc37c06a8824d2f503863"},"schema_version":"1.0"},"canonical_sha256":"461428b0cebc85a05bb10a688eef1344da8807ac1b375697f6dad227f388bf45","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:39.326402Z","signature_b64":"KYjfIWpnRcHougdAYZo63N2M0z9MXKjS/xE7DGB1mHCVoxUALdyn8gWNxedaElE3VmDEwRCbJPZZONhj4RYhCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"461428b0cebc85a05bb10a688eef1344da8807ac1b375697f6dad227f388bf45","last_reissued_at":"2026-05-18T00:07:39.325669Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:39.325669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.06707","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:07:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H1etdHKb2BF+9la2eq6eOZ2jhlh+spatZcGNhCozRKdckoeykQg//hjjlGqKHCnPx+1DsVQr0xxtu7btVon2Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T19:47:22.635663Z"},"content_sha256":"4c27c23740564001350e0016a96919c369d629f4a6904e52a99942e490017a92","schema_version":"1.0","event_id":"sha256:4c27c23740564001350e0016a96919c369d629f4a6904e52a99942e490017a92"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:IYKCRMGOXSC2AW5RBJUI53YTIT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A non-iterative algorithm for generalized Pig games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Ernesto Mordecki, Fabi\\'an Crocce","submitted_at":"2018-08-20T22:05:56Z","abstract_excerpt":"We provide a polynomial algorithm to find the value and an optimal strategy for a generalization of the Pig game. Modeled as a competitive Markov decision process, the corresponding Bellman equations can be decoupled leading to systems of two non-linear equations with two unknowns. In this way we avoid the classical iterative approaches. A simple complexity analysis reveals that the algorithm requires O(s log(s)) steps, where s is the number of states of the game. The classical Pig and the Piglet (a simple variant of the Pig played with a coin) are examined in detail."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.06707","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:07:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hyYfqvdqLG+8S/2yY9nGsmHmkT5DiUVTVI84sQSI3luuy+HoaleNkW4kSzUxww22ah8mBVynf3rIJpAclGakAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T19:47:22.636025Z"},"content_sha256":"32daf1de75885e19cd56a1d4095f1a4aabc83673479a7408b0a0ab1577bc6bb2","schema_version":"1.0","event_id":"sha256:32daf1de75885e19cd56a1d4095f1a4aabc83673479a7408b0a0ab1577bc6bb2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IYKCRMGOXSC2AW5RBJUI53YTIT/bundle.json","state_url":"https://pith.science/pith/IYKCRMGOXSC2AW5RBJUI53YTIT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IYKCRMGOXSC2AW5RBJUI53YTIT/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-20T19:47:22Z","links":{"resolver":"https://pith.science/pith/IYKCRMGOXSC2AW5RBJUI53YTIT","bundle":"https://pith.science/pith/IYKCRMGOXSC2AW5RBJUI53YTIT/bundle.json","state":"https://pith.science/pith/IYKCRMGOXSC2AW5RBJUI53YTIT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IYKCRMGOXSC2AW5RBJUI53YTIT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:IYKCRMGOXSC2AW5RBJUI53YTIT","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":"1b5ccf50ff4ab909c1f6778e7dc515ccc4123d8369bbc37c06a8824d2f503863","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-08-20T22:05:56Z","title_canon_sha256":"b206f36f8a590829096e77f9de98bd0f26b7eb318319c002b5427047d2d18101"},"schema_version":"1.0","source":{"id":"1808.06707","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.06707","created_at":"2026-05-18T00:07:39Z"},{"alias_kind":"arxiv_version","alias_value":"1808.06707v1","created_at":"2026-05-18T00:07:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.06707","created_at":"2026-05-18T00:07:39Z"},{"alias_kind":"pith_short_12","alias_value":"IYKCRMGOXSC2","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IYKCRMGOXSC2AW5R","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IYKCRMGO","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:32daf1de75885e19cd56a1d4095f1a4aabc83673479a7408b0a0ab1577bc6bb2","target":"graph","created_at":"2026-05-18T00:07:39Z","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 provide a polynomial algorithm to find the value and an optimal strategy for a generalization of the Pig game. Modeled as a competitive Markov decision process, the corresponding Bellman equations can be decoupled leading to systems of two non-linear equations with two unknowns. In this way we avoid the classical iterative approaches. A simple complexity analysis reveals that the algorithm requires O(s log(s)) steps, where s is the number of states of the game. The classical Pig and the Piglet (a simple variant of the Pig played with a coin) are examined in detail.","authors_text":"Ernesto Mordecki, Fabi\\'an Crocce","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-08-20T22:05:56Z","title":"A non-iterative algorithm for generalized Pig games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.06707","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:4c27c23740564001350e0016a96919c369d629f4a6904e52a99942e490017a92","target":"record","created_at":"2026-05-18T00:07:39Z","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":"1b5ccf50ff4ab909c1f6778e7dc515ccc4123d8369bbc37c06a8824d2f503863","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-08-20T22:05:56Z","title_canon_sha256":"b206f36f8a590829096e77f9de98bd0f26b7eb318319c002b5427047d2d18101"},"schema_version":"1.0","source":{"id":"1808.06707","kind":"arxiv","version":1}},"canonical_sha256":"461428b0cebc85a05bb10a688eef1344da8807ac1b375697f6dad227f388bf45","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"461428b0cebc85a05bb10a688eef1344da8807ac1b375697f6dad227f388bf45","first_computed_at":"2026-05-18T00:07:39.325669Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:39.325669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KYjfIWpnRcHougdAYZo63N2M0z9MXKjS/xE7DGB1mHCVoxUALdyn8gWNxedaElE3VmDEwRCbJPZZONhj4RYhCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:39.326402Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.06707","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4c27c23740564001350e0016a96919c369d629f4a6904e52a99942e490017a92","sha256:32daf1de75885e19cd56a1d4095f1a4aabc83673479a7408b0a0ab1577bc6bb2"],"state_sha256":"ba587f88c1ba389b8746b9af387c8c3c6445c26c134ad9297ec88cd5031ae13d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CWNLnh5tMyPVB4oYQqoNUen0MajaLefRCQZ1o5JgPiLkBSGPx+hUbp5CXSXx9gfHSJfI/d6cRr3FWexKxYj/Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T19:47:22.638005Z","bundle_sha256":"e740186ec40e35100961e020907e77d38bf59a6e9c43933ca38050e5b269df9f"}}