{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:TMOZDZ2GRZJSC5CLMUPV4XZNHJ","short_pith_number":"pith:TMOZDZ2G","canonical_record":{"source":{"id":"1107.1379","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-07T13:29:32Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"28c7e4be9810f4abce5fe55a3dc211cf155596305c8791e93139bb93acc391b8","abstract_canon_sha256":"3db19667c2de70ba043013bc2cf3616bf417c4c0dccc7e712ffb6e5717a21726"},"schema_version":"1.0"},"canonical_sha256":"9b1d91e7468e5321744b651f5e5f2d3a43312292fd1235f3225d79e8b22198fe","source":{"kind":"arxiv","id":"1107.1379","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.1379","created_at":"2026-05-18T03:52:26Z"},{"alias_kind":"arxiv_version","alias_value":"1107.1379v2","created_at":"2026-05-18T03:52:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.1379","created_at":"2026-05-18T03:52:26Z"},{"alias_kind":"pith_short_12","alias_value":"TMOZDZ2GRZJS","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"TMOZDZ2GRZJSC5CL","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"TMOZDZ2G","created_at":"2026-05-18T12:26:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:TMOZDZ2GRZJSC5CLMUPV4XZNHJ","target":"record","payload":{"canonical_record":{"source":{"id":"1107.1379","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-07T13:29:32Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"28c7e4be9810f4abce5fe55a3dc211cf155596305c8791e93139bb93acc391b8","abstract_canon_sha256":"3db19667c2de70ba043013bc2cf3616bf417c4c0dccc7e712ffb6e5717a21726"},"schema_version":"1.0"},"canonical_sha256":"9b1d91e7468e5321744b651f5e5f2d3a43312292fd1235f3225d79e8b22198fe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:26.447560Z","signature_b64":"mTMm82NnPLpZKS3Dql3xXA3G9Qz/kO+JkYWdQhyovsRwXxN00J4MTl8I27EUKqk0Oi6SLoi3xSmMUgy8mXdTDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b1d91e7468e5321744b651f5e5f2d3a43312292fd1235f3225d79e8b22198fe","last_reissued_at":"2026-05-18T03:52:26.446847Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:26.446847Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.1379","source_version":2,"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:52:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QvGHhgu/W3v0rUBQTznXlWuayRwUUgDuFbcEglRCB8O7yHXx0XGsxSyPLbbArhlTBivTr+k7uwiuQCD69iWEBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:44:49.594546Z"},"content_sha256":"9b3c531e64c21cd5d874b9404468ba135bf592de70a940e914e704688e66c9bf","schema_version":"1.0","event_id":"sha256:9b3c531e64c21cd5d874b9404468ba135bf592de70a940e914e704688e66c9bf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:TMOZDZ2GRZJSC5CLMUPV4XZNHJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The secretary problem on an unknown poset","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Bryn Garrod, Robert Morris","submitted_at":"2011-07-07T13:29:32Z","abstract_excerpt":"We consider generalizations of the classical secretary problem, also known as the problem of optimal choice, to posets where the only information we have is the size of the poset and the number of maximal elements. We show that, given this information, there is an algorithm that is successful with probability at least $\\frac{1}{e}$. We conjecture that if there are $k$ maximal elements and $k \\geq 2$ then this can be improved to $\\sqrt[k-1]{\\frac{1}{k}}$, and prove this conjecture for posets of width $k$. We also show that no better bound is possible."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.1379","kind":"arxiv","version":2},"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:52:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bau4RsvW7kFAmItid6bcT0uHlOYoaf3TWCAcaFIcG1W7ulFJ4+6Mj0slZKeFJq1OVyCvaR4GFQ6htQycRGPuAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:44:49.595231Z"},"content_sha256":"05e53de596bbe100ce3b424762a0dba58e31b63cd12e5a48d56c07fa9e268c8e","schema_version":"1.0","event_id":"sha256:05e53de596bbe100ce3b424762a0dba58e31b63cd12e5a48d56c07fa9e268c8e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TMOZDZ2GRZJSC5CLMUPV4XZNHJ/bundle.json","state_url":"https://pith.science/pith/TMOZDZ2GRZJSC5CLMUPV4XZNHJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TMOZDZ2GRZJSC5CLMUPV4XZNHJ/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-05-30T22:44:49Z","links":{"resolver":"https://pith.science/pith/TMOZDZ2GRZJSC5CLMUPV4XZNHJ","bundle":"https://pith.science/pith/TMOZDZ2GRZJSC5CLMUPV4XZNHJ/bundle.json","state":"https://pith.science/pith/TMOZDZ2GRZJSC5CLMUPV4XZNHJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TMOZDZ2GRZJSC5CLMUPV4XZNHJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:TMOZDZ2GRZJSC5CLMUPV4XZNHJ","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":"3db19667c2de70ba043013bc2cf3616bf417c4c0dccc7e712ffb6e5717a21726","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-07T13:29:32Z","title_canon_sha256":"28c7e4be9810f4abce5fe55a3dc211cf155596305c8791e93139bb93acc391b8"},"schema_version":"1.0","source":{"id":"1107.1379","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.1379","created_at":"2026-05-18T03:52:26Z"},{"alias_kind":"arxiv_version","alias_value":"1107.1379v2","created_at":"2026-05-18T03:52:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.1379","created_at":"2026-05-18T03:52:26Z"},{"alias_kind":"pith_short_12","alias_value":"TMOZDZ2GRZJS","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"TMOZDZ2GRZJSC5CL","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"TMOZDZ2G","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:05e53de596bbe100ce3b424762a0dba58e31b63cd12e5a48d56c07fa9e268c8e","target":"graph","created_at":"2026-05-18T03:52:26Z","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 generalizations of the classical secretary problem, also known as the problem of optimal choice, to posets where the only information we have is the size of the poset and the number of maximal elements. We show that, given this information, there is an algorithm that is successful with probability at least $\\frac{1}{e}$. We conjecture that if there are $k$ maximal elements and $k \\geq 2$ then this can be improved to $\\sqrt[k-1]{\\frac{1}{k}}$, and prove this conjecture for posets of width $k$. We also show that no better bound is possible.","authors_text":"Bryn Garrod, Robert Morris","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-07T13:29:32Z","title":"The secretary problem on an unknown poset"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.1379","kind":"arxiv","version":2},"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:9b3c531e64c21cd5d874b9404468ba135bf592de70a940e914e704688e66c9bf","target":"record","created_at":"2026-05-18T03:52:26Z","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":"3db19667c2de70ba043013bc2cf3616bf417c4c0dccc7e712ffb6e5717a21726","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-07T13:29:32Z","title_canon_sha256":"28c7e4be9810f4abce5fe55a3dc211cf155596305c8791e93139bb93acc391b8"},"schema_version":"1.0","source":{"id":"1107.1379","kind":"arxiv","version":2}},"canonical_sha256":"9b1d91e7468e5321744b651f5e5f2d3a43312292fd1235f3225d79e8b22198fe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b1d91e7468e5321744b651f5e5f2d3a43312292fd1235f3225d79e8b22198fe","first_computed_at":"2026-05-18T03:52:26.446847Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:52:26.446847Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mTMm82NnPLpZKS3Dql3xXA3G9Qz/kO+JkYWdQhyovsRwXxN00J4MTl8I27EUKqk0Oi6SLoi3xSmMUgy8mXdTDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:52:26.447560Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.1379","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9b3c531e64c21cd5d874b9404468ba135bf592de70a940e914e704688e66c9bf","sha256:05e53de596bbe100ce3b424762a0dba58e31b63cd12e5a48d56c07fa9e268c8e"],"state_sha256":"044c362b5bd4afb895b9b078e6a8df5d815bb4a2313d230238d732243b8f7b33"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F/PP0Zf5sj5yqHrdBib3zUOCvczUUxym85d3IenUreDZc/RQtf/LNh3f5kW8X7xcteKP6CepVJINSdI0QWHoDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T22:44:49.598806Z","bundle_sha256":"3347cc26a855beb2656b4cc44c6ec3bc330fd27aa42d7e7eb95cde47bc8e71fd"}}