{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:FYATBQNVVOUNJW3HO4NQ5MFALB","short_pith_number":"pith:FYATBQNV","canonical_record":{"source":{"id":"1502.02155","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-07T16:04:14Z","cross_cats_sorted":["cs.CC","math.OC"],"title_canon_sha256":"6ffae2d6544978148a603aef2d2f697cce751053ef03dfe65b8a18a7fbdc0f3f","abstract_canon_sha256":"2b9470685eb7c8b0ad2738e2434a5c208c90f31fa8b21c16ecad247864f45208"},"schema_version":"1.0"},"canonical_sha256":"2e0130c1b5aba8d4db67771b0eb0a05876285554c89cf3ccc21ec818f408d08b","source":{"kind":"arxiv","id":"1502.02155","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.02155","created_at":"2026-05-18T02:27:43Z"},{"alias_kind":"arxiv_version","alias_value":"1502.02155v1","created_at":"2026-05-18T02:27:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02155","created_at":"2026-05-18T02:27:43Z"},{"alias_kind":"pith_short_12","alias_value":"FYATBQNVVOUN","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"FYATBQNVVOUNJW3H","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"FYATBQNV","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:FYATBQNVVOUNJW3HO4NQ5MFALB","target":"record","payload":{"canonical_record":{"source":{"id":"1502.02155","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-07T16:04:14Z","cross_cats_sorted":["cs.CC","math.OC"],"title_canon_sha256":"6ffae2d6544978148a603aef2d2f697cce751053ef03dfe65b8a18a7fbdc0f3f","abstract_canon_sha256":"2b9470685eb7c8b0ad2738e2434a5c208c90f31fa8b21c16ecad247864f45208"},"schema_version":"1.0"},"canonical_sha256":"2e0130c1b5aba8d4db67771b0eb0a05876285554c89cf3ccc21ec818f408d08b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:43.481048Z","signature_b64":"wntzMhCVtB5XwuVRP86KAhGFm0IKr3a+eZAGiQdc26aR7DNC1kpHJtBC/SMAg0hHyy/t3RLuSMfTeT8hewsTAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e0130c1b5aba8d4db67771b0eb0a05876285554c89cf3ccc21ec818f408d08b","last_reissued_at":"2026-05-18T02:27:43.480522Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:43.480522Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.02155","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-18T02:27:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3ZaWNlMceDotBNkiEImgjMeperLrjlEFHQCXm7GtLuqxUZrH2+CPOxcaq3R5FDoo1baI16DKh89xZcdzxdHiBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T13:32:23.818631Z"},"content_sha256":"b362e5d0c7859ad8d8df697e5918f0ef6def51a1d02754f5328837435ccc3921","schema_version":"1.0","event_id":"sha256:b362e5d0c7859ad8d8df697e5918f0ef6def51a1d02754f5328837435ccc3921"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:FYATBQNVVOUNJW3HO4NQ5MFALB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Secretary Problems with Non-Uniform Arrival Order","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.OC"],"primary_cat":"cs.DS","authors_text":"Rad Niazadeh, Robert Kleinberg, Thomas Kesselheim","submitted_at":"2015-02-07T16:04:14Z","abstract_excerpt":"For many online problems, it is known that the uniform arrival order enables the design of algorithms with much better performance guarantees than under worst-case. The quintessential example is the secretary problem. If the sequence of elements is presented in uniformly random order there is an algorithm that picks the maximum value with probability 1/e, whereas no non-trivial performance guarantee is possible if the elements arrive in worst-case order. This work initiates an investigation into relaxations of the random-ordering hypothesis in online algorithms, by focusing on the secretary pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02155","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-18T02:27:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2oPV3NJKaGS20KGsG1azEvOZU7FJ8o/W0XVQm3001u13N7UFSFmPHj/5yuzLj22t1lDtnW7e6lzm4NILylHhDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T13:32:23.818979Z"},"content_sha256":"983dbadafb3ff388ac117c79b72b3325691200b467257e52b692978a6ebc518e","schema_version":"1.0","event_id":"sha256:983dbadafb3ff388ac117c79b72b3325691200b467257e52b692978a6ebc518e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FYATBQNVVOUNJW3HO4NQ5MFALB/bundle.json","state_url":"https://pith.science/pith/FYATBQNVVOUNJW3HO4NQ5MFALB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FYATBQNVVOUNJW3HO4NQ5MFALB/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-29T13:32:23Z","links":{"resolver":"https://pith.science/pith/FYATBQNVVOUNJW3HO4NQ5MFALB","bundle":"https://pith.science/pith/FYATBQNVVOUNJW3HO4NQ5MFALB/bundle.json","state":"https://pith.science/pith/FYATBQNVVOUNJW3HO4NQ5MFALB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FYATBQNVVOUNJW3HO4NQ5MFALB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:FYATBQNVVOUNJW3HO4NQ5MFALB","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":"2b9470685eb7c8b0ad2738e2434a5c208c90f31fa8b21c16ecad247864f45208","cross_cats_sorted":["cs.CC","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-07T16:04:14Z","title_canon_sha256":"6ffae2d6544978148a603aef2d2f697cce751053ef03dfe65b8a18a7fbdc0f3f"},"schema_version":"1.0","source":{"id":"1502.02155","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.02155","created_at":"2026-05-18T02:27:43Z"},{"alias_kind":"arxiv_version","alias_value":"1502.02155v1","created_at":"2026-05-18T02:27:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02155","created_at":"2026-05-18T02:27:43Z"},{"alias_kind":"pith_short_12","alias_value":"FYATBQNVVOUN","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"FYATBQNVVOUNJW3H","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"FYATBQNV","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:983dbadafb3ff388ac117c79b72b3325691200b467257e52b692978a6ebc518e","target":"graph","created_at":"2026-05-18T02:27:43Z","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":"For many online problems, it is known that the uniform arrival order enables the design of algorithms with much better performance guarantees than under worst-case. The quintessential example is the secretary problem. If the sequence of elements is presented in uniformly random order there is an algorithm that picks the maximum value with probability 1/e, whereas no non-trivial performance guarantee is possible if the elements arrive in worst-case order. This work initiates an investigation into relaxations of the random-ordering hypothesis in online algorithms, by focusing on the secretary pr","authors_text":"Rad Niazadeh, Robert Kleinberg, Thomas Kesselheim","cross_cats":["cs.CC","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-07T16:04:14Z","title":"Secretary Problems with Non-Uniform Arrival Order"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02155","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:b362e5d0c7859ad8d8df697e5918f0ef6def51a1d02754f5328837435ccc3921","target":"record","created_at":"2026-05-18T02:27:43Z","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":"2b9470685eb7c8b0ad2738e2434a5c208c90f31fa8b21c16ecad247864f45208","cross_cats_sorted":["cs.CC","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-07T16:04:14Z","title_canon_sha256":"6ffae2d6544978148a603aef2d2f697cce751053ef03dfe65b8a18a7fbdc0f3f"},"schema_version":"1.0","source":{"id":"1502.02155","kind":"arxiv","version":1}},"canonical_sha256":"2e0130c1b5aba8d4db67771b0eb0a05876285554c89cf3ccc21ec818f408d08b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2e0130c1b5aba8d4db67771b0eb0a05876285554c89cf3ccc21ec818f408d08b","first_computed_at":"2026-05-18T02:27:43.480522Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:27:43.480522Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wntzMhCVtB5XwuVRP86KAhGFm0IKr3a+eZAGiQdc26aR7DNC1kpHJtBC/SMAg0hHyy/t3RLuSMfTeT8hewsTAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:27:43.481048Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.02155","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b362e5d0c7859ad8d8df697e5918f0ef6def51a1d02754f5328837435ccc3921","sha256:983dbadafb3ff388ac117c79b72b3325691200b467257e52b692978a6ebc518e"],"state_sha256":"872ff4c4192182197e85a48d0081c69dff702d9aabc42a0005d7b3a06159b695"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PkWVpWZTzmE+qokb5r/XPtetwDVEVrZBzvrFFoUPiYl3JeCJxt1HXacb9Pj41eZrJIB9SRMKoc5XaRp4+JrdCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T13:32:23.820870Z","bundle_sha256":"165ecd056b35f6033ff43c111997ca8db1e2c38e1a57e2885589cb2326787d45"}}