{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:CFAHOBSNCJTZHQWRPGZEZQG2NO","short_pith_number":"pith:CFAHOBSN","canonical_record":{"source":{"id":"1809.04312","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2018-09-12T08:50:23Z","cross_cats_sorted":[],"title_canon_sha256":"083ef9777a42848e9a65eb75f3f723a7521e8d69afe31bd65f7d7659d456aa73","abstract_canon_sha256":"640d919a83276b465e9cf3c005c3ef72800523cac6877847cf21b5f384d39f0c"},"schema_version":"1.0"},"canonical_sha256":"114077064d126793c2d179b24cc0da6ba52b7f4e3be8ed63e72b16ec3f14a6fa","source":{"kind":"arxiv","id":"1809.04312","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.04312","created_at":"2026-05-17T23:42:15Z"},{"alias_kind":"arxiv_version","alias_value":"1809.04312v5","created_at":"2026-05-17T23:42:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.04312","created_at":"2026-05-17T23:42:15Z"},{"alias_kind":"pith_short_12","alias_value":"CFAHOBSNCJTZ","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CFAHOBSNCJTZHQWR","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CFAHOBSN","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:CFAHOBSNCJTZHQWRPGZEZQG2NO","target":"record","payload":{"canonical_record":{"source":{"id":"1809.04312","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2018-09-12T08:50:23Z","cross_cats_sorted":[],"title_canon_sha256":"083ef9777a42848e9a65eb75f3f723a7521e8d69afe31bd65f7d7659d456aa73","abstract_canon_sha256":"640d919a83276b465e9cf3c005c3ef72800523cac6877847cf21b5f384d39f0c"},"schema_version":"1.0"},"canonical_sha256":"114077064d126793c2d179b24cc0da6ba52b7f4e3be8ed63e72b16ec3f14a6fa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:15.401374Z","signature_b64":"iZ5I/uelYFOGxEo9Znun7UYxvFLi1jE6C2xGO/aJ7La3hKXDwB3/5yyQG6dPy6ED2eml5ryJDBbubhyUiVAIBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"114077064d126793c2d179b24cc0da6ba52b7f4e3be8ed63e72b16ec3f14a6fa","last_reissued_at":"2026-05-17T23:42:15.400740Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:15.400740Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.04312","source_version":5,"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-17T23:42:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JjDhEpgQW+2CmmwqQRpS8YN4gFppj8W5tbMODyQzRH3cIgwL8Q1S2hI/X8G0b6eTHGv6SSdMVTvf/0vRMQ52DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T16:55:30.157946Z"},"content_sha256":"03d6930952902df2504a2063c161b83a903950aea86ac2cf66c951de832376a7","schema_version":"1.0","event_id":"sha256:03d6930952902df2504a2063c161b83a903950aea86ac2cf66c951de832376a7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:CFAHOBSNCJTZHQWRPGZEZQG2NO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Curse and Blessing of Not-All-Equal in k-Satisfiability","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"S. Cliff Liu","submitted_at":"2018-09-12T08:50:23Z","abstract_excerpt":"As a natural variant of the $k$-SAT problem, NAE-$k$-SAT additionally requires the literals in each clause to take not-all-equal (NAE) truth values. In this paper, we study the worst-case time complexities of solving NAE-$k$-SAT and MAX-NAE-$k$-SAT approximation, as functions of $k$, the number of variables $n$, and the performance ratio $\\delta$. The latter problem asks for a solution of at least $\\delta$ times the optimal. Our main results include:\n  (1) A deterministic algorithm for NAE-$k$-SAT that is faster than the best deterministic algorithm for $k$-SAT on all $k \\ge 3$. Previously, no"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.04312","kind":"arxiv","version":5},"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-17T23:42:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dL+BhUAwj/s91vHlWNdxGqgdENJZmadN78BVIGukMSC1SYs/SAHEiwkBzybIBVHrTYF1qPXsY+xyN6ADp4vIAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T16:55:30.158420Z"},"content_sha256":"f2b06935b443d61ee6272ebc08e3b7d725c623fbbbda75f2bdf405ab676f2d85","schema_version":"1.0","event_id":"sha256:f2b06935b443d61ee6272ebc08e3b7d725c623fbbbda75f2bdf405ab676f2d85"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CFAHOBSNCJTZHQWRPGZEZQG2NO/bundle.json","state_url":"https://pith.science/pith/CFAHOBSNCJTZHQWRPGZEZQG2NO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CFAHOBSNCJTZHQWRPGZEZQG2NO/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-21T16:55:30Z","links":{"resolver":"https://pith.science/pith/CFAHOBSNCJTZHQWRPGZEZQG2NO","bundle":"https://pith.science/pith/CFAHOBSNCJTZHQWRPGZEZQG2NO/bundle.json","state":"https://pith.science/pith/CFAHOBSNCJTZHQWRPGZEZQG2NO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CFAHOBSNCJTZHQWRPGZEZQG2NO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:CFAHOBSNCJTZHQWRPGZEZQG2NO","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":"640d919a83276b465e9cf3c005c3ef72800523cac6877847cf21b5f384d39f0c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2018-09-12T08:50:23Z","title_canon_sha256":"083ef9777a42848e9a65eb75f3f723a7521e8d69afe31bd65f7d7659d456aa73"},"schema_version":"1.0","source":{"id":"1809.04312","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.04312","created_at":"2026-05-17T23:42:15Z"},{"alias_kind":"arxiv_version","alias_value":"1809.04312v5","created_at":"2026-05-17T23:42:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.04312","created_at":"2026-05-17T23:42:15Z"},{"alias_kind":"pith_short_12","alias_value":"CFAHOBSNCJTZ","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CFAHOBSNCJTZHQWR","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CFAHOBSN","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:f2b06935b443d61ee6272ebc08e3b7d725c623fbbbda75f2bdf405ab676f2d85","target":"graph","created_at":"2026-05-17T23:42:15Z","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":"As a natural variant of the $k$-SAT problem, NAE-$k$-SAT additionally requires the literals in each clause to take not-all-equal (NAE) truth values. In this paper, we study the worst-case time complexities of solving NAE-$k$-SAT and MAX-NAE-$k$-SAT approximation, as functions of $k$, the number of variables $n$, and the performance ratio $\\delta$. The latter problem asks for a solution of at least $\\delta$ times the optimal. Our main results include:\n  (1) A deterministic algorithm for NAE-$k$-SAT that is faster than the best deterministic algorithm for $k$-SAT on all $k \\ge 3$. Previously, no","authors_text":"S. Cliff Liu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2018-09-12T08:50:23Z","title":"The Curse and Blessing of Not-All-Equal in k-Satisfiability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.04312","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:03d6930952902df2504a2063c161b83a903950aea86ac2cf66c951de832376a7","target":"record","created_at":"2026-05-17T23:42:15Z","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":"640d919a83276b465e9cf3c005c3ef72800523cac6877847cf21b5f384d39f0c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2018-09-12T08:50:23Z","title_canon_sha256":"083ef9777a42848e9a65eb75f3f723a7521e8d69afe31bd65f7d7659d456aa73"},"schema_version":"1.0","source":{"id":"1809.04312","kind":"arxiv","version":5}},"canonical_sha256":"114077064d126793c2d179b24cc0da6ba52b7f4e3be8ed63e72b16ec3f14a6fa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"114077064d126793c2d179b24cc0da6ba52b7f4e3be8ed63e72b16ec3f14a6fa","first_computed_at":"2026-05-17T23:42:15.400740Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:15.400740Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iZ5I/uelYFOGxEo9Znun7UYxvFLi1jE6C2xGO/aJ7La3hKXDwB3/5yyQG6dPy6ED2eml5ryJDBbubhyUiVAIBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:15.401374Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.04312","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:03d6930952902df2504a2063c161b83a903950aea86ac2cf66c951de832376a7","sha256:f2b06935b443d61ee6272ebc08e3b7d725c623fbbbda75f2bdf405ab676f2d85"],"state_sha256":"0ab2b88cd50ffa92bea87721c3b7a61d7dfb3cb302a38fb44c4ae0b279d3c6f0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ux3WzMGyQopR/5EAMn1aWcDBYJcIsoCZQkAZF0cFiIOd741ZUE01swj+zX1OqDtqKZiDgLsY3kRg+TT48+11Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T16:55:30.165965Z","bundle_sha256":"f472c639182ed57d1bc091cdf6b00d2ed10cfa706229f77792446e59c9192900"}}