{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:LLCAAACQ6CWXAWH2ZYPZGJHO6F","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":"3988a217b5f67b16d18579758b69680e4c6655174be9713ec5ba743dcbcfed71","cross_cats_sorted":["math.AC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-02T16:06:29Z","title_canon_sha256":"47703ff8f8ea275d83d4ceb1aa3d791658708f500219f1372d64ec5917edd864"},"schema_version":"1.0","source":{"id":"2607.02364","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.02364","created_at":"2026-07-03T01:17:56Z"},{"alias_kind":"arxiv_version","alias_value":"2607.02364v1","created_at":"2026-07-03T01:17:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.02364","created_at":"2026-07-03T01:17:56Z"},{"alias_kind":"pith_short_12","alias_value":"LLCAAACQ6CWX","created_at":"2026-07-03T01:17:56Z"},{"alias_kind":"pith_short_16","alias_value":"LLCAAACQ6CWXAWH2","created_at":"2026-07-03T01:17:56Z"},{"alias_kind":"pith_short_8","alias_value":"LLCAAACQ","created_at":"2026-07-03T01:17:56Z"}],"graph_snapshots":[{"event_id":"sha256:264bfcd4dc11f78e1cbfd6ad677dbc171cbaf3c2d8f568701b227cd6d4a07ca6","target":"graph","created_at":"2026-07-03T01:17:56Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.02364/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the problem of deterministically computing the exact root of a sparse polynomial in the multivariate setting. Let $f \\in \\F[x_1,\\ldots,x_n]$ be a nonzero polynomial that is an exact $e$-th power, say $f = g^e$. Suppose $f$ is $s$-sparse, has an individual degree of at most $d$, and a total degree of $D = \\tdeg(f)$. We prove a sparsity bound on the base polynomial $g$: \\[ \\|g\\|_0 \\le s^{D(2d+2)/e + 1}. \\] Based on this bound, we develop a deterministic algorithm that computes the base $g$. %\nIn contrast to the general deterministic factorization algorithm of Bhargava, Saraf, and Volkov","authors_text":"Qiao-Long Huang, Ruichen Qiu, Xiao-Shan Gao, Yichuan Cao","cross_cats":["math.AC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-02T16:06:29Z","title":"Deterministic Polynomial-time Exact-root Computation for Sparse Polynomials with Bounded Total Degree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.02364","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:a86d90134d9e3965d34dd29c79466244e26f4f0dbde2ae70182db73cdcd5f04a","target":"record","created_at":"2026-07-03T01:17:56Z","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":"3988a217b5f67b16d18579758b69680e4c6655174be9713ec5ba743dcbcfed71","cross_cats_sorted":["math.AC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-02T16:06:29Z","title_canon_sha256":"47703ff8f8ea275d83d4ceb1aa3d791658708f500219f1372d64ec5917edd864"},"schema_version":"1.0","source":{"id":"2607.02364","kind":"arxiv","version":1}},"canonical_sha256":"5ac4000050f0ad7058face1f9324eef1591e43b30a1a62073f6f702b1c373892","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ac4000050f0ad7058face1f9324eef1591e43b30a1a62073f6f702b1c373892","first_computed_at":"2026-07-03T01:17:56.777723Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-03T01:17:56.777723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mak8XrSbaiUVvoxwbgL9DT1L8O1vyNYmBFctgNPSSPVpBDgZ7qvzaNJ4cx0HUxjKIuvuzUHCEgp1okE6g6rHDQ==","signature_status":"signed_v1","signed_at":"2026-07-03T01:17:56.778163Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.02364","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a86d90134d9e3965d34dd29c79466244e26f4f0dbde2ae70182db73cdcd5f04a","sha256:264bfcd4dc11f78e1cbfd6ad677dbc171cbaf3c2d8f568701b227cd6d4a07ca6"],"state_sha256":"fb8ba4bc5991e64566b0150116394ff262dc7c3eb6869899562e107fdc1bf5fe"}