{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:NTFXSIRZRHDAMFOYXLMUMLAPEL","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":"14b1d97080405c1280cf8312cb01745b577395118fd5487eedfa92a400d2e372","cross_cats_sorted":["cs.DM","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-04T10:00:29Z","title_canon_sha256":"ea5152053f5acb6f903f99a41e56801791cc446c57784716fb1200ce0ef47e54"},"schema_version":"1.0","source":{"id":"1408.0629","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.0629","created_at":"2026-05-18T00:52:24Z"},{"alias_kind":"arxiv_version","alias_value":"1408.0629v5","created_at":"2026-05-18T00:52:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.0629","created_at":"2026-05-18T00:52:24Z"},{"alias_kind":"pith_short_12","alias_value":"NTFXSIRZRHDA","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NTFXSIRZRHDAMFOY","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NTFXSIRZ","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:e05b5f79c4643395ae41c7e228527353152a1515f66cc1b6340d93a4cc71c749","target":"graph","created_at":"2026-05-18T00:52:24Z","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 investigate connections between SAT (the propositional satisfiability problem) and combinatorics, around the minimum degree (number of occurrences) of variables in various forms of redundancy-free boolean conjunctive normal forms (clause-sets).\n  Lean clause-sets do not have non-trivial autarkies, that is, it is not possible to satisfy some clauses and leave the other clauses untouched. The deficiency of a clause-set is the difference of the number of clauses and the number of variables. We prove a precise upper bound on the minimum variable degree of lean clause-sets in dependency on the d","authors_text":"Oliver Kullmann, Xishun Zhao","cross_cats":["cs.DM","cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-04T10:00:29Z","title":"Bounds for variables with few occurrences in conjunctive normal forms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.0629","kind":"arxiv","version":5},"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:987b6ab46f811f9c7ec532fbadd3661e27a6ae99001d48543ba0aaca2e754c08","target":"record","created_at":"2026-05-18T00:52:24Z","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":"14b1d97080405c1280cf8312cb01745b577395118fd5487eedfa92a400d2e372","cross_cats_sorted":["cs.DM","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-04T10:00:29Z","title_canon_sha256":"ea5152053f5acb6f903f99a41e56801791cc446c57784716fb1200ce0ef47e54"},"schema_version":"1.0","source":{"id":"1408.0629","kind":"arxiv","version":5}},"canonical_sha256":"6ccb79223989c60615d8bad9462c0f22ce87f131d50061e31da97048defb23b8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6ccb79223989c60615d8bad9462c0f22ce87f131d50061e31da97048defb23b8","first_computed_at":"2026-05-18T00:52:24.196912Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:24.196912Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YYxLDIFgYktvRB3ElOX0M/7e7rW6zLxnxZYBNXHcV1rqpkbeX5uxYYYscREAmZLs+4bxHIYgXy8Pr+deN4tWDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:24.197562Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.0629","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:987b6ab46f811f9c7ec532fbadd3661e27a6ae99001d48543ba0aaca2e754c08","sha256:e05b5f79c4643395ae41c7e228527353152a1515f66cc1b6340d93a4cc71c749"],"state_sha256":"c902768c3f8a0590f06e3c53bbaee2a697d52226803652c43acf356c43dee031"}