{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:SBBNPSXM26UFCXEPC7LFEJPR4Q","short_pith_number":"pith:SBBNPSXM","schema_version":"1.0","canonical_sha256":"9042d7caecd7a8515c8f17d65225f1e403f14e261565a6e06d7636b152da2092","source":{"kind":"arxiv","id":"1010.5756","version":3},"attestation_state":"computed","paper":{"title":"On variables with few occurrences in conjunctive normal forms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Oliver Kullmann, Xishun Zhao","submitted_at":"2010-10-27T17:53:09Z","abstract_excerpt":"We consider the question of the existence of variables with few occurrences in boolean conjunctive normal forms (clause-sets). Let mvd(F) for a clause-set F denote the minimal variable-degree, the minimum of the number of occurrences of variables. Our main result is an upper bound mvd(F) <= nM(surp(F)) <= surp(F) + 1 + log_2(surp(F)) for lean clause-sets F in dependency on the surplus surp(F).\n  - Lean clause-sets, defined as having no non-trivial autarkies, generalise minimally unsatisfiable clause-sets.\n  - For the surplus we have surp(F) <= delta(F) = c(F) - n(F), using the deficiency delta"},"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":"1010.5756","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-10-27T17:53:09Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"78ce8c79a848fc2c26e2feca369e9a925d8d27a63324b2aba635c4d08199f639","abstract_canon_sha256":"2cb81ff38450c486a6b8d763484a035d7b55548c7fc0ae143bafae3dd59c296d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:18.800921Z","signature_b64":"1mDyN0PFWesbLma1sQp7lT5VCUD4C9kmO2MmdZDCQxceXrfiLE/bJo6gg2PQLABeMEmttWmbUCmvYv9+XNcaDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9042d7caecd7a8515c8f17d65225f1e403f14e261565a6e06d7636b152da2092","last_reissued_at":"2026-05-18T02:49:18.800339Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:18.800339Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On variables with few occurrences in conjunctive normal forms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Oliver Kullmann, Xishun Zhao","submitted_at":"2010-10-27T17:53:09Z","abstract_excerpt":"We consider the question of the existence of variables with few occurrences in boolean conjunctive normal forms (clause-sets). Let mvd(F) for a clause-set F denote the minimal variable-degree, the minimum of the number of occurrences of variables. Our main result is an upper bound mvd(F) <= nM(surp(F)) <= surp(F) + 1 + log_2(surp(F)) for lean clause-sets F in dependency on the surplus surp(F).\n  - Lean clause-sets, defined as having no non-trivial autarkies, generalise minimally unsatisfiable clause-sets.\n  - For the surplus we have surp(F) <= delta(F) = c(F) - n(F), using the deficiency delta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.5756","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":"1010.5756","created_at":"2026-05-18T02:49:18.800429+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.5756v3","created_at":"2026-05-18T02:49:18.800429+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.5756","created_at":"2026-05-18T02:49:18.800429+00:00"},{"alias_kind":"pith_short_12","alias_value":"SBBNPSXM26UF","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_16","alias_value":"SBBNPSXM26UFCXEP","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_8","alias_value":"SBBNPSXM","created_at":"2026-05-18T12:26:13.927090+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/SBBNPSXM26UFCXEPC7LFEJPR4Q","json":"https://pith.science/pith/SBBNPSXM26UFCXEPC7LFEJPR4Q.json","graph_json":"https://pith.science/api/pith-number/SBBNPSXM26UFCXEPC7LFEJPR4Q/graph.json","events_json":"https://pith.science/api/pith-number/SBBNPSXM26UFCXEPC7LFEJPR4Q/events.json","paper":"https://pith.science/paper/SBBNPSXM"},"agent_actions":{"view_html":"https://pith.science/pith/SBBNPSXM26UFCXEPC7LFEJPR4Q","download_json":"https://pith.science/pith/SBBNPSXM26UFCXEPC7LFEJPR4Q.json","view_paper":"https://pith.science/paper/SBBNPSXM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.5756&json=true","fetch_graph":"https://pith.science/api/pith-number/SBBNPSXM26UFCXEPC7LFEJPR4Q/graph.json","fetch_events":"https://pith.science/api/pith-number/SBBNPSXM26UFCXEPC7LFEJPR4Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SBBNPSXM26UFCXEPC7LFEJPR4Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SBBNPSXM26UFCXEPC7LFEJPR4Q/action/storage_attestation","attest_author":"https://pith.science/pith/SBBNPSXM26UFCXEPC7LFEJPR4Q/action/author_attestation","sign_citation":"https://pith.science/pith/SBBNPSXM26UFCXEPC7LFEJPR4Q/action/citation_signature","submit_replication":"https://pith.science/pith/SBBNPSXM26UFCXEPC7LFEJPR4Q/action/replication_record"}},"created_at":"2026-05-18T02:49:18.800429+00:00","updated_at":"2026-05-18T02:49:18.800429+00:00"}