{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:GVXTC2HRJARYPKHGEL345LKRDR","short_pith_number":"pith:GVXTC2HR","canonical_record":{"source":{"id":"2412.20493","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2024-12-29T15:15:11Z","cross_cats_sorted":[],"title_canon_sha256":"5e523def5268febdf26f82f7b05509b72d0ff9e57fc862f53cd6dfa56c8936c7","abstract_canon_sha256":"8e32184ed062b2fa9322a11e8eced757056fcc19ebdb6ed401d092bc45111f5c"},"schema_version":"1.0"},"canonical_sha256":"356f3168f1482387a8e622f7cead511c7d5e36db9e8266db916f264c4af57b64","source":{"kind":"arxiv","id":"2412.20493","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.20493","created_at":"2026-07-05T09:55:17Z"},{"alias_kind":"arxiv_version","alias_value":"2412.20493v1","created_at":"2026-07-05T09:55:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.20493","created_at":"2026-07-05T09:55:17Z"},{"alias_kind":"pith_short_12","alias_value":"GVXTC2HRJARY","created_at":"2026-07-05T09:55:17Z"},{"alias_kind":"pith_short_16","alias_value":"GVXTC2HRJARYPKHG","created_at":"2026-07-05T09:55:17Z"},{"alias_kind":"pith_short_8","alias_value":"GVXTC2HR","created_at":"2026-07-05T09:55:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:GVXTC2HRJARYPKHGEL345LKRDR","target":"record","payload":{"canonical_record":{"source":{"id":"2412.20493","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2024-12-29T15:15:11Z","cross_cats_sorted":[],"title_canon_sha256":"5e523def5268febdf26f82f7b05509b72d0ff9e57fc862f53cd6dfa56c8936c7","abstract_canon_sha256":"8e32184ed062b2fa9322a11e8eced757056fcc19ebdb6ed401d092bc45111f5c"},"schema_version":"1.0"},"canonical_sha256":"356f3168f1482387a8e622f7cead511c7d5e36db9e8266db916f264c4af57b64","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:55:17.872607Z","signature_b64":"qvqex5O0Kw+8d6NQVqeNsgIp9hXP3bAVHUCsLm+x4PyyjQ0HAGwuy5Z0XKGR+2eRZvmMMjWB9D0LaIKP/iL+Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"356f3168f1482387a8e622f7cead511c7d5e36db9e8266db916f264c4af57b64","last_reissued_at":"2026-07-05T09:55:17.872122Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:55:17.872122Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.20493","source_version":1,"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-07-05T09:55:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9NDVfZ4dJjY6gZOTHL0zLIkQmTTVczp57uk5ev6Lv/GHwEkuv4fWM+pgRgJDlMvdYvc9NybRaeh8aJqDmrUDCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T10:43:43.706079Z"},"content_sha256":"848f5baa27b860ef2f94b30f0a058db06a9f515a0eed37810fd33a89704dd394","schema_version":"1.0","event_id":"sha256:848f5baa27b860ef2f94b30f0a058db06a9f515a0eed37810fd33a89704dd394"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:GVXTC2HRJARYPKHGEL345LKRDR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Extremal Properties of k-CNF: Capturing Threshold Functions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Marvin K\\\"unnemann, Mohit Gurumukhani, Ramamohan Paturi","submitted_at":"2024-12-29T15:15:11Z","abstract_excerpt":"We consider a basic question on the expressiveness of $k$-CNF formulas: How well can $k$-CNF formulas capture threshold functions? Specifically, what is the largest number of assignments (of Hamming weight $t$) accepted by a $k$-CNF formula that only accepts assignments of weight at least $t$? Among others, we provide the following results:\n  - While an optimal solution is known for $t \\leq n/k$, the problem remains open for $t > n/k$. We formulate a (monotone) version of the problem as an extremal hypergraph problem and show that for $t = n-k$, the problem is exactly the Tur\\'{a}n problem.\n  "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.20493","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.20493/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T09:55:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NHuYzIkJuUGerplaRQii7eZaLgHcuoqHed9fPblUMayvIxUobBFnQ0Rnuiui4mA7e58V7Dl6bFVMP7WaG6xBBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T10:43:43.706663Z"},"content_sha256":"be9b4b0e924ed737851e90338ca0b11cdbac7476743a7cbea066582c565ec028","schema_version":"1.0","event_id":"sha256:be9b4b0e924ed737851e90338ca0b11cdbac7476743a7cbea066582c565ec028"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GVXTC2HRJARYPKHGEL345LKRDR/bundle.json","state_url":"https://pith.science/pith/GVXTC2HRJARYPKHGEL345LKRDR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GVXTC2HRJARYPKHGEL345LKRDR/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-08-11T10:43:43Z","links":{"resolver":"https://pith.science/pith/GVXTC2HRJARYPKHGEL345LKRDR","bundle":"https://pith.science/pith/GVXTC2HRJARYPKHGEL345LKRDR/bundle.json","state":"https://pith.science/pith/GVXTC2HRJARYPKHGEL345LKRDR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GVXTC2HRJARYPKHGEL345LKRDR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:GVXTC2HRJARYPKHGEL345LKRDR","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":"8e32184ed062b2fa9322a11e8eced757056fcc19ebdb6ed401d092bc45111f5c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2024-12-29T15:15:11Z","title_canon_sha256":"5e523def5268febdf26f82f7b05509b72d0ff9e57fc862f53cd6dfa56c8936c7"},"schema_version":"1.0","source":{"id":"2412.20493","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.20493","created_at":"2026-07-05T09:55:17Z"},{"alias_kind":"arxiv_version","alias_value":"2412.20493v1","created_at":"2026-07-05T09:55:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.20493","created_at":"2026-07-05T09:55:17Z"},{"alias_kind":"pith_short_12","alias_value":"GVXTC2HRJARY","created_at":"2026-07-05T09:55:17Z"},{"alias_kind":"pith_short_16","alias_value":"GVXTC2HRJARYPKHG","created_at":"2026-07-05T09:55:17Z"},{"alias_kind":"pith_short_8","alias_value":"GVXTC2HR","created_at":"2026-07-05T09:55:17Z"}],"graph_snapshots":[{"event_id":"sha256:be9b4b0e924ed737851e90338ca0b11cdbac7476743a7cbea066582c565ec028","target":"graph","created_at":"2026-07-05T09:55:17Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2412.20493/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider a basic question on the expressiveness of $k$-CNF formulas: How well can $k$-CNF formulas capture threshold functions? Specifically, what is the largest number of assignments (of Hamming weight $t$) accepted by a $k$-CNF formula that only accepts assignments of weight at least $t$? Among others, we provide the following results:\n  - While an optimal solution is known for $t \\leq n/k$, the problem remains open for $t > n/k$. We formulate a (monotone) version of the problem as an extremal hypergraph problem and show that for $t = n-k$, the problem is exactly the Tur\\'{a}n problem.\n  ","authors_text":"Marvin K\\\"unnemann, Mohit Gurumukhani, Ramamohan Paturi","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2024-12-29T15:15:11Z","title":"On Extremal Properties of k-CNF: Capturing Threshold Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.20493","kind":"arxiv","version":1},"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:848f5baa27b860ef2f94b30f0a058db06a9f515a0eed37810fd33a89704dd394","target":"record","created_at":"2026-07-05T09:55:17Z","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":"8e32184ed062b2fa9322a11e8eced757056fcc19ebdb6ed401d092bc45111f5c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2024-12-29T15:15:11Z","title_canon_sha256":"5e523def5268febdf26f82f7b05509b72d0ff9e57fc862f53cd6dfa56c8936c7"},"schema_version":"1.0","source":{"id":"2412.20493","kind":"arxiv","version":1}},"canonical_sha256":"356f3168f1482387a8e622f7cead511c7d5e36db9e8266db916f264c4af57b64","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"356f3168f1482387a8e622f7cead511c7d5e36db9e8266db916f264c4af57b64","first_computed_at":"2026-07-05T09:55:17.872122Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:55:17.872122Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qvqex5O0Kw+8d6NQVqeNsgIp9hXP3bAVHUCsLm+x4PyyjQ0HAGwuy5Z0XKGR+2eRZvmMMjWB9D0LaIKP/iL+Cg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:55:17.872607Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.20493","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:848f5baa27b860ef2f94b30f0a058db06a9f515a0eed37810fd33a89704dd394","sha256:be9b4b0e924ed737851e90338ca0b11cdbac7476743a7cbea066582c565ec028"],"state_sha256":"eabf101d2a325744085bfed13c485aadad417a0f8a24b1cc6c3a45747333d24e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oGpVdmQaw1R7lmYirr8fcMjcxAJW+V/0cs9zq+fz/fXwLAK1bu53Rc5l4ySs2uTFqUOoC9qok0fiHpOQjyCZBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T10:43:43.710923Z","bundle_sha256":"7eb4d927b1cae2d6f7f314fc146292ced13448f310b096b22547c8f3e6b01589"}}