{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:OLLDVGPPBAZVRTLHPNVKUASV66","short_pith_number":"pith:OLLDVGPP","schema_version":"1.0","canonical_sha256":"72d63a99ef083358cd677b6aaa0255f797826a648136e77a4354a9f20ecdcd90","source":{"kind":"arxiv","id":"0911.0086","version":3},"attestation_state":"computed","paper":{"title":"Sorting under Partial Information (without the Ellipsoid Algorithm)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Gwena\\\"el Joret, Jean Cardinal, J. Ian Munro, Rapha\\\"el Jungers, Samuel Fiorini","submitted_at":"2009-10-31T14:36:36Z","abstract_excerpt":"We revisit the well-known problem of sorting under partial information: sort a finite set given the outcomes of comparisons between some pairs of elements. The input is a partially ordered set P, and solving the problem amounts to discovering an unknown linear extension of P, using pairwise comparisons. The information-theoretic lower bound on the number of comparisons needed in the worst case is log e(P), the binary logarithm of the number of linear extensions of P. In a breakthrough paper, Jeff Kahn and Jeong Han Kim (J. Comput. System Sci. 51 (3), 390-399, 1995) showed that there exists a p"},"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":"0911.0086","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-10-31T14:36:36Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"79cb92db4115ce5a13041c8dd2a30b2c265df93e2339046fc4e8b0acb2a0df7d","abstract_canon_sha256":"730e22c6dd3574540cd8a45c082a045d986fe41d597aae9e57fcc3159def7641"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:05.215374Z","signature_b64":"bMJ1GLhPqyuwd3oLWjhyt9pDB7SW3xIYPR8fPNLMk9JTSN9JfV70lk/150gibHK4MA0JEgM/1eYi828KjEskAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72d63a99ef083358cd677b6aaa0255f797826a648136e77a4354a9f20ecdcd90","last_reissued_at":"2026-05-18T03:36:05.214829Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:05.214829Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sorting under Partial Information (without the Ellipsoid Algorithm)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Gwena\\\"el Joret, Jean Cardinal, J. Ian Munro, Rapha\\\"el Jungers, Samuel Fiorini","submitted_at":"2009-10-31T14:36:36Z","abstract_excerpt":"We revisit the well-known problem of sorting under partial information: sort a finite set given the outcomes of comparisons between some pairs of elements. The input is a partially ordered set P, and solving the problem amounts to discovering an unknown linear extension of P, using pairwise comparisons. The information-theoretic lower bound on the number of comparisons needed in the worst case is log e(P), the binary logarithm of the number of linear extensions of P. In a breakthrough paper, Jeff Kahn and Jeong Han Kim (J. Comput. System Sci. 51 (3), 390-399, 1995) showed that there exists a p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.0086","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":"0911.0086","created_at":"2026-05-18T03:36:05.214912+00:00"},{"alias_kind":"arxiv_version","alias_value":"0911.0086v3","created_at":"2026-05-18T03:36:05.214912+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.0086","created_at":"2026-05-18T03:36:05.214912+00:00"},{"alias_kind":"pith_short_12","alias_value":"OLLDVGPPBAZV","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_16","alias_value":"OLLDVGPPBAZVRTLH","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_8","alias_value":"OLLDVGPP","created_at":"2026-05-18T12:26:01.383474+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/OLLDVGPPBAZVRTLHPNVKUASV66","json":"https://pith.science/pith/OLLDVGPPBAZVRTLHPNVKUASV66.json","graph_json":"https://pith.science/api/pith-number/OLLDVGPPBAZVRTLHPNVKUASV66/graph.json","events_json":"https://pith.science/api/pith-number/OLLDVGPPBAZVRTLHPNVKUASV66/events.json","paper":"https://pith.science/paper/OLLDVGPP"},"agent_actions":{"view_html":"https://pith.science/pith/OLLDVGPPBAZVRTLHPNVKUASV66","download_json":"https://pith.science/pith/OLLDVGPPBAZVRTLHPNVKUASV66.json","view_paper":"https://pith.science/paper/OLLDVGPP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0911.0086&json=true","fetch_graph":"https://pith.science/api/pith-number/OLLDVGPPBAZVRTLHPNVKUASV66/graph.json","fetch_events":"https://pith.science/api/pith-number/OLLDVGPPBAZVRTLHPNVKUASV66/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OLLDVGPPBAZVRTLHPNVKUASV66/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OLLDVGPPBAZVRTLHPNVKUASV66/action/storage_attestation","attest_author":"https://pith.science/pith/OLLDVGPPBAZVRTLHPNVKUASV66/action/author_attestation","sign_citation":"https://pith.science/pith/OLLDVGPPBAZVRTLHPNVKUASV66/action/citation_signature","submit_replication":"https://pith.science/pith/OLLDVGPPBAZVRTLHPNVKUASV66/action/replication_record"}},"created_at":"2026-05-18T03:36:05.214912+00:00","updated_at":"2026-05-18T03:36:05.214912+00:00"}