{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ECAEG4JAJIJBCVYDGI4Q4XQIPY","short_pith_number":"pith:ECAEG4JA","schema_version":"1.0","canonical_sha256":"20804371204a1211570332390e5e087e0ee4b09c8b0871b1aa3875898c2440d7","source":{"kind":"arxiv","id":"1702.03989","version":3},"attestation_state":"computed","paper":{"title":"Selecting with History","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sivan Sabato, Tom Hess","submitted_at":"2017-02-13T21:19:32Z","abstract_excerpt":"We define a new selection problem, \\emph{Selecting with History}, which extends the secretary problem to a setting with historical information. We propose a strategy for this problem and calculate its success probability in the limit of a large sequence."},"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":"1702.03989","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-13T21:19:32Z","cross_cats_sorted":[],"title_canon_sha256":"3f56182fe0dd4f8680835b3f66ae6539d54ef7dfc86e0a1d23b705118bae71d8","abstract_canon_sha256":"91590eca0827e3c06196a2b135953b19e5e89510111f9e3f3cda601fa6fde858"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:47.625123Z","signature_b64":"rrb3rksSjfeRLq+jk2ePTE1vub14Oy6QwZ/yFRbBuIGBCELdXd0+vRqqFa+/JscdpL0kB0xsW3s9IhYPVV5bCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20804371204a1211570332390e5e087e0ee4b09c8b0871b1aa3875898c2440d7","last_reissued_at":"2026-05-18T00:04:47.624408Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:47.624408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Selecting with History","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sivan Sabato, Tom Hess","submitted_at":"2017-02-13T21:19:32Z","abstract_excerpt":"We define a new selection problem, \\emph{Selecting with History}, which extends the secretary problem to a setting with historical information. We propose a strategy for this problem and calculate its success probability in the limit of a large sequence."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.03989","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1702.03989","created_at":"2026-05-18T00:04:47.624516+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.03989v3","created_at":"2026-05-18T00:04:47.624516+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.03989","created_at":"2026-05-18T00:04:47.624516+00:00"},{"alias_kind":"pith_short_12","alias_value":"ECAEG4JAJIJB","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"ECAEG4JAJIJBCVYD","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"ECAEG4JA","created_at":"2026-05-18T12:31:12.930513+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ECAEG4JAJIJBCVYDGI4Q4XQIPY","json":"https://pith.science/pith/ECAEG4JAJIJBCVYDGI4Q4XQIPY.json","graph_json":"https://pith.science/api/pith-number/ECAEG4JAJIJBCVYDGI4Q4XQIPY/graph.json","events_json":"https://pith.science/api/pith-number/ECAEG4JAJIJBCVYDGI4Q4XQIPY/events.json","paper":"https://pith.science/paper/ECAEG4JA"},"agent_actions":{"view_html":"https://pith.science/pith/ECAEG4JAJIJBCVYDGI4Q4XQIPY","download_json":"https://pith.science/pith/ECAEG4JAJIJBCVYDGI4Q4XQIPY.json","view_paper":"https://pith.science/paper/ECAEG4JA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.03989&json=true","fetch_graph":"https://pith.science/api/pith-number/ECAEG4JAJIJBCVYDGI4Q4XQIPY/graph.json","fetch_events":"https://pith.science/api/pith-number/ECAEG4JAJIJBCVYDGI4Q4XQIPY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ECAEG4JAJIJBCVYDGI4Q4XQIPY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ECAEG4JAJIJBCVYDGI4Q4XQIPY/action/storage_attestation","attest_author":"https://pith.science/pith/ECAEG4JAJIJBCVYDGI4Q4XQIPY/action/author_attestation","sign_citation":"https://pith.science/pith/ECAEG4JAJIJBCVYDGI4Q4XQIPY/action/citation_signature","submit_replication":"https://pith.science/pith/ECAEG4JAJIJBCVYDGI4Q4XQIPY/action/replication_record"}},"created_at":"2026-05-18T00:04:47.624516+00:00","updated_at":"2026-05-18T00:04:47.624516+00:00"}