{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:72BJXC2GOKS532GEDIU7NQEOQQ","short_pith_number":"pith:72BJXC2G","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"},"canonical_sha256":"fe829b8b4672a5dde8c41a29f6c08e84253b0d5d2973852d28302feadca33d51","source":{"kind":"arxiv","id":"1007.2678","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.2678","created_at":"2026-05-18T02:06:21Z"},{"alias_kind":"arxiv_version","alias_value":"1007.2678v1","created_at":"2026-05-18T02:06:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.2678","created_at":"2026-05-18T02:06:21Z"},{"alias_kind":"pith_short_12","alias_value":"72BJXC2GOKS5","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"72BJXC2GOKS532GE","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"72BJXC2G","created_at":"2026-05-18T12:26:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:72BJXC2GOKS532GEDIU7NQEOQQ","target":"record","payload":{"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"},"canonical_sha256":"fe829b8b4672a5dde8c41a29f6c08e84253b0d5d2973852d28302feadca33d51","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"},"source_kind":"arxiv","source_id":"1007.2678","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-18T02:06:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C52uXS2QWabrsC3azW/ppkqn9Z8J5rL7wurSOKpDUJ1WPKphm2Fg6KPf2OkqViJ/tcOvYrBkqDkcsrOQzRvYDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:33:36.687359Z"},"content_sha256":"c1fd9137c06526c4c9b3b3ddd1c87e7356e3777f1e0f5a7aec091253dee1eae6","schema_version":"1.0","event_id":"sha256:c1fd9137c06526c4c9b3b3ddd1c87e7356e3777f1e0f5a7aec091253dee1eae6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:72BJXC2GOKS532GEDIU7NQEOQQ","target":"graph","payload":{"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"},"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-18T02:06:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AjONuivsCPUQYE2Q9070eI5AsZZPE5FYyvqe3h4wLueHKXI0wZQ4VRV24YIZg5Zx07/XogKm0a9mD+3LFPDjAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:33:36.687997Z"},"content_sha256":"dda471587af463c79d6c0d2adc23b54779b4b599a428856bfc89b6dcbe0feab8","schema_version":"1.0","event_id":"sha256:dda471587af463c79d6c0d2adc23b54779b4b599a428856bfc89b6dcbe0feab8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/72BJXC2GOKS532GEDIU7NQEOQQ/bundle.json","state_url":"https://pith.science/pith/72BJXC2GOKS532GEDIU7NQEOQQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/72BJXC2GOKS532GEDIU7NQEOQQ/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-06-07T17:33:36Z","links":{"resolver":"https://pith.science/pith/72BJXC2GOKS532GEDIU7NQEOQQ","bundle":"https://pith.science/pith/72BJXC2GOKS532GEDIU7NQEOQQ/bundle.json","state":"https://pith.science/pith/72BJXC2GOKS532GEDIU7NQEOQQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/72BJXC2GOKS532GEDIU7NQEOQQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:72BJXC2GOKS532GEDIU7NQEOQQ","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":"c6e51d60a083e5f03b76d0db18646783e8e0cd052b33ddd61cec03e97c273992","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-07-15T23:12:11Z","title_canon_sha256":"3590e5d7cdaffcae1436a4a1015b62060739f4432476b5488877d2e4ed214884"},"schema_version":"1.0","source":{"id":"1007.2678","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.2678","created_at":"2026-05-18T02:06:21Z"},{"alias_kind":"arxiv_version","alias_value":"1007.2678v1","created_at":"2026-05-18T02:06:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.2678","created_at":"2026-05-18T02:06:21Z"},{"alias_kind":"pith_short_12","alias_value":"72BJXC2GOKS5","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"72BJXC2GOKS532GE","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"72BJXC2G","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:dda471587af463c79d6c0d2adc23b54779b4b599a428856bfc89b6dcbe0feab8","target":"graph","created_at":"2026-05-18T02:06:21Z","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":"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","authors_text":"Bin Fu, Zhixiang Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-07-15T23:12:11Z","title":"Approximating Multilinear Monomial Coefficients and Maximum Multilinear Monomials in Multivariate Polynomials"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.2678","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:c1fd9137c06526c4c9b3b3ddd1c87e7356e3777f1e0f5a7aec091253dee1eae6","target":"record","created_at":"2026-05-18T02:06:21Z","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":"c6e51d60a083e5f03b76d0db18646783e8e0cd052b33ddd61cec03e97c273992","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-07-15T23:12:11Z","title_canon_sha256":"3590e5d7cdaffcae1436a4a1015b62060739f4432476b5488877d2e4ed214884"},"schema_version":"1.0","source":{"id":"1007.2678","kind":"arxiv","version":1}},"canonical_sha256":"fe829b8b4672a5dde8c41a29f6c08e84253b0d5d2973852d28302feadca33d51","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fe829b8b4672a5dde8c41a29f6c08e84253b0d5d2973852d28302feadca33d51","first_computed_at":"2026-05-18T02:06:21.411551Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:06:21.411551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ebZaZU1rchGIDvH8IW5bTLPTiVewFkEsllq1mOTvSkOKqCSKXYwdW9dMt4aDfKlNOA3b4m7fA9TPaocgEj1GCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:06:21.412214Z","signed_message":"canonical_sha256_bytes"},"source_id":"1007.2678","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c1fd9137c06526c4c9b3b3ddd1c87e7356e3777f1e0f5a7aec091253dee1eae6","sha256:dda471587af463c79d6c0d2adc23b54779b4b599a428856bfc89b6dcbe0feab8"],"state_sha256":"010681165eb7271af3a2d4b0df5e25f963724d618dea75da228e0c4bb9e7880b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QzCS7eSVrPTZOAnTwrRGozPG+c8tjDcDMoiZ+jTz/JCv6U/pMxjqAwrd9cpoDgqxv5jQwc6T1yPPZ+9wr8zHDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T17:33:36.691495Z","bundle_sha256":"31657e39333a2bc2e4ca4f53f09faf4e05ed1a362007f8b52c22240eb6e015c7"}}