{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:GJHMJTU7AXD6QAHREIBHZ3TAC5","short_pith_number":"pith:GJHMJTU7","canonical_record":{"source":{"id":"1606.06926","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-22T12:31:10Z","cross_cats_sorted":[],"title_canon_sha256":"240ffdbfc4b539fdcfdf12a77e93d06a5fe0c07a96911fc8e5b75ad53279c7b5","abstract_canon_sha256":"2c7b2ef9d496b24c21d39315ae85d498b6d6b15cba9b9872bb0d53d3615d7abe"},"schema_version":"1.0"},"canonical_sha256":"324ec4ce9f05c7e800f122027cee6017420d9ef57d8bbb598ce4293b542b36f8","source":{"kind":"arxiv","id":"1606.06926","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.06926","created_at":"2026-05-18T01:12:00Z"},{"alias_kind":"arxiv_version","alias_value":"1606.06926v1","created_at":"2026-05-18T01:12:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.06926","created_at":"2026-05-18T01:12:00Z"},{"alias_kind":"pith_short_12","alias_value":"GJHMJTU7AXD6","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GJHMJTU7AXD6QAHR","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GJHMJTU7","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:GJHMJTU7AXD6QAHREIBHZ3TAC5","target":"record","payload":{"canonical_record":{"source":{"id":"1606.06926","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-22T12:31:10Z","cross_cats_sorted":[],"title_canon_sha256":"240ffdbfc4b539fdcfdf12a77e93d06a5fe0c07a96911fc8e5b75ad53279c7b5","abstract_canon_sha256":"2c7b2ef9d496b24c21d39315ae85d498b6d6b15cba9b9872bb0d53d3615d7abe"},"schema_version":"1.0"},"canonical_sha256":"324ec4ce9f05c7e800f122027cee6017420d9ef57d8bbb598ce4293b542b36f8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:00.899103Z","signature_b64":"INfhM8cT/Tvd/hikyDMTD/k8HVOsE5v7XjfIG8vORH6i6AsdkRgUWhgcLet07Nggu/hvi6OV7qR/6yexKm8xAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"324ec4ce9f05c7e800f122027cee6017420d9ef57d8bbb598ce4293b542b36f8","last_reissued_at":"2026-05-18T01:12:00.898727Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:00.898727Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.06926","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-05-18T01:12:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/++6WTrpjUl8Dl3qNPH6KjtNPvKWtfBMoY8qlj/OZRcnoV5GCy+lwnIsfDi9pEPtB3vvm/K5Klx7sTAUqgaOBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:41:36.086622Z"},"content_sha256":"573c7f424827526771cb89af2b6b3e36130f0a17bd55f1e2570ab08054c4dfad","schema_version":"1.0","event_id":"sha256:573c7f424827526771cb89af2b6b3e36130f0a17bd55f1e2570ab08054c4dfad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:GJHMJTU7AXD6QAHREIBHZ3TAC5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Think Eternally: Improved Algorithms for the Temp Secretary Problem and Extensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andreas T\\\"onnis, Thomas Kesselheim","submitted_at":"2016-06-22T12:31:10Z","abstract_excerpt":"The \\emph{Temp Secretary Problem} was recently introduced by Fiat et al. It is a generalization of the Secretary Problem, in which commitments are temporary for a fixed duration. We present a simple online algorithm with improved performance guarantees for cases already considered by Fiat et al.\\ and give competitive ratios for new generalizations of the problem. In the classical setting, where candidates have identical contract durations $\\gamma \\ll 1$ and we are allowed to hire up to $B$ candidates simultaneously, our algorithm is $(\\frac{1}{2} - O(\\sqrt{\\gamma}))$-competitive. For large $B$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.06926","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":""},"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-05-18T01:12:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fHLi+m9rYLwGDtz2pe9C9W6KZT/V/E2aW5effT9NnQcjIi0KG5j9ZHlLJFV1l5w5NNnkPv32RL0avHDPzfYaDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:41:36.086972Z"},"content_sha256":"c9254895267a894d7b95b8fee90ab3424f879f97a9fada2029068b5c5cd67443","schema_version":"1.0","event_id":"sha256:c9254895267a894d7b95b8fee90ab3424f879f97a9fada2029068b5c5cd67443"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GJHMJTU7AXD6QAHREIBHZ3TAC5/bundle.json","state_url":"https://pith.science/pith/GJHMJTU7AXD6QAHREIBHZ3TAC5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GJHMJTU7AXD6QAHREIBHZ3TAC5/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-06-02T21:41:36Z","links":{"resolver":"https://pith.science/pith/GJHMJTU7AXD6QAHREIBHZ3TAC5","bundle":"https://pith.science/pith/GJHMJTU7AXD6QAHREIBHZ3TAC5/bundle.json","state":"https://pith.science/pith/GJHMJTU7AXD6QAHREIBHZ3TAC5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GJHMJTU7AXD6QAHREIBHZ3TAC5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:GJHMJTU7AXD6QAHREIBHZ3TAC5","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":"2c7b2ef9d496b24c21d39315ae85d498b6d6b15cba9b9872bb0d53d3615d7abe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-22T12:31:10Z","title_canon_sha256":"240ffdbfc4b539fdcfdf12a77e93d06a5fe0c07a96911fc8e5b75ad53279c7b5"},"schema_version":"1.0","source":{"id":"1606.06926","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.06926","created_at":"2026-05-18T01:12:00Z"},{"alias_kind":"arxiv_version","alias_value":"1606.06926v1","created_at":"2026-05-18T01:12:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.06926","created_at":"2026-05-18T01:12:00Z"},{"alias_kind":"pith_short_12","alias_value":"GJHMJTU7AXD6","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GJHMJTU7AXD6QAHR","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GJHMJTU7","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:c9254895267a894d7b95b8fee90ab3424f879f97a9fada2029068b5c5cd67443","target":"graph","created_at":"2026-05-18T01:12:00Z","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":"The \\emph{Temp Secretary Problem} was recently introduced by Fiat et al. It is a generalization of the Secretary Problem, in which commitments are temporary for a fixed duration. We present a simple online algorithm with improved performance guarantees for cases already considered by Fiat et al.\\ and give competitive ratios for new generalizations of the problem. In the classical setting, where candidates have identical contract durations $\\gamma \\ll 1$ and we are allowed to hire up to $B$ candidates simultaneously, our algorithm is $(\\frac{1}{2} - O(\\sqrt{\\gamma}))$-competitive. For large $B$","authors_text":"Andreas T\\\"onnis, Thomas Kesselheim","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-22T12:31:10Z","title":"Think Eternally: Improved Algorithms for the Temp Secretary Problem and Extensions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.06926","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:573c7f424827526771cb89af2b6b3e36130f0a17bd55f1e2570ab08054c4dfad","target":"record","created_at":"2026-05-18T01:12:00Z","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":"2c7b2ef9d496b24c21d39315ae85d498b6d6b15cba9b9872bb0d53d3615d7abe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-22T12:31:10Z","title_canon_sha256":"240ffdbfc4b539fdcfdf12a77e93d06a5fe0c07a96911fc8e5b75ad53279c7b5"},"schema_version":"1.0","source":{"id":"1606.06926","kind":"arxiv","version":1}},"canonical_sha256":"324ec4ce9f05c7e800f122027cee6017420d9ef57d8bbb598ce4293b542b36f8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"324ec4ce9f05c7e800f122027cee6017420d9ef57d8bbb598ce4293b542b36f8","first_computed_at":"2026-05-18T01:12:00.898727Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:00.898727Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"INfhM8cT/Tvd/hikyDMTD/k8HVOsE5v7XjfIG8vORH6i6AsdkRgUWhgcLet07Nggu/hvi6OV7qR/6yexKm8xAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:00.899103Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.06926","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:573c7f424827526771cb89af2b6b3e36130f0a17bd55f1e2570ab08054c4dfad","sha256:c9254895267a894d7b95b8fee90ab3424f879f97a9fada2029068b5c5cd67443"],"state_sha256":"081d9e956ea0d93c2d394b68f37cdc23827f03a4436bb9062a47a17b85915546"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fTY78SA4Ano6inW7soEEnlGXd7lXFlBY67UOkJcgAXZrOw08bmUaFKU9Vb/LL4pMefszHI0fOaKmQM7bFn4RAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T21:41:36.088867Z","bundle_sha256":"e142ab1ef3b5dd0bcb6d7e2993b463297d2fc057dc56d750e1d8360bc7f8a471"}}