{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:XK4PH27PG3DCXKI66YAL4V4JBZ","short_pith_number":"pith:XK4PH27P","canonical_record":{"source":{"id":"1811.06444","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-15T15:59:28Z","cross_cats_sorted":[],"title_canon_sha256":"8994a2dbbdf083dbc1874ba1a56ae07a9eddbee6a1071555b04fcce571f2cc58","abstract_canon_sha256":"3eab7d88ea4ed76cadf94bf3a5028c0d5cf4271cce464c271d4d9a26191dfe4a"},"schema_version":"1.0"},"canonical_sha256":"bab8f3ebef36c62ba91ef600be57890e5971d47b75df0e2eda1e810dae1f04e9","source":{"kind":"arxiv","id":"1811.06444","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.06444","created_at":"2026-05-18T00:00:37Z"},{"alias_kind":"arxiv_version","alias_value":"1811.06444v1","created_at":"2026-05-18T00:00:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.06444","created_at":"2026-05-18T00:00:37Z"},{"alias_kind":"pith_short_12","alias_value":"XK4PH27PG3DC","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XK4PH27PG3DCXKI6","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XK4PH27P","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:XK4PH27PG3DCXKI66YAL4V4JBZ","target":"record","payload":{"canonical_record":{"source":{"id":"1811.06444","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-15T15:59:28Z","cross_cats_sorted":[],"title_canon_sha256":"8994a2dbbdf083dbc1874ba1a56ae07a9eddbee6a1071555b04fcce571f2cc58","abstract_canon_sha256":"3eab7d88ea4ed76cadf94bf3a5028c0d5cf4271cce464c271d4d9a26191dfe4a"},"schema_version":"1.0"},"canonical_sha256":"bab8f3ebef36c62ba91ef600be57890e5971d47b75df0e2eda1e810dae1f04e9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:37.669122Z","signature_b64":"bjugkBNG0bI0evNJYp4TO69MFvXKwXxXqNBSWHjfvOH6E90vJf6fuO7Rw/W9AO9RJ4xbHwKqOalYyKe+kEzgBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bab8f3ebef36c62ba91ef600be57890e5971d47b75df0e2eda1e810dae1f04e9","last_reissued_at":"2026-05-18T00:00:37.668699Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:37.668699Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.06444","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-18T00:00:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HIKPGXxTbYpKN/6LrcXP4poJtfsXEfG6tjO3Z67s5lnBOMJfla2LrW7bMbKHVGCluSGwyJyUQZjW9+Y6zEa4Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T04:00:08.890773Z"},"content_sha256":"c9d9e9dc4f624d4a5bda70f5c6e3d690c24732e766c2c7054fd91316e90e70c9","schema_version":"1.0","event_id":"sha256:c9d9e9dc4f624d4a5bda70f5c6e3d690c24732e766c2c7054fd91316e90e70c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:XK4PH27PG3DCXKI66YAL4V4JBZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Secretary Ranking with Minimal Inversions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Eric Balkanski, Renato Paes Leme, Sepehr Assadi","submitted_at":"2018-11-15T15:59:28Z","abstract_excerpt":"We study a twist on the classic secretary problem, which we term the secretary ranking problem: elements from an ordered set arrive in random order and instead of picking the maximum element, the algorithm is asked to assign a rank, or position, to each of the elements. The rank assigned is irrevocable and is given knowing only the pairwise comparisons with elements previously arrived. The goal is to minimize the distance of the rank produced to the true rank of the elements measured by the Kendall-Tau distance, which corresponds to the number of pairs that are inverted with respect to the tru"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.06444","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-18T00:00:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OxeEJ5HRCKz2JqNuvESgJffcQ7Qb6L7bdmL8eqE0BpPhNDNpLiK3c0/de+lpSmyz+tHH1JVLB/PI8rk69GXMAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T04:00:08.891464Z"},"content_sha256":"f0019d9ba25a93c8fc660840ec5d5f27016a7e2ebbe746caf8f82464334c6929","schema_version":"1.0","event_id":"sha256:f0019d9ba25a93c8fc660840ec5d5f27016a7e2ebbe746caf8f82464334c6929"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XK4PH27PG3DCXKI66YAL4V4JBZ/bundle.json","state_url":"https://pith.science/pith/XK4PH27PG3DCXKI66YAL4V4JBZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XK4PH27PG3DCXKI66YAL4V4JBZ/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-05-30T04:00:08Z","links":{"resolver":"https://pith.science/pith/XK4PH27PG3DCXKI66YAL4V4JBZ","bundle":"https://pith.science/pith/XK4PH27PG3DCXKI66YAL4V4JBZ/bundle.json","state":"https://pith.science/pith/XK4PH27PG3DCXKI66YAL4V4JBZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XK4PH27PG3DCXKI66YAL4V4JBZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XK4PH27PG3DCXKI66YAL4V4JBZ","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":"3eab7d88ea4ed76cadf94bf3a5028c0d5cf4271cce464c271d4d9a26191dfe4a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-15T15:59:28Z","title_canon_sha256":"8994a2dbbdf083dbc1874ba1a56ae07a9eddbee6a1071555b04fcce571f2cc58"},"schema_version":"1.0","source":{"id":"1811.06444","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.06444","created_at":"2026-05-18T00:00:37Z"},{"alias_kind":"arxiv_version","alias_value":"1811.06444v1","created_at":"2026-05-18T00:00:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.06444","created_at":"2026-05-18T00:00:37Z"},{"alias_kind":"pith_short_12","alias_value":"XK4PH27PG3DC","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XK4PH27PG3DCXKI6","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XK4PH27P","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:f0019d9ba25a93c8fc660840ec5d5f27016a7e2ebbe746caf8f82464334c6929","target":"graph","created_at":"2026-05-18T00:00:37Z","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":"We study a twist on the classic secretary problem, which we term the secretary ranking problem: elements from an ordered set arrive in random order and instead of picking the maximum element, the algorithm is asked to assign a rank, or position, to each of the elements. The rank assigned is irrevocable and is given knowing only the pairwise comparisons with elements previously arrived. The goal is to minimize the distance of the rank produced to the true rank of the elements measured by the Kendall-Tau distance, which corresponds to the number of pairs that are inverted with respect to the tru","authors_text":"Eric Balkanski, Renato Paes Leme, Sepehr Assadi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-15T15:59:28Z","title":"Secretary Ranking with Minimal Inversions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.06444","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:c9d9e9dc4f624d4a5bda70f5c6e3d690c24732e766c2c7054fd91316e90e70c9","target":"record","created_at":"2026-05-18T00:00:37Z","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":"3eab7d88ea4ed76cadf94bf3a5028c0d5cf4271cce464c271d4d9a26191dfe4a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-15T15:59:28Z","title_canon_sha256":"8994a2dbbdf083dbc1874ba1a56ae07a9eddbee6a1071555b04fcce571f2cc58"},"schema_version":"1.0","source":{"id":"1811.06444","kind":"arxiv","version":1}},"canonical_sha256":"bab8f3ebef36c62ba91ef600be57890e5971d47b75df0e2eda1e810dae1f04e9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bab8f3ebef36c62ba91ef600be57890e5971d47b75df0e2eda1e810dae1f04e9","first_computed_at":"2026-05-18T00:00:37.668699Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:37.668699Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bjugkBNG0bI0evNJYp4TO69MFvXKwXxXqNBSWHjfvOH6E90vJf6fuO7Rw/W9AO9RJ4xbHwKqOalYyKe+kEzgBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:37.669122Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.06444","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c9d9e9dc4f624d4a5bda70f5c6e3d690c24732e766c2c7054fd91316e90e70c9","sha256:f0019d9ba25a93c8fc660840ec5d5f27016a7e2ebbe746caf8f82464334c6929"],"state_sha256":"5177b55d3fc4c783bc52ffbbfb5d1131809c285c1a57aee4d0960783880d4484"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G3uJJeLH0pNHUYQ7QGiBu44r3n4jKxJj9e615WvRDv+OI91xeNrymNjKc0VTUc5jbYptlWKyNZG0Jk7ryHY+Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T04:00:08.896571Z","bundle_sha256":"d01a453fe0c194a9f872c56e72dbf4dae657c93ed50f31900a1650dd625b6fe8"}}