{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:YLTDEFGZJB2G3YWCGK3UQIQ3ZU","short_pith_number":"pith:YLTDEFGZ","schema_version":"1.0","canonical_sha256":"c2e63214d948746de2c232b748221bcd0db4038023c7e2ba45c81daa8d48371b","source":{"kind":"arxiv","id":"2411.01191","version":1},"attestation_state":"computed","paper":{"title":"Prophet Secretary and Matching: the Significance of the Largest Item","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DS","authors_text":"Dongchen Li, Zhihao Gavin Tang, Zhiyi Huang, Ziyun Chen","submitted_at":"2024-11-02T09:37:10Z","abstract_excerpt":"The prophet secretary problem is a combination of the prophet inequality and the secretary problem, where elements are drawn from known independent distributions and arrive in uniformly random order. In this work, we design 1) a $0.688$-competitive algorithm, that breaks the $0.675$ barrier of blind strategies (Correa, Saona, Ziliotto, 2021), and 2) a $0.641$-competitive algorithm for the prophet secretary matching problem, that breaks the $1-1/e\\approx 0.632$ barrier for the first time. Our second result also applies to the query-commit model of weighted stochastic matching and improves the s"},"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":"2411.01191","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-11-02T09:37:10Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"21ccbe84232787fe6634409f7617e105563d904d03834b7056411ab22c79e286","abstract_canon_sha256":"f192610d971acac1c365308fcdecf8bd99faa9966930f334efbdf4642c1a028a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:30:26.542313Z","signature_b64":"ccJOj6Jlo9SkdadBxTa+3culaT8Pr/RJHycsDesdMO0wABfvUqQSHrB6LiUZOO0hcD43VgyEwnEvL507UWwoDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2e63214d948746de2c232b748221bcd0db4038023c7e2ba45c81daa8d48371b","last_reissued_at":"2026-07-05T09:30:26.541710Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:30:26.541710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Prophet Secretary and Matching: the Significance of the Largest Item","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DS","authors_text":"Dongchen Li, Zhihao Gavin Tang, Zhiyi Huang, Ziyun Chen","submitted_at":"2024-11-02T09:37:10Z","abstract_excerpt":"The prophet secretary problem is a combination of the prophet inequality and the secretary problem, where elements are drawn from known independent distributions and arrive in uniformly random order. In this work, we design 1) a $0.688$-competitive algorithm, that breaks the $0.675$ barrier of blind strategies (Correa, Saona, Ziliotto, 2021), and 2) a $0.641$-competitive algorithm for the prophet secretary matching problem, that breaks the $1-1/e\\approx 0.632$ barrier for the first time. Our second result also applies to the query-commit model of weighted stochastic matching and improves the s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.01191","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.01191/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2411.01191","created_at":"2026-07-05T09:30:26.541768+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.01191v1","created_at":"2026-07-05T09:30:26.541768+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.01191","created_at":"2026-07-05T09:30:26.541768+00:00"},{"alias_kind":"pith_short_12","alias_value":"YLTDEFGZJB2G","created_at":"2026-07-05T09:30:26.541768+00:00"},{"alias_kind":"pith_short_16","alias_value":"YLTDEFGZJB2G3YWC","created_at":"2026-07-05T09:30:26.541768+00:00"},{"alias_kind":"pith_short_8","alias_value":"YLTDEFGZ","created_at":"2026-07-05T09:30:26.541768+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.10892","citing_title":"The Competition Complexity of Prophet Secretary","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YLTDEFGZJB2G3YWCGK3UQIQ3ZU","json":"https://pith.science/pith/YLTDEFGZJB2G3YWCGK3UQIQ3ZU.json","graph_json":"https://pith.science/api/pith-number/YLTDEFGZJB2G3YWCGK3UQIQ3ZU/graph.json","events_json":"https://pith.science/api/pith-number/YLTDEFGZJB2G3YWCGK3UQIQ3ZU/events.json","paper":"https://pith.science/paper/YLTDEFGZ"},"agent_actions":{"view_html":"https://pith.science/pith/YLTDEFGZJB2G3YWCGK3UQIQ3ZU","download_json":"https://pith.science/pith/YLTDEFGZJB2G3YWCGK3UQIQ3ZU.json","view_paper":"https://pith.science/paper/YLTDEFGZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.01191&json=true","fetch_graph":"https://pith.science/api/pith-number/YLTDEFGZJB2G3YWCGK3UQIQ3ZU/graph.json","fetch_events":"https://pith.science/api/pith-number/YLTDEFGZJB2G3YWCGK3UQIQ3ZU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YLTDEFGZJB2G3YWCGK3UQIQ3ZU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YLTDEFGZJB2G3YWCGK3UQIQ3ZU/action/storage_attestation","attest_author":"https://pith.science/pith/YLTDEFGZJB2G3YWCGK3UQIQ3ZU/action/author_attestation","sign_citation":"https://pith.science/pith/YLTDEFGZJB2G3YWCGK3UQIQ3ZU/action/citation_signature","submit_replication":"https://pith.science/pith/YLTDEFGZJB2G3YWCGK3UQIQ3ZU/action/replication_record"}},"created_at":"2026-07-05T09:30:26.541768+00:00","updated_at":"2026-07-05T09:30:26.541768+00:00"}