{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:5JR2CL3YMGU6GGAGLFDGBONH6S","short_pith_number":"pith:5JR2CL3Y","schema_version":"1.0","canonical_sha256":"ea63a12f7861a9e31806594660b9a7f4b47d1c047040f4579c556fefbb685e7e","source":{"kind":"arxiv","id":"1303.0478","version":2},"attestation_state":"computed","paper":{"title":"Monomial Testing and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Shenshi Chen","submitted_at":"2013-03-03T09:11:24Z","abstract_excerpt":"In this paper, we devise two algorithms for the problem of testing $q$-monomials of degree $k$ in any multivariate polynomial represented by a circuit, regardless of the primality of $q$. One is an $O^*(2^k)$ time randomized algorithm. The other is an $O^*(12.8^k)$ time deterministic algorithm for the same $q$-monomial testing problem but requiring the polynomials to be represented by tree-like circuits. Several applications of $q$-monomial testing are also given, including a deterministic $O^*(12.8^{mk})$ upper bound for the $m$-set $k$-packing problem."},"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":"1303.0478","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-03-03T09:11:24Z","cross_cats_sorted":[],"title_canon_sha256":"c1cb87dfc7cfc238af47aededdc2a3098bc4fea319c8311bf30db4e92560b31d","abstract_canon_sha256":"ad3b3115ca2cb0dc234d55ed625a1633c89aec458d6a2b829d6eca191884b667"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:17.002756Z","signature_b64":"Ebiz4CQbsCG2M6OrvXuKAFMKe74O1LCJJxKpWOpCbZgxKdLirhv2I342IXskNfAfcP4Sb4ZnqXq9M+2CQtjUBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea63a12f7861a9e31806594660b9a7f4b47d1c047040f4579c556fefbb685e7e","last_reissued_at":"2026-05-18T03:28:17.002184Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:17.002184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Monomial Testing and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Shenshi Chen","submitted_at":"2013-03-03T09:11:24Z","abstract_excerpt":"In this paper, we devise two algorithms for the problem of testing $q$-monomials of degree $k$ in any multivariate polynomial represented by a circuit, regardless of the primality of $q$. One is an $O^*(2^k)$ time randomized algorithm. The other is an $O^*(12.8^k)$ time deterministic algorithm for the same $q$-monomial testing problem but requiring the polynomials to be represented by tree-like circuits. Several applications of $q$-monomial testing are also given, including a deterministic $O^*(12.8^{mk})$ upper bound for the $m$-set $k$-packing problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.0478","kind":"arxiv","version":2},"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":"1303.0478","created_at":"2026-05-18T03:28:17.002288+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.0478v2","created_at":"2026-05-18T03:28:17.002288+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.0478","created_at":"2026-05-18T03:28:17.002288+00:00"},{"alias_kind":"pith_short_12","alias_value":"5JR2CL3YMGU6","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"5JR2CL3YMGU6GGAG","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"5JR2CL3Y","created_at":"2026-05-18T12:27:34.582898+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/5JR2CL3YMGU6GGAGLFDGBONH6S","json":"https://pith.science/pith/5JR2CL3YMGU6GGAGLFDGBONH6S.json","graph_json":"https://pith.science/api/pith-number/5JR2CL3YMGU6GGAGLFDGBONH6S/graph.json","events_json":"https://pith.science/api/pith-number/5JR2CL3YMGU6GGAGLFDGBONH6S/events.json","paper":"https://pith.science/paper/5JR2CL3Y"},"agent_actions":{"view_html":"https://pith.science/pith/5JR2CL3YMGU6GGAGLFDGBONH6S","download_json":"https://pith.science/pith/5JR2CL3YMGU6GGAGLFDGBONH6S.json","view_paper":"https://pith.science/paper/5JR2CL3Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.0478&json=true","fetch_graph":"https://pith.science/api/pith-number/5JR2CL3YMGU6GGAGLFDGBONH6S/graph.json","fetch_events":"https://pith.science/api/pith-number/5JR2CL3YMGU6GGAGLFDGBONH6S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5JR2CL3YMGU6GGAGLFDGBONH6S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5JR2CL3YMGU6GGAGLFDGBONH6S/action/storage_attestation","attest_author":"https://pith.science/pith/5JR2CL3YMGU6GGAGLFDGBONH6S/action/author_attestation","sign_citation":"https://pith.science/pith/5JR2CL3YMGU6GGAGLFDGBONH6S/action/citation_signature","submit_replication":"https://pith.science/pith/5JR2CL3YMGU6GGAGLFDGBONH6S/action/replication_record"}},"created_at":"2026-05-18T03:28:17.002288+00:00","updated_at":"2026-05-18T03:28:17.002288+00:00"}