{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:E56FPLE7TYX3M3KKW2KLMMZYPE","short_pith_number":"pith:E56FPLE7","canonical_record":{"source":{"id":"1308.2644","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-12T18:27:53Z","cross_cats_sorted":[],"title_canon_sha256":"9fa0cb4609a8ef776ff96beffa7e41cfa95d26ac5b55bea59087ef3663b9a6c6","abstract_canon_sha256":"a8905c070ab0f3684109e2100b63417a319692542ef90fb4579eeae34e217c8c"},"schema_version":"1.0"},"canonical_sha256":"277c57ac9f9e2fb66d4ab694b633387926dc0a16fdba06e50530b1d204836751","source":{"kind":"arxiv","id":"1308.2644","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.2644","created_at":"2026-05-18T03:16:06Z"},{"alias_kind":"arxiv_version","alias_value":"1308.2644v1","created_at":"2026-05-18T03:16:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.2644","created_at":"2026-05-18T03:16:06Z"},{"alias_kind":"pith_short_12","alias_value":"E56FPLE7TYX3","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"E56FPLE7TYX3M3KK","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"E56FPLE7","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:E56FPLE7TYX3M3KKW2KLMMZYPE","target":"record","payload":{"canonical_record":{"source":{"id":"1308.2644","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-12T18:27:53Z","cross_cats_sorted":[],"title_canon_sha256":"9fa0cb4609a8ef776ff96beffa7e41cfa95d26ac5b55bea59087ef3663b9a6c6","abstract_canon_sha256":"a8905c070ab0f3684109e2100b63417a319692542ef90fb4579eeae34e217c8c"},"schema_version":"1.0"},"canonical_sha256":"277c57ac9f9e2fb66d4ab694b633387926dc0a16fdba06e50530b1d204836751","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:16:06.942046Z","signature_b64":"AFpft7ufInJdbepcIKGa7pKPAqroEOwqRsP/lWMIDb4rlvNiu+ulEEq1XieDMKnL9hq0lQYv/trwS9C3HSt+BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"277c57ac9f9e2fb66d4ab694b633387926dc0a16fdba06e50530b1d204836751","last_reissued_at":"2026-05-18T03:16:06.941595Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:16:06.941595Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.2644","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:16:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"88LzNbpdTlc/snonLppQSUdZGAmjHDeqcVj2NcWPrkCnYpMh5wiEyVRKMA/Bw/gETndip6R+r+gXkslA5caTBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T19:49:12.068361Z"},"content_sha256":"e73c74a79d8370173fcd225b0f0737f12707a6e543889f7edc74985bbdebf619","schema_version":"1.0","event_id":"sha256:e73c74a79d8370173fcd225b0f0737f12707a6e543889f7edc74985bbdebf619"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:E56FPLE7TYX3M3KKW2KLMMZYPE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"From directed path to linear order - the best choice problem for powers of directed path","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrzej Grzesik, Ma{\\l}gorzata Sulkowska, Micha{\\l} Morayne","submitted_at":"2013-08-12T18:27:53Z","abstract_excerpt":"We examine the evolution of the best choice algorithm and the probability of its success from a directed path to the linear order of the same cardinality through $k$th powers of a directed path, $1 \\leq k < n$. The vertices of a $k$th power of a directed path of a known length $n$ are exposed one by one to a selector in some random order. At any time the selector can see the graph induced by the vertices that have already come. The selector's aim is to choose online the maximal vertex (i.e. the vertex with no outgoing edges). It is shown that the probability of success $p_n$ for the optimal al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.2644","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:16:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gbyzbqQoriY9PwPaCzm0ab/xlZ3s1g3tfZInfpaOl2LB0QqgTQKY2pABt+uOBK3Ot50/cHIJxmBIM8GB8uRoCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T19:49:12.068718Z"},"content_sha256":"151395cea8312f780a8c673857526512154b4d0ca593c10fbabcaaefcdb2b5e1","schema_version":"1.0","event_id":"sha256:151395cea8312f780a8c673857526512154b4d0ca593c10fbabcaaefcdb2b5e1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E56FPLE7TYX3M3KKW2KLMMZYPE/bundle.json","state_url":"https://pith.science/pith/E56FPLE7TYX3M3KKW2KLMMZYPE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E56FPLE7TYX3M3KKW2KLMMZYPE/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-07-03T19:49:12Z","links":{"resolver":"https://pith.science/pith/E56FPLE7TYX3M3KKW2KLMMZYPE","bundle":"https://pith.science/pith/E56FPLE7TYX3M3KKW2KLMMZYPE/bundle.json","state":"https://pith.science/pith/E56FPLE7TYX3M3KKW2KLMMZYPE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E56FPLE7TYX3M3KKW2KLMMZYPE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:E56FPLE7TYX3M3KKW2KLMMZYPE","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":"a8905c070ab0f3684109e2100b63417a319692542ef90fb4579eeae34e217c8c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-12T18:27:53Z","title_canon_sha256":"9fa0cb4609a8ef776ff96beffa7e41cfa95d26ac5b55bea59087ef3663b9a6c6"},"schema_version":"1.0","source":{"id":"1308.2644","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.2644","created_at":"2026-05-18T03:16:06Z"},{"alias_kind":"arxiv_version","alias_value":"1308.2644v1","created_at":"2026-05-18T03:16:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.2644","created_at":"2026-05-18T03:16:06Z"},{"alias_kind":"pith_short_12","alias_value":"E56FPLE7TYX3","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"E56FPLE7TYX3M3KK","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"E56FPLE7","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:151395cea8312f780a8c673857526512154b4d0ca593c10fbabcaaefcdb2b5e1","target":"graph","created_at":"2026-05-18T03:16:06Z","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 examine the evolution of the best choice algorithm and the probability of its success from a directed path to the linear order of the same cardinality through $k$th powers of a directed path, $1 \\leq k < n$. The vertices of a $k$th power of a directed path of a known length $n$ are exposed one by one to a selector in some random order. At any time the selector can see the graph induced by the vertices that have already come. The selector's aim is to choose online the maximal vertex (i.e. the vertex with no outgoing edges). It is shown that the probability of success $p_n$ for the optimal al","authors_text":"Andrzej Grzesik, Ma{\\l}gorzata Sulkowska, Micha{\\l} Morayne","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-12T18:27:53Z","title":"From directed path to linear order - the best choice problem for powers of directed path"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.2644","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:e73c74a79d8370173fcd225b0f0737f12707a6e543889f7edc74985bbdebf619","target":"record","created_at":"2026-05-18T03:16:06Z","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":"a8905c070ab0f3684109e2100b63417a319692542ef90fb4579eeae34e217c8c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-12T18:27:53Z","title_canon_sha256":"9fa0cb4609a8ef776ff96beffa7e41cfa95d26ac5b55bea59087ef3663b9a6c6"},"schema_version":"1.0","source":{"id":"1308.2644","kind":"arxiv","version":1}},"canonical_sha256":"277c57ac9f9e2fb66d4ab694b633387926dc0a16fdba06e50530b1d204836751","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"277c57ac9f9e2fb66d4ab694b633387926dc0a16fdba06e50530b1d204836751","first_computed_at":"2026-05-18T03:16:06.941595Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:16:06.941595Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AFpft7ufInJdbepcIKGa7pKPAqroEOwqRsP/lWMIDb4rlvNiu+ulEEq1XieDMKnL9hq0lQYv/trwS9C3HSt+BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:16:06.942046Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.2644","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e73c74a79d8370173fcd225b0f0737f12707a6e543889f7edc74985bbdebf619","sha256:151395cea8312f780a8c673857526512154b4d0ca593c10fbabcaaefcdb2b5e1"],"state_sha256":"7e6136c86fdc66654bbb25b22f641550a76c9c882bbe2cc57a7b83af4b849f9f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sqwsZO6XrgVVZvgkwGZDczkhFU7oStHcvGHKwMa7/RvmeDVjUlUiZdIIGu7/UzYiSR4mJdtaGAPffKOTKpTfAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T19:49:12.070673Z","bundle_sha256":"9bca6dcd4b1bdd8c695dc04ff55ac1e3e158532dd8d0366470d7a31b4b0d4c60"}}