{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:2HCUGBP5E54BSBI2NTSW7ULNI4","short_pith_number":"pith:2HCUGBP5","schema_version":"1.0","canonical_sha256":"d1c54305fd277819051a6ce56fd16d4719e016b003910accd7b8213c084f89aa","source":{"kind":"arxiv","id":"1902.00219","version":1},"attestation_state":"computed","paper":{"title":"A note on self-improving sorting with hidden partitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Kai Jin, Man-Kwun Chiu, Siu-Wing Cheng","submitted_at":"2019-02-01T08:26:43Z","abstract_excerpt":"We study self-improving sorting with hidden partitions. Our result is an optimal algorithm which runs in expected time O(H(\\pi(I)) + n), where I is the given input which contains n elements to be sorted, \\pi(I) is the output which are the ranks of all element in I, and H(\\pi(I)) denotes the entropy of the output."},"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":"1902.00219","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-02-01T08:26:43Z","cross_cats_sorted":[],"title_canon_sha256":"68598dde39a148e16e8afc1411b8dc8aab72e92d6b8d4be36092e60da8128003","abstract_canon_sha256":"9355861d5fa70d105b3900fee902033d821463108c659e7693368e9739bddaa6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:57.999214Z","signature_b64":"BiOoWe2NrhZMY+BPlzzgjIigEQyX4E1nqM5vz0G1X7+AbcGOVD+724Tc04Mmymd8/dvktR5e37PmNlSJ4KAdDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1c54305fd277819051a6ce56fd16d4719e016b003910accd7b8213c084f89aa","last_reissued_at":"2026-05-17T23:54:57.998752Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:57.998752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on self-improving sorting with hidden partitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Kai Jin, Man-Kwun Chiu, Siu-Wing Cheng","submitted_at":"2019-02-01T08:26:43Z","abstract_excerpt":"We study self-improving sorting with hidden partitions. Our result is an optimal algorithm which runs in expected time O(H(\\pi(I)) + n), where I is the given input which contains n elements to be sorted, \\pi(I) is the output which are the ranks of all element in I, and H(\\pi(I)) denotes the entropy of the output."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.00219","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1902.00219","created_at":"2026-05-17T23:54:57.998815+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.00219v1","created_at":"2026-05-17T23:54:57.998815+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00219","created_at":"2026-05-17T23:54:57.998815+00:00"},{"alias_kind":"pith_short_12","alias_value":"2HCUGBP5E54B","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"2HCUGBP5E54BSBI2","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"2HCUGBP5","created_at":"2026-05-18T12:33:07.085635+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/2HCUGBP5E54BSBI2NTSW7ULNI4","json":"https://pith.science/pith/2HCUGBP5E54BSBI2NTSW7ULNI4.json","graph_json":"https://pith.science/api/pith-number/2HCUGBP5E54BSBI2NTSW7ULNI4/graph.json","events_json":"https://pith.science/api/pith-number/2HCUGBP5E54BSBI2NTSW7ULNI4/events.json","paper":"https://pith.science/paper/2HCUGBP5"},"agent_actions":{"view_html":"https://pith.science/pith/2HCUGBP5E54BSBI2NTSW7ULNI4","download_json":"https://pith.science/pith/2HCUGBP5E54BSBI2NTSW7ULNI4.json","view_paper":"https://pith.science/paper/2HCUGBP5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.00219&json=true","fetch_graph":"https://pith.science/api/pith-number/2HCUGBP5E54BSBI2NTSW7ULNI4/graph.json","fetch_events":"https://pith.science/api/pith-number/2HCUGBP5E54BSBI2NTSW7ULNI4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2HCUGBP5E54BSBI2NTSW7ULNI4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2HCUGBP5E54BSBI2NTSW7ULNI4/action/storage_attestation","attest_author":"https://pith.science/pith/2HCUGBP5E54BSBI2NTSW7ULNI4/action/author_attestation","sign_citation":"https://pith.science/pith/2HCUGBP5E54BSBI2NTSW7ULNI4/action/citation_signature","submit_replication":"https://pith.science/pith/2HCUGBP5E54BSBI2NTSW7ULNI4/action/replication_record"}},"created_at":"2026-05-17T23:54:57.998815+00:00","updated_at":"2026-05-17T23:54:57.998815+00:00"}