{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:67X3AVV4T5M7BLEFMN7SFIEX5M","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":"d2bd95034836b64decf3514c52b652a889e79bb9079da969a81b448b49aeba56","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-17T10:16:28Z","title_canon_sha256":"da8b794d446481cbd50370c1b7c56f045a2c5013c0b155ff5a6f51a791e032b1"},"schema_version":"1.0","source":{"id":"1404.4473","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.4473","created_at":"2026-05-18T02:48:18Z"},{"alias_kind":"arxiv_version","alias_value":"1404.4473v2","created_at":"2026-05-18T02:48:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4473","created_at":"2026-05-18T02:48:18Z"},{"alias_kind":"pith_short_12","alias_value":"67X3AVV4T5M7","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"67X3AVV4T5M7BLEF","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"67X3AVV4","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:5893dce6cd4afc47fa948f8750d940db4fe521353ca3bba9982ed215467ac3aa","target":"graph","created_at":"2026-05-18T02:48: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":"Only recently progress has been made in obtaining $o(\\log(\\mathrm{rank}))$-competitive algorithms for the matroid secretary problem. More precisely, Chakraborty and Lachish (2012) presented a $O(\\sqrt{\\log(\\mathrm{rank})})$-competitive procedure, and Lachish (2014) later presented a $O(\\log\\log(\\mathrm{rank}))$-competitive algorithm. Both these algorithms and their analyses are very involved, which is also reflected in the extremely high constants in their competitive ratios.\n  Using different tools, we present a considerably simpler $O(\\log\\log(\\mathrm{rank}))$-competitive algorithm for the m","authors_text":"Moran Feldman, Ola Svensson, Rico Zenklusen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-17T10:16:28Z","title":"A Simple $O(\\log\\log(\\mathrm{rank}))$-Competitive Algorithm for the Matroid Secretary Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.4473","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:7e4949f2f7e5611038d4d6fb0c6eb46e08af1fc09ba33499870b533069b5523c","target":"record","created_at":"2026-05-18T02:48: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":"d2bd95034836b64decf3514c52b652a889e79bb9079da969a81b448b49aeba56","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-17T10:16:28Z","title_canon_sha256":"da8b794d446481cbd50370c1b7c56f045a2c5013c0b155ff5a6f51a791e032b1"},"schema_version":"1.0","source":{"id":"1404.4473","kind":"arxiv","version":2}},"canonical_sha256":"f7efb056bc9f59f0ac85637f22a097eb1315ef1c77c390eea3e7cdadb011f1ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f7efb056bc9f59f0ac85637f22a097eb1315ef1c77c390eea3e7cdadb011f1ab","first_computed_at":"2026-05-18T02:48:18.979831Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:18.979831Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q8/lluAd4kMYAnoeE9MQpy4au8hR+AAQq38xSl1fvMxxd7Ck+qDJ/c3y/JUcFQSrFwl4OOy1FitTWpbiFJOZBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:18.980278Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.4473","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7e4949f2f7e5611038d4d6fb0c6eb46e08af1fc09ba33499870b533069b5523c","sha256:5893dce6cd4afc47fa948f8750d940db4fe521353ca3bba9982ed215467ac3aa"],"state_sha256":"9319a6a54078d79de50fceabc6891fadbe2963916b5f956e823172dfaf745bf1"}