{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:FWGAFWU37CNQI5M5VRHZ65LLJU","short_pith_number":"pith:FWGAFWU3","schema_version":"1.0","canonical_sha256":"2d8c02da9bf89b04759dac4f9f756b4d19709aa54719ca4579252943c245b877","source":{"kind":"arxiv","id":"1802.06312","version":1},"attestation_state":"computed","paper":{"title":"Counting linear extensions of restricted posets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Igor Pak, Samuel Dittmer","submitted_at":"2018-02-17T23:57:46Z","abstract_excerpt":"The classical 1991 result by Brightwell and Winkler states that the number of linear extensions of a poset is #P-complete. We extend this result to posets with certain restrictions. First, we prove that the number of linear extension for posets of height two is #P-complete. Furthermore, we prove that this holds for incidence posets of graphs. Finally, we prove that the number of linear extensions for posets of dimension two is #P-complete."},"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":"1802.06312","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-17T23:57:46Z","cross_cats_sorted":[],"title_canon_sha256":"58c9c943e0820031b3468cc21958175b7949dc89b3797c11d16a892168a3c0c3","abstract_canon_sha256":"78febeae05fa6ac1bef14c919b1abcb17d7e8afbff253d321d9ed2ce245a8915"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:03.703593Z","signature_b64":"rzQctiv9//dZHpGmlg167N2YjROhKvpXytQJoFJRxY5gOHi+IEbjM+iV0SQKICMYhtgBpWjfh83isqmqBiRzDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d8c02da9bf89b04759dac4f9f756b4d19709aa54719ca4579252943c245b877","last_reissued_at":"2026-05-18T00:23:03.702932Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:03.702932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting linear extensions of restricted posets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Igor Pak, Samuel Dittmer","submitted_at":"2018-02-17T23:57:46Z","abstract_excerpt":"The classical 1991 result by Brightwell and Winkler states that the number of linear extensions of a poset is #P-complete. We extend this result to posets with certain restrictions. First, we prove that the number of linear extension for posets of height two is #P-complete. Furthermore, we prove that this holds for incidence posets of graphs. Finally, we prove that the number of linear extensions for posets of dimension two is #P-complete."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06312","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":"1802.06312","created_at":"2026-05-18T00:23:03.703029+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.06312v1","created_at":"2026-05-18T00:23:03.703029+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06312","created_at":"2026-05-18T00:23:03.703029+00:00"},{"alias_kind":"pith_short_12","alias_value":"FWGAFWU37CNQ","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"FWGAFWU37CNQI5M5","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"FWGAFWU3","created_at":"2026-05-18T12:32:25.280505+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"1907.04243","citing_title":"The Combinatorics of Barrier Synchronization","ref_index":9,"is_internal_anchor":true},{"citing_arxiv_id":"1907.07172","citing_title":"Ordinal pattern probabilities for symmetric random walks","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FWGAFWU37CNQI5M5VRHZ65LLJU","json":"https://pith.science/pith/FWGAFWU37CNQI5M5VRHZ65LLJU.json","graph_json":"https://pith.science/api/pith-number/FWGAFWU37CNQI5M5VRHZ65LLJU/graph.json","events_json":"https://pith.science/api/pith-number/FWGAFWU37CNQI5M5VRHZ65LLJU/events.json","paper":"https://pith.science/paper/FWGAFWU3"},"agent_actions":{"view_html":"https://pith.science/pith/FWGAFWU37CNQI5M5VRHZ65LLJU","download_json":"https://pith.science/pith/FWGAFWU37CNQI5M5VRHZ65LLJU.json","view_paper":"https://pith.science/paper/FWGAFWU3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.06312&json=true","fetch_graph":"https://pith.science/api/pith-number/FWGAFWU37CNQI5M5VRHZ65LLJU/graph.json","fetch_events":"https://pith.science/api/pith-number/FWGAFWU37CNQI5M5VRHZ65LLJU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FWGAFWU37CNQI5M5VRHZ65LLJU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FWGAFWU37CNQI5M5VRHZ65LLJU/action/storage_attestation","attest_author":"https://pith.science/pith/FWGAFWU37CNQI5M5VRHZ65LLJU/action/author_attestation","sign_citation":"https://pith.science/pith/FWGAFWU37CNQI5M5VRHZ65LLJU/action/citation_signature","submit_replication":"https://pith.science/pith/FWGAFWU37CNQI5M5VRHZ65LLJU/action/replication_record"}},"created_at":"2026-05-18T00:23:03.703029+00:00","updated_at":"2026-05-18T00:23:03.703029+00:00"}