{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:DMQXLASECNQ56JDCC44GAQZJXA","short_pith_number":"pith:DMQXLASE","canonical_record":{"source":{"id":"1812.06828","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-12-17T15:16:33Z","cross_cats_sorted":["cs.SC"],"title_canon_sha256":"1aa75da10746a76d848a0c884bb76e18638046f47b1cc4bf7cdaefba119a4a8f","abstract_canon_sha256":"fdb8f7ad85e6362ac469ec6ad7c0bd840b69abf60727786947575439ff1c4066"},"schema_version":"1.0"},"canonical_sha256":"1b217582441361df24621738604329b817e389a81a54fbe1ab865ed27541c840","source":{"kind":"arxiv","id":"1812.06828","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.06828","created_at":"2026-05-17T23:58:09Z"},{"alias_kind":"arxiv_version","alias_value":"1812.06828v1","created_at":"2026-05-17T23:58:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.06828","created_at":"2026-05-17T23:58:09Z"},{"alias_kind":"pith_short_12","alias_value":"DMQXLASECNQ5","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DMQXLASECNQ56JDC","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DMQXLASE","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:DMQXLASECNQ56JDCC44GAQZJXA","target":"record","payload":{"canonical_record":{"source":{"id":"1812.06828","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-12-17T15:16:33Z","cross_cats_sorted":["cs.SC"],"title_canon_sha256":"1aa75da10746a76d848a0c884bb76e18638046f47b1cc4bf7cdaefba119a4a8f","abstract_canon_sha256":"fdb8f7ad85e6362ac469ec6ad7c0bd840b69abf60727786947575439ff1c4066"},"schema_version":"1.0"},"canonical_sha256":"1b217582441361df24621738604329b817e389a81a54fbe1ab865ed27541c840","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:09.278469Z","signature_b64":"TpO5kzAmjDl8kTkuyE4LWchJxH5dFhCxeB0ph2vFgqH1Z/JoPH8h0U6rflmztI2SMvztyW5zdeF2vi9ZPJ64DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b217582441361df24621738604329b817e389a81a54fbe1ab865ed27541c840","last_reissued_at":"2026-05-17T23:58:09.277807Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:09.277807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.06828","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-17T23:58:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EzXb7NmoV6Ni9WKhqxzI+Uj3rrSF8IkxmMTUS/IYgCZj6YFbmCBHOplWIRTGCBC01FszVlYuTeuQX7D6qokjDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:35:51.464393Z"},"content_sha256":"d56bb9455029f0fc6f8148fcb00fd80aabf9a624b0fc6b2ef38ea574341d4c2f","schema_version":"1.0","event_id":"sha256:d56bb9455029f0fc6f8148fcb00fd80aabf9a624b0fc6b2ef38ea574341d4c2f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:DMQXLASECNQ56JDCC44GAQZJXA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Complexity of Factors of Multivariate Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC"],"primary_cat":"cs.CC","authors_text":"Peter B\\\"urgisser","submitted_at":"2018-12-17T15:16:33Z","abstract_excerpt":"The existence of string functions, which are not polynomial time computable, but whose graph is checkable in polynomial time, is a basic assumption in cryptography. We prove that in the framework of algebraic complexity, there are no such families of polynomial functions of polynomially bounded degree over fields of characteristic zero. The proof relies on a polynomial upper bound on the approximative complexity of a factor g of a polynomial f in terms of the (approximative) complexity of f and the degree of the factor g. This extends a result by Kaltofen (STOC 1986). The concept of approximat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.06828","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-17T23:58:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P3srKx17XGKwTE+J1wCLM3/5BrGT3Tt02dx2QPpv32lKhK3VQPxhoWvJX1cYE2KUi+8Gvh4i1GoQHdZXyObODg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:35:51.465168Z"},"content_sha256":"e106a1870a8e906fce147e14482b7b35df65a9c0ec5f415b6491fc8dd68d1762","schema_version":"1.0","event_id":"sha256:e106a1870a8e906fce147e14482b7b35df65a9c0ec5f415b6491fc8dd68d1762"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DMQXLASECNQ56JDCC44GAQZJXA/bundle.json","state_url":"https://pith.science/pith/DMQXLASECNQ56JDCC44GAQZJXA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DMQXLASECNQ56JDCC44GAQZJXA/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-05-31T12:35:51Z","links":{"resolver":"https://pith.science/pith/DMQXLASECNQ56JDCC44GAQZJXA","bundle":"https://pith.science/pith/DMQXLASECNQ56JDCC44GAQZJXA/bundle.json","state":"https://pith.science/pith/DMQXLASECNQ56JDCC44GAQZJXA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DMQXLASECNQ56JDCC44GAQZJXA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:DMQXLASECNQ56JDCC44GAQZJXA","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":"fdb8f7ad85e6362ac469ec6ad7c0bd840b69abf60727786947575439ff1c4066","cross_cats_sorted":["cs.SC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-12-17T15:16:33Z","title_canon_sha256":"1aa75da10746a76d848a0c884bb76e18638046f47b1cc4bf7cdaefba119a4a8f"},"schema_version":"1.0","source":{"id":"1812.06828","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.06828","created_at":"2026-05-17T23:58:09Z"},{"alias_kind":"arxiv_version","alias_value":"1812.06828v1","created_at":"2026-05-17T23:58:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.06828","created_at":"2026-05-17T23:58:09Z"},{"alias_kind":"pith_short_12","alias_value":"DMQXLASECNQ5","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DMQXLASECNQ56JDC","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DMQXLASE","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:e106a1870a8e906fce147e14482b7b35df65a9c0ec5f415b6491fc8dd68d1762","target":"graph","created_at":"2026-05-17T23:58:09Z","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":"The existence of string functions, which are not polynomial time computable, but whose graph is checkable in polynomial time, is a basic assumption in cryptography. We prove that in the framework of algebraic complexity, there are no such families of polynomial functions of polynomially bounded degree over fields of characteristic zero. The proof relies on a polynomial upper bound on the approximative complexity of a factor g of a polynomial f in terms of the (approximative) complexity of f and the degree of the factor g. This extends a result by Kaltofen (STOC 1986). The concept of approximat","authors_text":"Peter B\\\"urgisser","cross_cats":["cs.SC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-12-17T15:16:33Z","title":"The Complexity of Factors of Multivariate Polynomials"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.06828","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:d56bb9455029f0fc6f8148fcb00fd80aabf9a624b0fc6b2ef38ea574341d4c2f","target":"record","created_at":"2026-05-17T23:58:09Z","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":"fdb8f7ad85e6362ac469ec6ad7c0bd840b69abf60727786947575439ff1c4066","cross_cats_sorted":["cs.SC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-12-17T15:16:33Z","title_canon_sha256":"1aa75da10746a76d848a0c884bb76e18638046f47b1cc4bf7cdaefba119a4a8f"},"schema_version":"1.0","source":{"id":"1812.06828","kind":"arxiv","version":1}},"canonical_sha256":"1b217582441361df24621738604329b817e389a81a54fbe1ab865ed27541c840","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b217582441361df24621738604329b817e389a81a54fbe1ab865ed27541c840","first_computed_at":"2026-05-17T23:58:09.277807Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:09.277807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TpO5kzAmjDl8kTkuyE4LWchJxH5dFhCxeB0ph2vFgqH1Z/JoPH8h0U6rflmztI2SMvztyW5zdeF2vi9ZPJ64DQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:09.278469Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.06828","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d56bb9455029f0fc6f8148fcb00fd80aabf9a624b0fc6b2ef38ea574341d4c2f","sha256:e106a1870a8e906fce147e14482b7b35df65a9c0ec5f415b6491fc8dd68d1762"],"state_sha256":"bb44aa21f96740c145ba4a12d7c690a49bcbd7a20d9379146145314b766d1b44"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4zoyfEOoueQQ5Fr0fyuIjw+WCY0I2gHkf62FWOAsi72TjF4670VWDWKa0/WzA/Upn1800O01j+8UWvssGdbRBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T12:35:51.469130Z","bundle_sha256":"0f2c16d181b8a44cfd3b60a3430e61f86b84f9ac5f79caf58e01d416db602e6d"}}