{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:4FGKWYRS57D33IBPH4LDRHDTVE","short_pith_number":"pith:4FGKWYRS","canonical_record":{"source":{"id":"2311.00749","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-11-01T18:00:03Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"abe3771df188a5fa6f1e5f1ac94295df553c6c71d8729c113e70539fcd2c5a30","abstract_canon_sha256":"0835bd4dc2e88873e10c9c7345d87ac9b69dd446896758c3d11f1cdde2b04b4d"},"schema_version":"1.0"},"canonical_sha256":"e14cab6232efc7bda02f3f16389c73a9066f40532af7b53970d97ad1f06b9bf4","source":{"kind":"arxiv","id":"2311.00749","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.00749","created_at":"2026-07-05T07:08:14Z"},{"alias_kind":"arxiv_version","alias_value":"2311.00749v1","created_at":"2026-07-05T07:08:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.00749","created_at":"2026-07-05T07:08:14Z"},{"alias_kind":"pith_short_12","alias_value":"4FGKWYRS57D3","created_at":"2026-07-05T07:08:14Z"},{"alias_kind":"pith_short_16","alias_value":"4FGKWYRS57D33IBP","created_at":"2026-07-05T07:08:14Z"},{"alias_kind":"pith_short_8","alias_value":"4FGKWYRS","created_at":"2026-07-05T07:08:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:4FGKWYRS57D33IBPH4LDRHDTVE","target":"record","payload":{"canonical_record":{"source":{"id":"2311.00749","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-11-01T18:00:03Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"abe3771df188a5fa6f1e5f1ac94295df553c6c71d8729c113e70539fcd2c5a30","abstract_canon_sha256":"0835bd4dc2e88873e10c9c7345d87ac9b69dd446896758c3d11f1cdde2b04b4d"},"schema_version":"1.0"},"canonical_sha256":"e14cab6232efc7bda02f3f16389c73a9066f40532af7b53970d97ad1f06b9bf4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:08:14.786556Z","signature_b64":"5iFYH8ZYCCMMWQ1fhfuUmzoKTXh+CHtZWWO6FSmAKb4jEnScjACf62F4Jk4XFFsAKRckBAzo1MfkZvpYc7BmCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e14cab6232efc7bda02f3f16389c73a9066f40532af7b53970d97ad1f06b9bf4","last_reissued_at":"2026-07-05T07:08:14.786119Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:08:14.786119Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2311.00749","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-05T07:08:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VfESibkkjpbIcXMFyub1LAm40d/9+uNAhjtN+yzujjNBtObBsI14fPnQlWs+RcinTMWXWMnIih/icRuT7RklCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T05:13:07.547669Z"},"content_sha256":"1e8de7de43d7b25bc20fec31a7136e94b82255572220e5955dc8f52a47075a1f","schema_version":"1.0","event_id":"sha256:1e8de7de43d7b25bc20fec31a7136e94b82255572220e5955dc8f52a47075a1f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:4FGKWYRS57D33IBPH4LDRHDTVE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sorting with Predictions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Christian Coester, Xingjian Bai","submitted_at":"2023-11-01T18:00:03Z","abstract_excerpt":"We explore the fundamental problem of sorting through the lens of learning-augmented algorithms, where algorithms can leverage possibly erroneous predictions to improve their efficiency. We consider two different settings: In the first setting, each item is provided a prediction of its position in the sorted list. In the second setting, we assume there is a \"quick-and-dirty\" way of comparing items, in addition to slow-and-exact comparisons. For both settings, we design new and simple algorithms using only $O(\\sum_i \\log \\eta_i)$ exact comparisons, where $\\eta_i$ is a suitably defined predictio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.00749","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/2311.00749/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-05T07:08:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1GNgXMzjBOryiSM6PtBJ7Cl6rYvSpPXFacV+ImdetLH5o1xpcBNllE4aSbnVBynJL9R0bc/1u3RGncm04oEEDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T05:13:07.548174Z"},"content_sha256":"559b15d85ac1199d342dac8899540f8f69d2627ae2cd27c2db133cead38ef7c1","schema_version":"1.0","event_id":"sha256:559b15d85ac1199d342dac8899540f8f69d2627ae2cd27c2db133cead38ef7c1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4FGKWYRS57D33IBPH4LDRHDTVE/bundle.json","state_url":"https://pith.science/pith/4FGKWYRS57D33IBPH4LDRHDTVE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4FGKWYRS57D33IBPH4LDRHDTVE/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-08T05:13:07Z","links":{"resolver":"https://pith.science/pith/4FGKWYRS57D33IBPH4LDRHDTVE","bundle":"https://pith.science/pith/4FGKWYRS57D33IBPH4LDRHDTVE/bundle.json","state":"https://pith.science/pith/4FGKWYRS57D33IBPH4LDRHDTVE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4FGKWYRS57D33IBPH4LDRHDTVE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:4FGKWYRS57D33IBPH4LDRHDTVE","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":"0835bd4dc2e88873e10c9c7345d87ac9b69dd446896758c3d11f1cdde2b04b4d","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-11-01T18:00:03Z","title_canon_sha256":"abe3771df188a5fa6f1e5f1ac94295df553c6c71d8729c113e70539fcd2c5a30"},"schema_version":"1.0","source":{"id":"2311.00749","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.00749","created_at":"2026-07-05T07:08:14Z"},{"alias_kind":"arxiv_version","alias_value":"2311.00749v1","created_at":"2026-07-05T07:08:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.00749","created_at":"2026-07-05T07:08:14Z"},{"alias_kind":"pith_short_12","alias_value":"4FGKWYRS57D3","created_at":"2026-07-05T07:08:14Z"},{"alias_kind":"pith_short_16","alias_value":"4FGKWYRS57D33IBP","created_at":"2026-07-05T07:08:14Z"},{"alias_kind":"pith_short_8","alias_value":"4FGKWYRS","created_at":"2026-07-05T07:08:14Z"}],"graph_snapshots":[{"event_id":"sha256:559b15d85ac1199d342dac8899540f8f69d2627ae2cd27c2db133cead38ef7c1","target":"graph","created_at":"2026-07-05T07:08:14Z","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/2311.00749/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We explore the fundamental problem of sorting through the lens of learning-augmented algorithms, where algorithms can leverage possibly erroneous predictions to improve their efficiency. We consider two different settings: In the first setting, each item is provided a prediction of its position in the sorted list. In the second setting, we assume there is a \"quick-and-dirty\" way of comparing items, in addition to slow-and-exact comparisons. For both settings, we design new and simple algorithms using only $O(\\sum_i \\log \\eta_i)$ exact comparisons, where $\\eta_i$ is a suitably defined predictio","authors_text":"Christian Coester, Xingjian Bai","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-11-01T18:00:03Z","title":"Sorting with Predictions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.00749","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:1e8de7de43d7b25bc20fec31a7136e94b82255572220e5955dc8f52a47075a1f","target":"record","created_at":"2026-07-05T07:08:14Z","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":"0835bd4dc2e88873e10c9c7345d87ac9b69dd446896758c3d11f1cdde2b04b4d","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-11-01T18:00:03Z","title_canon_sha256":"abe3771df188a5fa6f1e5f1ac94295df553c6c71d8729c113e70539fcd2c5a30"},"schema_version":"1.0","source":{"id":"2311.00749","kind":"arxiv","version":1}},"canonical_sha256":"e14cab6232efc7bda02f3f16389c73a9066f40532af7b53970d97ad1f06b9bf4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e14cab6232efc7bda02f3f16389c73a9066f40532af7b53970d97ad1f06b9bf4","first_computed_at":"2026-07-05T07:08:14.786119Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:08:14.786119Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5iFYH8ZYCCMMWQ1fhfuUmzoKTXh+CHtZWWO6FSmAKb4jEnScjACf62F4Jk4XFFsAKRckBAzo1MfkZvpYc7BmCw==","signature_status":"signed_v1","signed_at":"2026-07-05T07:08:14.786556Z","signed_message":"canonical_sha256_bytes"},"source_id":"2311.00749","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1e8de7de43d7b25bc20fec31a7136e94b82255572220e5955dc8f52a47075a1f","sha256:559b15d85ac1199d342dac8899540f8f69d2627ae2cd27c2db133cead38ef7c1"],"state_sha256":"fed139993cba5b1c73d85bf3445521c7d0fe8b88474f17ad376bbc2552d49c8c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ALSxIRTJQIwDh/rm0hgiWKXR694Zed57fYimCZ9c0hBTPmR7u2UmR/+4zFcfod0pNChLly1jiehovIxVwkjHAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T05:13:07.552052Z","bundle_sha256":"c8eca90183ea198fb57d9655888021db0699bd5d36e6511b4e0afdeebca0935e"}}