{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:HWDALXCM54JZCM2MY4JB4FDBCM","short_pith_number":"pith:HWDALXCM","canonical_record":{"source":{"id":"2611.16814","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2026-11-12T13:50:50Z","cross_cats_sorted":[],"title_canon_sha256":"1b52629e6bf591f26fcdcfb381bf2e1bd550fa53babc902d03d43e4b88df6b18","abstract_canon_sha256":"e075238ef37ed316fc18195e2641186529fbdccfe1e8e4d43c60e132701a8dd3"},"schema_version":"1.0"},"canonical_sha256":"3d8605dc4cef1391334cc7121e1461130bdaef38d13f845d4015a53264e2b684","source":{"kind":"arxiv","id":"2611.16814","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2611.16814","created_at":"2026-11-13T05:33:27Z"},{"alias_kind":"arxiv_version","alias_value":"2611.16814v1","created_at":"2026-11-13T05:33:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2611.16814","created_at":"2026-11-13T05:33:27Z"},{"alias_kind":"pith_short_12","alias_value":"HWDALXCM54JZ","created_at":"2026-11-13T05:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"HWDALXCM54JZCM2M","created_at":"2026-11-13T05:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"HWDALXCM","created_at":"2026-11-13T05:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:HWDALXCM54JZCM2MY4JB4FDBCM","target":"record","payload":{"canonical_record":{"source":{"id":"2611.16814","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2026-11-12T13:50:50Z","cross_cats_sorted":[],"title_canon_sha256":"1b52629e6bf591f26fcdcfb381bf2e1bd550fa53babc902d03d43e4b88df6b18","abstract_canon_sha256":"e075238ef37ed316fc18195e2641186529fbdccfe1e8e4d43c60e132701a8dd3"},"schema_version":"1.0"},"canonical_sha256":"3d8605dc4cef1391334cc7121e1461130bdaef38d13f845d4015a53264e2b684","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-11-13T05:33:27.121820Z","signature_b64":"c/jekwrvrhBl3u72FRUpT+Q7pWlIZ9cFkwXAQh0tTgmkmYJSfQTM9V78PZu8lwHisn6QP+h4taZ8Zn9aGU9aDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d8605dc4cef1391334cc7121e1461130bdaef38d13f845d4015a53264e2b684","last_reissued_at":"2026-11-13T05:33:27.119203Z","signature_status":"signed_v1","first_computed_at":"2026-11-13T05:33:27.119203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2611.16814","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-11-13T05:33:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4p/o/Fzl3aQQkEMcTJAPxrDojiFdYN+Ho6prUTtl8egZEcyXRjEI+J5YxL4oXKudCj0pn7IfY5MtQSqURF5gDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-11-16T04:47:02.262338Z"},"content_sha256":"a88c555d4635f4dbcf89fc86d18e0ff1b2b0345713a935fe84dbac5a3010229a","schema_version":"1.0","event_id":"sha256:a88c555d4635f4dbcf89fc86d18e0ff1b2b0345713a935fe84dbac5a3010229a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:HWDALXCM54JZCM2MY4JB4FDBCM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Deterministic Algorithms for $k$-SAT: Generalization of Chains and Recurrence Proof","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Binbin Cui, S. Cliff Liu, Yongrui Yu","submitted_at":"2026-11-12T13:50:50Z","abstract_excerpt":"We present a deterministic algorithm for 3-SAT running in $1.32736^n$ time. The algorithm is built on a branching-and-chain framework augmented with a polynomial-time expansion procedure that joins short chains through additional clauses to form bounded-size blocks, which impose stronger constraints on the assignment space. After branching, the algorithm chooses between derandomized local search guided by the block structure and enumeration of block assignments together with selected port variables, reducing the remaining formula to 2-SAT. A weighted analysis of branching, partial-assignment, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2611.16814","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/2611.16814/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"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-11-13T05:33:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uOJvGmtOY2ZntIezTXbJ7p7JApGBfYM9Ruih/w5Q1WOKO9EyQpBYGst5AZ786nyuJkp57UC7oh4WlFGDfBL+Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-11-16T04:47:02.262663Z"},"content_sha256":"01c11577055024b01e0cd3a442acadc6ef2ef409b008617c5a32f55e4b225920","schema_version":"1.0","event_id":"sha256:01c11577055024b01e0cd3a442acadc6ef2ef409b008617c5a32f55e4b225920"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HWDALXCM54JZCM2MY4JB4FDBCM/bundle.json","state_url":"https://pith.science/pith/HWDALXCM54JZCM2MY4JB4FDBCM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HWDALXCM54JZCM2MY4JB4FDBCM/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-11-16T04:47:02Z","links":{"resolver":"https://pith.science/pith/HWDALXCM54JZCM2MY4JB4FDBCM","bundle":"https://pith.science/pith/HWDALXCM54JZCM2MY4JB4FDBCM/bundle.json","state":"https://pith.science/pith/HWDALXCM54JZCM2MY4JB4FDBCM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HWDALXCM54JZCM2MY4JB4FDBCM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:HWDALXCM54JZCM2MY4JB4FDBCM","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":"e075238ef37ed316fc18195e2641186529fbdccfe1e8e4d43c60e132701a8dd3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2026-11-12T13:50:50Z","title_canon_sha256":"1b52629e6bf591f26fcdcfb381bf2e1bd550fa53babc902d03d43e4b88df6b18"},"schema_version":"1.0","source":{"id":"2611.16814","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2611.16814","created_at":"2026-11-13T05:33:27Z"},{"alias_kind":"arxiv_version","alias_value":"2611.16814v1","created_at":"2026-11-13T05:33:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2611.16814","created_at":"2026-11-13T05:33:27Z"},{"alias_kind":"pith_short_12","alias_value":"HWDALXCM54JZ","created_at":"2026-11-13T05:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"HWDALXCM54JZCM2M","created_at":"2026-11-13T05:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"HWDALXCM","created_at":"2026-11-13T05:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:01c11577055024b01e0cd3a442acadc6ef2ef409b008617c5a32f55e4b225920","target":"graph","created_at":"2026-11-13T05:33:27Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2611.16814/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a deterministic algorithm for 3-SAT running in $1.32736^n$ time. The algorithm is built on a branching-and-chain framework augmented with a polynomial-time expansion procedure that joins short chains through additional clauses to form bounded-size blocks, which impose stronger constraints on the assignment space. After branching, the algorithm chooses between derandomized local search guided by the block structure and enumeration of block assignments together with selected port variables, reducing the remaining formula to 2-SAT. A weighted analysis of branching, partial-assignment, ","authors_text":"Binbin Cui, S. Cliff Liu, Yongrui Yu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2026-11-12T13:50:50Z","title":"Improved Deterministic Algorithms for $k$-SAT: Generalization of Chains and Recurrence Proof"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2611.16814","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:a88c555d4635f4dbcf89fc86d18e0ff1b2b0345713a935fe84dbac5a3010229a","target":"record","created_at":"2026-11-13T05:33:27Z","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":"e075238ef37ed316fc18195e2641186529fbdccfe1e8e4d43c60e132701a8dd3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2026-11-12T13:50:50Z","title_canon_sha256":"1b52629e6bf591f26fcdcfb381bf2e1bd550fa53babc902d03d43e4b88df6b18"},"schema_version":"1.0","source":{"id":"2611.16814","kind":"arxiv","version":1}},"canonical_sha256":"3d8605dc4cef1391334cc7121e1461130bdaef38d13f845d4015a53264e2b684","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3d8605dc4cef1391334cc7121e1461130bdaef38d13f845d4015a53264e2b684","first_computed_at":"2026-11-13T05:33:27.119203Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-11-13T05:33:27.119203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c/jekwrvrhBl3u72FRUpT+Q7pWlIZ9cFkwXAQh0tTgmkmYJSfQTM9V78PZu8lwHisn6QP+h4taZ8Zn9aGU9aDA==","signature_status":"signed_v1","signed_at":"2026-11-13T05:33:27.121820Z","signed_message":"canonical_sha256_bytes"},"source_id":"2611.16814","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a88c555d4635f4dbcf89fc86d18e0ff1b2b0345713a935fe84dbac5a3010229a","sha256:01c11577055024b01e0cd3a442acadc6ef2ef409b008617c5a32f55e4b225920"],"state_sha256":"0f6029f243220b8c52ac73cdf47a76e8a88e368cabc7dfc83e0741037f2f0107"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rkI3zeo0KOOCCDMyf/qsB6aIs6D2EEybD960BjXUCwhDBIAMZaCORW0T6qUMHqCAQunWnTK/JfAqlH6INnDtBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-11-16T04:47:02.269510Z","bundle_sha256":"fe11948bbefdfd24810cab31d54353c0a91ca64552f1607046d44b73dc567079"}}