{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:U6UZ5WWRUMGD2EJXXNMNP7QLFO","short_pith_number":"pith:U6UZ5WWR","canonical_record":{"source":{"id":"1808.06655","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2018-08-20T19:10:39Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"a4836ea715abb3262255f00dcd79e9528894c9e1a29d03ab4fa8777991fd0153","abstract_canon_sha256":"2809601800fd00927407c1d07a8dbf738e2239fd286574e27f652b9c89b4f877"},"schema_version":"1.0"},"canonical_sha256":"a7a99edad1a30c3d1137bb58d7fe0b2baf4c30f8693682f14d1a96a0c770509b","source":{"kind":"arxiv","id":"1808.06655","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.06655","created_at":"2026-05-18T00:07:39Z"},{"alias_kind":"arxiv_version","alias_value":"1808.06655v1","created_at":"2026-05-18T00:07:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.06655","created_at":"2026-05-18T00:07:39Z"},{"alias_kind":"pith_short_12","alias_value":"U6UZ5WWRUMGD","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"U6UZ5WWRUMGD2EJX","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"U6UZ5WWR","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:U6UZ5WWRUMGD2EJXXNMNP7QLFO","target":"record","payload":{"canonical_record":{"source":{"id":"1808.06655","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2018-08-20T19:10:39Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"a4836ea715abb3262255f00dcd79e9528894c9e1a29d03ab4fa8777991fd0153","abstract_canon_sha256":"2809601800fd00927407c1d07a8dbf738e2239fd286574e27f652b9c89b4f877"},"schema_version":"1.0"},"canonical_sha256":"a7a99edad1a30c3d1137bb58d7fe0b2baf4c30f8693682f14d1a96a0c770509b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:39.504066Z","signature_b64":"XoK91LqvKrERPqMpPPMzpwbxjaef+/r8zUHjrABTHjHagR+aHJbP4o4V7G7LQeFMgU9Jvpdjhe3TCwagxv9RCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7a99edad1a30c3d1137bb58d7fe0b2baf4c30f8693682f14d1a96a0c770509b","last_reissued_at":"2026-05-18T00:07:39.503402Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:39.503402Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.06655","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-18T00:07:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AeJ/R/uEs6vX2lzkQ/5DY8+D0P8vt4KJaQgA8e6naxyhoZGPrOPUP7M3aJkgkZr19BAGGDNv3gRb+7RAiBGUCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:22:02.767219Z"},"content_sha256":"4b29d650a6f8434d68982e2c7d25218873d093e4393c257e1fc1004bec72af76","schema_version":"1.0","event_id":"sha256:4b29d650a6f8434d68982e2c7d25218873d093e4393c257e1fc1004bec72af76"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:U6UZ5WWRUMGD2EJXXNMNP7QLFO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deterministic Factorization of Sparse Polynomials with Bounded Individual Degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.AC","authors_text":"Ilya Volkovich, Shubhangi Saraf, Vishwas Bhargava","submitted_at":"2018-08-20T19:10:39Z","abstract_excerpt":"In this paper we study the problem of deterministic factorization of sparse polynomials. We show that if $f \\in \\mathbb{F}[x_{1},x_{2},\\ldots ,x_{n}]$ is a polynomial with $s$ monomials, with individual degrees of its variables bounded by $d$, then $f$ can be deterministically factored in time $s^{\\mathrm{poly}(d) \\log n}$. Prior to our work, the only efficient factoring algorithms known for this class of polynomials were randomized, and other than for the cases of $d=1$ and $d=2$, only exponential time deterministic factoring algorithms were known.\n  A crucial ingredient in our proof is a qua"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.06655","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-18T00:07:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pKXap7WQqqKaU9cMbmqlVD/ssAGgsibjatU7bcIvtDYm8FLf96PiNw4DqxcusituQi1zZhlfZbVryeCK8vdsDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:22:02.767578Z"},"content_sha256":"88cced79e801f97aeb9d3b7b0e8849184db887b46c111ddfa7ca7cf68b657298","schema_version":"1.0","event_id":"sha256:88cced79e801f97aeb9d3b7b0e8849184db887b46c111ddfa7ca7cf68b657298"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U6UZ5WWRUMGD2EJXXNMNP7QLFO/bundle.json","state_url":"https://pith.science/pith/U6UZ5WWRUMGD2EJXXNMNP7QLFO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U6UZ5WWRUMGD2EJXXNMNP7QLFO/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-02T01:22:02Z","links":{"resolver":"https://pith.science/pith/U6UZ5WWRUMGD2EJXXNMNP7QLFO","bundle":"https://pith.science/pith/U6UZ5WWRUMGD2EJXXNMNP7QLFO/bundle.json","state":"https://pith.science/pith/U6UZ5WWRUMGD2EJXXNMNP7QLFO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U6UZ5WWRUMGD2EJXXNMNP7QLFO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:U6UZ5WWRUMGD2EJXXNMNP7QLFO","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":"2809601800fd00927407c1d07a8dbf738e2239fd286574e27f652b9c89b4f877","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2018-08-20T19:10:39Z","title_canon_sha256":"a4836ea715abb3262255f00dcd79e9528894c9e1a29d03ab4fa8777991fd0153"},"schema_version":"1.0","source":{"id":"1808.06655","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.06655","created_at":"2026-05-18T00:07:39Z"},{"alias_kind":"arxiv_version","alias_value":"1808.06655v1","created_at":"2026-05-18T00:07:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.06655","created_at":"2026-05-18T00:07:39Z"},{"alias_kind":"pith_short_12","alias_value":"U6UZ5WWRUMGD","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"U6UZ5WWRUMGD2EJX","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"U6UZ5WWR","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:88cced79e801f97aeb9d3b7b0e8849184db887b46c111ddfa7ca7cf68b657298","target":"graph","created_at":"2026-05-18T00:07:39Z","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":"In this paper we study the problem of deterministic factorization of sparse polynomials. We show that if $f \\in \\mathbb{F}[x_{1},x_{2},\\ldots ,x_{n}]$ is a polynomial with $s$ monomials, with individual degrees of its variables bounded by $d$, then $f$ can be deterministically factored in time $s^{\\mathrm{poly}(d) \\log n}$. Prior to our work, the only efficient factoring algorithms known for this class of polynomials were randomized, and other than for the cases of $d=1$ and $d=2$, only exponential time deterministic factoring algorithms were known.\n  A crucial ingredient in our proof is a qua","authors_text":"Ilya Volkovich, Shubhangi Saraf, Vishwas Bhargava","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2018-08-20T19:10:39Z","title":"Deterministic Factorization of Sparse Polynomials with Bounded Individual Degree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.06655","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:4b29d650a6f8434d68982e2c7d25218873d093e4393c257e1fc1004bec72af76","target":"record","created_at":"2026-05-18T00:07:39Z","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":"2809601800fd00927407c1d07a8dbf738e2239fd286574e27f652b9c89b4f877","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2018-08-20T19:10:39Z","title_canon_sha256":"a4836ea715abb3262255f00dcd79e9528894c9e1a29d03ab4fa8777991fd0153"},"schema_version":"1.0","source":{"id":"1808.06655","kind":"arxiv","version":1}},"canonical_sha256":"a7a99edad1a30c3d1137bb58d7fe0b2baf4c30f8693682f14d1a96a0c770509b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a7a99edad1a30c3d1137bb58d7fe0b2baf4c30f8693682f14d1a96a0c770509b","first_computed_at":"2026-05-18T00:07:39.503402Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:39.503402Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XoK91LqvKrERPqMpPPMzpwbxjaef+/r8zUHjrABTHjHagR+aHJbP4o4V7G7LQeFMgU9Jvpdjhe3TCwagxv9RCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:39.504066Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.06655","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4b29d650a6f8434d68982e2c7d25218873d093e4393c257e1fc1004bec72af76","sha256:88cced79e801f97aeb9d3b7b0e8849184db887b46c111ddfa7ca7cf68b657298"],"state_sha256":"2cd643dd5a67dd702eea655a811478edd76a90c9e986def969f4a5fa12372339"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9DOhT+lFZAoP3m6VhG9SNnsZ8jMAJK3ZlldnSGxDL4i7djAkVr6U3D7XbfVICDs4W+MvBUHwn8aKBB36ASx8Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T01:22:02.769432Z","bundle_sha256":"9df0323b9b163c44f7c2a7d52b506b1c36c8548d3bc0d47ac4b574523680fab6"}}