{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:LZUUMFSIN6ZMROXX3OEWIEMTNK","short_pith_number":"pith:LZUUMFSI","canonical_record":{"source":{"id":"1812.00963","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-03T18:37:23Z","cross_cats_sorted":[],"title_canon_sha256":"10f461c0cc0db74aa45d1a723976da7ac633129ff424d0c6b6f2649a14c06c0c","abstract_canon_sha256":"7007f5799f2e08235a14d1377a48a5feff6128caeab9d51fe5069994b7fb3fb7"},"schema_version":"1.0"},"canonical_sha256":"5e694616486fb2c8baf7db896411936a9bd564bea61d2387f131f74fa283d5cc","source":{"kind":"arxiv","id":"1812.00963","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.00963","created_at":"2026-05-17T23:59:18Z"},{"alias_kind":"arxiv_version","alias_value":"1812.00963v1","created_at":"2026-05-17T23:59:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.00963","created_at":"2026-05-17T23:59:18Z"},{"alias_kind":"pith_short_12","alias_value":"LZUUMFSIN6ZM","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LZUUMFSIN6ZMROXX","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LZUUMFSI","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:LZUUMFSIN6ZMROXX3OEWIEMTNK","target":"record","payload":{"canonical_record":{"source":{"id":"1812.00963","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-03T18:37:23Z","cross_cats_sorted":[],"title_canon_sha256":"10f461c0cc0db74aa45d1a723976da7ac633129ff424d0c6b6f2649a14c06c0c","abstract_canon_sha256":"7007f5799f2e08235a14d1377a48a5feff6128caeab9d51fe5069994b7fb3fb7"},"schema_version":"1.0"},"canonical_sha256":"5e694616486fb2c8baf7db896411936a9bd564bea61d2387f131f74fa283d5cc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:18.524213Z","signature_b64":"2zrPhs2ta1T6MuAoksE88H7xsmdob+C3Q5GIRFxon7lNaypOah3GP9fFm3tWhsXzcI79YDfRoDc58VHsknysBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e694616486fb2c8baf7db896411936a9bd564bea61d2387f131f74fa283d5cc","last_reissued_at":"2026-05-17T23:59:18.523763Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:18.523763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.00963","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-17T23:59:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sKIei74OTmaOBc8+kCwOrPJi4yE9tmNyPOV/x3PKPc2bDyR1D1fnCY5P+7mZVhWp28WcznODyt89qLK29tLwAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T06:42:09.472620Z"},"content_sha256":"a4733373dad76e983e807953fd9ecd688d76f72970b5170f36f3aa0b18a16abe","schema_version":"1.0","event_id":"sha256:a4733373dad76e983e807953fd9ecd688d76f72970b5170f36f3aa0b18a16abe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:LZUUMFSIN6ZMROXX3OEWIEMTNK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Avoiding patterns and making the best choice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Brant Jones","submitted_at":"2018-12-03T18:37:23Z","abstract_excerpt":"We study a variation of the game of best choice (also known as the secretary problem or game of googol) under an additional assumption that the ranks of interview candidates are restricted using permutation pattern-avoidance. We develop some general machinery for investigating interview orderings with a non-uniform rank distribution, and give a complete description of the optimal strategies for the pattern-avoiding games under each of the size three permutations. The optimal strategy for the \"disappointment-free\" (i.e. 321-avoiding) interviews has a form that seems to be new, involving thresho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.00963","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-17T23:59:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2GT85zkPWJCFvQs1cnGEv+c/s9ZqEEdevRsAgss4+TFEDwEpCLp/moybHkyXNYpj0Fg9tUJvyYCfny2XPHdjCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T06:42:09.472968Z"},"content_sha256":"99c0a495463fafcc6cd73880dc5fa5fb65839776ba9f1b26f3d80e4838a8073e","schema_version":"1.0","event_id":"sha256:99c0a495463fafcc6cd73880dc5fa5fb65839776ba9f1b26f3d80e4838a8073e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LZUUMFSIN6ZMROXX3OEWIEMTNK/bundle.json","state_url":"https://pith.science/pith/LZUUMFSIN6ZMROXX3OEWIEMTNK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LZUUMFSIN6ZMROXX3OEWIEMTNK/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-24T06:42:09Z","links":{"resolver":"https://pith.science/pith/LZUUMFSIN6ZMROXX3OEWIEMTNK","bundle":"https://pith.science/pith/LZUUMFSIN6ZMROXX3OEWIEMTNK/bundle.json","state":"https://pith.science/pith/LZUUMFSIN6ZMROXX3OEWIEMTNK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LZUUMFSIN6ZMROXX3OEWIEMTNK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LZUUMFSIN6ZMROXX3OEWIEMTNK","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":"7007f5799f2e08235a14d1377a48a5feff6128caeab9d51fe5069994b7fb3fb7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-03T18:37:23Z","title_canon_sha256":"10f461c0cc0db74aa45d1a723976da7ac633129ff424d0c6b6f2649a14c06c0c"},"schema_version":"1.0","source":{"id":"1812.00963","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.00963","created_at":"2026-05-17T23:59:18Z"},{"alias_kind":"arxiv_version","alias_value":"1812.00963v1","created_at":"2026-05-17T23:59:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.00963","created_at":"2026-05-17T23:59:18Z"},{"alias_kind":"pith_short_12","alias_value":"LZUUMFSIN6ZM","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LZUUMFSIN6ZMROXX","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LZUUMFSI","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:99c0a495463fafcc6cd73880dc5fa5fb65839776ba9f1b26f3d80e4838a8073e","target":"graph","created_at":"2026-05-17T23:59:18Z","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 study a variation of the game of best choice (also known as the secretary problem or game of googol) under an additional assumption that the ranks of interview candidates are restricted using permutation pattern-avoidance. We develop some general machinery for investigating interview orderings with a non-uniform rank distribution, and give a complete description of the optimal strategies for the pattern-avoiding games under each of the size three permutations. The optimal strategy for the \"disappointment-free\" (i.e. 321-avoiding) interviews has a form that seems to be new, involving thresho","authors_text":"Brant Jones","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-03T18:37:23Z","title":"Avoiding patterns and making the best choice"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.00963","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:a4733373dad76e983e807953fd9ecd688d76f72970b5170f36f3aa0b18a16abe","target":"record","created_at":"2026-05-17T23:59:18Z","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":"7007f5799f2e08235a14d1377a48a5feff6128caeab9d51fe5069994b7fb3fb7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-03T18:37:23Z","title_canon_sha256":"10f461c0cc0db74aa45d1a723976da7ac633129ff424d0c6b6f2649a14c06c0c"},"schema_version":"1.0","source":{"id":"1812.00963","kind":"arxiv","version":1}},"canonical_sha256":"5e694616486fb2c8baf7db896411936a9bd564bea61d2387f131f74fa283d5cc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e694616486fb2c8baf7db896411936a9bd564bea61d2387f131f74fa283d5cc","first_computed_at":"2026-05-17T23:59:18.523763Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:18.523763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2zrPhs2ta1T6MuAoksE88H7xsmdob+C3Q5GIRFxon7lNaypOah3GP9fFm3tWhsXzcI79YDfRoDc58VHsknysBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:18.524213Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.00963","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a4733373dad76e983e807953fd9ecd688d76f72970b5170f36f3aa0b18a16abe","sha256:99c0a495463fafcc6cd73880dc5fa5fb65839776ba9f1b26f3d80e4838a8073e"],"state_sha256":"6b8d28ca814d474f84b39c2dc43e281cb8ccb9ab0092608bdfe0f350f6aece8c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ghyi8NVMkfA93OwVN7yaxuOa7M5ItYL7/wHBhllk54YSN//wpvvUP8TZC1NA4S5Yu6mJ3QYPGVV42S/rpjLhCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T06:42:09.475032Z","bundle_sha256":"6ea55a544b45aa04665bc76abd29f1e430be28655694eafa3f87777274a5c6b6"}}