{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:UPISMCCARR6P2C6AZ5WG7IANA4","short_pith_number":"pith:UPISMCCA","schema_version":"1.0","canonical_sha256":"a3d12608408c7cfd0bc0cf6c6fa00d070907aa5ac4bb4d331eeda41059f4ef81","source":{"kind":"arxiv","id":"1603.02901","version":3},"attestation_state":"computed","paper":{"title":"Linear Extensions and Comparable Pairs in Partial Orders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Colin McDiarmid, David Penman, Vasileios Iliopoulos","submitted_at":"2016-03-09T14:39:51Z","abstract_excerpt":"We study the number of linear extensions of a partial order with a given proportion of comparable pairs of elements, and estimate the maximum and minimum possible numbers. We also consider a random interval partial order on $n$ elements, which has close to a third of the pairs comparable with high probability: we show that the number of linear extensions is $n! \\, 2^{-\\Theta(n)}$ with high probability."},"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":"1603.02901","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-09T14:39:51Z","cross_cats_sorted":[],"title_canon_sha256":"709fcc87f83007ff23fbd4127c98a78580a76976b350e82b6fbca9e0a32d9486","abstract_canon_sha256":"8876747f07fcb27ac4353b3c919927df7fa264e8fc84c8563913a58e2becb68f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:25.409424Z","signature_b64":"VcBmSFn2dCy+5WJYaHVktuF3axuUxQ2QrsDzBLedtKej1QeFh9+sDY7rLWu+nxykNA0kzMOo3jgaLI5pPUKoCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3d12608408c7cfd0bc0cf6c6fa00d070907aa5ac4bb4d331eeda41059f4ef81","last_reissued_at":"2026-05-18T00:03:25.408981Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:25.408981Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear Extensions and Comparable Pairs in Partial Orders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Colin McDiarmid, David Penman, Vasileios Iliopoulos","submitted_at":"2016-03-09T14:39:51Z","abstract_excerpt":"We study the number of linear extensions of a partial order with a given proportion of comparable pairs of elements, and estimate the maximum and minimum possible numbers. We also consider a random interval partial order on $n$ elements, which has close to a third of the pairs comparable with high probability: we show that the number of linear extensions is $n! \\, 2^{-\\Theta(n)}$ with high probability."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.02901","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":"1603.02901","created_at":"2026-05-18T00:03:25.409045+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.02901v3","created_at":"2026-05-18T00:03:25.409045+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.02901","created_at":"2026-05-18T00:03:25.409045+00:00"},{"alias_kind":"pith_short_12","alias_value":"UPISMCCARR6P","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"UPISMCCARR6P2C6A","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"UPISMCCA","created_at":"2026-05-18T12:30:46.583412+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/UPISMCCARR6P2C6AZ5WG7IANA4","json":"https://pith.science/pith/UPISMCCARR6P2C6AZ5WG7IANA4.json","graph_json":"https://pith.science/api/pith-number/UPISMCCARR6P2C6AZ5WG7IANA4/graph.json","events_json":"https://pith.science/api/pith-number/UPISMCCARR6P2C6AZ5WG7IANA4/events.json","paper":"https://pith.science/paper/UPISMCCA"},"agent_actions":{"view_html":"https://pith.science/pith/UPISMCCARR6P2C6AZ5WG7IANA4","download_json":"https://pith.science/pith/UPISMCCARR6P2C6AZ5WG7IANA4.json","view_paper":"https://pith.science/paper/UPISMCCA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.02901&json=true","fetch_graph":"https://pith.science/api/pith-number/UPISMCCARR6P2C6AZ5WG7IANA4/graph.json","fetch_events":"https://pith.science/api/pith-number/UPISMCCARR6P2C6AZ5WG7IANA4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UPISMCCARR6P2C6AZ5WG7IANA4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UPISMCCARR6P2C6AZ5WG7IANA4/action/storage_attestation","attest_author":"https://pith.science/pith/UPISMCCARR6P2C6AZ5WG7IANA4/action/author_attestation","sign_citation":"https://pith.science/pith/UPISMCCARR6P2C6AZ5WG7IANA4/action/citation_signature","submit_replication":"https://pith.science/pith/UPISMCCARR6P2C6AZ5WG7IANA4/action/replication_record"}},"created_at":"2026-05-18T00:03:25.409045+00:00","updated_at":"2026-05-18T00:03:25.409045+00:00"}