{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:WA7AN55AKV7YMQLIEBOBSH6AFE","short_pith_number":"pith:WA7AN55A","schema_version":"1.0","canonical_sha256":"b03e06f7a0557f864168205c191fc029052345139385e11af280046d0a6a90f2","source":{"kind":"arxiv","id":"1008.3310","version":2},"attestation_state":"computed","paper":{"title":"Partially ordered secretaries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.PR"],"primary_cat":"math.OC","authors_text":"Johan W\\\"astlund, Ragnar Freij","submitted_at":"2010-08-19T14:32:09Z","abstract_excerpt":"The elements of a finite nonempty partially ordered set are exposed at independent uniform times in $[0,1]$ to a selector who, at any given time, can see the structure of the induced partial order on the exposed elements. The selector's task is to choose online a maximal element. This generalizes the classical linear order secretary problem, for which it is known that the selector can succeed with probability $1/e$ and that this is best possible. We describe a strategy for the general problem that achieves success probability $1/e$ for an arbitrary partial order."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1008.3310","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-08-19T14:32:09Z","cross_cats_sorted":["cs.DS","math.PR"],"title_canon_sha256":"b727403953fa58f224b492376917f66bea3240246b2cea7cb1f3ca5d493c80da","abstract_canon_sha256":"2404a549d7e7fb3e9c959b911a870c6fdcc6d5fdce46469085eccb56c865a974"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:39:50.102172Z","signature_b64":"e/uveVKNJXS05mdYb8T6rdf+PDrGpBZOmUXmhlPHDtCuNnpRsAjVHd/57bRnI1vq/OTDPhdY5jAZ0PyUqjZQAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b03e06f7a0557f864168205c191fc029052345139385e11af280046d0a6a90f2","last_reissued_at":"2026-05-18T04:39:50.101641Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:39:50.101641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Partially ordered secretaries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.PR"],"primary_cat":"math.OC","authors_text":"Johan W\\\"astlund, Ragnar Freij","submitted_at":"2010-08-19T14:32:09Z","abstract_excerpt":"The elements of a finite nonempty partially ordered set are exposed at independent uniform times in $[0,1]$ to a selector who, at any given time, can see the structure of the induced partial order on the exposed elements. The selector's task is to choose online a maximal element. This generalizes the classical linear order secretary problem, for which it is known that the selector can succeed with probability $1/e$ and that this is best possible. We describe a strategy for the general problem that achieves success probability $1/e$ for an arbitrary partial order."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.3310","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1008.3310","created_at":"2026-05-18T04:39:50.101723+00:00"},{"alias_kind":"arxiv_version","alias_value":"1008.3310v2","created_at":"2026-05-18T04:39:50.101723+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.3310","created_at":"2026-05-18T04:39:50.101723+00:00"},{"alias_kind":"pith_short_12","alias_value":"WA7AN55AKV7Y","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_16","alias_value":"WA7AN55AKV7YMQLI","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_8","alias_value":"WA7AN55A","created_at":"2026-05-18T12:26:15.391820+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WA7AN55AKV7YMQLIEBOBSH6AFE","json":"https://pith.science/pith/WA7AN55AKV7YMQLIEBOBSH6AFE.json","graph_json":"https://pith.science/api/pith-number/WA7AN55AKV7YMQLIEBOBSH6AFE/graph.json","events_json":"https://pith.science/api/pith-number/WA7AN55AKV7YMQLIEBOBSH6AFE/events.json","paper":"https://pith.science/paper/WA7AN55A"},"agent_actions":{"view_html":"https://pith.science/pith/WA7AN55AKV7YMQLIEBOBSH6AFE","download_json":"https://pith.science/pith/WA7AN55AKV7YMQLIEBOBSH6AFE.json","view_paper":"https://pith.science/paper/WA7AN55A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1008.3310&json=true","fetch_graph":"https://pith.science/api/pith-number/WA7AN55AKV7YMQLIEBOBSH6AFE/graph.json","fetch_events":"https://pith.science/api/pith-number/WA7AN55AKV7YMQLIEBOBSH6AFE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WA7AN55AKV7YMQLIEBOBSH6AFE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WA7AN55AKV7YMQLIEBOBSH6AFE/action/storage_attestation","attest_author":"https://pith.science/pith/WA7AN55AKV7YMQLIEBOBSH6AFE/action/author_attestation","sign_citation":"https://pith.science/pith/WA7AN55AKV7YMQLIEBOBSH6AFE/action/citation_signature","submit_replication":"https://pith.science/pith/WA7AN55AKV7YMQLIEBOBSH6AFE/action/replication_record"}},"created_at":"2026-05-18T04:39:50.101723+00:00","updated_at":"2026-05-18T04:39:50.101723+00:00"}