{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:D7FHGLHL5ZFLWNRN2LWNE3EV2K","short_pith_number":"pith:D7FHGLHL","schema_version":"1.0","canonical_sha256":"1fca732cebee4abb362dd2ecd26c95d2918ec546ec9b3fcd92cc1e9f9aae03b8","source":{"kind":"arxiv","id":"1807.06397","version":3},"attestation_state":"computed","paper":{"title":"Expressing Linear Orders Requires Exponential-Size DNNFs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LO"],"primary_cat":"cs.CC","authors_text":"Ronald de Haan","submitted_at":"2018-07-17T13:02:55Z","abstract_excerpt":"We show that any DNNF circuit that expresses the set of linear orders over a set of $n$ candidates must be of size $2^{\\Omega(n)}$. Moreover, we show that there exist DNNF circuits of size $2^{O(n)}$ expressing linear orders over $n$ candidates."},"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":"1807.06397","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-07-17T13:02:55Z","cross_cats_sorted":["cs.AI","cs.LO"],"title_canon_sha256":"73257e80f3ed03be601b7876c4faeb6a26d0b054431d0601b2dbbd8514b07b2a","abstract_canon_sha256":"7129d73a5482555edf5edd8c7d2f32f78b4ee0e0a47d7a485f33c93e1721a5ed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:43.152869Z","signature_b64":"SbHnBDRjhupAgEu7cy0ptbbEFvy7n+1ioanM2dQVrHdgqjojgkF/2WthdcAGF7/XPngpTLg/R9vm899VUweDDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1fca732cebee4abb362dd2ecd26c95d2918ec546ec9b3fcd92cc1e9f9aae03b8","last_reissued_at":"2026-05-17T23:44:43.152220Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:43.152220Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Expressing Linear Orders Requires Exponential-Size DNNFs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LO"],"primary_cat":"cs.CC","authors_text":"Ronald de Haan","submitted_at":"2018-07-17T13:02:55Z","abstract_excerpt":"We show that any DNNF circuit that expresses the set of linear orders over a set of $n$ candidates must be of size $2^{\\Omega(n)}$. Moreover, we show that there exist DNNF circuits of size $2^{O(n)}$ expressing linear orders over $n$ candidates."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.06397","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":"1807.06397","created_at":"2026-05-17T23:44:43.152327+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.06397v3","created_at":"2026-05-17T23:44:43.152327+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.06397","created_at":"2026-05-17T23:44:43.152327+00:00"},{"alias_kind":"pith_short_12","alias_value":"D7FHGLHL5ZFL","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"D7FHGLHL5ZFLWNRN","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"D7FHGLHL","created_at":"2026-05-18T12:32:19.392346+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/D7FHGLHL5ZFLWNRN2LWNE3EV2K","json":"https://pith.science/pith/D7FHGLHL5ZFLWNRN2LWNE3EV2K.json","graph_json":"https://pith.science/api/pith-number/D7FHGLHL5ZFLWNRN2LWNE3EV2K/graph.json","events_json":"https://pith.science/api/pith-number/D7FHGLHL5ZFLWNRN2LWNE3EV2K/events.json","paper":"https://pith.science/paper/D7FHGLHL"},"agent_actions":{"view_html":"https://pith.science/pith/D7FHGLHL5ZFLWNRN2LWNE3EV2K","download_json":"https://pith.science/pith/D7FHGLHL5ZFLWNRN2LWNE3EV2K.json","view_paper":"https://pith.science/paper/D7FHGLHL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.06397&json=true","fetch_graph":"https://pith.science/api/pith-number/D7FHGLHL5ZFLWNRN2LWNE3EV2K/graph.json","fetch_events":"https://pith.science/api/pith-number/D7FHGLHL5ZFLWNRN2LWNE3EV2K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D7FHGLHL5ZFLWNRN2LWNE3EV2K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D7FHGLHL5ZFLWNRN2LWNE3EV2K/action/storage_attestation","attest_author":"https://pith.science/pith/D7FHGLHL5ZFLWNRN2LWNE3EV2K/action/author_attestation","sign_citation":"https://pith.science/pith/D7FHGLHL5ZFLWNRN2LWNE3EV2K/action/citation_signature","submit_replication":"https://pith.science/pith/D7FHGLHL5ZFLWNRN2LWNE3EV2K/action/replication_record"}},"created_at":"2026-05-17T23:44:43.152327+00:00","updated_at":"2026-05-17T23:44:43.152327+00:00"}