{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:SBBNPSXM26UFCXEPC7LFEJPR4Q","short_pith_number":"pith:SBBNPSXM","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"},"canonical_sha256":"9042d7caecd7a8515c8f17d65225f1e403f14e261565a6e06d7636b152da2092","source":{"kind":"arxiv","id":"1010.5756","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.5756","created_at":"2026-05-18T02:49:18Z"},{"alias_kind":"arxiv_version","alias_value":"1010.5756v3","created_at":"2026-05-18T02:49:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.5756","created_at":"2026-05-18T02:49:18Z"},{"alias_kind":"pith_short_12","alias_value":"SBBNPSXM26UF","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"SBBNPSXM26UFCXEP","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"SBBNPSXM","created_at":"2026-05-18T12:26:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:SBBNPSXM26UFCXEPC7LFEJPR4Q","target":"record","payload":{"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"},"canonical_sha256":"9042d7caecd7a8515c8f17d65225f1e403f14e261565a6e06d7636b152da2092","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"},"source_kind":"arxiv","source_id":"1010.5756","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:49:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wbtvlv2mLpUJBfL+peTRmYgLIerA81e0VUyonont9R3HqsDont/d1yaJIZlCb2ur1vfcKJ/pc2hqNk+XjvClCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:22:25.363172Z"},"content_sha256":"e32bc01fd64b5031b789e64de230c5cef03d8bf1be4328e188c29d8463b86ec0","schema_version":"1.0","event_id":"sha256:e32bc01fd64b5031b789e64de230c5cef03d8bf1be4328e188c29d8463b86ec0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:SBBNPSXM26UFCXEPC7LFEJPR4Q","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:49:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U6eciIWjSnbM1MbHlY1joYw7s2Ote8uRel25sGWP2ATe5mMgsiaq54l2uBKXPlC08qMWmHAqJkP8aPw+fmO9DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:22:25.363880Z"},"content_sha256":"10ea0003fb7f15cfb87feea92c736c891f1a1455c9d593970d78289040e4f0f8","schema_version":"1.0","event_id":"sha256:10ea0003fb7f15cfb87feea92c736c891f1a1455c9d593970d78289040e4f0f8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SBBNPSXM26UFCXEPC7LFEJPR4Q/bundle.json","state_url":"https://pith.science/pith/SBBNPSXM26UFCXEPC7LFEJPR4Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SBBNPSXM26UFCXEPC7LFEJPR4Q/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T03:22:25Z","links":{"resolver":"https://pith.science/pith/SBBNPSXM26UFCXEPC7LFEJPR4Q","bundle":"https://pith.science/pith/SBBNPSXM26UFCXEPC7LFEJPR4Q/bundle.json","state":"https://pith.science/pith/SBBNPSXM26UFCXEPC7LFEJPR4Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SBBNPSXM26UFCXEPC7LFEJPR4Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:SBBNPSXM26UFCXEPC7LFEJPR4Q","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":"2cb81ff38450c486a6b8d763484a035d7b55548c7fc0ae143bafae3dd59c296d","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-10-27T17:53:09Z","title_canon_sha256":"78ce8c79a848fc2c26e2feca369e9a925d8d27a63324b2aba635c4d08199f639"},"schema_version":"1.0","source":{"id":"1010.5756","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.5756","created_at":"2026-05-18T02:49:18Z"},{"alias_kind":"arxiv_version","alias_value":"1010.5756v3","created_at":"2026-05-18T02:49:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.5756","created_at":"2026-05-18T02:49:18Z"},{"alias_kind":"pith_short_12","alias_value":"SBBNPSXM26UF","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"SBBNPSXM26UFCXEP","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"SBBNPSXM","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:10ea0003fb7f15cfb87feea92c736c891f1a1455c9d593970d78289040e4f0f8","target":"graph","created_at":"2026-05-18T02:49:18Z","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 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","authors_text":"Oliver Kullmann, Xishun Zhao","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-10-27T17:53:09Z","title":"On variables with few occurrences in conjunctive normal forms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.5756","kind":"arxiv","version":3},"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:e32bc01fd64b5031b789e64de230c5cef03d8bf1be4328e188c29d8463b86ec0","target":"record","created_at":"2026-05-18T02:49:18Z","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":"2cb81ff38450c486a6b8d763484a035d7b55548c7fc0ae143bafae3dd59c296d","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-10-27T17:53:09Z","title_canon_sha256":"78ce8c79a848fc2c26e2feca369e9a925d8d27a63324b2aba635c4d08199f639"},"schema_version":"1.0","source":{"id":"1010.5756","kind":"arxiv","version":3}},"canonical_sha256":"9042d7caecd7a8515c8f17d65225f1e403f14e261565a6e06d7636b152da2092","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9042d7caecd7a8515c8f17d65225f1e403f14e261565a6e06d7636b152da2092","first_computed_at":"2026-05-18T02:49:18.800339Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:49:18.800339Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1mDyN0PFWesbLma1sQp7lT5VCUD4C9kmO2MmdZDCQxceXrfiLE/bJo6gg2PQLABeMEmttWmbUCmvYv9+XNcaDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:49:18.800921Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.5756","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e32bc01fd64b5031b789e64de230c5cef03d8bf1be4328e188c29d8463b86ec0","sha256:10ea0003fb7f15cfb87feea92c736c891f1a1455c9d593970d78289040e4f0f8"],"state_sha256":"a45e23e9b315ad10a2540b225c77378f58351547eabe0f8e51c08dbe5adfde9d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rCYj/muQP3YktaXdsfJaQ1R038IwY55RiFeBekZe3PWOLP9PwvShplFDezE26irheolN/y5L6Fe3087YSZG6AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T03:22:25.367214Z","bundle_sha256":"c10ba620af91e20b0a95234f24d9fd852dc050802e82f04029fe770ab3d7943b"}}