{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:RCMCLITR244353JT635PZZF4JZ","short_pith_number":"pith:RCMCLITR","schema_version":"1.0","canonical_sha256":"889825a271d739beed33f6fafce4bc4e57d20ddb8077a76ef688e1a27de58048","source":{"kind":"arxiv","id":"1311.7115","version":1},"attestation_state":"computed","paper":{"title":"Deterministic Approximate Counting for Juntas of Degree-$2$ Polynomial Threshold Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.CC","authors_text":"Anindya De, Ilias Diakonikolas, Rocco A. Servedio","submitted_at":"2013-11-27T20:33:33Z","abstract_excerpt":"Let $g: \\{-1,1\\}^k \\to \\{-1,1\\}$ be any Boolean function and $q_1,\\dots,q_k$ be any degree-2 polynomials over $\\{-1,1\\}^n.$ We give a \\emph{deterministic} algorithm which, given as input explicit descriptions of $g,q_1,\\dots,q_k$ and an accuracy parameter $\\eps>0$, approximates \\[\\Pr_{x \\sim \\{-1,1\\}^n}[g(\\sign(q_1(x)),\\dots,\\sign(q_k(x)))=1]\\] to within an additive $\\pm \\eps$. For any constant $\\eps > 0$ and $k \\geq 1$ the running time of our algorithm is a fixed polynomial in $n$. This is the first fixed polynomial-time algorithm that can deterministically approximately count satisfying assi"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1311.7115","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-11-27T20:33:33Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"fb854eb7c7ef085c5bd36eb82343aff3a9a80c6b7b3541b4a7ef15c6f7ad78dc","abstract_canon_sha256":"cb95b6758b04bac6124193233671a6b1eda4aafc73bb4d43c773921a55bdaf0d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:04.154142Z","signature_b64":"LzkUXK6LnTWnInrQH+7n7sszN7Xv3RqaQTytmnO+SfekL/pZBUBU9Xhjc42/NYTKR4JqTQi1fB1ofobHvbGCCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"889825a271d739beed33f6fafce4bc4e57d20ddb8077a76ef688e1a27de58048","last_reissued_at":"2026-05-18T03:06:04.153688Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:04.153688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deterministic Approximate Counting for Juntas of Degree-$2$ Polynomial Threshold Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.CC","authors_text":"Anindya De, Ilias Diakonikolas, Rocco A. Servedio","submitted_at":"2013-11-27T20:33:33Z","abstract_excerpt":"Let $g: \\{-1,1\\}^k \\to \\{-1,1\\}$ be any Boolean function and $q_1,\\dots,q_k$ be any degree-2 polynomials over $\\{-1,1\\}^n.$ We give a \\emph{deterministic} algorithm which, given as input explicit descriptions of $g,q_1,\\dots,q_k$ and an accuracy parameter $\\eps>0$, approximates \\[\\Pr_{x \\sim \\{-1,1\\}^n}[g(\\sign(q_1(x)),\\dots,\\sign(q_k(x)))=1]\\] to within an additive $\\pm \\eps$. For any constant $\\eps > 0$ and $k \\geq 1$ the running time of our algorithm is a fixed polynomial in $n$. This is the first fixed polynomial-time algorithm that can deterministically approximately count satisfying assi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.7115","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":""},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1311.7115","created_at":"2026-05-18T03:06:04.153761+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.7115v1","created_at":"2026-05-18T03:06:04.153761+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.7115","created_at":"2026-05-18T03:06:04.153761+00:00"},{"alias_kind":"pith_short_12","alias_value":"RCMCLITR2443","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"RCMCLITR244353JT","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"RCMCLITR","created_at":"2026-05-18T12:27:57.521954+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RCMCLITR244353JT635PZZF4JZ","json":"https://pith.science/pith/RCMCLITR244353JT635PZZF4JZ.json","graph_json":"https://pith.science/api/pith-number/RCMCLITR244353JT635PZZF4JZ/graph.json","events_json":"https://pith.science/api/pith-number/RCMCLITR244353JT635PZZF4JZ/events.json","paper":"https://pith.science/paper/RCMCLITR"},"agent_actions":{"view_html":"https://pith.science/pith/RCMCLITR244353JT635PZZF4JZ","download_json":"https://pith.science/pith/RCMCLITR244353JT635PZZF4JZ.json","view_paper":"https://pith.science/paper/RCMCLITR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.7115&json=true","fetch_graph":"https://pith.science/api/pith-number/RCMCLITR244353JT635PZZF4JZ/graph.json","fetch_events":"https://pith.science/api/pith-number/RCMCLITR244353JT635PZZF4JZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RCMCLITR244353JT635PZZF4JZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RCMCLITR244353JT635PZZF4JZ/action/storage_attestation","attest_author":"https://pith.science/pith/RCMCLITR244353JT635PZZF4JZ/action/author_attestation","sign_citation":"https://pith.science/pith/RCMCLITR244353JT635PZZF4JZ/action/citation_signature","submit_replication":"https://pith.science/pith/RCMCLITR244353JT635PZZF4JZ/action/replication_record"}},"created_at":"2026-05-18T03:06:04.153761+00:00","updated_at":"2026-05-18T03:06:04.153761+00:00"}