{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:72BJXC2GOKS532GEDIU7NQEOQQ","short_pith_number":"pith:72BJXC2G","schema_version":"1.0","canonical_sha256":"fe829b8b4672a5dde8c41a29f6c08e84253b0d5d2973852d28302feadca33d51","source":{"kind":"arxiv","id":"1007.2678","version":1},"attestation_state":"computed","paper":{"title":"Approximating Multilinear Monomial Coefficients and Maximum Multilinear Monomials in Multivariate Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Bin Fu, Zhixiang Chen","submitted_at":"2010-07-15T23:12:11Z","abstract_excerpt":"This paper is our third step towards developing a theory of testing monomials in multivariate polynomials and concentrates on two problems: (1) How to compute the coefficients of multilinear monomials; and (2) how to find a maximum multilinear monomial when the input is a $\\Pi\\Sigma\\Pi$ polynomial. We first prove that the first problem is \\#P-hard and then devise a $O^*(3^ns(n))$ upper bound for this problem for any polynomial represented by an arithmetic circuit of size $s(n)$. Later, this upper bound is improved to $O^*(2^n)$ for $\\Pi\\Sigma\\Pi$ polynomials. We then design fully polynomial-ti"},"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":"1007.2678","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-07-15T23:12:11Z","cross_cats_sorted":[],"title_canon_sha256":"3590e5d7cdaffcae1436a4a1015b62060739f4432476b5488877d2e4ed214884","abstract_canon_sha256":"c6e51d60a083e5f03b76d0db18646783e8e0cd052b33ddd61cec03e97c273992"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:06:21.412214Z","signature_b64":"ebZaZU1rchGIDvH8IW5bTLPTiVewFkEsllq1mOTvSkOKqCSKXYwdW9dMt4aDfKlNOA3b4m7fA9TPaocgEj1GCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe829b8b4672a5dde8c41a29f6c08e84253b0d5d2973852d28302feadca33d51","last_reissued_at":"2026-05-18T02:06:21.411551Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:06:21.411551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximating Multilinear Monomial Coefficients and Maximum Multilinear Monomials in Multivariate Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Bin Fu, Zhixiang Chen","submitted_at":"2010-07-15T23:12:11Z","abstract_excerpt":"This paper is our third step towards developing a theory of testing monomials in multivariate polynomials and concentrates on two problems: (1) How to compute the coefficients of multilinear monomials; and (2) how to find a maximum multilinear monomial when the input is a $\\Pi\\Sigma\\Pi$ polynomial. We first prove that the first problem is \\#P-hard and then devise a $O^*(3^ns(n))$ upper bound for this problem for any polynomial represented by an arithmetic circuit of size $s(n)$. Later, this upper bound is improved to $O^*(2^n)$ for $\\Pi\\Sigma\\Pi$ polynomials. We then design fully polynomial-ti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.2678","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":"1007.2678","created_at":"2026-05-18T02:06:21.411645+00:00"},{"alias_kind":"arxiv_version","alias_value":"1007.2678v1","created_at":"2026-05-18T02:06:21.411645+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.2678","created_at":"2026-05-18T02:06:21.411645+00:00"},{"alias_kind":"pith_short_12","alias_value":"72BJXC2GOKS5","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_16","alias_value":"72BJXC2GOKS532GE","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_8","alias_value":"72BJXC2G","created_at":"2026-05-18T12:26:04.259169+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/72BJXC2GOKS532GEDIU7NQEOQQ","json":"https://pith.science/pith/72BJXC2GOKS532GEDIU7NQEOQQ.json","graph_json":"https://pith.science/api/pith-number/72BJXC2GOKS532GEDIU7NQEOQQ/graph.json","events_json":"https://pith.science/api/pith-number/72BJXC2GOKS532GEDIU7NQEOQQ/events.json","paper":"https://pith.science/paper/72BJXC2G"},"agent_actions":{"view_html":"https://pith.science/pith/72BJXC2GOKS532GEDIU7NQEOQQ","download_json":"https://pith.science/pith/72BJXC2GOKS532GEDIU7NQEOQQ.json","view_paper":"https://pith.science/paper/72BJXC2G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1007.2678&json=true","fetch_graph":"https://pith.science/api/pith-number/72BJXC2GOKS532GEDIU7NQEOQQ/graph.json","fetch_events":"https://pith.science/api/pith-number/72BJXC2GOKS532GEDIU7NQEOQQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/72BJXC2GOKS532GEDIU7NQEOQQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/72BJXC2GOKS532GEDIU7NQEOQQ/action/storage_attestation","attest_author":"https://pith.science/pith/72BJXC2GOKS532GEDIU7NQEOQQ/action/author_attestation","sign_citation":"https://pith.science/pith/72BJXC2GOKS532GEDIU7NQEOQQ/action/citation_signature","submit_replication":"https://pith.science/pith/72BJXC2GOKS532GEDIU7NQEOQQ/action/replication_record"}},"created_at":"2026-05-18T02:06:21.411645+00:00","updated_at":"2026-05-18T02:06:21.411645+00:00"}