{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:RCMCLITR244353JT635PZZF4JZ","short_pith_number":"pith:RCMCLITR","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"},"canonical_sha256":"889825a271d739beed33f6fafce4bc4e57d20ddb8077a76ef688e1a27de58048","source":{"kind":"arxiv","id":"1311.7115","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.7115","created_at":"2026-05-18T03:06:04Z"},{"alias_kind":"arxiv_version","alias_value":"1311.7115v1","created_at":"2026-05-18T03:06:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.7115","created_at":"2026-05-18T03:06:04Z"},{"alias_kind":"pith_short_12","alias_value":"RCMCLITR2443","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"RCMCLITR244353JT","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"RCMCLITR","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:RCMCLITR244353JT635PZZF4JZ","target":"record","payload":{"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"},"canonical_sha256":"889825a271d739beed33f6fafce4bc4e57d20ddb8077a76ef688e1a27de58048","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"},"source_kind":"arxiv","source_id":"1311.7115","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-05-18T03:06:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uSC2PZLh2DnKx4JWVx5wTGnWzreHFMkv8ed2x9ptcdJ543Bih+MCrozgIRF8rtPkEE4Vzvm8q466sStYExZXCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:04:51.640797Z"},"content_sha256":"698610046c7bd5f3035d3d5cd2c5bd318987de79e2dc0c3ff62a7f51f541534b","schema_version":"1.0","event_id":"sha256:698610046c7bd5f3035d3d5cd2c5bd318987de79e2dc0c3ff62a7f51f541534b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:RCMCLITR244353JT635PZZF4JZ","target":"graph","payload":{"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"},"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-18T03:06:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DNO4cxzh5xJEeayKKxhs08DNtHD43UV71DLyI8do/ByXI0qAxtuGkrbu82EzfCW7JeCYECNklgeqMGPuw2u1Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:04:51.641450Z"},"content_sha256":"7090d1a926656d3129e3d33788f6d6e7f06e917fbeda2cbcfa1730266db7934c","schema_version":"1.0","event_id":"sha256:7090d1a926656d3129e3d33788f6d6e7f06e917fbeda2cbcfa1730266db7934c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RCMCLITR244353JT635PZZF4JZ/bundle.json","state_url":"https://pith.science/pith/RCMCLITR244353JT635PZZF4JZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RCMCLITR244353JT635PZZF4JZ/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-05-27T05:04:51Z","links":{"resolver":"https://pith.science/pith/RCMCLITR244353JT635PZZF4JZ","bundle":"https://pith.science/pith/RCMCLITR244353JT635PZZF4JZ/bundle.json","state":"https://pith.science/pith/RCMCLITR244353JT635PZZF4JZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RCMCLITR244353JT635PZZF4JZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:RCMCLITR244353JT635PZZF4JZ","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":"cb95b6758b04bac6124193233671a6b1eda4aafc73bb4d43c773921a55bdaf0d","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-11-27T20:33:33Z","title_canon_sha256":"fb854eb7c7ef085c5bd36eb82343aff3a9a80c6b7b3541b4a7ef15c6f7ad78dc"},"schema_version":"1.0","source":{"id":"1311.7115","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.7115","created_at":"2026-05-18T03:06:04Z"},{"alias_kind":"arxiv_version","alias_value":"1311.7115v1","created_at":"2026-05-18T03:06:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.7115","created_at":"2026-05-18T03:06:04Z"},{"alias_kind":"pith_short_12","alias_value":"RCMCLITR2443","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"RCMCLITR244353JT","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"RCMCLITR","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:7090d1a926656d3129e3d33788f6d6e7f06e917fbeda2cbcfa1730266db7934c","target":"graph","created_at":"2026-05-18T03:06:04Z","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":"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","authors_text":"Anindya De, Ilias Diakonikolas, Rocco A. Servedio","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-11-27T20:33:33Z","title":"Deterministic Approximate Counting for Juntas of Degree-$2$ Polynomial Threshold Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.7115","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:698610046c7bd5f3035d3d5cd2c5bd318987de79e2dc0c3ff62a7f51f541534b","target":"record","created_at":"2026-05-18T03:06:04Z","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":"cb95b6758b04bac6124193233671a6b1eda4aafc73bb4d43c773921a55bdaf0d","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-11-27T20:33:33Z","title_canon_sha256":"fb854eb7c7ef085c5bd36eb82343aff3a9a80c6b7b3541b4a7ef15c6f7ad78dc"},"schema_version":"1.0","source":{"id":"1311.7115","kind":"arxiv","version":1}},"canonical_sha256":"889825a271d739beed33f6fafce4bc4e57d20ddb8077a76ef688e1a27de58048","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"889825a271d739beed33f6fafce4bc4e57d20ddb8077a76ef688e1a27de58048","first_computed_at":"2026-05-18T03:06:04.153688Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:06:04.153688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LzkUXK6LnTWnInrQH+7n7sszN7Xv3RqaQTytmnO+SfekL/pZBUBU9Xhjc42/NYTKR4JqTQi1fB1ofobHvbGCCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:06:04.154142Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.7115","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:698610046c7bd5f3035d3d5cd2c5bd318987de79e2dc0c3ff62a7f51f541534b","sha256:7090d1a926656d3129e3d33788f6d6e7f06e917fbeda2cbcfa1730266db7934c"],"state_sha256":"7561dee2dad099e908f0b12da0a3fc84aaf230c84870cef7d4ecfd4c963f77f0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2NSXJqEqGe7iBeIozZriSRyF5vDz4m6G2eCl8nNoHiIiLQ6VAO3CCqaRQ0zIrIMz7kByXHAQEJ5RK3IeGk8lBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T05:04:51.645242Z","bundle_sha256":"7e0dc763f31a1fc0ca040c85adc2b0f59df02de7227d6c81735ec37cd821d67e"}}