{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:I6PGVCG6BATTEVPBV5WCS3N2EK","short_pith_number":"pith:I6PGVCG6","schema_version":"1.0","canonical_sha256":"479e6a88de08273255e1af6c296dba228f0af86238326277d632da7e1aaf5cd5","source":{"kind":"arxiv","id":"2411.10892","version":1},"attestation_state":"computed","paper":{"title":"The Competition Complexity of Prophet Secretary","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Tamar Garbuz, Tomer Ezra","submitted_at":"2024-11-16T21:27:51Z","abstract_excerpt":"We study the classic single-choice prophet secretary problem through a resource augmentation lens. Our goal is to bound the $(1-\\epsilon)$-competition complexity for different classes of online algorithms. This metric asks for the smallest $k$ such that the expected value of the online algorithm on $k$ copies of the original instance, is at least a $(1 - \\epsilon)$-approximation to the expected offline optimum on the original instance (without added copies).\n  We consider four natural classes of online algorithms: single-threshold, time-based threshold, activation-based, and general algorithms"},"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.10892","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2024-11-16T21:27:51Z","cross_cats_sorted":[],"title_canon_sha256":"3662b6acfc3a83237a5d2495ba95f6ebab7d3ab22476fb12ddf3cbe454e78890","abstract_canon_sha256":"9dfc64d00aa0b7f0d00b6e7a347d83b1410648c88262946f551dcd693c11e09b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:36:24.060477Z","signature_b64":"urfwbXUUj6vFBDHt46h9lOFd5wawJRLceMJW8i9SHHbAxCmAUcSeZty9MB4ztBaOzEbCJXnvxmvOAiB1B7fiDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"479e6a88de08273255e1af6c296dba228f0af86238326277d632da7e1aaf5cd5","last_reissued_at":"2026-07-05T09:36:24.060045Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:36:24.060045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Competition Complexity of Prophet Secretary","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Tamar Garbuz, Tomer Ezra","submitted_at":"2024-11-16T21:27:51Z","abstract_excerpt":"We study the classic single-choice prophet secretary problem through a resource augmentation lens. Our goal is to bound the $(1-\\epsilon)$-competition complexity for different classes of online algorithms. This metric asks for the smallest $k$ such that the expected value of the online algorithm on $k$ copies of the original instance, is at least a $(1 - \\epsilon)$-approximation to the expected offline optimum on the original instance (without added copies).\n  We consider four natural classes of online algorithms: single-threshold, time-based threshold, activation-based, and general algorithms"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.10892","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.10892/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.10892","created_at":"2026-07-05T09:36:24.060095+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.10892v1","created_at":"2026-07-05T09:36:24.060095+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.10892","created_at":"2026-07-05T09:36:24.060095+00:00"},{"alias_kind":"pith_short_12","alias_value":"I6PGVCG6BATT","created_at":"2026-07-05T09:36:24.060095+00:00"},{"alias_kind":"pith_short_16","alias_value":"I6PGVCG6BATTEVPB","created_at":"2026-07-05T09:36:24.060095+00:00"},{"alias_kind":"pith_short_8","alias_value":"I6PGVCG6","created_at":"2026-07-05T09:36:24.060095+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.18061","citing_title":"Posted Pricing and Competition in Large Markets","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/I6PGVCG6BATTEVPBV5WCS3N2EK","json":"https://pith.science/pith/I6PGVCG6BATTEVPBV5WCS3N2EK.json","graph_json":"https://pith.science/api/pith-number/I6PGVCG6BATTEVPBV5WCS3N2EK/graph.json","events_json":"https://pith.science/api/pith-number/I6PGVCG6BATTEVPBV5WCS3N2EK/events.json","paper":"https://pith.science/paper/I6PGVCG6"},"agent_actions":{"view_html":"https://pith.science/pith/I6PGVCG6BATTEVPBV5WCS3N2EK","download_json":"https://pith.science/pith/I6PGVCG6BATTEVPBV5WCS3N2EK.json","view_paper":"https://pith.science/paper/I6PGVCG6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.10892&json=true","fetch_graph":"https://pith.science/api/pith-number/I6PGVCG6BATTEVPBV5WCS3N2EK/graph.json","fetch_events":"https://pith.science/api/pith-number/I6PGVCG6BATTEVPBV5WCS3N2EK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I6PGVCG6BATTEVPBV5WCS3N2EK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I6PGVCG6BATTEVPBV5WCS3N2EK/action/storage_attestation","attest_author":"https://pith.science/pith/I6PGVCG6BATTEVPBV5WCS3N2EK/action/author_attestation","sign_citation":"https://pith.science/pith/I6PGVCG6BATTEVPBV5WCS3N2EK/action/citation_signature","submit_replication":"https://pith.science/pith/I6PGVCG6BATTEVPBV5WCS3N2EK/action/replication_record"}},"created_at":"2026-07-05T09:36:24.060095+00:00","updated_at":"2026-07-05T09:36:24.060095+00:00"}