{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:OLLDVGPPBAZVRTLHPNVKUASV66","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":"730e22c6dd3574540cd8a45c082a045d986fe41d597aae9e57fcc3159def7641","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-10-31T14:36:36Z","title_canon_sha256":"79cb92db4115ce5a13041c8dd2a30b2c265df93e2339046fc4e8b0acb2a0df7d"},"schema_version":"1.0","source":{"id":"0911.0086","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0911.0086","created_at":"2026-05-18T03:36:05Z"},{"alias_kind":"arxiv_version","alias_value":"0911.0086v3","created_at":"2026-05-18T03:36:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.0086","created_at":"2026-05-18T03:36:05Z"},{"alias_kind":"pith_short_12","alias_value":"OLLDVGPPBAZV","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"OLLDVGPPBAZVRTLH","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"OLLDVGPP","created_at":"2026-05-18T12:26:01Z"}],"graph_snapshots":[{"event_id":"sha256:31924ecd047c0bc44b5d1bf0c434988cb8837592fb556cacd05edb3f03c5bb5f","target":"graph","created_at":"2026-05-18T03:36:05Z","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 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","authors_text":"Gwena\\\"el Joret, Jean Cardinal, J. Ian Munro, Rapha\\\"el Jungers, Samuel Fiorini","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-10-31T14:36:36Z","title":"Sorting under Partial Information (without the Ellipsoid Algorithm)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.0086","kind":"arxiv","version":3},"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:ad6c26cef29d1cf7f9582fc8a686969332312f9a636593f79189d17bf79e9659","target":"record","created_at":"2026-05-18T03:36:05Z","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":"730e22c6dd3574540cd8a45c082a045d986fe41d597aae9e57fcc3159def7641","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-10-31T14:36:36Z","title_canon_sha256":"79cb92db4115ce5a13041c8dd2a30b2c265df93e2339046fc4e8b0acb2a0df7d"},"schema_version":"1.0","source":{"id":"0911.0086","kind":"arxiv","version":3}},"canonical_sha256":"72d63a99ef083358cd677b6aaa0255f797826a648136e77a4354a9f20ecdcd90","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"72d63a99ef083358cd677b6aaa0255f797826a648136e77a4354a9f20ecdcd90","first_computed_at":"2026-05-18T03:36:05.214829Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:36:05.214829Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bMJ1GLhPqyuwd3oLWjhyt9pDB7SW3xIYPR8fPNLMk9JTSN9JfV70lk/150gibHK4MA0JEgM/1eYi828KjEskAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:36:05.215374Z","signed_message":"canonical_sha256_bytes"},"source_id":"0911.0086","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad6c26cef29d1cf7f9582fc8a686969332312f9a636593f79189d17bf79e9659","sha256:31924ecd047c0bc44b5d1bf0c434988cb8837592fb556cacd05edb3f03c5bb5f"],"state_sha256":"887c3e17146f766c5149b60c24acf26b24407080aea14830f61e5825bd450ef7"}