{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:I6PGVCG6BATTEVPBV5WCS3N2EK","short_pith_number":"pith:I6PGVCG6","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"},"canonical_sha256":"479e6a88de08273255e1af6c296dba228f0af86238326277d632da7e1aaf5cd5","source":{"kind":"arxiv","id":"2411.10892","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.10892","created_at":"2026-07-05T09:36:24Z"},{"alias_kind":"arxiv_version","alias_value":"2411.10892v1","created_at":"2026-07-05T09:36:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.10892","created_at":"2026-07-05T09:36:24Z"},{"alias_kind":"pith_short_12","alias_value":"I6PGVCG6BATT","created_at":"2026-07-05T09:36:24Z"},{"alias_kind":"pith_short_16","alias_value":"I6PGVCG6BATTEVPB","created_at":"2026-07-05T09:36:24Z"},{"alias_kind":"pith_short_8","alias_value":"I6PGVCG6","created_at":"2026-07-05T09:36:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:I6PGVCG6BATTEVPBV5WCS3N2EK","target":"record","payload":{"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"},"canonical_sha256":"479e6a88de08273255e1af6c296dba228f0af86238326277d632da7e1aaf5cd5","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"},"source_kind":"arxiv","source_id":"2411.10892","source_version":1,"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-07-05T09:36:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i4lm5NztYq6mNQT4Yya6d5ahrA8YsBljsSBlDCDqwNAVgo0pDYrWSblSx0sA7g0ZkfIPmTrVktKwk0Rbf+/xDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T19:35:16.317821Z"},"content_sha256":"af36e7ed1ef625e21ec1ea38f39cf2ec206e8638ac25ed3b4439f843f1cadbb1","schema_version":"1.0","event_id":"sha256:af36e7ed1ef625e21ec1ea38f39cf2ec206e8638ac25ed3b4439f843f1cadbb1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:I6PGVCG6BATTEVPBV5WCS3N2EK","target":"graph","payload":{"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"},"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-07-05T09:36:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CBfoBT1DgW7AdCqakCmk9KFPGeTtZrc2RyvfizQeqPpIB/f2rclaciszdvAU6wvOgZUsYKOoa5QXbOTGVr8UBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T19:35:16.318224Z"},"content_sha256":"5805769f09ee5fba716af94bf63c26bae697769e2e2c9f12b4c003e209bde84a","schema_version":"1.0","event_id":"sha256:5805769f09ee5fba716af94bf63c26bae697769e2e2c9f12b4c003e209bde84a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I6PGVCG6BATTEVPBV5WCS3N2EK/bundle.json","state_url":"https://pith.science/pith/I6PGVCG6BATTEVPBV5WCS3N2EK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I6PGVCG6BATTEVPBV5WCS3N2EK/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-08-21T19:35:16Z","links":{"resolver":"https://pith.science/pith/I6PGVCG6BATTEVPBV5WCS3N2EK","bundle":"https://pith.science/pith/I6PGVCG6BATTEVPBV5WCS3N2EK/bundle.json","state":"https://pith.science/pith/I6PGVCG6BATTEVPBV5WCS3N2EK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I6PGVCG6BATTEVPBV5WCS3N2EK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:I6PGVCG6BATTEVPBV5WCS3N2EK","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":"9dfc64d00aa0b7f0d00b6e7a347d83b1410648c88262946f551dcd693c11e09b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2024-11-16T21:27:51Z","title_canon_sha256":"3662b6acfc3a83237a5d2495ba95f6ebab7d3ab22476fb12ddf3cbe454e78890"},"schema_version":"1.0","source":{"id":"2411.10892","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.10892","created_at":"2026-07-05T09:36:24Z"},{"alias_kind":"arxiv_version","alias_value":"2411.10892v1","created_at":"2026-07-05T09:36:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.10892","created_at":"2026-07-05T09:36:24Z"},{"alias_kind":"pith_short_12","alias_value":"I6PGVCG6BATT","created_at":"2026-07-05T09:36:24Z"},{"alias_kind":"pith_short_16","alias_value":"I6PGVCG6BATTEVPB","created_at":"2026-07-05T09:36:24Z"},{"alias_kind":"pith_short_8","alias_value":"I6PGVCG6","created_at":"2026-07-05T09:36:24Z"}],"graph_snapshots":[{"event_id":"sha256:5805769f09ee5fba716af94bf63c26bae697769e2e2c9f12b4c003e209bde84a","target":"graph","created_at":"2026-07-05T09:36:24Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2411.10892/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Tamar Garbuz, Tomer Ezra","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2024-11-16T21:27:51Z","title":"The Competition Complexity of Prophet Secretary"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.10892","kind":"arxiv","version":1},"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:af36e7ed1ef625e21ec1ea38f39cf2ec206e8638ac25ed3b4439f843f1cadbb1","target":"record","created_at":"2026-07-05T09:36:24Z","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":"9dfc64d00aa0b7f0d00b6e7a347d83b1410648c88262946f551dcd693c11e09b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2024-11-16T21:27:51Z","title_canon_sha256":"3662b6acfc3a83237a5d2495ba95f6ebab7d3ab22476fb12ddf3cbe454e78890"},"schema_version":"1.0","source":{"id":"2411.10892","kind":"arxiv","version":1}},"canonical_sha256":"479e6a88de08273255e1af6c296dba228f0af86238326277d632da7e1aaf5cd5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"479e6a88de08273255e1af6c296dba228f0af86238326277d632da7e1aaf5cd5","first_computed_at":"2026-07-05T09:36:24.060045Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:36:24.060045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"urfwbXUUj6vFBDHt46h9lOFd5wawJRLceMJW8i9SHHbAxCmAUcSeZty9MB4ztBaOzEbCJXnvxmvOAiB1B7fiDw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:36:24.060477Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.10892","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af36e7ed1ef625e21ec1ea38f39cf2ec206e8638ac25ed3b4439f843f1cadbb1","sha256:5805769f09ee5fba716af94bf63c26bae697769e2e2c9f12b4c003e209bde84a"],"state_sha256":"d96c3e0ad4ce320e4eb39e8d9b8467ca6d0362f162f8238b02c8b17460e9c97a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XPPO7XDOFhhYo3iEOSx0S6lEdAeFLVmtELU/MprCtIlNwMTmQY/e9IAFVoHwcYgY7OT7L21AzfJmbl0+jabCDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T19:35:16.320919Z","bundle_sha256":"6429eb0d6b137961c7443cc805fdeb3344d4b98d0585eb7f357e86e4b41dbb9a"}}