{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FD7BM63ZUVHBV2JHA4EPBBLPR6","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":"3fabce8c8f1ce5ced062158e56ab9a65fdb31ca3e7296e2e16d7a318f715bab3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-09-16T18:36:20Z","title_canon_sha256":"da9bb70734dbae3f525b3422568dd2cead496b361906b9e0f626e2c6e8adf6b4"},"schema_version":"1.0","source":{"id":"1809.05932","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.05932","created_at":"2026-05-18T00:05:36Z"},{"alias_kind":"arxiv_version","alias_value":"1809.05932v1","created_at":"2026-05-18T00:05:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.05932","created_at":"2026-05-18T00:05:36Z"},{"alias_kind":"pith_short_12","alias_value":"FD7BM63ZUVHB","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FD7BM63ZUVHBV2JH","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FD7BM63Z","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:a11896c40072318f70867623b58f9c864d216c1afc4c30e5a341a4b1bc8e511e","target":"graph","created_at":"2026-05-18T00:05:36Z","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 show that there is a randomized algorithm that, when given a small constant-depth Boolean circuit $C$ made up of gates that compute constant-degree Polynomial Threshold functions or PTFs (i.e., Boolean functions that compute signs of constant-degree polynomials), counts the number of satisfying assignments to $C$ in significantly better than brute-force time.\n  Formally, for any constants $d,k$, there is an $\\epsilon > 0$ such that the algorithm counts the number of satisfying assignments to a given depth-$d$ circuit $C$ made up of $k$-PTF gates such that $C$ has size at most $n^{1+\\epsilon","authors_text":"Deepanshu Kush, Nutan Limaye, Srikanth Srinivasan, Swapnam Bajpai, Vaibhav Krishan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-09-16T18:36:20Z","title":"A #SAT Algorithm for Small Constant-Depth Circuits with PTF gates"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.05932","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:ab440786f0efd31b37e0a34eb258e487c64783df07d3f3c695b9bb3fbc8dcc4f","target":"record","created_at":"2026-05-18T00:05:36Z","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":"3fabce8c8f1ce5ced062158e56ab9a65fdb31ca3e7296e2e16d7a318f715bab3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-09-16T18:36:20Z","title_canon_sha256":"da9bb70734dbae3f525b3422568dd2cead496b361906b9e0f626e2c6e8adf6b4"},"schema_version":"1.0","source":{"id":"1809.05932","kind":"arxiv","version":1}},"canonical_sha256":"28fe167b79a54e1ae9270708f0856f8f8a5178b6725dca71f33e5c984e43e68e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"28fe167b79a54e1ae9270708f0856f8f8a5178b6725dca71f33e5c984e43e68e","first_computed_at":"2026-05-18T00:05:36.096936Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:36.096936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eiKLHIq140qwoz31ZKoWq6JdVGM8JANn4fbCiAwVmETjdl1jE8HSwXTO5hG1u7WRLj6FN4evh6DvzymPBKHpBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:36.097357Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.05932","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ab440786f0efd31b37e0a34eb258e487c64783df07d3f3c695b9bb3fbc8dcc4f","sha256:a11896c40072318f70867623b58f9c864d216c1afc4c30e5a341a4b1bc8e511e"],"state_sha256":"3708a585147c2684df05fb60aa245fbe152a2d663c15fda348d8971e2ccc8775"}