{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:SEA66DAC6XNP4ADTIUVLICALPY","short_pith_number":"pith:SEA66DAC","canonical_record":{"source":{"id":"2404.06585","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-04-09T19:26:25Z","cross_cats_sorted":[],"title_canon_sha256":"4ef72a1cd92670c4a03bd38c869bdcef762e08fb4a90cf9b70cde357d788c7f5","abstract_canon_sha256":"e4034d2f7f119f5fb7ff32f809937dad22b610694aa7029923064711b8378bcb"},"schema_version":"1.0"},"canonical_sha256":"9101ef0c02f5dafe0073452ab4080b7e06eca18e4c2d68a648c997820ccf0666","source":{"kind":"arxiv","id":"2404.06585","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.06585","created_at":"2026-07-07T03:18:45Z"},{"alias_kind":"arxiv_version","alias_value":"2404.06585v4","created_at":"2026-07-07T03:18:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.06585","created_at":"2026-07-07T03:18:45Z"},{"alias_kind":"pith_short_12","alias_value":"SEA66DAC6XNP","created_at":"2026-07-07T03:18:45Z"},{"alias_kind":"pith_short_16","alias_value":"SEA66DAC6XNP4ADT","created_at":"2026-07-07T03:18:45Z"},{"alias_kind":"pith_short_8","alias_value":"SEA66DAC","created_at":"2026-07-07T03:18:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:SEA66DAC6XNP4ADTIUVLICALPY","target":"record","payload":{"canonical_record":{"source":{"id":"2404.06585","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-04-09T19:26:25Z","cross_cats_sorted":[],"title_canon_sha256":"4ef72a1cd92670c4a03bd38c869bdcef762e08fb4a90cf9b70cde357d788c7f5","abstract_canon_sha256":"e4034d2f7f119f5fb7ff32f809937dad22b610694aa7029923064711b8378bcb"},"schema_version":"1.0"},"canonical_sha256":"9101ef0c02f5dafe0073452ab4080b7e06eca18e4c2d68a648c997820ccf0666","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-07T03:18:45.427536Z","signature_b64":"8pbvtd34uUuhkNlwLbz+StusRF9573nLOLHHjlBnb3HbUD9LN3RDIfXOhJICxF4817N1SDer5N9VLnmU+KTEDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9101ef0c02f5dafe0073452ab4080b7e06eca18e4c2d68a648c997820ccf0666","last_reissued_at":"2026-07-07T03:18:45.426981Z","signature_status":"signed_v1","first_computed_at":"2026-07-07T03:18:45.426981Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2404.06585","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-07T03:18:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JhudjlP2BCBlerG8ZCT2AuXiPeZXzU5ZEXDVxTf+euYWzydUgI/Gtmuw4ZANUc4+uJk/+NjcsM8kCi4ZGggTDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T10:30:09.517612Z"},"content_sha256":"b11831336fee0964f2038c3acd8885b68ad1240ce11d9be68989700f663480b3","schema_version":"1.0","event_id":"sha256:b11831336fee0964f2038c3acd8885b68ad1240ce11d9be68989700f663480b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:SEA66DAC6XNP4ADTIUVLICALPY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Penney's game for permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Penney's game on permutations of length 3 is non-transitive, with explicit winning probabilities for every pair.","cross_cats":[],"primary_cat":"math.CO","authors_text":"Sergi Elizalde, Yixin Lin","submitted_at":"2024-04-09T19:26:25Z","abstract_excerpt":"We consider the permutation analogue of Penney's game for words. Two players, in order, each choose a permutation of length $k\\ge3$; then a sequence of independent random values from a continuous distribution is generated, until the relative order of the last $k$ numbers coincides with one of the chosen permutations, making that player the winner.\n  We compute the winning probabilities for all pairs of permutations of length 3 and some pairs of length 4, showing that, as in the original version for words, the game is non-transitive. Our proofs introduce new bijections for consecutive patterns "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We compute the winning probabilities for all pairs of permutations of length 3 and some pairs of length 4, showing that, as in the original version for words, the game is non-transitive.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The input sequence consists of independent random values from a continuous distribution, so that every consecutive block of k values is equally likely to realize any of the k! possible relative orders.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Computes winning probabilities for all pairs of length-3 permutations and some length-4 pairs in the permutation analogue of Penney's game, proves non-transitivity, and introduces bijections for consecutive patterns.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Penney's game on permutations of length 3 is non-transitive, with explicit winning probabilities for every pair.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"8d466df4f93792831d0ad460ce51820f21359a5060744f516b619d4d38f67f99"},"source":{"id":"2404.06585","kind":"arxiv","version":4},"verdict":{"id":"dc3867ae-361e-48cb-b352-04227792695f","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-24T01:51:09.535486Z","strongest_claim":"We compute the winning probabilities for all pairs of permutations of length 3 and some pairs of length 4, showing that, as in the original version for words, the game is non-transitive.","one_line_summary":"Computes winning probabilities for all pairs of length-3 permutations and some length-4 pairs in the permutation analogue of Penney's game, proves non-transitivity, and introduces bijections for consecutive patterns.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The input sequence consists of independent random values from a continuous distribution, so that every consecutive block of k values is equally likely to realize any of the k! possible relative orders.","pith_extraction_headline":"Penney's game on permutations of length 3 is non-transitive, with explicit winning probabilities for every pair."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2404.06585/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":"dc3867ae-361e-48cb-b352-04227792695f"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-07T03:18:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y521mXEXphJ9doSBh4oTQ3dXeBRhPihLhMDPU671LpF1u22o7N+hyuUrl1YMSANnJP8d0PzoVBfsOvjziJ79DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T10:30:09.522213Z"},"content_sha256":"7b5c368b272787b417b20bd908f446ad3654dfe436d4b02c78741b35d3462501","schema_version":"1.0","event_id":"sha256:7b5c368b272787b417b20bd908f446ad3654dfe436d4b02c78741b35d3462501"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SEA66DAC6XNP4ADTIUVLICALPY/bundle.json","state_url":"https://pith.science/pith/SEA66DAC6XNP4ADTIUVLICALPY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SEA66DAC6XNP4ADTIUVLICALPY/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-06T10:30:09Z","links":{"resolver":"https://pith.science/pith/SEA66DAC6XNP4ADTIUVLICALPY","bundle":"https://pith.science/pith/SEA66DAC6XNP4ADTIUVLICALPY/bundle.json","state":"https://pith.science/pith/SEA66DAC6XNP4ADTIUVLICALPY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SEA66DAC6XNP4ADTIUVLICALPY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:SEA66DAC6XNP4ADTIUVLICALPY","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":"e4034d2f7f119f5fb7ff32f809937dad22b610694aa7029923064711b8378bcb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-04-09T19:26:25Z","title_canon_sha256":"4ef72a1cd92670c4a03bd38c869bdcef762e08fb4a90cf9b70cde357d788c7f5"},"schema_version":"1.0","source":{"id":"2404.06585","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.06585","created_at":"2026-07-07T03:18:45Z"},{"alias_kind":"arxiv_version","alias_value":"2404.06585v4","created_at":"2026-07-07T03:18:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.06585","created_at":"2026-07-07T03:18:45Z"},{"alias_kind":"pith_short_12","alias_value":"SEA66DAC6XNP","created_at":"2026-07-07T03:18:45Z"},{"alias_kind":"pith_short_16","alias_value":"SEA66DAC6XNP4ADT","created_at":"2026-07-07T03:18:45Z"},{"alias_kind":"pith_short_8","alias_value":"SEA66DAC","created_at":"2026-07-07T03:18:45Z"}],"graph_snapshots":[{"event_id":"sha256:7b5c368b272787b417b20bd908f446ad3654dfe436d4b02c78741b35d3462501","target":"graph","created_at":"2026-07-07T03:18:45Z","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 compute the winning probabilities for all pairs of permutations of length 3 and some pairs of length 4, showing that, as in the original version for words, the game is non-transitive."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The input sequence consists of independent random values from a continuous distribution, so that every consecutive block of k values is equally likely to realize any of the k! possible relative orders."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Computes winning probabilities for all pairs of length-3 permutations and some length-4 pairs in the permutation analogue of Penney's game, proves non-transitivity, and introduces bijections for consecutive patterns."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Penney's game on permutations of length 3 is non-transitive, with explicit winning probabilities for every pair."}],"snapshot_sha256":"8d466df4f93792831d0ad460ce51820f21359a5060744f516b619d4d38f67f99"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2404.06585/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the permutation analogue of Penney's game for words. Two players, in order, each choose a permutation of length $k\\ge3$; then a sequence of independent random values from a continuous distribution is generated, until the relative order of the last $k$ numbers coincides with one of the chosen permutations, making that player the winner.\n  We compute the winning probabilities for all pairs of permutations of length 3 and some pairs of length 4, showing that, as in the original version for words, the game is non-transitive. Our proofs introduce new bijections for consecutive patterns ","authors_text":"Sergi Elizalde, Yixin Lin","cross_cats":[],"headline":"Penney's game on permutations of length 3 is non-transitive, with explicit winning probabilities for every pair.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-04-09T19:26:25Z","title":"Penney's game for permutations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.06585","kind":"arxiv","version":4},"verdict":{"created_at":"2026-05-24T01:51:09.535486Z","id":"dc3867ae-361e-48cb-b352-04227792695f","model_set":{"reader":"grok-4.3"},"one_line_summary":"Computes winning probabilities for all pairs of length-3 permutations and some length-4 pairs in the permutation analogue of Penney's game, proves non-transitivity, and introduces bijections for consecutive patterns.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Penney's game on permutations of length 3 is non-transitive, with explicit winning probabilities for every pair.","strongest_claim":"We compute the winning probabilities for all pairs of permutations of length 3 and some pairs of length 4, showing that, as in the original version for words, the game is non-transitive.","weakest_assumption":"The input sequence consists of independent random values from a continuous distribution, so that every consecutive block of k values is equally likely to realize any of the k! possible relative orders."}},"verdict_id":"dc3867ae-361e-48cb-b352-04227792695f"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b11831336fee0964f2038c3acd8885b68ad1240ce11d9be68989700f663480b3","target":"record","created_at":"2026-07-07T03:18:45Z","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":"e4034d2f7f119f5fb7ff32f809937dad22b610694aa7029923064711b8378bcb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-04-09T19:26:25Z","title_canon_sha256":"4ef72a1cd92670c4a03bd38c869bdcef762e08fb4a90cf9b70cde357d788c7f5"},"schema_version":"1.0","source":{"id":"2404.06585","kind":"arxiv","version":4}},"canonical_sha256":"9101ef0c02f5dafe0073452ab4080b7e06eca18e4c2d68a648c997820ccf0666","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9101ef0c02f5dafe0073452ab4080b7e06eca18e4c2d68a648c997820ccf0666","first_computed_at":"2026-07-07T03:18:45.426981Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-07T03:18:45.426981Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8pbvtd34uUuhkNlwLbz+StusRF9573nLOLHHjlBnb3HbUD9LN3RDIfXOhJICxF4817N1SDer5N9VLnmU+KTEDg==","signature_status":"signed_v1","signed_at":"2026-07-07T03:18:45.427536Z","signed_message":"canonical_sha256_bytes"},"source_id":"2404.06585","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b11831336fee0964f2038c3acd8885b68ad1240ce11d9be68989700f663480b3","sha256:7b5c368b272787b417b20bd908f446ad3654dfe436d4b02c78741b35d3462501"],"state_sha256":"97de6cd28015fde58098f79abef6c289f9a796f302422e20f900ccb05b88bf1e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HWlPBzBQn0PiDAetKXhhZ+ItnW16rF64Qcze8jYJlWFqtvg71RpMkG6Mo7b3InjyQrb8mNTQi5P4uHqrVWUoDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T10:30:09.528111Z","bundle_sha256":"563c2eccaff73c8f58cf84ad957d4a8c97a84311eefc7cb8d4151de5e1195fb3"}}